diff --git a/leetcode-cn/origin-data.json b/leetcode-cn/origin-data.json index 0e539dda..1b5fc207 100644 --- a/leetcode-cn/origin-data.json +++ b/leetcode-cn/origin-data.json @@ -1,7 +1,7 @@ { "user_name": "", "num_solved": 0, - "num_total": 2836, + "num_total": 2840, "ac_easy": 0, "ac_medium": 0, "ac_hard": 0, @@ -12,8 +12,8 @@ "question__title": "集水器", "question__title_slug": "kskhHQ", "question__hide": false, - "total_acs": 282, - "total_submitted": 608, + "total_acs": 287, + "total_submitted": 614, "total_column_articles": 4, "frontend_question_id": "LCP 71", "is_new_question": false @@ -33,8 +33,8 @@ "question__title": "沙地治理", "question__title_slug": "XxZZjK", "question__hide": false, - "total_acs": 335, - "total_submitted": 1779, + "total_acs": 345, + "total_submitted": 1804, "total_column_articles": 10, "frontend_question_id": "LCP 70", "is_new_question": false @@ -54,8 +54,8 @@ "question__title": "Hello LeetCode!", "question__title_slug": "rMeRt2", "question__hide": false, - "total_acs": 838, - "total_submitted": 2941, + "total_acs": 852, + "total_submitted": 2980, "total_column_articles": 16, "frontend_question_id": "LCP 69", "is_new_question": false @@ -75,9 +75,9 @@ "question__title": "美观的花束", "question__title_slug": "1GxJYY", "question__hide": false, - "total_acs": 2142, - "total_submitted": 4753, - "total_column_articles": 37, + "total_acs": 2180, + "total_submitted": 4809, + "total_column_articles": 38, "frontend_question_id": "LCP 68", "is_new_question": false }, @@ -96,9 +96,9 @@ "question__title": "装饰树", "question__title_slug": "KnLfVT", "question__hide": false, - "total_acs": 2681, - "total_submitted": 2992, - "total_column_articles": 43, + "total_acs": 2819, + "total_submitted": 3151, + "total_column_articles": 44, "frontend_question_id": "LCP 67", "is_new_question": false }, @@ -117,9 +117,9 @@ "question__title": "最小展台数量", "question__title_slug": "600YaG", "question__hide": false, - "total_acs": 2903, - "total_submitted": 3830, - "total_column_articles": 41, + "total_acs": 2998, + "total_submitted": 3958, + "total_column_articles": 45, "frontend_question_id": "LCP 66", "is_new_question": false }, @@ -138,8 +138,8 @@ "question__title": "弹珠游戏", "question__title_slug": "EXvqDp", "question__hide": false, - "total_acs": 3168, - "total_submitted": 13153, + "total_acs": 3192, + "total_submitted": 13231, "total_column_articles": 99, "frontend_question_id": "LCP 63", "is_new_question": false @@ -159,9 +159,9 @@ "question__title": "二叉树灯饰", "question__title_slug": "U7WvvU", "question__hide": false, - "total_acs": 1371, - "total_submitted": 4526, - "total_column_articles": 39, + "total_acs": 1393, + "total_submitted": 4572, + "total_column_articles": 40, "frontend_question_id": "LCP 64", "is_new_question": false }, @@ -180,9 +180,9 @@ "question__title": "舒适的湿度", "question__title_slug": "3aqs1c", "question__hide": false, - "total_acs": 697, - "total_submitted": 1757, - "total_column_articles": 12, + "total_acs": 709, + "total_submitted": 1771, + "total_column_articles": 13, "frontend_question_id": "LCP 65", "is_new_question": false }, @@ -201,9 +201,9 @@ "question__title": "交通枢纽", "question__title_slug": "D9PW8w", "question__hide": false, - "total_acs": 4648, - "total_submitted": 7719, - "total_column_articles": 39, + "total_acs": 4670, + "total_submitted": 7754, + "total_column_articles": 41, "frontend_question_id": "LCP 62", "is_new_question": false }, @@ -222,9 +222,9 @@ "question__title": "气温变化趋势", "question__title_slug": "6CE719", "question__hide": false, - "total_acs": 5620, - "total_submitted": 9380, - "total_column_articles": 47, + "total_acs": 5661, + "total_submitted": 9459, + "total_column_articles": 49, "frontend_question_id": "LCP 61", "is_new_question": false }, @@ -243,9 +243,9 @@ "question__title": "积木拼接", "question__title_slug": "De4qBB", "question__hide": false, - "total_acs": 301, - "total_submitted": 984, - "total_column_articles": 13, + "total_acs": 302, + "total_submitted": 987, + "total_column_articles": 14, "frontend_question_id": "LCP 58", "is_new_question": false }, @@ -264,8 +264,8 @@ "question__title": "力扣泡泡龙", "question__title_slug": "WInSav", "question__hide": false, - "total_acs": 690, - "total_submitted": 3216, + "total_acs": 691, + "total_submitted": 3250, "total_column_articles": 24, "frontend_question_id": "LCP 60", "is_new_question": false @@ -285,8 +285,8 @@ "question__title": "搭桥过河", "question__title_slug": "NfY1m5", "question__hide": false, - "total_acs": 173, - "total_submitted": 611, + "total_acs": 174, + "total_submitted": 612, "total_column_articles": 8, "frontend_question_id": "LCP 59", "is_new_question": false @@ -306,8 +306,8 @@ "question__title": "打地鼠", "question__title_slug": "ZbAuEH", "question__hide": false, - "total_acs": 1655, - "total_submitted": 6386, + "total_acs": 1659, + "total_submitted": 6408, "total_column_articles": 36, "frontend_question_id": "LCP 57", "is_new_question": false @@ -327,9 +327,9 @@ "question__title": "信物传送", "question__title_slug": "6UEx57", "question__hide": false, - "total_acs": 2067, - "total_submitted": 5129, - "total_column_articles": 56, + "total_acs": 2087, + "total_submitted": 5157, + "total_column_articles": 57, "frontend_question_id": "LCP 56", "is_new_question": false }, @@ -348,8 +348,8 @@ "question__title": "采集果实", "question__title_slug": "PTXy4P", "question__hide": false, - "total_acs": 4054, - "total_submitted": 5557, + "total_acs": 4086, + "total_submitted": 5610, "total_column_articles": 59, "frontend_question_id": "LCP 55", "is_new_question": false @@ -369,8 +369,8 @@ "question__title": "夺回据点", "question__title_slug": "s5kipK", "question__hide": false, - "total_acs": 412, - "total_submitted": 1109, + "total_acs": 413, + "total_submitted": 1110, "total_column_articles": 7, "frontend_question_id": "LCP 54", "is_new_question": false @@ -391,7 +391,7 @@ "question__title_slug": "EJvmW4", "question__hide": false, "total_acs": 813, - "total_submitted": 1942, + "total_submitted": 1943, "total_column_articles": 15, "frontend_question_id": "LCP 53", "is_new_question": false @@ -411,9 +411,9 @@ "question__title": "二叉搜索树染色", "question__title_slug": "QO5KpG", "question__hide": false, - "total_acs": 3430, - "total_submitted": 12688, - "total_column_articles": 83, + "total_acs": 3448, + "total_submitted": 12733, + "total_column_articles": 84, "frontend_question_id": "LCP 52", "is_new_question": false }, @@ -432,8 +432,8 @@ "question__title": "烹饪料理", "question__title_slug": "UEcfPD", "question__hide": false, - "total_acs": 4503, - "total_submitted": 9561, + "total_acs": 4516, + "total_submitted": 9582, "total_column_articles": 87, "frontend_question_id": "LCP 51", "is_new_question": false @@ -453,9 +453,9 @@ "question__title": "宝石补给", "question__title_slug": "WHnhjV", "question__hide": false, - "total_acs": 6403, - "total_submitted": 9452, - "total_column_articles": 60, + "total_acs": 6459, + "total_submitted": 9524, + "total_column_articles": 62, "frontend_question_id": "LCP 50", "is_new_question": false }, @@ -474,8 +474,8 @@ "question__title": "自行车炫技赛场", "question__title_slug": "kplEvH", "question__hide": false, - "total_acs": 2259, - "total_submitted": 8110, + "total_acs": 2274, + "total_submitted": 8143, "total_column_articles": 53, "frontend_question_id": "LCP 45", "is_new_question": false @@ -495,8 +495,8 @@ "question__title": "无限棋局", "question__title_slug": "fsa7oZ", "question__hide": false, - "total_acs": 832, - "total_submitted": 3095, + "total_acs": 840, + "total_submitted": 3104, "total_column_articles": 16, "frontend_question_id": "LCP 48", "is_new_question": false @@ -516,8 +516,8 @@ "question__title": "志愿者调配", "question__title_slug": "05ZEDJ", "question__hide": false, - "total_acs": 1728, - "total_submitted": 3641, + "total_acs": 1741, + "total_submitted": 3655, "total_column_articles": 40, "frontend_question_id": "LCP 46", "is_new_question": false @@ -537,8 +537,8 @@ "question__title": "玩具套圈", "question__title_slug": "vFjcfV", "question__hide": false, - "total_acs": 2396, - "total_submitted": 8423, + "total_acs": 2403, + "total_submitted": 8433, "total_column_articles": 46, "frontend_question_id": "LCP 42", "is_new_question": false @@ -558,9 +558,9 @@ "question__title": "黑白翻转棋", "question__title_slug": "fHi6rV", "question__hide": false, - "total_acs": 2544, - "total_submitted": 5000, - "total_column_articles": 61, + "total_acs": 2560, + "total_submitted": 5037, + "total_column_articles": 62, "frontend_question_id": "LCP 41", "is_new_question": false }, @@ -579,9 +579,9 @@ "question__title": "无人机方阵", "question__title_slug": "0jQkd0", "question__hide": false, - "total_acs": 7852, - "total_submitted": 14261, - "total_column_articles": 83, + "total_acs": 7903, + "total_submitted": 14352, + "total_column_articles": 86, "frontend_question_id": "LCP 39", "is_new_question": false }, @@ -600,9 +600,9 @@ "question__title": "心算挑战", "question__title_slug": "uOAnQW", "question__hide": false, - "total_acs": 7544, - "total_submitted": 24507, - "total_column_articles": 155, + "total_acs": 7605, + "total_submitted": 24662, + "total_column_articles": 157, "frontend_question_id": "LCP 40", "is_new_question": false }, @@ -621,8 +621,8 @@ "question__title": "十字路口的交通", "question__title_slug": "Y1VbOX", "question__hide": false, - "total_acs": 1159, - "total_submitted": 2232, + "total_acs": 1162, + "total_submitted": 2235, "total_column_articles": 29, "frontend_question_id": "LCP 43", "is_new_question": false @@ -642,9 +642,9 @@ "question__title": "开幕式焰火", "question__title_slug": "sZ59z6", "question__hide": false, - "total_acs": 11660, - "total_submitted": 14534, - "total_column_articles": 166, + "total_acs": 11743, + "total_submitted": 14638, + "total_column_articles": 168, "frontend_question_id": "LCP 44", "is_new_question": false }, @@ -663,8 +663,8 @@ "question__title": "入场安检", "question__title_slug": "oPs9Bm", "question__hide": false, - "total_acs": 1576, - "total_submitted": 3587, + "total_acs": 1581, + "total_submitted": 3597, "total_column_articles": 29, "frontend_question_id": "LCP 47", "is_new_question": false @@ -684,8 +684,8 @@ "question__title": "环形闯关游戏", "question__title_slug": "K8GULz", "question__hide": false, - "total_acs": 860, - "total_submitted": 2406, + "total_acs": 861, + "total_submitted": 2416, "total_column_articles": 18, "frontend_question_id": "LCP 49", "is_new_question": false @@ -705,9 +705,9 @@ "question__title": "省份数量", "question__title_slug": "bLyHh0", "question__hide": false, - "total_acs": 17333, - "total_submitted": 25745, - "total_column_articles": 183, + "total_acs": 17498, + "total_submitted": 25963, + "total_column_articles": 186, "frontend_question_id": "剑指 Offer II 116", "is_new_question": false }, @@ -726,9 +726,9 @@ "question__title": "路径的数目", "question__title_slug": "2AoeFn", "question__hide": false, - "total_acs": 15924, - "total_submitted": 20780, - "total_column_articles": 172, + "total_acs": 16101, + "total_submitted": 21070, + "total_column_articles": 175, "frontend_question_id": "剑指 Offer II 098", "is_new_question": false }, @@ -747,9 +747,9 @@ "question__title": "含有 k 个元素的组合", "question__title_slug": "uUsW3B", "question__hide": false, - "total_acs": 20965, - "total_submitted": 25128, - "total_column_articles": 170, + "total_acs": 21206, + "total_submitted": 25420, + "total_column_articles": 172, "frontend_question_id": "剑指 Offer II 080", "is_new_question": false }, @@ -768,9 +768,9 @@ "question__title": "所有子集", "question__title_slug": "TVdhkn", "question__hide": false, - "total_acs": 23275, - "total_submitted": 27124, - "total_column_articles": 254, + "total_acs": 23479, + "total_submitted": 27355, + "total_column_articles": 258, "frontend_question_id": "剑指 Offer II 079", "is_new_question": false }, @@ -789,9 +789,9 @@ "question__title": "合并排序链表", "question__title_slug": "vvXgSW", "question__hide": false, - "total_acs": 22105, - "total_submitted": 34744, - "total_column_articles": 225, + "total_acs": 22354, + "total_submitted": 35109, + "total_column_articles": 226, "frontend_question_id": "剑指 Offer II 078", "is_new_question": false }, @@ -810,9 +810,9 @@ "question__title": "链表排序", "question__title_slug": "7WHec2", "question__hide": false, - "total_acs": 29336, - "total_submitted": 46646, - "total_column_articles": 297, + "total_acs": 29636, + "total_submitted": 47056, + "total_column_articles": 300, "frontend_question_id": "剑指 Offer II 077", "is_new_question": false }, @@ -831,9 +831,9 @@ "question__title": "数组中的第 k 大的数字", "question__title_slug": "xx4gT2", "question__hide": false, - "total_acs": 34581, - "total_submitted": 51096, - "total_column_articles": 243, + "total_acs": 34909, + "total_submitted": 51548, + "total_column_articles": 245, "frontend_question_id": "剑指 Offer II 076", "is_new_question": false }, @@ -852,9 +852,9 @@ "question__title": "数组相对排序", "question__title_slug": "0H97ZC", "question__hide": false, - "total_acs": 20109, - "total_submitted": 28422, - "total_column_articles": 260, + "total_acs": 20354, + "total_submitted": 28768, + "total_column_articles": 264, "frontend_question_id": "剑指 Offer II 075", "is_new_question": false }, @@ -873,9 +873,9 @@ "question__title": "合并区间", "question__title_slug": "SsGoHC", "question__hide": false, - "total_acs": 20148, - "total_submitted": 35147, - "total_column_articles": 191, + "total_acs": 20368, + "total_submitted": 35535, + "total_column_articles": 193, "frontend_question_id": "剑指 Offer II 074", "is_new_question": false }, @@ -894,9 +894,9 @@ "question__title": "狒狒吃香蕉", "question__title_slug": "nZZqjQ", "question__hide": false, - "total_acs": 17530, - "total_submitted": 33154, - "total_column_articles": 165, + "total_acs": 17698, + "total_submitted": 33431, + "total_column_articles": 166, "frontend_question_id": "剑指 Offer II 073", "is_new_question": false }, @@ -915,9 +915,9 @@ "question__title": "求平方根", "question__title_slug": "jJ0w9p", "question__hide": false, - "total_acs": 28358, - "total_submitted": 64899, - "total_column_articles": 201, + "total_acs": 28595, + "total_submitted": 65449, + "total_column_articles": 204, "frontend_question_id": "剑指 Offer II 072", "is_new_question": false }, @@ -936,9 +936,9 @@ "question__title": "按权重生成随机数", "question__title_slug": "cuyjEf", "question__hide": false, - "total_acs": 12325, - "total_submitted": 24912, - "total_column_articles": 92, + "total_acs": 12449, + "total_submitted": 25155, + "total_column_articles": 96, "frontend_question_id": "剑指 Offer II 071", "is_new_question": false }, @@ -957,9 +957,9 @@ "question__title": "排序数组中只出现一次的数字", "question__title_slug": "skFtm2", "question__hide": false, - "total_acs": 22133, - "total_submitted": 35369, - "total_column_articles": 207, + "total_acs": 22376, + "total_submitted": 35792, + "total_column_articles": 215, "frontend_question_id": "剑指 Offer II 070", "is_new_question": false }, @@ -978,9 +978,9 @@ "question__title": "山峰数组的顶部", "question__title_slug": "B1IidL", "question__hide": false, - "total_acs": 57182, - "total_submitted": 81055, - "total_column_articles": 542, + "total_acs": 57449, + "total_submitted": 81411, + "total_column_articles": 546, "frontend_question_id": "剑指 Offer II 069", "is_new_question": false }, @@ -999,9 +999,9 @@ "question__title": "查找插入位置", "question__title_slug": "N6YdxV", "question__hide": false, - "total_acs": 22713, - "total_submitted": 45653, - "total_column_articles": 217, + "total_acs": 23017, + "total_submitted": 46270, + "total_column_articles": 221, "frontend_question_id": "剑指 Offer II 068", "is_new_question": false }, @@ -1020,9 +1020,9 @@ "question__title": "最大的异或", "question__title_slug": "ms70jA", "question__hide": false, - "total_acs": 10880, - "total_submitted": 16571, - "total_column_articles": 120, + "total_acs": 11005, + "total_submitted": 16743, + "total_column_articles": 121, "frontend_question_id": "剑指 Offer II 067", "is_new_question": false }, @@ -1041,9 +1041,9 @@ "question__title": "单词之和", "question__title_slug": "z1R5dt", "question__hide": false, - "total_acs": 12014, - "total_submitted": 18609, - "total_column_articles": 186, + "total_acs": 12159, + "total_submitted": 18836, + "total_column_articles": 188, "frontend_question_id": "剑指 Offer II 066", "is_new_question": false }, @@ -1062,9 +1062,9 @@ "question__title": "最短的单词编码", "question__title_slug": "iSwD2y", "question__hide": false, - "total_acs": 11927, - "total_submitted": 18709, - "total_column_articles": 147, + "total_acs": 12055, + "total_submitted": 18916, + "total_column_articles": 148, "frontend_question_id": "剑指 Offer II 065", "is_new_question": false }, @@ -1083,9 +1083,9 @@ "question__title": "神奇的字典", "question__title_slug": "US1pGT", "question__hide": false, - "total_acs": 12061, - "total_submitted": 19836, - "total_column_articles": 149, + "total_acs": 12177, + "total_submitted": 20024, + "total_column_articles": 152, "frontend_question_id": "剑指 Offer II 064", "is_new_question": false }, @@ -1104,9 +1104,9 @@ "question__title": "替换单词", "question__title_slug": "UhWRSj", "question__hide": false, - "total_acs": 15182, - "total_submitted": 21516, - "total_column_articles": 219, + "total_acs": 15370, + "total_submitted": 21794, + "total_column_articles": 222, "frontend_question_id": "剑指 Offer II 063", "is_new_question": false }, @@ -1125,9 +1125,9 @@ "question__title": "和最小的 k 个数对", "question__title_slug": "qn8gGX", "question__hide": false, - "total_acs": 15500, - "total_submitted": 28692, - "total_column_articles": 155, + "total_acs": 15644, + "total_submitted": 28935, + "total_column_articles": 157, "frontend_question_id": "剑指 Offer II 061", "is_new_question": false }, @@ -1146,8 +1146,8 @@ "question__title": "实现前缀树", "question__title_slug": "QC3q1f", "question__hide": false, - "total_acs": 16878, - "total_submitted": 22262, + "total_acs": 17041, + "total_submitted": 22486, "total_column_articles": 164, "frontend_question_id": "剑指 Offer II 062", "is_new_question": false @@ -1167,9 +1167,9 @@ "question__title": "出现频率最高的 k 个数字", "question__title_slug": "g5c51o", "question__hide": false, - "total_acs": 20046, - "total_submitted": 28961, - "total_column_articles": 224, + "total_acs": 20260, + "total_submitted": 29299, + "total_column_articles": 227, "frontend_question_id": "剑指 Offer II 060", "is_new_question": false }, @@ -1188,8 +1188,8 @@ "question__title": "数据流的第 K 大数值", "question__title_slug": "jBjn9C", "question__hide": false, - "total_acs": 17844, - "total_submitted": 28105, + "total_acs": 18018, + "total_submitted": 28394, "total_column_articles": 163, "frontend_question_id": "剑指 Offer II 059", "is_new_question": false @@ -1209,9 +1209,9 @@ "question__title": "日程表", "question__title_slug": "fi9suh", "question__hide": false, - "total_acs": 14073, - "total_submitted": 22924, - "total_column_articles": 140, + "total_acs": 14207, + "total_submitted": 23144, + "total_column_articles": 145, "frontend_question_id": "剑指 Offer II 058", "is_new_question": false }, @@ -1230,8 +1230,8 @@ "question__title": "值和下标之差都在给定的范围内", "question__title_slug": "7WqeDu", "question__hide": false, - "total_acs": 15231, - "total_submitted": 43108, + "total_acs": 15388, + "total_submitted": 43563, "total_column_articles": 114, "frontend_question_id": "剑指 Offer II 057", "is_new_question": false @@ -1251,9 +1251,9 @@ "question__title": "最长连续序列", "question__title_slug": "WhsWhI", "question__hide": false, - "total_acs": 19905, - "total_submitted": 40315, - "total_column_articles": 183, + "total_acs": 20109, + "total_submitted": 40770, + "total_column_articles": 185, "frontend_question_id": "剑指 Offer II 119", "is_new_question": false }, @@ -1272,9 +1272,9 @@ "question__title": "二叉搜索树中两个节点之和", "question__title_slug": "opLdQZ", "question__hide": false, - "total_acs": 23314, - "total_submitted": 31832, - "total_column_articles": 242, + "total_acs": 23544, + "total_submitted": 32127, + "total_column_articles": 251, "frontend_question_id": "剑指 Offer II 056", "is_new_question": false }, @@ -1293,8 +1293,8 @@ "question__title": "多余的边", "question__title_slug": "7LpjUW", "question__hide": false, - "total_acs": 8711, - "total_submitted": 12447, + "total_acs": 8782, + "total_submitted": 12548, "total_column_articles": 111, "frontend_question_id": "剑指 Offer II 118", "is_new_question": false @@ -1314,9 +1314,9 @@ "question__title": "相似的字符串", "question__title_slug": "H6lPxb", "question__hide": false, - "total_acs": 7207, - "total_submitted": 11580, - "total_column_articles": 76, + "total_acs": 7287, + "total_submitted": 11709, + "total_column_articles": 77, "frontend_question_id": "剑指 Offer II 117", "is_new_question": false }, @@ -1335,9 +1335,9 @@ "question__title": "二叉搜索树迭代器", "question__title_slug": "kTOapQ", "question__hide": false, - "total_acs": 16752, - "total_submitted": 19644, - "total_column_articles": 167, + "total_acs": 16899, + "total_submitted": 19807, + "total_column_articles": 169, "frontend_question_id": "剑指 Offer II 055", "is_new_question": false }, @@ -1356,9 +1356,9 @@ "question__title": "所有大于等于节点的值之和", "question__title_slug": "w6cpku", "question__hide": false, - "total_acs": 19747, - "total_submitted": 23095, - "total_column_articles": 231, + "total_acs": 19963, + "total_submitted": 23336, + "total_column_articles": 233, "frontend_question_id": "剑指 Offer II 054", "is_new_question": false }, @@ -1377,8 +1377,8 @@ "question__title": "重建序列", "question__title_slug": "ur2n8P", "question__hide": false, - "total_acs": 22610, - "total_submitted": 44556, + "total_acs": 22697, + "total_submitted": 44705, "total_column_articles": 260, "frontend_question_id": "剑指 Offer II 115", "is_new_question": false @@ -1398,9 +1398,9 @@ "question__title": "二叉搜索树中的中序后继", "question__title_slug": "P5rCT8", "question__hide": false, - "total_acs": 24878, - "total_submitted": 38970, - "total_column_articles": 233, + "total_acs": 25128, + "total_submitted": 39403, + "total_column_articles": 235, "frontend_question_id": "剑指 Offer II 053", "is_new_question": false }, @@ -1419,8 +1419,8 @@ "question__title": "外星文字典", "question__title_slug": "Jf1JuT", "question__hide": false, - "total_acs": 19202, - "total_submitted": 36161, + "total_acs": 19281, + "total_submitted": 36327, "total_column_articles": 201, "frontend_question_id": "剑指 Offer II 114", "is_new_question": false @@ -1440,9 +1440,9 @@ "question__title": "展平二叉搜索树", "question__title_slug": "NYBBNL", "question__hide": false, - "total_acs": 23769, - "total_submitted": 32078, - "total_column_articles": 215, + "total_acs": 24011, + "total_submitted": 32418, + "total_column_articles": 221, "frontend_question_id": "剑指 Offer II 052", "is_new_question": false }, @@ -1461,9 +1461,9 @@ "question__title": "课程顺序", "question__title_slug": "QA2IGt", "question__hide": false, - "total_acs": 10799, - "total_submitted": 18969, - "total_column_articles": 126, + "total_acs": 10922, + "total_submitted": 19153, + "total_column_articles": 129, "frontend_question_id": "剑指 Offer II 113", "is_new_question": false }, @@ -1482,9 +1482,9 @@ "question__title": "节点之和最大的路径", "question__title_slug": "jC7MId", "question__hide": false, - "total_acs": 15412, - "total_submitted": 31830, - "total_column_articles": 140, + "total_acs": 15557, + "total_submitted": 32103, + "total_column_articles": 142, "frontend_question_id": "剑指 Offer II 051", "is_new_question": false }, @@ -1503,8 +1503,8 @@ "question__title": "最长递增路径", "question__title_slug": "fpTFWP", "question__hide": false, - "total_acs": 10749, - "total_submitted": 18485, + "total_acs": 10853, + "total_submitted": 18666, "total_column_articles": 104, "frontend_question_id": "剑指 Offer II 112", "is_new_question": false @@ -1524,9 +1524,9 @@ "question__title": "向下的路径节点之和", "question__title_slug": "6eUYwP", "question__hide": false, - "total_acs": 20427, - "total_submitted": 36078, - "total_column_articles": 174, + "total_acs": 20596, + "total_submitted": 36492, + "total_column_articles": 176, "frontend_question_id": "剑指 Offer II 050", "is_new_question": false }, @@ -1545,9 +1545,9 @@ "question__title": "从根节点到叶节点的路径数字之和", "question__title_slug": "3Etpl5", "question__hide": false, - "total_acs": 22839, - "total_submitted": 30880, - "total_column_articles": 242, + "total_acs": 23170, + "total_submitted": 31422, + "total_column_articles": 243, "frontend_question_id": "剑指 Offer II 049", "is_new_question": false }, @@ -1566,9 +1566,9 @@ "question__title": "计算除法", "question__title_slug": "vlzXQL", "question__hide": false, - "total_acs": 6892, - "total_submitted": 10588, - "total_column_articles": 90, + "total_acs": 6965, + "total_submitted": 10700, + "total_column_articles": 91, "frontend_question_id": "剑指 Offer II 111", "is_new_question": false }, @@ -1587,8 +1587,8 @@ "question__title": "序列化与反序列化二叉树", "question__title_slug": "h54YBf", "question__hide": false, - "total_acs": 16873, - "total_submitted": 25118, + "total_acs": 17067, + "total_submitted": 25394, "total_column_articles": 140, "frontend_question_id": "剑指 Offer II 048", "is_new_question": false @@ -1608,9 +1608,9 @@ "question__title": "所有路径", "question__title_slug": "bP4bmD", "question__hide": false, - "total_acs": 13980, - "total_submitted": 17301, - "total_column_articles": 176, + "total_acs": 14143, + "total_submitted": 17511, + "total_column_articles": 177, "frontend_question_id": "剑指 Offer II 110", "is_new_question": false }, @@ -1629,8 +1629,8 @@ "question__title": "开密码锁", "question__title_slug": "zlDJc7", "question__hide": false, - "total_acs": 10490, - "total_submitted": 18038, + "total_acs": 10607, + "total_submitted": 18226, "total_column_articles": 111, "frontend_question_id": "剑指 Offer II 109", "is_new_question": false @@ -1650,9 +1650,9 @@ "question__title": "二叉树剪枝", "question__title_slug": "pOCWxh", "question__hide": false, - "total_acs": 23006, - "total_submitted": 33439, - "total_column_articles": 281, + "total_acs": 23358, + "total_submitted": 33997, + "total_column_articles": 282, "frontend_question_id": "剑指 Offer II 047", "is_new_question": false }, @@ -1671,8 +1671,8 @@ "question__title": "单词演变", "question__title_slug": "om3reC", "question__hide": false, - "total_acs": 8031, - "total_submitted": 13390, + "total_acs": 8121, + "total_submitted": 13536, "total_column_articles": 72, "frontend_question_id": "剑指 Offer II 108", "is_new_question": false @@ -1692,9 +1692,9 @@ "question__title": "二叉树的右侧视图", "question__title_slug": "WNC0Lk", "question__hide": false, - "total_acs": 21126, - "total_submitted": 29655, - "total_column_articles": 262, + "total_acs": 21327, + "total_submitted": 29978, + "total_column_articles": 265, "frontend_question_id": "剑指 Offer II 046", "is_new_question": false }, @@ -1713,9 +1713,9 @@ "question__title": "二叉树最底层最左边的值", "question__title_slug": "LwUNpT", "question__hide": false, - "total_acs": 23899, - "total_submitted": 29995, - "total_column_articles": 284, + "total_acs": 24130, + "total_submitted": 30295, + "total_column_articles": 285, "frontend_question_id": "剑指 Offer II 045", "is_new_question": false }, @@ -1734,9 +1734,9 @@ "question__title": "二叉树每层的最大值", "question__title_slug": "hPov7L", "question__hide": false, - "total_acs": 23571, - "total_submitted": 37131, - "total_column_articles": 251, + "total_acs": 23795, + "total_submitted": 37508, + "total_column_articles": 254, "frontend_question_id": "剑指 Offer II 044", "is_new_question": false }, @@ -1755,8 +1755,8 @@ "question__title": "矩阵中的距离", "question__title_slug": "2bCMpM", "question__hide": false, - "total_acs": 11348, - "total_submitted": 21886, + "total_acs": 11460, + "total_submitted": 22106, "total_column_articles": 92, "frontend_question_id": "剑指 Offer II 107", "is_new_question": false @@ -1776,9 +1776,9 @@ "question__title": "往完全二叉树添加节点", "question__title_slug": "NaqhDT", "question__hide": false, - "total_acs": 17323, - "total_submitted": 28061, - "total_column_articles": 216, + "total_acs": 17471, + "total_submitted": 28272, + "total_column_articles": 217, "frontend_question_id": "剑指 Offer II 043", "is_new_question": false }, @@ -1797,9 +1797,9 @@ "question__title": "二分图", "question__title_slug": "vEAB3K", "question__hide": false, - "total_acs": 11920, - "total_submitted": 21698, - "total_column_articles": 113, + "total_acs": 12028, + "total_submitted": 21892, + "total_column_articles": 116, "frontend_question_id": "剑指 Offer II 106", "is_new_question": false }, @@ -1818,9 +1818,9 @@ "question__title": "最近请求次数", "question__title_slug": "H8086Q", "question__hide": false, - "total_acs": 20957, - "total_submitted": 25435, - "total_column_articles": 173, + "total_acs": 21195, + "total_submitted": 25766, + "total_column_articles": 175, "frontend_question_id": "剑指 Offer II 042", "is_new_question": false }, @@ -1839,9 +1839,9 @@ "question__title": "滑动窗口的平均值", "question__title_slug": "qIsx9U", "question__hide": false, - "total_acs": 48286, - "total_submitted": 61454, - "total_column_articles": 422, + "total_acs": 48553, + "total_submitted": 61784, + "total_column_articles": 425, "frontend_question_id": "剑指 Offer II 041", "is_new_question": false }, @@ -1860,9 +1860,9 @@ "question__title": "岛屿的最大面积", "question__title_slug": "ZL6zAn", "question__hide": false, - "total_acs": 22794, - "total_submitted": 32409, - "total_column_articles": 232, + "total_acs": 23007, + "total_submitted": 32734, + "total_column_articles": 235, "frontend_question_id": "剑指 Offer II 105", "is_new_question": false }, @@ -1881,8 +1881,8 @@ "question__title": "排列的数目", "question__title_slug": "D0F0SV", "question__hide": false, - "total_acs": 11114, - "total_submitted": 19125, + "total_acs": 11201, + "total_submitted": 19275, "total_column_articles": 92, "frontend_question_id": "剑指 Offer II 104", "is_new_question": false @@ -1902,9 +1902,9 @@ "question__title": "最少的硬币数目", "question__title_slug": "gaM7Ch", "question__hide": false, - "total_acs": 21355, - "total_submitted": 42458, - "total_column_articles": 148, + "total_acs": 21603, + "total_submitted": 42911, + "total_column_articles": 149, "frontend_question_id": "剑指 Offer II 103", "is_new_question": false }, @@ -1923,9 +1923,9 @@ "question__title": "加减的目标值", "question__title_slug": "YaVDxD", "question__hide": false, - "total_acs": 15316, - "total_submitted": 26920, - "total_column_articles": 109, + "total_acs": 15437, + "total_submitted": 27168, + "total_column_articles": 111, "frontend_question_id": "剑指 Offer II 102", "is_new_question": false }, @@ -1944,9 +1944,9 @@ "question__title": "分割等和子集", "question__title_slug": "NUPfPr", "question__hide": false, - "total_acs": 19060, - "total_submitted": 38214, - "total_column_articles": 135, + "total_acs": 19230, + "total_submitted": 38579, + "total_column_articles": 137, "frontend_question_id": "剑指 Offer II 101", "is_new_question": false }, @@ -1965,9 +1965,9 @@ "question__title": "三角形中最小路径之和", "question__title_slug": "IlPe0q", "question__hide": false, - "total_acs": 15970, - "total_submitted": 21203, - "total_column_articles": 174, + "total_acs": 16097, + "total_submitted": 21453, + "total_column_articles": 176, "frontend_question_id": "剑指 Offer II 100", "is_new_question": false }, @@ -1986,9 +1986,9 @@ "question__title": "最小路径之和", "question__title_slug": "0i0mDW", "question__hide": false, - "total_acs": 18522, - "total_submitted": 25214, - "total_column_articles": 182, + "total_acs": 18719, + "total_submitted": 25471, + "total_column_articles": 184, "frontend_question_id": "剑指 Offer II 099", "is_new_question": false }, @@ -2007,9 +2007,9 @@ "question__title": "矩阵中最大的矩形", "question__title_slug": "PLYXKQ", "question__hide": false, - "total_acs": 13228, - "total_submitted": 22887, - "total_column_articles": 156, + "total_acs": 13366, + "total_submitted": 23125, + "total_column_articles": 157, "frontend_question_id": "剑指 Offer II 040", "is_new_question": false }, @@ -2028,9 +2028,9 @@ "question__title": "直方图最大矩形面积", "question__title_slug": "0ynMMM", "question__hide": false, - "total_acs": 20062, - "total_submitted": 39352, - "total_column_articles": 157, + "total_acs": 20289, + "total_submitted": 39816, + "total_column_articles": 161, "frontend_question_id": "剑指 Offer II 039", "is_new_question": false }, @@ -2049,9 +2049,9 @@ "question__title": "每日温度", "question__title_slug": "iIQa4I", "question__hide": false, - "total_acs": 28417, - "total_submitted": 37026, - "total_column_articles": 262, + "total_acs": 28727, + "total_submitted": 37420, + "total_column_articles": 268, "frontend_question_id": "剑指 Offer II 038", "is_new_question": false }, @@ -2070,9 +2070,9 @@ "question__title": "小行星碰撞", "question__title_slug": "XagZNi", "question__hide": false, - "total_acs": 23217, - "total_submitted": 52800, - "total_column_articles": 279, + "total_acs": 23394, + "total_submitted": 53181, + "total_column_articles": 281, "frontend_question_id": "剑指 Offer II 037", "is_new_question": false }, @@ -2091,9 +2091,9 @@ "question__title": "子序列的数目", "question__title_slug": "21dk04", "question__hide": false, - "total_acs": 10877, - "total_submitted": 19541, - "total_column_articles": 100, + "total_acs": 10982, + "total_submitted": 19720, + "total_column_articles": 101, "frontend_question_id": "剑指 Offer II 097", "is_new_question": false }, @@ -2112,9 +2112,9 @@ "question__title": "后缀表达式", "question__title_slug": "8Zf90G", "question__hide": false, - "total_acs": 21596, - "total_submitted": 38450, - "total_column_articles": 232, + "total_acs": 21779, + "total_submitted": 38761, + "total_column_articles": 234, "frontend_question_id": "剑指 Offer II 036", "is_new_question": false }, @@ -2133,9 +2133,9 @@ "question__title": "最小时间差", "question__title_slug": "569nqc", "question__hide": false, - "total_acs": 22494, - "total_submitted": 33944, - "total_column_articles": 177, + "total_acs": 22753, + "total_submitted": 34372, + "total_column_articles": 178, "frontend_question_id": "剑指 Offer II 035", "is_new_question": false }, @@ -2154,9 +2154,9 @@ "question__title": "字符串交织", "question__title_slug": "IY6buf", "question__hide": false, - "total_acs": 12217, - "total_submitted": 25566, - "total_column_articles": 103, + "total_acs": 12313, + "total_submitted": 25794, + "total_column_articles": 104, "frontend_question_id": "剑指 Offer II 096", "is_new_question": false }, @@ -2175,9 +2175,9 @@ "question__title": "外星语言是否排序", "question__title_slug": "lwyVBB", "question__hide": false, - "total_acs": 19118, - "total_submitted": 34477, - "total_column_articles": 241, + "total_acs": 19365, + "total_submitted": 34874, + "total_column_articles": 246, "frontend_question_id": "剑指 Offer II 034", "is_new_question": false }, @@ -2196,9 +2196,9 @@ "question__title": "变位词组", "question__title_slug": "sfvd7V", "question__hide": false, - "total_acs": 22511, - "total_submitted": 29905, - "total_column_articles": 193, + "total_acs": 22763, + "total_submitted": 30225, + "total_column_articles": 197, "frontend_question_id": "剑指 Offer II 033", "is_new_question": false }, @@ -2217,9 +2217,9 @@ "question__title": "最长公共子序列", "question__title_slug": "qJnOS7", "question__hide": false, - "total_acs": 32797, - "total_submitted": 49668, - "total_column_articles": 213, + "total_acs": 33055, + "total_submitted": 50077, + "total_column_articles": 216, "frontend_question_id": "剑指 Offer II 095", "is_new_question": false }, @@ -2238,9 +2238,9 @@ "question__title": "有效的变位词", "question__title_slug": "dKk3P7", "question__hide": false, - "total_acs": 26298, - "total_submitted": 43933, - "total_column_articles": 218, + "total_acs": 26575, + "total_submitted": 44385, + "total_column_articles": 222, "frontend_question_id": "剑指 Offer II 032", "is_new_question": false }, @@ -2259,9 +2259,9 @@ "question__title": "最少回文分割", "question__title_slug": "omKAoA", "question__hide": false, - "total_acs": 10605, - "total_submitted": 18360, - "total_column_articles": 85, + "total_acs": 10697, + "total_submitted": 18528, + "total_column_articles": 87, "frontend_question_id": "剑指 Offer II 094", "is_new_question": false }, @@ -2280,9 +2280,9 @@ "question__title": "最长斐波那契数列", "question__title_slug": "Q91FMA", "question__hide": false, - "total_acs": 14898, - "total_submitted": 25216, - "total_column_articles": 103, + "total_acs": 15012, + "total_submitted": 25417, + "total_column_articles": 104, "frontend_question_id": "剑指 Offer II 093", "is_new_question": false }, @@ -2301,9 +2301,9 @@ "question__title": "最近最少使用缓存", "question__title_slug": "OrIXps", "question__hide": false, - "total_acs": 20321, - "total_submitted": 36678, - "total_column_articles": 202, + "total_acs": 20532, + "total_submitted": 37040, + "total_column_articles": 203, "frontend_question_id": "剑指 Offer II 031", "is_new_question": false }, @@ -2322,9 +2322,9 @@ "question__title": "翻转字符", "question__title_slug": "cyJERH", "question__hide": false, - "total_acs": 15999, - "total_submitted": 23522, - "total_column_articles": 197, + "total_acs": 16178, + "total_submitted": 23804, + "total_column_articles": 198, "frontend_question_id": "剑指 Offer II 092", "is_new_question": false }, @@ -2343,9 +2343,9 @@ "question__title": "粉刷房子", "question__title_slug": "JEj789", "question__hide": false, - "total_acs": 39963, - "total_submitted": 51492, - "total_column_articles": 509, + "total_acs": 40147, + "total_submitted": 51710, + "total_column_articles": 511, "frontend_question_id": "剑指 Offer II 091", "is_new_question": false }, @@ -2364,9 +2364,9 @@ "question__title": "插入、删除和随机访问都是 O(1) 的容器", "question__title_slug": "FortPu", "question__hide": false, - "total_acs": 19012, - "total_submitted": 35169, - "total_column_articles": 134, + "total_acs": 19205, + "total_submitted": 35513, + "total_column_articles": 135, "frontend_question_id": "剑指 Offer II 030", "is_new_question": false }, @@ -2385,9 +2385,9 @@ "question__title": "环形房屋偷盗", "question__title_slug": "PzWKhm", "question__hide": false, - "total_acs": 13783, - "total_submitted": 28248, - "total_column_articles": 125, + "total_acs": 13881, + "total_submitted": 28463, + "total_column_articles": 127, "frontend_question_id": "剑指 Offer II 090", "is_new_question": false }, @@ -2406,9 +2406,9 @@ "question__title": "排序的循环链表", "question__title_slug": "4ueAj6", "question__hide": false, - "total_acs": 39437, - "total_submitted": 116799, - "total_column_articles": 566, + "total_acs": 39676, + "total_submitted": 117594, + "total_column_articles": 568, "frontend_question_id": "剑指 Offer II 029", "is_new_question": false }, @@ -2427,9 +2427,9 @@ "question__title": "展平多级双向链表", "question__title_slug": "Qv1Da2", "question__hide": false, - "total_acs": 19602, - "total_submitted": 32509, - "total_column_articles": 271, + "total_acs": 19801, + "total_submitted": 32820, + "total_column_articles": 276, "frontend_question_id": "剑指 Offer II 028", "is_new_question": false }, @@ -2448,9 +2448,9 @@ "question__title": "回文链表", "question__title_slug": "aMhZSa", "question__hide": false, - "total_acs": 47305, - "total_submitted": 77033, - "total_column_articles": 407, + "total_acs": 47831, + "total_submitted": 77901, + "total_column_articles": 410, "frontend_question_id": "剑指 Offer II 027", "is_new_question": false }, @@ -2469,9 +2469,9 @@ "question__title": "重排链表", "question__title_slug": "LGjMqU", "question__hide": false, - "total_acs": 31530, - "total_submitted": 47095, - "total_column_articles": 314, + "total_acs": 31839, + "total_submitted": 47540, + "total_column_articles": 320, "frontend_question_id": "剑指 Offer II 026", "is_new_question": false }, @@ -2490,9 +2490,9 @@ "question__title": "链表中的两数相加", "question__title_slug": "lMSNwu", "question__hide": false, - "total_acs": 29814, - "total_submitted": 50624, - "total_column_articles": 331, + "total_acs": 30069, + "total_submitted": 51079, + "total_column_articles": 335, "frontend_question_id": "剑指 Offer II 025", "is_new_question": false }, @@ -2511,9 +2511,9 @@ "question__title": "反转链表", "question__title_slug": "UHnkqh", "question__hide": false, - "total_acs": 73421, - "total_submitted": 97111, - "total_column_articles": 452, + "total_acs": 74244, + "total_submitted": 98178, + "total_column_articles": 460, "frontend_question_id": "剑指 Offer II 024", "is_new_question": false }, @@ -2532,9 +2532,9 @@ "question__title": "两个链表的第一个重合节点", "question__title_slug": "3u1WK4", "question__hide": false, - "total_acs": 33652, - "total_submitted": 48064, - "total_column_articles": 238, + "total_acs": 33999, + "total_submitted": 48574, + "total_column_articles": 242, "frontend_question_id": "剑指 Offer II 023", "is_new_question": false }, @@ -2553,9 +2553,9 @@ "question__title": "链表中环的入口节点", "question__title_slug": "c32eOV", "question__hide": false, - "total_acs": 42888, - "total_submitted": 77009, - "total_column_articles": 289, + "total_acs": 43344, + "total_submitted": 77876, + "total_column_articles": 293, "frontend_question_id": "剑指 Offer II 022", "is_new_question": false }, @@ -2574,9 +2574,9 @@ "question__title": "删除链表的倒数第 n 个结点", "question__title_slug": "SLwz0R", "question__hide": false, - "total_acs": 39000, - "total_submitted": 73299, - "total_column_articles": 394, + "total_acs": 39459, + "total_submitted": 74074, + "total_column_articles": 398, "frontend_question_id": "剑指 Offer II 021", "is_new_question": false }, @@ -2595,9 +2595,9 @@ "question__title": "回文子字符串的个数", "question__title_slug": "a7VOhD", "question__hide": false, - "total_acs": 28775, - "total_submitted": 40114, - "total_column_articles": 243, + "total_acs": 29038, + "total_submitted": 40448, + "total_column_articles": 245, "frontend_question_id": "剑指 Offer II 020", "is_new_question": false }, @@ -2616,9 +2616,9 @@ "question__title": "最多删除一个字符得到回文", "question__title_slug": "RQku0D", "question__hide": false, - "total_acs": 28851, - "total_submitted": 62677, - "total_column_articles": 272, + "total_acs": 29157, + "total_submitted": 63370, + "total_column_articles": 276, "frontend_question_id": "剑指 Offer II 019", "is_new_question": false }, @@ -2637,9 +2637,9 @@ "question__title": "有效的回文", "question__title_slug": "XltzEq", "question__hide": false, - "total_acs": 32882, - "total_submitted": 63563, - "total_column_articles": 282, + "total_acs": 33223, + "total_submitted": 64265, + "total_column_articles": 286, "frontend_question_id": "剑指 Offer II 018", "is_new_question": false }, @@ -2658,9 +2658,9 @@ "question__title": "含有所有字符的最短字符串", "question__title_slug": "M1oyTv", "question__hide": false, - "total_acs": 23441, - "total_submitted": 46628, - "total_column_articles": 241, + "total_acs": 23670, + "total_submitted": 47121, + "total_column_articles": 242, "frontend_question_id": "剑指 Offer II 017", "is_new_question": false }, @@ -2679,9 +2679,9 @@ "question__title": "不含重复字符的最长子字符串", "question__title_slug": "wtcaE1", "question__hide": false, - "total_acs": 35819, - "total_submitted": 75146, - "total_column_articles": 358, + "total_acs": 36154, + "total_submitted": 75834, + "total_column_articles": 359, "frontend_question_id": "剑指 Offer II 016", "is_new_question": false }, @@ -2700,9 +2700,9 @@ "question__title": "字符串中的所有变位词", "question__title_slug": "VabMRr", "question__hide": false, - "total_acs": 26331, - "total_submitted": 42306, - "total_column_articles": 234, + "total_acs": 26573, + "total_submitted": 42678, + "total_column_articles": 235, "frontend_question_id": "剑指 Offer II 015", "is_new_question": false }, @@ -2721,9 +2721,9 @@ "question__title": "字符串中的变位词", "question__title_slug": "MPnaiL", "question__hide": false, - "total_acs": 32960, - "total_submitted": 64098, - "total_column_articles": 262, + "total_acs": 33259, + "total_submitted": 64620, + "total_column_articles": 263, "frontend_question_id": "剑指 Offer II 014", "is_new_question": false }, @@ -2742,9 +2742,9 @@ "question__title": "二维子矩阵的和", "question__title_slug": "O4NDxx", "question__hide": false, - "total_acs": 26144, - "total_submitted": 38375, - "total_column_articles": 230, + "total_acs": 26387, + "total_submitted": 38731, + "total_column_articles": 233, "frontend_question_id": "剑指 Offer II 013", "is_new_question": false }, @@ -2763,9 +2763,9 @@ "question__title": "左右两边子数组的和相等", "question__title_slug": "tvdfij", "question__hide": false, - "total_acs": 35009, - "total_submitted": 52348, - "total_column_articles": 328, + "total_acs": 35305, + "total_submitted": 52797, + "total_column_articles": 333, "frontend_question_id": "剑指 Offer II 012", "is_new_question": false }, @@ -2784,9 +2784,9 @@ "question__title": "0 和 1 个数相同的子数组", "question__title_slug": "A1NYOS", "question__hide": false, - "total_acs": 31076, - "total_submitted": 56263, - "total_column_articles": 273, + "total_acs": 31309, + "total_submitted": 56698, + "total_column_articles": 274, "frontend_question_id": "剑指 Offer II 011", "is_new_question": false }, @@ -2805,9 +2805,9 @@ "question__title": "和为 k 的子数组", "question__title_slug": "QTMn0o", "question__hide": false, - "total_acs": 40182, - "total_submitted": 92954, - "total_column_articles": 290, + "total_acs": 40565, + "total_submitted": 93849, + "total_column_articles": 291, "frontend_question_id": "剑指 Offer II 010", "is_new_question": false }, @@ -2826,9 +2826,9 @@ "question__title": "房屋偷盗", "question__title_slug": "Gu0c2T", "question__hide": false, - "total_acs": 19794, - "total_submitted": 32644, - "total_column_articles": 170, + "total_acs": 19974, + "total_submitted": 32989, + "total_column_articles": 171, "frontend_question_id": "剑指 Offer II 089", "is_new_question": false }, @@ -2847,8 +2847,8 @@ "question__title": "乘积小于 K 的子数组", "question__title_slug": "ZVAVXX", "question__hide": false, - "total_acs": 36962, - "total_submitted": 68456, + "total_acs": 37264, + "total_submitted": 69029, "total_column_articles": 319, "frontend_question_id": "剑指 Offer II 009", "is_new_question": false @@ -2868,9 +2868,9 @@ "question__title": "爬楼梯的最少成本", "question__title_slug": "GzCJIP", "question__hide": false, - "total_acs": 27404, - "total_submitted": 37481, - "total_column_articles": 233, + "total_acs": 27705, + "total_submitted": 37934, + "total_column_articles": 235, "frontend_question_id": "剑指 Offer II 088", "is_new_question": false }, @@ -2889,9 +2889,9 @@ "question__title": "和大于等于 target 的最短子数组", "question__title_slug": "2VG8Kg", "question__hide": false, - "total_acs": 44572, - "total_submitted": 90298, - "total_column_articles": 365, + "total_acs": 44926, + "total_submitted": 90930, + "total_column_articles": 366, "frontend_question_id": "剑指 Offer II 008", "is_new_question": false }, @@ -2910,9 +2910,9 @@ "question__title": "复原 IP ", "question__title_slug": "0on3uN", "question__hide": false, - "total_acs": 16317, - "total_submitted": 26252, - "total_column_articles": 181, + "total_acs": 16615, + "total_submitted": 26627, + "total_column_articles": 184, "frontend_question_id": "剑指 Offer II 087", "is_new_question": false }, @@ -2931,9 +2931,9 @@ "question__title": "分割回文子字符串", "question__title_slug": "M99OJA", "question__hide": false, - "total_acs": 15777, - "total_submitted": 20947, - "total_column_articles": 138, + "total_acs": 15930, + "total_submitted": 21143, + "total_column_articles": 139, "frontend_question_id": "剑指 Offer II 086", "is_new_question": false }, @@ -2952,9 +2952,9 @@ "question__title": "数组中和为 0 的三个数", "question__title_slug": "1fGaJU", "question__hide": false, - "total_acs": 42450, - "total_submitted": 96258, - "total_column_articles": 281, + "total_acs": 42820, + "total_submitted": 97095, + "total_column_articles": 284, "frontend_question_id": "剑指 Offer II 007", "is_new_question": false }, @@ -2973,9 +2973,9 @@ "question__title": "生成匹配的括号", "question__title_slug": "IDBivT", "question__hide": false, - "total_acs": 21870, - "total_submitted": 25662, - "total_column_articles": 239, + "total_acs": 22070, + "total_submitted": 25908, + "total_column_articles": 241, "frontend_question_id": "剑指 Offer II 085", "is_new_question": false }, @@ -2994,9 +2994,9 @@ "question__title": "排序数组中两个数字之和", "question__title_slug": "kLl5u1", "question__hide": false, - "total_acs": 48016, - "total_submitted": 71922, - "total_column_articles": 366, + "total_acs": 48483, + "total_submitted": 72574, + "total_column_articles": 368, "frontend_question_id": "剑指 Offer II 006", "is_new_question": false }, @@ -3015,9 +3015,9 @@ "question__title": "单词长度的最大乘积", "question__title_slug": "aseY1I", "question__hide": false, - "total_acs": 40481, - "total_submitted": 56582, - "total_column_articles": 328, + "total_acs": 40823, + "total_submitted": 57081, + "total_column_articles": 331, "frontend_question_id": "剑指 Offer II 005", "is_new_question": false }, @@ -3036,9 +3036,9 @@ "question__title": "含有重复元素集合的全排列 ", "question__title_slug": "7p8L0Z", "question__hide": false, - "total_acs": 18160, - "total_submitted": 26203, - "total_column_articles": 169, + "total_acs": 18332, + "total_submitted": 26439, + "total_column_articles": 170, "frontend_question_id": "剑指 Offer II 084", "is_new_question": false }, @@ -3057,8 +3057,8 @@ "question__title": "没有重复元素集合的全排列", "question__title_slug": "VvJkup", "question__hide": false, - "total_acs": 20980, - "total_submitted": 24425, + "total_acs": 21248, + "total_submitted": 24746, "total_column_articles": 241, "frontend_question_id": "剑指 Offer II 083", "is_new_question": false @@ -3078,8 +3078,8 @@ "question__title": "只出现一次的数字 ", "question__title_slug": "WGki4K", "question__hide": false, - "total_acs": 49905, - "total_submitted": 70048, + "total_acs": 50289, + "total_submitted": 70588, "total_column_articles": 393, "frontend_question_id": "剑指 Offer II 004", "is_new_question": false @@ -3099,8 +3099,8 @@ "question__title": "含有重复元素集合的组合", "question__title_slug": "4sjJUc", "question__hide": false, - "total_acs": 18663, - "total_submitted": 28405, + "total_acs": 18835, + "total_submitted": 28624, "total_column_articles": 169, "frontend_question_id": "剑指 Offer II 082", "is_new_question": false @@ -3120,9 +3120,9 @@ "question__title": "二进制加法", "question__title_slug": "JFETK5", "question__hide": false, - "total_acs": 44854, - "total_submitted": 82033, - "total_column_articles": 444, + "total_acs": 45184, + "total_submitted": 82668, + "total_column_articles": 449, "frontend_question_id": "剑指 Offer II 002", "is_new_question": false }, @@ -3141,9 +3141,9 @@ "question__title": "前 n 个数字二进制中 1 的个数", "question__title_slug": "w3tCBm", "question__hide": false, - "total_acs": 57375, - "total_submitted": 72893, - "total_column_articles": 505, + "total_acs": 57835, + "total_submitted": 73470, + "total_column_articles": 512, "frontend_question_id": "剑指 Offer II 003", "is_new_question": false }, @@ -3162,8 +3162,8 @@ "question__title": "允许重复选择元素的组合", "question__title_slug": "Ygoe9J", "question__hide": false, - "total_acs": 21780, - "total_submitted": 27014, + "total_acs": 21962, + "total_submitted": 27226, "total_column_articles": 206, "frontend_question_id": "剑指 Offer II 081", "is_new_question": false @@ -3183,9 +3183,9 @@ "question__title": "整数除法", "question__title_slug": "xoh6Oh", "question__hide": false, - "total_acs": 49043, - "total_submitted": 230457, - "total_column_articles": 403, + "total_acs": 49346, + "total_submitted": 231953, + "total_column_articles": 406, "frontend_question_id": "剑指 Offer II 001", "is_new_question": false }, @@ -3204,8 +3204,8 @@ "question__title": "主题空间", "question__title_slug": "YesdPw", "question__hide": false, - "total_acs": 3106, - "total_submitted": 7528, + "total_acs": 3125, + "total_submitted": 7574, "total_column_articles": 88, "frontend_question_id": "LCS 03", "is_new_question": false @@ -3225,9 +3225,9 @@ "question__title": "完成一半题目", "question__title_slug": "WqXACV", "question__hide": false, - "total_acs": 7552, - "total_submitted": 11478, - "total_column_articles": 142, + "total_acs": 7611, + "total_submitted": 11570, + "total_column_articles": 143, "frontend_question_id": "LCS 02", "is_new_question": false }, @@ -3246,9 +3246,9 @@ "question__title": "下载插件", "question__title_slug": "Ju9Xwi", "question__hide": false, - "total_acs": 10762, - "total_submitted": 19829, - "total_column_articles": 225, + "total_acs": 10859, + "total_submitted": 20067, + "total_column_articles": 226, "frontend_question_id": "LCS 01", "is_new_question": false }, @@ -3267,8 +3267,8 @@ "question__title": "魔塔游戏", "question__title_slug": "p0NxJO", "question__hide": false, - "total_acs": 8775, - "total_submitted": 23388, + "total_acs": 8805, + "total_submitted": 23447, "total_column_articles": 139, "frontend_question_id": "LCP 30", "is_new_question": false @@ -3289,7 +3289,7 @@ "question__title_slug": "7rLGCR", "question__hide": false, "total_acs": 984, - "total_submitted": 1760, + "total_submitted": 1761, "total_column_articles": 19, "frontend_question_id": "LCP 38", "is_new_question": false @@ -3309,8 +3309,8 @@ "question__title": "最多牌组数", "question__title_slug": "Up5XYM", "question__hide": false, - "total_acs": 1444, - "total_submitted": 4311, + "total_acs": 1451, + "total_submitted": 4319, "total_column_articles": 24, "frontend_question_id": "LCP 36", "is_new_question": false @@ -3330,8 +3330,8 @@ "question__title": "蓄水", "question__title_slug": "o8SXZn", "question__hide": false, - "total_acs": 8062, - "total_submitted": 31124, + "total_acs": 8094, + "total_submitted": 31209, "total_column_articles": 131, "frontend_question_id": "LCP 33", "is_new_question": false @@ -3351,8 +3351,8 @@ "question__title": "电动车游城市", "question__title_slug": "DFPeFJ", "question__hide": false, - "total_acs": 2139, - "total_submitted": 4460, + "total_acs": 2144, + "total_submitted": 4479, "total_column_articles": 35, "frontend_question_id": "LCP 35", "is_new_question": false @@ -3372,8 +3372,8 @@ "question__title": "批量处理任务", "question__title_slug": "t3fKg1", "question__hide": false, - "total_acs": 1788, - "total_submitted": 4052, + "total_acs": 1807, + "total_submitted": 4083, "total_column_articles": 29, "frontend_question_id": "LCP 32", "is_new_question": false @@ -3393,8 +3393,8 @@ "question__title": "变换的迷宫", "question__title_slug": "Db3wC1", "question__hide": false, - "total_acs": 2601, - "total_submitted": 9035, + "total_acs": 2606, + "total_submitted": 9052, "total_column_articles": 41, "frontend_question_id": "LCP 31", "is_new_question": false @@ -3414,8 +3414,8 @@ "question__title": "乐团站位", "question__title_slug": "SNJvJP", "question__hide": false, - "total_acs": 7787, - "total_submitted": 36872, + "total_acs": 7797, + "total_submitted": 36926, "total_column_articles": 165, "frontend_question_id": "LCP 29", "is_new_question": false @@ -3435,8 +3435,8 @@ "question__title": "采购方案", "question__title_slug": "4xy4Wx", "question__hide": false, - "total_acs": 17068, - "total_submitted": 54344, + "total_acs": 17129, + "total_submitted": 54529, "total_column_articles": 275, "frontend_question_id": "LCP 28", "is_new_question": false @@ -3456,8 +3456,8 @@ "question__title": "黑盒光线反射", "question__title_slug": "IQvJ9i", "question__hide": false, - "total_acs": 1542, - "total_submitted": 4561, + "total_acs": 1543, + "total_submitted": 4594, "total_column_articles": 30, "frontend_question_id": "LCP 27", "is_new_question": false @@ -3477,9 +3477,9 @@ "question__title": "早餐组合", "question__title_slug": "2vYnGI", "question__hide": false, - "total_acs": 23177, - "total_submitted": 77292, - "total_column_articles": 329, + "total_acs": 23259, + "total_submitted": 77565, + "total_column_articles": 330, "frontend_question_id": "LCP 18", "is_new_question": false }, @@ -3498,9 +3498,9 @@ "question__title": "黑白方格画", "question__title_slug": "ccw6C7", "question__hide": false, - "total_acs": 10638, - "total_submitted": 30824, - "total_column_articles": 211, + "total_acs": 10656, + "total_submitted": 30868, + "total_column_articles": 213, "frontend_question_id": "LCP 22", "is_new_question": false }, @@ -3519,8 +3519,8 @@ "question__title": "速算机器人", "question__title_slug": "nGK0Fy", "question__hide": false, - "total_acs": 30314, - "total_submitted": 37822, + "total_acs": 30421, + "total_submitted": 37951, "total_column_articles": 339, "frontend_question_id": "LCP 17", "is_new_question": false @@ -3540,8 +3540,8 @@ "question__title": "古董键盘", "question__title_slug": "Uh984O", "question__hide": false, - "total_acs": 1716, - "total_submitted": 4669, + "total_acs": 1721, + "total_submitted": 4680, "total_column_articles": 34, "frontend_question_id": "LCP 25", "is_new_question": false @@ -3561,8 +3561,8 @@ "question__title": "追逐游戏", "question__title_slug": "Za25hA", "question__hide": false, - "total_acs": 1370, - "total_submitted": 3641, + "total_acs": 1374, + "total_submitted": 3647, "total_column_articles": 33, "frontend_question_id": "LCP 21", "is_new_question": false @@ -3582,8 +3582,8 @@ "question__title": "快速公交", "question__title_slug": "meChtZ", "question__hide": false, - "total_acs": 2368, - "total_submitted": 6749, + "total_acs": 2372, + "total_submitted": 6753, "total_column_articles": 35, "frontend_question_id": "LCP 20", "is_new_question": false @@ -3603,8 +3603,8 @@ "question__title": "导航装置", "question__title_slug": "hSRGyL", "question__hide": false, - "total_acs": 864, - "total_submitted": 2313, + "total_acs": 865, + "total_submitted": 2315, "total_column_articles": 24, "frontend_question_id": "LCP 26", "is_new_question": false @@ -3624,8 +3624,8 @@ "question__title": "数字游戏", "question__title_slug": "5TxKeK", "question__hide": false, - "total_acs": 1320, - "total_submitted": 4265, + "total_acs": 1322, + "total_submitted": 4283, "total_column_articles": 30, "frontend_question_id": "LCP 24", "is_new_question": false @@ -3645,8 +3645,8 @@ "question__title": "秋叶收藏集", "question__title_slug": "UlBDOe", "question__hide": false, - "total_acs": 21453, - "total_submitted": 41411, + "total_acs": 21472, + "total_submitted": 41441, "total_column_articles": 229, "frontend_question_id": "LCP 19", "is_new_question": false @@ -3666,8 +3666,8 @@ "question__title": "寻宝", "question__title_slug": "xun-bao", "question__hide": false, - "total_acs": 10026, - "total_submitted": 16626, + "total_acs": 10027, + "total_submitted": 16629, "total_column_articles": 96, "frontend_question_id": "LCP 13", "is_new_question": false @@ -3687,8 +3687,8 @@ "question__title": "最小矩形面积", "question__title_slug": "zui-xiao-ju-xing-mian-ji", "question__hide": false, - "total_acs": 1431, - "total_submitted": 5795, + "total_acs": 1454, + "total_submitted": 5886, "total_column_articles": 26, "frontend_question_id": "LCP 37", "is_new_question": false @@ -3708,8 +3708,8 @@ "question__title": "最小跳跃次数", "question__title_slug": "zui-xiao-tiao-yue-ci-shu", "question__hide": false, - "total_acs": 10059, - "total_submitted": 32045, + "total_acs": 10088, + "total_submitted": 32110, "total_column_articles": 126, "frontend_question_id": "LCP 09", "is_new_question": false @@ -3729,9 +3729,9 @@ "question__title": "二叉树染色", "question__title_slug": "er-cha-shu-ran-se-UGC", "question__hide": false, - "total_acs": 4558, - "total_submitted": 8275, - "total_column_articles": 89, + "total_acs": 4583, + "total_submitted": 8309, + "total_column_articles": 90, "frontend_question_id": "LCP 34", "is_new_question": false }, @@ -3750,9 +3750,9 @@ "question__title": "游乐园的迷宫", "question__title_slug": "you-le-yuan-de-mi-gong", "question__hide": false, - "total_acs": 1232, - "total_submitted": 2027, - "total_column_articles": 28, + "total_acs": 1235, + "total_submitted": 2033, + "total_column_articles": 29, "frontend_question_id": "LCP 15", "is_new_question": false }, @@ -3771,8 +3771,8 @@ "question__title": "小张刷题计划", "question__title_slug": "xiao-zhang-shua-ti-ji-hua", "question__hide": false, - "total_acs": 9920, - "total_submitted": 22885, + "total_acs": 9961, + "total_submitted": 22981, "total_column_articles": 144, "frontend_question_id": "LCP 12", "is_new_question": false @@ -3792,8 +3792,8 @@ "question__title": "期望个数统计", "question__title_slug": "qi-wang-ge-shu-tong-ji", "question__hide": false, - "total_acs": 9297, - "total_submitted": 12959, + "total_acs": 9319, + "total_submitted": 12985, "total_column_articles": 95, "frontend_question_id": "LCP 11", "is_new_question": false @@ -3834,9 +3834,9 @@ "question__title": "传递信息", "question__title_slug": "chuan-di-xin-xi", "question__hide": false, - "total_acs": 49595, - "total_submitted": 65074, - "total_column_articles": 583, + "total_acs": 49736, + "total_submitted": 65293, + "total_column_articles": 585, "frontend_question_id": "LCP 07", "is_new_question": false }, @@ -3855,9 +3855,9 @@ "question__title": "二叉树任务调度", "question__title_slug": "er-cha-shu-ren-wu-diao-du", "question__hide": false, - "total_acs": 2679, - "total_submitted": 4398, - "total_column_articles": 47, + "total_acs": 2694, + "total_submitted": 4421, + "total_column_articles": 48, "frontend_question_id": "LCP 10", "is_new_question": false }, @@ -3876,8 +3876,8 @@ "question__title": "切分数组", "question__title_slug": "qie-fen-shu-zu", "question__hide": false, - "total_acs": 3588, - "total_submitted": 15345, + "total_acs": 3594, + "total_submitted": 15370, "total_column_articles": 55, "frontend_question_id": "LCP 14", "is_new_question": false @@ -3897,9 +3897,9 @@ "question__title": "魔术排列", "question__title_slug": "er94lq", "question__hide": false, - "total_acs": 3497, - "total_submitted": 9629, - "total_column_articles": 63, + "total_acs": 3516, + "total_submitted": 9652, + "total_column_articles": 65, "frontend_question_id": "LCP 23", "is_new_question": false }, @@ -3918,8 +3918,8 @@ "question__title": "剧情触发时间", "question__title_slug": "ju-qing-hong-fa-shi-jian", "question__hide": false, - "total_acs": 6847, - "total_submitted": 21440, + "total_acs": 6863, + "total_submitted": 21492, "total_column_articles": 125, "frontend_question_id": "LCP 08", "is_new_question": false @@ -3939,9 +3939,9 @@ "question__title": "拿硬币", "question__title_slug": "na-ying-bi", "question__hide": false, - "total_acs": 54229, - "total_submitted": 64552, - "total_column_articles": 820, + "total_acs": 54400, + "total_submitted": 64756, + "total_column_articles": 822, "frontend_question_id": "LCP 06", "is_new_question": false }, @@ -3960,8 +3960,8 @@ "question__title": "Sparse Similarity LCCI", "question__title_slug": "sparse-similarity-lcci", "question__hide": false, - "total_acs": 5221, - "total_submitted": 14829, + "total_acs": 5237, + "total_submitted": 14880, "total_column_articles": 86, "frontend_question_id": "面试题 17.26", "is_new_question": false @@ -3981,8 +3981,8 @@ "question__title": "Langtons Ant LCCI", "question__title_slug": "langtons-ant-lcci", "question__hide": false, - "total_acs": 4160, - "total_submitted": 7206, + "total_acs": 4178, + "total_submitted": 7237, "total_column_articles": 78, "frontend_question_id": "面试题 16.22", "is_new_question": false @@ -4002,8 +4002,8 @@ "question__title": "Word Rectangle LCCI", "question__title_slug": "word-rectangle-lcci", "question__hide": false, - "total_acs": 2557, - "total_submitted": 5018, + "total_acs": 2565, + "total_submitted": 5042, "total_column_articles": 52, "frontend_question_id": "面试题 17.25", "is_new_question": false @@ -4023,8 +4023,8 @@ "question__title": "Sum Swap LCCI", "question__title_slug": "sum-swap-lcci", "question__hide": false, - "total_acs": 14061, - "total_submitted": 29610, + "total_acs": 14125, + "total_submitted": 29741, "total_column_articles": 247, "frontend_question_id": "面试题 16.21", "is_new_question": false @@ -4044,9 +4044,9 @@ "question__title": "T9 LCCI", "question__title_slug": "t9-lcci", "question__hide": false, - "total_acs": 13359, - "total_submitted": 18754, - "total_column_articles": 236, + "total_acs": 13423, + "total_submitted": 18832, + "total_column_articles": 237, "frontend_question_id": "面试题 16.20", "is_new_question": false }, @@ -4065,9 +4065,9 @@ "question__title": "Max Submatrix LCCI", "question__title_slug": "max-submatrix-lcci", "question__hide": false, - "total_acs": 20363, - "total_submitted": 38051, - "total_column_articles": 184, + "total_acs": 20433, + "total_submitted": 38198, + "total_column_articles": 185, "frontend_question_id": "面试题 17.24", "is_new_question": false }, @@ -4086,8 +4086,8 @@ "question__title": "Max Black Square LCCI", "question__title_slug": "max-black-square-lcci", "question__hide": false, - "total_acs": 7081, - "total_submitted": 18914, + "total_acs": 7114, + "total_submitted": 19013, "total_column_articles": 143, "frontend_question_id": "面试题 17.23", "is_new_question": false @@ -4107,9 +4107,9 @@ "question__title": "Missing Two LCCI", "question__title_slug": "missing-two-lcci", "question__hide": false, - "total_acs": 38676, - "total_submitted": 63635, - "total_column_articles": 563, + "total_acs": 38749, + "total_submitted": 63728, + "total_column_articles": 565, "frontend_question_id": "面试题 17.19", "is_new_question": false }, @@ -4128,9 +4128,9 @@ "question__title": "Shortest Supersequence LCCI", "question__title_slug": "shortest-supersequence-lcci", "question__hide": false, - "total_acs": 12167, - "total_submitted": 27417, - "total_column_articles": 161, + "total_acs": 12283, + "total_submitted": 27692, + "total_column_articles": 162, "frontend_question_id": "面试题 17.18", "is_new_question": false }, @@ -4149,9 +4149,9 @@ "question__title": "Pairs With Sum LCCI", "question__title_slug": "pairs-with-sum-lcci", "question__hide": false, - "total_acs": 15732, - "total_submitted": 32770, - "total_column_articles": 230, + "total_acs": 15800, + "total_submitted": 32908, + "total_column_articles": 231, "frontend_question_id": "面试题 16.24", "is_new_question": false }, @@ -4170,9 +4170,9 @@ "question__title": "Rank from Stream LCCI", "question__title_slug": "rank-from-stream-lcci", "question__hide": false, - "total_acs": 8310, - "total_submitted": 13392, - "total_column_articles": 137, + "total_acs": 8361, + "total_submitted": 13485, + "total_column_articles": 138, "frontend_question_id": "面试题 10.10", "is_new_question": false }, @@ -4191,8 +4191,8 @@ "question__title": "Group Anagrams LCCI", "question__title_slug": "group-anagrams-lcci", "question__hide": false, - "total_acs": 39999, - "total_submitted": 53915, + "total_acs": 40055, + "total_submitted": 53983, "total_column_articles": 477, "frontend_question_id": "面试题 10.02", "is_new_question": false @@ -4212,8 +4212,8 @@ "question__title": "Find Closest LCCI", "question__title_slug": "find-closest-lcci", "question__hide": false, - "total_acs": 48631, - "total_submitted": 66445, + "total_acs": 48714, + "total_submitted": 66559, "total_column_articles": 657, "frontend_question_id": "面试题 17.11", "is_new_question": false @@ -4233,9 +4233,9 @@ "question__title": "Find Majority Element LCCI", "question__title_slug": "find-majority-element-lcci", "question__hide": false, - "total_acs": 74770, - "total_submitted": 132399, - "total_column_articles": 1032, + "total_acs": 74910, + "total_submitted": 132719, + "total_column_articles": 1033, "frontend_question_id": "面试题 17.10", "is_new_question": false }, @@ -4254,8 +4254,8 @@ "question__title": "Get Kth Magic Number LCCI", "question__title_slug": "get-kth-magic-number-lcci", "question__hide": false, - "total_acs": 44410, - "total_submitted": 78504, + "total_acs": 44532, + "total_submitted": 78780, "total_column_articles": 404, "frontend_question_id": "面试题 17.09", "is_new_question": false @@ -4275,9 +4275,9 @@ "question__title": "Circus Tower LCCI", "question__title_slug": "circus-tower-lcci", "question__hide": false, - "total_acs": 11581, - "total_submitted": 40877, - "total_column_articles": 155, + "total_acs": 11624, + "total_submitted": 41009, + "total_column_articles": 156, "frontend_question_id": "面试题 17.08", "is_new_question": false }, @@ -4296,9 +4296,9 @@ "question__title": "Baby Names LCCI", "question__title_slug": "baby-names-lcci", "question__hide": false, - "total_acs": 11676, - "total_submitted": 28217, - "total_column_articles": 265, + "total_acs": 11713, + "total_submitted": 28328, + "total_column_articles": 266, "frontend_question_id": "面试题 17.07", "is_new_question": false }, @@ -4317,8 +4317,8 @@ "question__title": "Number Of 2s In Range LCCI", "question__title_slug": "number-of-2s-in-range-lcci", "question__hide": false, - "total_acs": 7941, - "total_submitted": 16434, + "total_acs": 7977, + "total_submitted": 16514, "total_column_articles": 163, "frontend_question_id": "面试题 17.06", "is_new_question": false @@ -4338,8 +4338,8 @@ "question__title": "Find Longest Subarray LCCI", "question__title_slug": "find-longest-subarray-lcci", "question__hide": false, - "total_acs": 8910, - "total_submitted": 22339, + "total_acs": 8961, + "total_submitted": 22473, "total_column_articles": 128, "frontend_question_id": "面试题 17.05", "is_new_question": false @@ -4359,9 +4359,9 @@ "question__title": "Missing Number LCCI", "question__title_slug": "missing-number-lcci", "question__hide": false, - "total_acs": 43991, - "total_submitted": 71912, - "total_column_articles": 651, + "total_acs": 44296, + "total_submitted": 72456, + "total_column_articles": 653, "frontend_question_id": "面试题 17.04", "is_new_question": false }, @@ -4380,9 +4380,9 @@ "question__title": "Boolean Evaluation LCCI", "question__title_slug": "boolean-evaluation-lcci", "question__hide": false, - "total_acs": 6951, - "total_submitted": 13191, - "total_column_articles": 102, + "total_acs": 6982, + "total_submitted": 13245, + "total_column_articles": 103, "frontend_question_id": "面试题 08.14", "is_new_question": false }, @@ -4401,9 +4401,9 @@ "question__title": "Word Transformer LCCI", "question__title_slug": "word-transformer-lcci", "question__hide": false, - "total_acs": 13046, - "total_submitted": 32919, - "total_column_articles": 193, + "total_acs": 13111, + "total_submitted": 33085, + "total_column_articles": 195, "frontend_question_id": "面试题 17.22", "is_new_question": false }, @@ -4422,8 +4422,8 @@ "question__title": "Volume of Histogram LCCI", "question__title_slug": "volume-of-histogram-lcci", "question__hide": false, - "total_acs": 49396, - "total_submitted": 77549, + "total_acs": 49452, + "total_submitted": 77630, "total_column_articles": 586, "frontend_question_id": "面试题 17.21", "is_new_question": false @@ -4443,8 +4443,8 @@ "question__title": "Continuous Median LCCI", "question__title_slug": "continuous-median-lcci", "question__hide": false, - "total_acs": 6147, - "total_submitted": 10654, + "total_acs": 6172, + "total_submitted": 10696, "total_column_articles": 103, "frontend_question_id": "面试题 17.20", "is_new_question": false @@ -4464,8 +4464,8 @@ "question__title": "Calculator LCCI", "question__title_slug": "calculator-lcci", "question__hide": false, - "total_acs": 22011, - "total_submitted": 55418, + "total_acs": 22101, + "total_submitted": 55617, "total_column_articles": 280, "frontend_question_id": "面试题 16.26", "is_new_question": false @@ -4485,8 +4485,8 @@ "question__title": "LRU Cache LCCI", "question__title_slug": "lru-cache-lcci", "question__hide": false, - "total_acs": 43744, - "total_submitted": 79059, + "total_acs": 43820, + "total_submitted": 79206, "total_column_articles": 339, "frontend_question_id": "面试题 16.25", "is_new_question": false @@ -4506,9 +4506,9 @@ "question__title": "Add Without Plus LCCI", "question__title_slug": "add-without-plus-lcci", "question__hide": false, - "total_acs": 18965, - "total_submitted": 31172, - "total_column_articles": 224, + "total_acs": 19045, + "total_submitted": 31283, + "total_column_articles": 225, "frontend_question_id": "面试题 17.01", "is_new_question": false }, @@ -4527,9 +4527,9 @@ "question__title": "Multi Search LCCI", "question__title_slug": "multi-search-lcci", "question__hide": false, - "total_acs": 11921, - "total_submitted": 26446, - "total_column_articles": 236, + "total_acs": 11956, + "total_submitted": 26540, + "total_column_articles": 237, "frontend_question_id": "面试题 17.17", "is_new_question": false }, @@ -4548,9 +4548,9 @@ "question__title": "The Masseuse LCCI", "question__title_slug": "the-masseuse-lcci", "question__hide": false, - "total_acs": 72973, - "total_submitted": 142533, - "total_column_articles": 1270, + "total_acs": 73161, + "total_submitted": 142902, + "total_column_articles": 1274, "frontend_question_id": "面试题 17.16", "is_new_question": false }, @@ -4569,9 +4569,9 @@ "question__title": "Longest Word LCCI", "question__title_slug": "longest-word-lcci", "question__hide": false, - "total_acs": 10333, - "total_submitted": 25207, - "total_column_articles": 172, + "total_acs": 10388, + "total_submitted": 25358, + "total_column_articles": 174, "frontend_question_id": "面试题 17.15", "is_new_question": false }, @@ -4590,9 +4590,9 @@ "question__title": "Smallest K LCCI", "question__title_slug": "smallest-k-lcci", "question__hide": false, - "total_acs": 96942, - "total_submitted": 163728, - "total_column_articles": 881, + "total_acs": 97181, + "total_submitted": 164200, + "total_column_articles": 884, "frontend_question_id": "面试题 17.14", "is_new_question": false }, @@ -4611,8 +4611,8 @@ "question__title": "Re-Space LCCI", "question__title_slug": "re-space-lcci", "question__hide": false, - "total_acs": 27696, - "total_submitted": 49999, + "total_acs": 27741, + "total_submitted": 50074, "total_column_articles": 299, "frontend_question_id": "面试题 17.13", "is_new_question": false @@ -4632,9 +4632,9 @@ "question__title": "BiNode LCCI", "question__title_slug": "binode-lcci", "question__hide": false, - "total_acs": 28731, - "total_submitted": 45026, - "total_column_articles": 370, + "total_acs": 28841, + "total_submitted": 45213, + "total_column_articles": 374, "frontend_question_id": "面试题 17.12", "is_new_question": false }, @@ -4653,8 +4653,8 @@ "question__title": "English Int LCCI", "question__title_slug": "english-int-lcci", "question__hide": false, - "total_acs": 3453, - "total_submitted": 8974, + "total_acs": 3459, + "total_submitted": 8997, "total_column_articles": 76, "frontend_question_id": "面试题 16.08", "is_new_question": false @@ -4674,8 +4674,8 @@ "question__title": "Factorial Zeros LCCI", "question__title_slug": "factorial-zeros-lcci", "question__hide": false, - "total_acs": 15758, - "total_submitted": 35079, + "total_acs": 15815, + "total_submitted": 35218, "total_column_articles": 165, "frontend_question_id": "面试题 16.05", "is_new_question": false @@ -4695,8 +4695,8 @@ "question__title": "Sorted Matrix Search LCCI", "question__title_slug": "sorted-matrix-search-lcci", "question__hide": false, - "total_acs": 18825, - "total_submitted": 42063, + "total_acs": 18899, + "total_submitted": 42252, "total_column_articles": 218, "frontend_question_id": "面试题 10.09", "is_new_question": false @@ -4716,9 +4716,9 @@ "question__title": "Hanota LCCI", "question__title_slug": "hanota-lcci", "question__hide": false, - "total_acs": 38116, - "total_submitted": 58426, - "total_column_articles": 388, + "total_acs": 38296, + "total_submitted": 58702, + "total_column_articles": 389, "frontend_question_id": "面试题 08.06", "is_new_question": false }, @@ -4737,8 +4737,8 @@ "question__title": "Peaks and Valleys LCCI", "question__title_slug": "peaks-and-valleys-lcci", "question__hide": false, - "total_acs": 12509, - "total_submitted": 18982, + "total_acs": 12575, + "total_submitted": 19076, "total_column_articles": 155, "frontend_question_id": "面试题 10.11", "is_new_question": false @@ -4758,9 +4758,9 @@ "question__title": "Sorted Merge LCCI", "question__title_slug": "sorted-merge-lcci", "question__hide": false, - "total_acs": 71877, - "total_submitted": 128144, - "total_column_articles": 2510, + "total_acs": 72313, + "total_submitted": 128833, + "total_column_articles": 2512, "frontend_question_id": "面试题 10.01", "is_new_question": false }, @@ -4779,9 +4779,9 @@ "question__title": "Robot in a Grid LCCI", "question__title_slug": "robot-in-a-grid-lcci", "question__hide": false, - "total_acs": 19535, - "total_submitted": 53808, - "total_column_articles": 290, + "total_acs": 19577, + "total_submitted": 53983, + "total_column_articles": 293, "frontend_question_id": "面试题 08.02", "is_new_question": false }, @@ -4800,9 +4800,9 @@ "question__title": "BST Sequences LCCI", "question__title_slug": "bst-sequences-lcci", "question__hide": false, - "total_acs": 9976, - "total_submitted": 20497, - "total_column_articles": 147, + "total_acs": 10025, + "total_submitted": 20605, + "total_column_articles": 148, "frontend_question_id": "面试题 04.09", "is_new_question": false }, @@ -4821,9 +4821,9 @@ "question__title": "Paths with Sum LCCI", "question__title_slug": "paths-with-sum-lcci", "question__hide": false, - "total_acs": 26664, - "total_submitted": 54566, - "total_column_articles": 335, + "total_acs": 26750, + "total_submitted": 54737, + "total_column_articles": 336, "frontend_question_id": "面试题 04.12", "is_new_question": false }, @@ -4842,9 +4842,9 @@ "question__title": "Partition List LCCI", "question__title_slug": "partition-list-lcci", "question__hide": false, - "total_acs": 38880, - "total_submitted": 61962, - "total_column_articles": 519, + "total_acs": 39044, + "total_submitted": 62273, + "total_column_articles": 520, "frontend_question_id": "面试题 02.04", "is_new_question": false }, @@ -4863,9 +4863,9 @@ "question__title": "Kth Node From End of List LCCI", "question__title_slug": "kth-node-from-end-of-list-lcci", "question__hide": false, - "total_acs": 83974, - "total_submitted": 107388, - "total_column_articles": 1145, + "total_acs": 84175, + "total_submitted": 107633, + "total_column_articles": 1148, "frontend_question_id": "面试题 02.02", "is_new_question": false }, @@ -4884,9 +4884,9 @@ "question__title": "One Away LCCI", "question__title_slug": "one-away-lcci", "question__hide": false, - "total_acs": 82010, - "total_submitted": 230694, - "total_column_articles": 1283, + "total_acs": 82200, + "total_submitted": 231245, + "total_column_articles": 1284, "frontend_question_id": "面试题 01.05", "is_new_question": false }, @@ -4905,9 +4905,9 @@ "question__title": "Pond Sizes LCCI", "question__title_slug": "pond-sizes-lcci", "question__hide": false, - "total_acs": 25980, - "total_submitted": 41436, - "total_column_articles": 452, + "total_acs": 26034, + "total_submitted": 41506, + "total_column_articles": 453, "frontend_question_id": "面试题 16.19", "is_new_question": false }, @@ -4926,9 +4926,9 @@ "question__title": "Pattern Matching LCCI", "question__title_slug": "pattern-matching-lcci", "question__hide": false, - "total_acs": 17155, - "total_submitted": 50569, - "total_column_articles": 339, + "total_acs": 17183, + "total_submitted": 50645, + "total_column_articles": 340, "frontend_question_id": "面试题 16.18", "is_new_question": false }, @@ -4947,9 +4947,9 @@ "question__title": "Contiguous Sequence LCCI", "question__title_slug": "contiguous-sequence-lcci", "question__hide": false, - "total_acs": 44695, - "total_submitted": 75538, - "total_column_articles": 486, + "total_acs": 44844, + "total_submitted": 75808, + "total_column_articles": 489, "frontend_question_id": "面试题 16.17", "is_new_question": false }, @@ -4968,8 +4968,8 @@ "question__title": "Sub Sort LCCI", "question__title_slug": "sub-sort-lcci", "question__hide": false, - "total_acs": 23116, - "total_submitted": 49473, + "total_acs": 23242, + "total_submitted": 49752, "total_column_articles": 306, "frontend_question_id": "面试题 16.16", "is_new_question": false @@ -4989,8 +4989,8 @@ "question__title": "Master Mind LCCI", "question__title_slug": "master-mind-lcci", "question__hide": false, - "total_acs": 14177, - "total_submitted": 30048, + "total_acs": 14255, + "total_submitted": 30210, "total_column_articles": 317, "frontend_question_id": "面试题 16.15", "is_new_question": false @@ -5010,8 +5010,8 @@ "question__title": "Best Line LCCI", "question__title_slug": "best-line-lcci", "question__hide": false, - "total_acs": 5383, - "total_submitted": 9632, + "total_acs": 5408, + "total_submitted": 9673, "total_column_articles": 86, "frontend_question_id": "面试题 16.14", "is_new_question": false @@ -5031,8 +5031,8 @@ "question__title": "Bisect Squares LCCI", "question__title_slug": "bisect-squares-lcci", "question__hide": false, - "total_acs": 3121, - "total_submitted": 7181, + "total_acs": 3136, + "total_submitted": 7207, "total_column_articles": 76, "frontend_question_id": "面试题 16.13", "is_new_question": false @@ -5052,9 +5052,9 @@ "question__title": "Diving Board LCCI", "question__title_slug": "diving-board-lcci", "question__hide": false, - "total_acs": 57323, - "total_submitted": 130469, - "total_column_articles": 656, + "total_acs": 57414, + "total_submitted": 130688, + "total_column_articles": 657, "frontend_question_id": "面试题 16.11", "is_new_question": false }, @@ -5073,9 +5073,9 @@ "question__title": "Living People LCCI", "question__title_slug": "living-people-lcci", "question__hide": false, - "total_acs": 15101, - "total_submitted": 22108, - "total_column_articles": 252, + "total_acs": 15172, + "total_submitted": 22202, + "total_column_articles": 253, "frontend_question_id": "面试题 16.10", "is_new_question": false }, @@ -5094,8 +5094,8 @@ "question__title": "Operations LCCI", "question__title_slug": "operations-lcci", "question__hide": false, - "total_acs": 3369, - "total_submitted": 6039, + "total_acs": 3389, + "total_submitted": 6068, "total_column_articles": 55, "frontend_question_id": "面试题 16.09", "is_new_question": false @@ -5115,9 +5115,9 @@ "question__title": "Maximum LCCI", "question__title_slug": "maximum-lcci", "question__hide": false, - "total_acs": 29231, - "total_submitted": 39629, - "total_column_articles": 383, + "total_acs": 29348, + "total_submitted": 39777, + "total_column_articles": 387, "frontend_question_id": "面试题 16.07", "is_new_question": false }, @@ -5136,9 +5136,9 @@ "question__title": "Permutation II LCCI", "question__title_slug": "permutation-ii-lcci", "question__hide": false, - "total_acs": 25742, - "total_submitted": 36524, - "total_column_articles": 336, + "total_acs": 25894, + "total_submitted": 36750, + "total_column_articles": 337, "frontend_question_id": "面试题 08.08", "is_new_question": false }, @@ -5157,9 +5157,9 @@ "question__title": "二叉树的最近公共祖先 LCOF", "question__title_slug": "er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof", "question__hide": false, - "total_acs": 190545, - "total_submitted": 270418, - "total_column_articles": 1016, + "total_acs": 191238, + "total_submitted": 271428, + "total_column_articles": 1018, "frontend_question_id": "剑指 Offer 68 - II", "is_new_question": false }, @@ -5178,9 +5178,9 @@ "question__title": "二叉搜索树的最近公共祖先 LCOF", "question__title_slug": "er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof", "question__hide": false, - "total_acs": 196319, - "total_submitted": 282456, - "total_column_articles": 1029, + "total_acs": 197023, + "total_submitted": 283461, + "total_column_articles": 1032, "frontend_question_id": "剑指 Offer 68 - I", "is_new_question": false }, @@ -5199,9 +5199,9 @@ "question__title": "求1+2+…+n LCOF", "question__title_slug": "qiu-12n-lcof", "question__hide": false, - "total_acs": 212709, - "total_submitted": 247249, - "total_column_articles": 1687, + "total_acs": 213392, + "total_submitted": 248048, + "total_column_articles": 1689, "frontend_question_id": "剑指 Offer 64", "is_new_question": false }, @@ -5220,9 +5220,9 @@ "question__title": "股票的最大利润 LCOF", "question__title_slug": "gu-piao-de-zui-da-li-run-lcof", "question__hide": false, - "total_acs": 234465, - "total_submitted": 370242, - "total_column_articles": 1458, + "total_acs": 235301, + "total_submitted": 371543, + "total_column_articles": 1460, "frontend_question_id": "剑指 Offer 63", "is_new_question": false }, @@ -5241,9 +5241,9 @@ "question__title": "圆圈中最后剩下的数字 LCOF", "question__title_slug": "yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof", "question__hide": false, - "total_acs": 172498, - "total_submitted": 261843, - "total_column_articles": 1022, + "total_acs": 173099, + "total_submitted": 262789, + "total_column_articles": 1023, "frontend_question_id": "剑指 Offer 62", "is_new_question": false }, @@ -5262,9 +5262,9 @@ "question__title": "平衡二叉树 LCOF", "question__title_slug": "ping-heng-er-cha-shu-lcof", "question__hide": false, - "total_acs": 223375, - "total_submitted": 373882, - "total_column_articles": 1351, + "total_acs": 224191, + "total_submitted": 375332, + "total_column_articles": 1356, "frontend_question_id": "剑指 Offer 55 - II", "is_new_question": false }, @@ -5283,9 +5283,9 @@ "question__title": "扑克牌中的顺子 LCOF", "question__title_slug": "bu-ke-pai-zhong-de-shun-zi-lcof", "question__hide": false, - "total_acs": 186607, - "total_submitted": 406046, - "total_column_articles": 1544, + "total_acs": 187321, + "total_submitted": 407684, + "total_column_articles": 1551, "frontend_question_id": "剑指 Offer 61", "is_new_question": false }, @@ -5304,9 +5304,9 @@ "question__title": "把字符串转换成整数 LCOF", "question__title_slug": "ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof", "question__hide": false, - "total_acs": 116261, - "total_submitted": 399738, - "total_column_articles": 887, + "total_acs": 116648, + "total_submitted": 401077, + "total_column_articles": 888, "frontend_question_id": "剑指 Offer 67", "is_new_question": false }, @@ -5325,9 +5325,9 @@ "question__title": "n个骰子的点数 LCOF", "question__title_slug": "nge-tou-zi-de-dian-shu-lcof", "question__hide": false, - "total_acs": 109902, - "total_submitted": 190815, - "total_column_articles": 905, + "total_acs": 110269, + "total_submitted": 191521, + "total_column_articles": 907, "frontend_question_id": "剑指 Offer 60", "is_new_question": false }, @@ -5346,9 +5346,9 @@ "question__title": "构建乘积数组 LCOF", "question__title_slug": "gou-jian-cheng-ji-shu-zu-lcof", "question__hide": false, - "total_acs": 128327, - "total_submitted": 216585, - "total_column_articles": 865, + "total_acs": 128803, + "total_submitted": 217425, + "total_column_articles": 867, "frontend_question_id": "剑指 Offer 66", "is_new_question": false }, @@ -5367,9 +5367,9 @@ "question__title": "队列的最大值 LCOF", "question__title_slug": "dui-lie-de-zui-da-zhi-lcof", "question__hide": false, - "total_acs": 147975, - "total_submitted": 308667, - "total_column_articles": 1359, + "total_acs": 148413, + "total_submitted": 309656, + "total_column_articles": 1360, "frontend_question_id": "面试题59 - II", "is_new_question": false }, @@ -5388,9 +5388,9 @@ "question__title": "滑动窗口的最大值 LCOF", "question__title_slug": "hua-dong-chuang-kou-de-zui-da-zhi-lcof", "question__hide": false, - "total_acs": 202495, - "total_submitted": 450117, - "total_column_articles": 1610, + "total_acs": 203196, + "total_submitted": 451611, + "total_column_articles": 1613, "frontend_question_id": "剑指 Offer 59 - I", "is_new_question": false }, @@ -5409,8 +5409,8 @@ "question__title": "不用加减乘除做加法 LCOF", "question__title_slug": "bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof", "question__hide": false, - "total_acs": 125025, - "total_submitted": 210287, + "total_acs": 125476, + "total_submitted": 211018, "total_column_articles": 762, "frontend_question_id": "剑指 Offer 65", "is_new_question": false @@ -5430,9 +5430,9 @@ "question__title": "丑数 LCOF", "question__title_slug": "chou-shu-lcof", "question__hide": false, - "total_acs": 146126, - "total_submitted": 224030, - "total_column_articles": 796, + "total_acs": 146647, + "total_submitted": 224836, + "total_column_articles": 799, "frontend_question_id": "剑指 Offer 49", "is_new_question": false }, @@ -5451,9 +5451,9 @@ "question__title": "二叉搜索树的第k大节点 LCOF", "question__title_slug": "er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof", "question__hide": false, - "total_acs": 268365, - "total_submitted": 350699, - "total_column_articles": 1698, + "total_acs": 269332, + "total_submitted": 352041, + "total_column_articles": 1705, "frontend_question_id": "剑指 Offer 54", "is_new_question": false }, @@ -5472,9 +5472,9 @@ "question__title": "最长不含重复字符的子字符串 LCOF", "question__title_slug": "zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof", "question__hide": false, - "total_acs": 265402, - "total_submitted": 571953, - "total_column_articles": 1656, + "total_acs": 266339, + "total_submitted": 574064, + "total_column_articles": 1662, "frontend_question_id": "剑指 Offer 48", "is_new_question": false }, @@ -5493,9 +5493,9 @@ "question__title": "缺失的数字 LCOF", "question__title_slug": "que-shi-de-shu-zi-lcof", "question__hide": false, - "total_acs": 301097, - "total_submitted": 669546, - "total_column_articles": 2289, + "total_acs": 302189, + "total_submitted": 671959, + "total_column_articles": 2293, "frontend_question_id": "剑指 Offer 53 - II", "is_new_question": false }, @@ -5514,9 +5514,9 @@ "question__title": "左旋转字符串 LCOF", "question__title_slug": "zuo-xuan-zhuan-zi-fu-chuan-lcof", "question__hide": false, - "total_acs": 392187, - "total_submitted": 455891, - "total_column_articles": 2772, + "total_acs": 394322, + "total_submitted": 458412, + "total_column_articles": 2781, "frontend_question_id": "剑指 Offer 58 - II", "is_new_question": false }, @@ -5535,9 +5535,9 @@ "question__title": "在排序数组中查找数字 LCOF", "question__title_slug": "zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof", "question__hide": false, - "total_acs": 331677, - "total_submitted": 624364, - "total_column_articles": 2399, + "total_acs": 332927, + "total_submitted": 626887, + "total_column_articles": 2410, "frontend_question_id": "剑指 Offer 53 - I", "is_new_question": false }, @@ -5556,9 +5556,9 @@ "question__title": "翻转单词顺序 LCOF", "question__title_slug": "fan-zhuan-dan-ci-shun-xu-lcof", "question__hide": false, - "total_acs": 221072, - "total_submitted": 496087, - "total_column_articles": 1475, + "total_acs": 221816, + "total_submitted": 497669, + "total_column_articles": 1481, "frontend_question_id": "剑指 Offer 58 - I", "is_new_question": false }, @@ -5577,9 +5577,9 @@ "question__title": "礼物的最大价值 LCOF", "question__title_slug": "li-wu-de-zui-da-jie-zhi-lcof", "question__hide": false, - "total_acs": 213521, - "total_submitted": 308931, - "total_column_articles": 1555, + "total_acs": 214298, + "total_submitted": 310045, + "total_column_articles": 1561, "frontend_question_id": "剑指 Offer 47", "is_new_question": false }, @@ -5598,9 +5598,9 @@ "question__title": "两个链表的第一个公共节点 LCOF", "question__title_slug": "liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof", "question__hide": false, - "total_acs": 275705, - "total_submitted": 419588, - "total_column_articles": 1459, + "total_acs": 276633, + "total_submitted": 421031, + "total_column_articles": 1464, "frontend_question_id": "剑指 Offer 52", "is_new_question": false }, @@ -5619,9 +5619,9 @@ "question__title": "把数字翻译成字符串 LCOF", "question__title_slug": "ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof", "question__hide": false, - "total_acs": 217012, - "total_submitted": 417512, - "total_column_articles": 2136, + "total_acs": 217786, + "total_submitted": 419146, + "total_column_articles": 2143, "frontend_question_id": "剑指 Offer 46", "is_new_question": false }, @@ -5640,9 +5640,9 @@ "question__title": "和为s的连续正数序列 LCOF", "question__title_slug": "he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof", "question__hide": false, - "total_acs": 215434, - "total_submitted": 302276, - "total_column_articles": 2325, + "total_acs": 216117, + "total_submitted": 303217, + "total_column_articles": 2331, "frontend_question_id": "剑指 Offer 57 - II", "is_new_question": false }, @@ -5661,9 +5661,9 @@ "question__title": "把数组排成最小的数 LCOF", "question__title_slug": "ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof", "question__hide": false, - "total_acs": 197816, - "total_submitted": 356280, - "total_column_articles": 1336, + "total_acs": 198506, + "total_submitted": 357621, + "total_column_articles": 1343, "frontend_question_id": "剑指 Offer 45", "is_new_question": false }, @@ -5682,9 +5682,9 @@ "question__title": "和为s的两个数字 LCOF", "question__title_slug": "he-wei-sde-liang-ge-shu-zi-lcof", "question__hide": false, - "total_acs": 231074, - "total_submitted": 339988, - "total_column_articles": 1305, + "total_acs": 231980, + "total_submitted": 341330, + "total_column_articles": 1310, "frontend_question_id": "剑指 Offer 57", "is_new_question": false }, @@ -5703,9 +5703,9 @@ "question__title": "数组中数字出现的次数 II LCOF", "question__title_slug": "shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof", "question__hide": false, - "total_acs": 149416, - "total_submitted": 185197, - "total_column_articles": 1011, + "total_acs": 149915, + "total_submitted": 185823, + "total_column_articles": 1012, "frontend_question_id": "剑指 Offer 56 - II", "is_new_question": false }, @@ -5724,9 +5724,9 @@ "question__title": "数组中数字出现的次数 LCOF", "question__title_slug": "shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof", "question__hide": false, - "total_acs": 181071, - "total_submitted": 261832, - "total_column_articles": 1446, + "total_acs": 181686, + "total_submitted": 262748, + "total_column_articles": 1447, "frontend_question_id": "剑指 Offer 56 - I", "is_new_question": false }, @@ -5745,9 +5745,9 @@ "question__title": "二叉树的深度 LCOF", "question__title_slug": "er-cha-shu-de-shen-du-lcof", "question__hide": false, - "total_acs": 274693, - "total_submitted": 346183, - "total_column_articles": 1702, + "total_acs": 275725, + "total_submitted": 347508, + "total_column_articles": 1705, "frontend_question_id": "剑指 Offer 55 - I", "is_new_question": false }, @@ -5766,9 +5766,9 @@ "question__title": "数组中的逆序对 LCOF", "question__title_slug": "shu-zu-zhong-de-ni-xu-dui-lcof", "question__hide": false, - "total_acs": 175255, - "total_submitted": 353267, - "total_column_articles": 1351, + "total_acs": 176002, + "total_submitted": 354655, + "total_column_articles": 1357, "frontend_question_id": "剑指 Offer 51", "is_new_question": false }, @@ -5787,9 +5787,9 @@ "question__title": "二叉树中和为某一值的路径 LCOF", "question__title_slug": "er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof", "question__hide": false, - "total_acs": 230150, - "total_submitted": 390641, - "total_column_articles": 1367, + "total_acs": 230991, + "total_submitted": 392004, + "total_column_articles": 1376, "frontend_question_id": "剑指 Offer 34", "is_new_question": false }, @@ -5808,9 +5808,9 @@ "question__title": "第一个只出现一次的字符 LCOF", "question__title_slug": "di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof", "question__hide": false, - "total_acs": 276772, - "total_submitted": 445472, - "total_column_articles": 1674, + "total_acs": 277768, + "total_submitted": 447248, + "total_column_articles": 1680, "frontend_question_id": "剑指 Offer 50", "is_new_question": false }, @@ -5829,9 +5829,9 @@ "question__title": "二叉搜索树的后序遍历序列 LCOF", "question__title_slug": "er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof", "question__hide": false, - "total_acs": 195011, - "total_submitted": 344912, - "total_column_articles": 1497, + "total_acs": 195766, + "total_submitted": 346137, + "total_column_articles": 1505, "frontend_question_id": "剑指 Offer 33", "is_new_question": false }, @@ -5850,9 +5850,9 @@ "question__title": "从上到下打印二叉树 III LCOF", "question__title_slug": "cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof", "question__hide": false, - "total_acs": 220607, - "total_submitted": 377296, - "total_column_articles": 1902, + "total_acs": 221504, + "total_submitted": 378873, + "total_column_articles": 1911, "frontend_question_id": "剑指 Offer 32 - III", "is_new_question": false }, @@ -5871,9 +5871,9 @@ "question__title": "数字序列中某一位的数字 LCOF", "question__title_slug": "shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof", "question__hide": false, - "total_acs": 94229, - "total_submitted": 219095, - "total_column_articles": 733, + "total_acs": 94536, + "total_submitted": 219815, + "total_column_articles": 734, "frontend_question_id": "剑指 Offer 44", "is_new_question": false }, @@ -5892,9 +5892,9 @@ "question__title": "从上到下打印二叉树 II LCOF", "question__title_slug": "cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof", "question__hide": false, - "total_acs": 239423, - "total_submitted": 347093, - "total_column_articles": 1710, + "total_acs": 240343, + "total_submitted": 348475, + "total_column_articles": 1718, "frontend_question_id": "剑指 Offer 32 - II", "is_new_question": false }, @@ -5913,9 +5913,9 @@ "question__title": "从上到下打印二叉树 LCOF", "question__title_slug": "cong-shang-dao-xia-da-yin-er-cha-shu-lcof", "question__hide": false, - "total_acs": 242184, - "total_submitted": 380526, - "total_column_articles": 1557, + "total_acs": 243144, + "total_submitted": 382088, + "total_column_articles": 1564, "frontend_question_id": "剑指 Offer 32 - I", "is_new_question": false }, @@ -5934,9 +5934,9 @@ "question__title": "数组中出现次数超过一半的数字 LCOF", "question__title_slug": "shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof", "question__hide": false, - "total_acs": 269139, - "total_submitted": 383846, - "total_column_articles": 1449, + "total_acs": 270092, + "total_submitted": 385220, + "total_column_articles": 1455, "frontend_question_id": "剑指 Offer 39", "is_new_question": false }, @@ -5955,9 +5955,9 @@ "question__title": "1~n整数中1出现的次数 LCOF", "question__title_slug": "1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof", "question__hide": false, - "total_acs": 79191, - "total_submitted": 156918, - "total_column_articles": 717, + "total_acs": 79425, + "total_submitted": 157337, + "total_column_articles": 719, "frontend_question_id": "剑指 Offer 43", "is_new_question": false }, @@ -5976,9 +5976,9 @@ "question__title": "字符串的排列 LCOF", "question__title_slug": "zi-fu-chuan-de-pai-lie-lcof", "question__hide": false, - "total_acs": 244761, - "total_submitted": 423747, - "total_column_articles": 1525, + "total_acs": 245608, + "total_submitted": 425260, + "total_column_articles": 1527, "frontend_question_id": "剑指 Offer 38", "is_new_question": false }, @@ -5997,9 +5997,9 @@ "question__title": "序列化二叉树 LCOF", "question__title_slug": "xu-lie-hua-er-cha-shu-lcof", "question__hide": false, - "total_acs": 122039, - "total_submitted": 212453, - "total_column_articles": 792, + "total_acs": 122491, + "total_submitted": 213209, + "total_column_articles": 793, "frontend_question_id": "剑指 Offer 37", "is_new_question": false }, @@ -6018,9 +6018,9 @@ "question__title": "栈的压入、弹出序列 LCOF", "question__title_slug": "zhan-de-ya-ru-dan-chu-xu-lie-lcof", "question__hide": false, - "total_acs": 189580, - "total_submitted": 311204, - "total_column_articles": 1429, + "total_acs": 190327, + "total_submitted": 312417, + "total_column_articles": 1437, "frontend_question_id": "剑指 Offer 31", "is_new_question": false }, @@ -6039,9 +6039,9 @@ "question__title": "二叉搜索树与双向链表 LCOF", "question__title_slug": "er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof", "question__hide": false, - "total_acs": 186715, - "total_submitted": 286495, - "total_column_articles": 1474, + "total_acs": 187396, + "total_submitted": 287542, + "total_column_articles": 1480, "frontend_question_id": "剑指 Offer 36", "is_new_question": false }, @@ -6060,9 +6060,9 @@ "question__title": "连续子数组的最大和 LCOF", "question__title_slug": "lian-xu-zi-shu-zu-de-zui-da-he-lcof", "question__hide": false, - "total_acs": 355867, - "total_submitted": 586718, - "total_column_articles": 2088, + "total_acs": 357162, + "total_submitted": 588993, + "total_column_articles": 2097, "frontend_question_id": "剑指 Offer 42", "is_new_question": false }, @@ -6081,9 +6081,9 @@ "question__title": "数据流中的中位数 LCOF", "question__title_slug": "shu-ju-liu-zhong-de-zhong-wei-shu-lcof", "question__hide": false, - "total_acs": 117060, - "total_submitted": 200205, - "total_column_articles": 793, + "total_acs": 117474, + "total_submitted": 200904, + "total_column_articles": 794, "frontend_question_id": "剑指 Offer 41", "is_new_question": false }, @@ -6102,9 +6102,9 @@ "question__title": "包含min函数的栈 LCOF", "question__title_slug": "bao-han-minhan-shu-de-zhan-lcof", "question__hide": false, - "total_acs": 292830, - "total_submitted": 526794, - "total_column_articles": 1781, + "total_acs": 294090, + "total_submitted": 529034, + "total_column_articles": 1785, "frontend_question_id": "剑指 Offer 30", "is_new_question": false }, @@ -6123,9 +6123,9 @@ "question__title": "最小的k个数 LCOF", "question__title_slug": "zui-xiao-de-kge-shu-lcof", "question__hide": false, - "total_acs": 392342, - "total_submitted": 682841, - "total_column_articles": 2393, + "total_acs": 393558, + "total_submitted": 685028, + "total_column_articles": 2402, "frontend_question_id": "剑指 Offer 40", "is_new_question": false }, @@ -6144,9 +6144,9 @@ "question__title": "复杂链表的复制 LCOF", "question__title_slug": "fu-za-lian-biao-de-fu-zhi-lcof", "question__hide": false, - "total_acs": 239861, - "total_submitted": 334939, - "total_column_articles": 1561, + "total_acs": 240859, + "total_submitted": 336333, + "total_column_articles": 1568, "frontend_question_id": "剑指 Offer 35", "is_new_question": false }, @@ -6165,9 +6165,9 @@ "question__title": "删除链表的节点 LCOF", "question__title_slug": "shan-chu-lian-biao-de-jie-dian-lcof", "question__hide": false, - "total_acs": 310642, - "total_submitted": 516878, - "total_column_articles": 2106, + "total_acs": 311991, + "total_submitted": 519203, + "total_column_articles": 2111, "frontend_question_id": "剑指 Offer 18", "is_new_question": false }, @@ -6186,9 +6186,9 @@ "question__title": "反转链表 LCOF", "question__title_slug": "fan-zhuan-lian-biao-lcof", "question__hide": false, - "total_acs": 491638, - "total_submitted": 660170, - "total_column_articles": 2660, + "total_acs": 493529, + "total_submitted": 662768, + "total_column_articles": 2669, "frontend_question_id": "剑指 Offer 24", "is_new_question": false }, @@ -6207,9 +6207,9 @@ "question__title": "正则表达式匹配 LCOF", "question__title_slug": "zheng-ze-biao-da-shi-pi-pei-lcof", "question__hide": false, - "total_acs": 106588, - "total_submitted": 275732, - "total_column_articles": 641, + "total_acs": 107013, + "total_submitted": 276807, + "total_column_articles": 642, "frontend_question_id": "剑指 Offer 19", "is_new_question": false }, @@ -6228,9 +6228,9 @@ "question__title": "打印从1到最大的n位数 LCOF", "question__title_slug": "da-yin-cong-1dao-zui-da-de-nwei-shu-lcof", "question__hide": false, - "total_acs": 231075, - "total_submitted": 297114, - "total_column_articles": 1475, + "total_acs": 231925, + "total_submitted": 298203, + "total_column_articles": 1479, "frontend_question_id": "剑指 Offer 17", "is_new_question": false }, @@ -6249,9 +6249,9 @@ "question__title": "数值的整数次方 LCOF", "question__title_slug": "shu-zhi-de-zheng-shu-ci-fang-lcof", "question__hide": false, - "total_acs": 209072, - "total_submitted": 601231, - "total_column_articles": 1169, + "total_acs": 209937, + "total_submitted": 603698, + "total_column_articles": 1172, "frontend_question_id": "剑指 Offer 16", "is_new_question": false }, @@ -6270,9 +6270,9 @@ "question__title": "链表中倒数第k个节点 LCOF", "question__title_slug": "lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof", "question__hide": false, - "total_acs": 408788, - "total_submitted": 509788, - "total_column_articles": 3322, + "total_acs": 410405, + "total_submitted": 511937, + "total_column_articles": 3336, "frontend_question_id": "剑指 Offer 22", "is_new_question": false }, @@ -6291,9 +6291,9 @@ "question__title": "顺时针打印矩阵 LCOF", "question__title_slug": "shun-shi-zhen-da-yin-ju-zhen-lcof", "question__hide": false, - "total_acs": 228182, - "total_submitted": 525724, - "total_column_articles": 2019, + "total_acs": 229107, + "total_submitted": 527856, + "total_column_articles": 2028, "frontend_question_id": "剑指 Offer 29", "is_new_question": false }, @@ -6312,9 +6312,9 @@ "question__title": "二进制中1的个数 LCOF", "question__title_slug": "er-jin-zhi-zhong-1de-ge-shu-lcof", "question__hide": false, - "total_acs": 299602, - "total_submitted": 397814, - "total_column_articles": 1687, + "total_acs": 300629, + "total_submitted": 399137, + "total_column_articles": 1693, "frontend_question_id": "剑指 Offer 15", "is_new_question": false }, @@ -6333,9 +6333,9 @@ "question__title": "调整数组顺序使奇数位于偶数前面 LCOF", "question__title_slug": "diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof", "question__hide": false, - "total_acs": 326678, - "total_submitted": 503146, - "total_column_articles": 2411, + "total_acs": 327969, + "total_submitted": 505086, + "total_column_articles": 2417, "frontend_question_id": "剑指 Offer 21", "is_new_question": false }, @@ -6354,9 +6354,9 @@ "question__title": "表示数值的字符串 LCOF", "question__title_slug": "biao-shi-shu-zhi-de-zi-fu-chuan-lcof", "question__hide": false, - "total_acs": 123232, - "total_submitted": 486064, - "total_column_articles": 1347, + "total_acs": 123725, + "total_submitted": 487862, + "total_column_articles": 1352, "frontend_question_id": "剑指 Offer 20", "is_new_question": false }, @@ -6375,9 +6375,9 @@ "question__title": "对称的二叉树 LCOF", "question__title_slug": "dui-cheng-de-er-cha-shu-lcof", "question__hide": false, - "total_acs": 256850, - "total_submitted": 445489, - "total_column_articles": 1691, + "total_acs": 257827, + "total_submitted": 447165, + "total_column_articles": 1697, "frontend_question_id": "剑指 Offer 28", "is_new_question": false }, @@ -6396,9 +6396,9 @@ "question__title": "二叉树的镜像 LCOF", "question__title_slug": "er-cha-shu-de-jing-xiang-lcof", "question__hide": false, - "total_acs": 316602, - "total_submitted": 397705, - "total_column_articles": 2057, + "total_acs": 317774, + "total_submitted": 399166, + "total_column_articles": 2062, "frontend_question_id": "剑指 Offer 27", "is_new_question": false }, @@ -6417,9 +6417,9 @@ "question__title": "树的子结构 LCOF", "question__title_slug": "shu-de-zi-jie-gou-lcof", "question__hide": false, - "total_acs": 265604, - "total_submitted": 569252, - "total_column_articles": 1911, + "total_acs": 266625, + "total_submitted": 571450, + "total_column_articles": 1915, "frontend_question_id": "剑指 Offer 26", "is_new_question": false }, @@ -6438,9 +6438,9 @@ "question__title": "合并两个排序的链表 LCOF", "question__title_slug": "he-bing-liang-ge-pai-xu-de-lian-biao-lcof", "question__hide": false, - "total_acs": 310281, - "total_submitted": 426962, - "total_column_articles": 1763, + "total_acs": 311547, + "total_submitted": 428798, + "total_column_articles": 1766, "frontend_question_id": "剑指 Offer 25", "is_new_question": false }, @@ -6459,9 +6459,9 @@ "question__title": "剪绳子 II LCOF", "question__title_slug": "jian-sheng-zi-ii-lcof", "question__hide": false, - "total_acs": 133768, - "total_submitted": 421579, - "total_column_articles": 716, + "total_acs": 134253, + "total_submitted": 423262, + "total_column_articles": 717, "frontend_question_id": "剑指 Offer 14- II", "is_new_question": false }, @@ -6480,9 +6480,9 @@ "question__title": "剪绳子 LCOF", "question__title_slug": "jian-sheng-zi-lcof", "question__hide": false, - "total_acs": 254776, - "total_submitted": 443340, - "total_column_articles": 1896, + "total_acs": 255792, + "total_submitted": 445096, + "total_column_articles": 1905, "frontend_question_id": "剑指 Offer 14- I", "is_new_question": false }, @@ -6501,9 +6501,9 @@ "question__title": "重建二叉树 LCOF", "question__title_slug": "zhong-jian-er-cha-shu-lcof", "question__hide": false, - "total_acs": 298704, - "total_submitted": 424055, - "total_column_articles": 2005, + "total_acs": 299765, + "total_submitted": 425563, + "total_column_articles": 2012, "frontend_question_id": "剑指 Offer 07", "is_new_question": false }, @@ -6522,9 +6522,9 @@ "question__title": "从尾到头打印链表 LCOF", "question__title_slug": "cong-wei-dao-tou-da-yin-lian-biao-lcof", "question__hide": false, - "total_acs": 532612, - "total_submitted": 712367, - "total_column_articles": 3250, + "total_acs": 535075, + "total_submitted": 715755, + "total_column_articles": 3259, "frontend_question_id": "剑指 Offer 06", "is_new_question": false }, @@ -6543,9 +6543,9 @@ "question__title": "机器人的运动范围 LCOF", "question__title_slug": "ji-qi-ren-de-yun-dong-fan-wei-lcof", "question__hide": false, - "total_acs": 286894, - "total_submitted": 535975, - "total_column_articles": 2368, + "total_acs": 287535, + "total_submitted": 537219, + "total_column_articles": 2370, "frontend_question_id": "面试题13", "is_new_question": false }, @@ -6564,9 +6564,9 @@ "question__title": "替换空格 LCOF", "question__title_slug": "ti-huan-kong-ge-lcof", "question__hide": false, - "total_acs": 550438, - "total_submitted": 728747, - "total_column_articles": 3095, + "total_acs": 553791, + "total_submitted": 733257, + "total_column_articles": 3108, "frontend_question_id": "剑指 Offer 05", "is_new_question": false }, @@ -6585,9 +6585,9 @@ "question__title": "矩阵中的路径 LCOF", "question__title_slug": "ju-zhen-zhong-de-lu-jing-lcof", "question__hide": false, - "total_acs": 294980, - "total_submitted": 647401, - "total_column_articles": 1696, + "total_acs": 296065, + "total_submitted": 649629, + "total_column_articles": 1703, "frontend_question_id": "剑指 Offer 12", "is_new_question": false }, @@ -6606,9 +6606,9 @@ "question__title": "旋转数组的最小数字 LCOF", "question__title_slug": "xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof", "question__hide": false, - "total_acs": 431497, - "total_submitted": 874598, - "total_column_articles": 2384, + "total_acs": 433122, + "total_submitted": 877956, + "total_column_articles": 2387, "frontend_question_id": "剑指 Offer 11", "is_new_question": false }, @@ -6627,9 +6627,9 @@ "question__title": "青蛙跳台阶问题 LCOF", "question__title_slug": "qing-wa-tiao-tai-jie-wen-ti-lcof", "question__hide": false, - "total_acs": 332380, - "total_submitted": 728195, - "total_column_articles": 1914, + "total_acs": 333766, + "total_submitted": 731314, + "total_column_articles": 1918, "frontend_question_id": "剑指 Offer 10- II", "is_new_question": false }, @@ -6648,9 +6648,9 @@ "question__title": "二维数组中的查找 LCOF", "question__title_slug": "er-wei-shu-zu-zhong-de-cha-zhao-lcof", "question__hide": false, - "total_acs": 446592, - "total_submitted": 1119766, - "total_column_articles": 3196, + "total_acs": 448617, + "total_submitted": 1125167, + "total_column_articles": 3204, "frontend_question_id": "剑指 Offer 04", "is_new_question": false }, @@ -6669,9 +6669,9 @@ "question__title": "数组中重复的数字 LCOF", "question__title_slug": "shu-zu-zhong-zhong-fu-de-shu-zi-lcof", "question__hide": false, - "total_acs": 657244, - "total_submitted": 972479, - "total_column_articles": 4000, + "total_acs": 659957, + "total_submitted": 976994, + "total_column_articles": 4015, "frontend_question_id": "剑指 Offer 03", "is_new_question": false }, @@ -6690,9 +6690,9 @@ "question__title": "斐波那契数列 LCOF", "question__title_slug": "fei-bo-na-qi-shu-lie-lcof", "question__hide": false, - "total_acs": 430988, - "total_submitted": 1194419, - "total_column_articles": 2605, + "total_acs": 432530, + "total_submitted": 1199002, + "total_column_articles": 2612, "frontend_question_id": "剑指 Offer 10- I", "is_new_question": false }, @@ -6711,9 +6711,9 @@ "question__title": "用两个栈实现队列 LCOF", "question__title_slug": "yong-liang-ge-zhan-shi-xian-dui-lie-lcof", "question__hide": false, - "total_acs": 485169, - "total_submitted": 686392, - "total_column_articles": 2666, + "total_acs": 486928, + "total_submitted": 688880, + "total_column_articles": 2673, "frontend_question_id": "剑指 Offer 09", "is_new_question": false }, @@ -6732,8 +6732,8 @@ "question__title": "Smallest Difference LCCI", "question__title_slug": "smallest-difference-lcci", "question__hide": false, - "total_acs": 19883, - "total_submitted": 46247, + "total_acs": 19953, + "total_submitted": 46418, "total_column_articles": 265, "frontend_question_id": "面试题 16.06", "is_new_question": false @@ -6753,9 +6753,9 @@ "question__title": "Tic-Tac-Toe LCCI", "question__title_slug": "tic-tac-toe-lcci", "question__hide": false, - "total_acs": 10534, - "total_submitted": 22569, - "total_column_articles": 203, + "total_acs": 10561, + "total_submitted": 22618, + "total_column_articles": 204, "frontend_question_id": "面试题 16.04", "is_new_question": false }, @@ -6774,9 +6774,9 @@ "question__title": "Intersection LCCI", "question__title_slug": "intersection-lcci", "question__hide": false, - "total_acs": 10689, - "total_submitted": 24328, - "total_column_articles": 249, + "total_acs": 10695, + "total_submitted": 24340, + "total_column_articles": 248, "frontend_question_id": "面试题 16.03", "is_new_question": false }, @@ -6795,8 +6795,8 @@ "question__title": "Words Frequency LCCI", "question__title_slug": "words-frequency-lcci", "question__hide": false, - "total_acs": 21541, - "total_submitted": 28103, + "total_acs": 21622, + "total_submitted": 28206, "total_column_articles": 259, "frontend_question_id": "面试题 16.02", "is_new_question": false @@ -6816,9 +6816,9 @@ "question__title": "Swap Numbers LCCI", "question__title_slug": "swap-numbers-lcci", "question__hide": false, - "total_acs": 35596, - "total_submitted": 43448, - "total_column_articles": 521, + "total_acs": 35718, + "total_submitted": 43607, + "total_column_articles": 522, "frontend_question_id": "面试题 16.01", "is_new_question": false }, @@ -6837,8 +6837,8 @@ "question__title": "Sparse Array Search LCCI", "question__title_slug": "sparse-array-search-lcci", "question__hide": false, - "total_acs": 27525, - "total_submitted": 48536, + "total_acs": 27621, + "total_submitted": 48711, "total_column_articles": 336, "frontend_question_id": "面试题 10.05", "is_new_question": false @@ -6858,8 +6858,8 @@ "question__title": "Permutation I LCCI", "question__title_slug": "permutation-i-lcci", "question__hide": false, - "total_acs": 29659, - "total_submitted": 36538, + "total_acs": 29775, + "total_submitted": 36683, "total_column_articles": 432, "frontend_question_id": "面试题 08.07", "is_new_question": false @@ -6879,8 +6879,8 @@ "question__title": "Magic Index LCCI", "question__title_slug": "magic-index-lcci", "question__hide": false, - "total_acs": 59457, - "total_submitted": 88119, + "total_acs": 59555, + "total_submitted": 88259, "total_column_articles": 482, "frontend_question_id": "面试题 08.03", "is_new_question": false @@ -6900,8 +6900,8 @@ "question__title": "Eight Queens LCCI", "question__title_slug": "eight-queens-lcci", "question__hide": false, - "total_acs": 26189, - "total_submitted": 34196, + "total_acs": 26302, + "total_submitted": 34344, "total_column_articles": 397, "frontend_question_id": "面试题 08.12", "is_new_question": false @@ -6921,9 +6921,9 @@ "question__title": "Search Rotate Array LCCI", "question__title_slug": "search-rotate-array-lcci", "question__hide": false, - "total_acs": 22988, - "total_submitted": 59443, - "total_column_articles": 278, + "total_acs": 23096, + "total_submitted": 59812, + "total_column_articles": 279, "frontend_question_id": "面试题 10.03", "is_new_question": false }, @@ -6942,8 +6942,8 @@ "question__title": "Coin LCCI", "question__title_slug": "coin-lcci", "question__hide": false, - "total_acs": 41071, - "total_submitted": 82587, + "total_acs": 41130, + "total_submitted": 82736, "total_column_articles": 369, "frontend_question_id": "面试题 08.11", "is_new_question": false @@ -6963,9 +6963,9 @@ "question__title": "Reverse Bits LCCI", "question__title_slug": "reverse-bits-lcci", "question__hide": false, - "total_acs": 18563, - "total_submitted": 48920, - "total_column_articles": 318, + "total_acs": 18665, + "total_submitted": 49313, + "total_column_articles": 319, "frontend_question_id": "面试题 05.03", "is_new_question": false }, @@ -6984,9 +6984,9 @@ "question__title": "Check SubTree LCCI", "question__title_slug": "check-subtree-lcci", "question__hide": false, - "total_acs": 24462, - "total_submitted": 34991, - "total_column_articles": 352, + "total_acs": 24550, + "total_submitted": 35168, + "total_column_articles": 355, "frontend_question_id": "面试题 04.10", "is_new_question": false }, @@ -7005,8 +7005,8 @@ "question__title": "Animal Shelter LCCI", "question__title_slug": "animal-shelter-lcci", "question__hide": false, - "total_acs": 16987, - "total_submitted": 29031, + "total_acs": 17054, + "total_submitted": 29175, "total_column_articles": 240, "frontend_question_id": "面试题 03.06", "is_new_question": false @@ -7026,8 +7026,8 @@ "question__title": "Binary Number to String LCCI", "question__title_slug": "bianry-number-to-string-lcci", "question__hide": false, - "total_acs": 11875, - "total_submitted": 16572, + "total_acs": 11918, + "total_submitted": 16627, "total_column_articles": 184, "frontend_question_id": "面试题 05.02", "is_new_question": false @@ -7047,9 +7047,9 @@ "question__title": "Pile Box LCCI", "question__title_slug": "pile-box-lcci", "question__hide": false, - "total_acs": 10618, - "total_submitted": 20853, - "total_column_articles": 124, + "total_acs": 10684, + "total_submitted": 20962, + "total_column_articles": 126, "frontend_question_id": "面试题 08.13", "is_new_question": false }, @@ -7068,8 +7068,8 @@ "question__title": "Color Fill LCCI", "question__title_slug": "color-fill-lcci", "question__hide": false, - "total_acs": 20339, - "total_submitted": 36365, + "total_acs": 20393, + "total_submitted": 36476, "total_column_articles": 314, "frontend_question_id": "面试题 08.10", "is_new_question": false @@ -7089,9 +7089,9 @@ "question__title": "Bracket LCCI", "question__title_slug": "bracket-lcci", "question__hide": false, - "total_acs": 30366, - "total_submitted": 37049, - "total_column_articles": 477, + "total_acs": 30457, + "total_submitted": 37156, + "total_column_articles": 478, "frontend_question_id": "面试题 08.09", "is_new_question": false }, @@ -7110,9 +7110,9 @@ "question__title": "Recursive Mulitply LCCI", "question__title_slug": "recursive-mulitply-lcci", "question__hide": false, - "total_acs": 38363, - "total_submitted": 57872, - "total_column_articles": 691, + "total_acs": 38525, + "total_submitted": 58130, + "total_column_articles": 694, "frontend_question_id": "面试题 08.05", "is_new_question": false }, @@ -7131,9 +7131,9 @@ "question__title": "Power Set LCCI", "question__title_slug": "power-set-lcci", "question__hide": false, - "total_acs": 28703, - "total_submitted": 35002, - "total_column_articles": 438, + "total_acs": 28798, + "total_submitted": 35124, + "total_column_articles": 439, "frontend_question_id": "面试题 08.04", "is_new_question": false }, @@ -7152,9 +7152,9 @@ "question__title": "Three Steps Problem LCCI", "question__title_slug": "three-steps-problem-lcci", "question__hide": false, - "total_acs": 57286, - "total_submitted": 155974, - "total_column_articles": 616, + "total_acs": 57481, + "total_submitted": 156495, + "total_column_articles": 620, "frontend_question_id": "面试题 08.01", "is_new_question": false }, @@ -7173,9 +7173,9 @@ "question__title": "Draw Line LCCI", "question__title_slug": "draw-line-lcci", "question__hide": false, - "total_acs": 5773, - "total_submitted": 10651, - "total_column_articles": 119, + "total_acs": 5802, + "total_submitted": 10713, + "total_column_articles": 120, "frontend_question_id": "面试题 05.08", "is_new_question": false }, @@ -7194,8 +7194,8 @@ "question__title": "Stack of Plates LCCI", "question__title_slug": "stack-of-plates-lcci", "question__hide": false, - "total_acs": 13941, - "total_submitted": 36095, + "total_acs": 14004, + "total_submitted": 36260, "total_column_articles": 199, "frontend_question_id": "面试题 03.03", "is_new_question": false @@ -7215,8 +7215,8 @@ "question__title": "Sum Lists LCCI", "question__title_slug": "sum-lists-lcci", "question__hide": false, - "total_acs": 56832, - "total_submitted": 120743, + "total_acs": 57022, + "total_submitted": 121192, "total_column_articles": 724, "frontend_question_id": "面试题 02.05", "is_new_question": false @@ -7236,9 +7236,9 @@ "question__title": "Delete Middle Node LCCI", "question__title_slug": "delete-middle-node-lcci", "question__hide": false, - "total_acs": 87886, - "total_submitted": 102176, - "total_column_articles": 818, + "total_acs": 88087, + "total_submitted": 102393, + "total_column_articles": 823, "frontend_question_id": "面试题 02.03", "is_new_question": false }, @@ -7257,9 +7257,9 @@ "question__title": "Zero Matrix LCCI", "question__title_slug": "zero-matrix-lcci", "question__hide": false, - "total_acs": 101870, - "total_submitted": 157181, - "total_column_articles": 949, + "total_acs": 102361, + "total_submitted": 158066, + "total_column_articles": 952, "frontend_question_id": "面试题 01.08", "is_new_question": false }, @@ -7278,9 +7278,9 @@ "question__title": "Rotate Matrix LCCI", "question__title_slug": "rotate-matrix-lcci", "question__hide": false, - "total_acs": 98830, - "total_submitted": 134007, - "total_column_articles": 1160, + "total_acs": 99413, + "total_submitted": 134831, + "total_column_articles": 1162, "frontend_question_id": "面试题 01.07", "is_new_question": false }, @@ -7299,9 +7299,9 @@ "question__title": "Palindrome Permutation LCCI", "question__title_slug": "palindrome-permutation-lcci", "question__hide": false, - "total_acs": 61070, - "total_submitted": 112853, - "total_column_articles": 1056, + "total_acs": 61282, + "total_submitted": 113272, + "total_column_articles": 1057, "frontend_question_id": "面试题 01.04", "is_new_question": false }, @@ -7320,8 +7320,8 @@ "question__title": "Closed Number LCCI", "question__title_slug": "closed-number-lcci", "question__hide": false, - "total_acs": 7970, - "total_submitted": 21987, + "total_acs": 7997, + "total_submitted": 22079, "total_column_articles": 183, "frontend_question_id": "面试题 05.04", "is_new_question": false @@ -7341,8 +7341,8 @@ "question__title": "Exchange LCCI", "question__title_slug": "exchange-lcci", "question__hide": false, - "total_acs": 16614, - "total_submitted": 23359, + "total_acs": 16670, + "total_submitted": 23441, "total_column_articles": 277, "frontend_question_id": "面试题 05.07", "is_new_question": false @@ -7362,8 +7362,8 @@ "question__title": "Convert Integer LCCI", "question__title_slug": "convert-integer-lcci", "question__hide": false, - "total_acs": 18191, - "total_submitted": 35123, + "total_acs": 18259, + "total_submitted": 35236, "total_column_articles": 313, "frontend_question_id": "面试题 05.06", "is_new_question": false @@ -7383,8 +7383,8 @@ "question__title": "Insert Into Bits LCCI", "question__title_slug": "insert-into-bits-lcci", "question__hide": false, - "total_acs": 14904, - "total_submitted": 28964, + "total_acs": 14956, + "total_submitted": 29059, "total_column_articles": 278, "frontend_question_id": "面试题 05.01", "is_new_question": false @@ -7404,8 +7404,8 @@ "question__title": "First Common Ancestor LCCI", "question__title_slug": "first-common-ancestor-lcci", "question__hide": false, - "total_acs": 25128, - "total_submitted": 35012, + "total_acs": 25220, + "total_submitted": 35131, "total_column_articles": 254, "frontend_question_id": "面试题 04.08", "is_new_question": false @@ -7425,9 +7425,9 @@ "question__title": "Successor LCCI", "question__title_slug": "successor-lcci", "question__hide": false, - "total_acs": 61817, - "total_submitted": 98774, - "total_column_articles": 648, + "total_acs": 61969, + "total_submitted": 99020, + "total_column_articles": 650, "frontend_question_id": "面试题 04.06", "is_new_question": false }, @@ -7446,8 +7446,8 @@ "question__title": "Legal Binary Search Tree LCCI", "question__title_slug": "legal-binary-search-tree-lcci", "question__hide": false, - "total_acs": 35738, - "total_submitted": 100698, + "total_acs": 35834, + "total_submitted": 100956, "total_column_articles": 421, "frontend_question_id": "面试题 04.05", "is_new_question": false @@ -7467,9 +7467,9 @@ "question__title": "Check Balance LCCI", "question__title_slug": "check-balance-lcci", "question__hide": false, - "total_acs": 42444, - "total_submitted": 71284, - "total_column_articles": 449, + "total_acs": 42544, + "total_submitted": 71434, + "total_column_articles": 450, "frontend_question_id": "面试题 04.04", "is_new_question": false }, @@ -7488,9 +7488,9 @@ "question__title": "List of Depth LCCI", "question__title_slug": "list-of-depth-lcci", "question__hide": false, - "total_acs": 32433, - "total_submitted": 40204, - "total_column_articles": 681, + "total_acs": 32510, + "total_submitted": 40289, + "total_column_articles": 682, "frontend_question_id": "面试题 04.03", "is_new_question": false }, @@ -7509,9 +7509,9 @@ "question__title": "Minimum Height Tree LCCI", "question__title_slug": "minimum-height-tree-lcci", "question__hide": false, - "total_acs": 44986, - "total_submitted": 57083, - "total_column_articles": 537, + "total_acs": 45087, + "total_submitted": 57209, + "total_column_articles": 539, "frontend_question_id": "面试题 04.02", "is_new_question": false }, @@ -7530,9 +7530,9 @@ "question__title": "Sort of Stacks LCCI", "question__title_slug": "sort-of-stacks-lcci", "question__hide": false, - "total_acs": 23956, - "total_submitted": 44355, - "total_column_articles": 322, + "total_acs": 24049, + "total_submitted": 44564, + "total_column_articles": 323, "frontend_question_id": "面试题 03.05", "is_new_question": false }, @@ -7551,8 +7551,8 @@ "question__title": "Three in One LCCI", "question__title_slug": "three-in-one-lcci", "question__hide": false, - "total_acs": 18147, - "total_submitted": 33979, + "total_acs": 18222, + "total_submitted": 34120, "total_column_articles": 265, "frontend_question_id": "面试题 03.01", "is_new_question": false @@ -7572,9 +7572,9 @@ "question__title": "Route Between Nodes LCCI", "question__title_slug": "route-between-nodes-lcci", "question__hide": false, - "total_acs": 27535, - "total_submitted": 51292, - "total_column_articles": 359, + "total_acs": 27638, + "total_submitted": 51500, + "total_column_articles": 362, "frontend_question_id": "面试题 04.01", "is_new_question": false }, @@ -7593,8 +7593,8 @@ "question__title": "Implement Queue using Stacks LCCI", "question__title_slug": "implement-queue-using-stacks-lcci", "question__hide": false, - "total_acs": 31521, - "total_submitted": 43922, + "total_acs": 31606, + "total_submitted": 44040, "total_column_articles": 426, "frontend_question_id": "面试题 03.04", "is_new_question": false @@ -7614,8 +7614,8 @@ "question__title": "Min Stack LCCI", "question__title_slug": "min-stack-lcci", "question__hide": false, - "total_acs": 35797, - "total_submitted": 57894, + "total_acs": 35908, + "total_submitted": 58074, "total_column_articles": 392, "frontend_question_id": "面试题 03.02", "is_new_question": false @@ -7635,9 +7635,9 @@ "question__title": "Linked List Cycle LCCI", "question__title_slug": "linked-list-cycle-lcci", "question__hide": false, - "total_acs": 38978, - "total_submitted": 71453, - "total_column_articles": 384, + "total_acs": 39083, + "total_submitted": 71626, + "total_column_articles": 385, "frontend_question_id": "面试题 02.08", "is_new_question": false }, @@ -7656,9 +7656,9 @@ "question__title": "Intersection of Two Linked Lists LCCI", "question__title_slug": "intersection-of-two-linked-lists-lcci", "question__hide": false, - "total_acs": 130429, - "total_submitted": 195158, - "total_column_articles": 913, + "total_acs": 131587, + "total_submitted": 196888, + "total_column_articles": 923, "frontend_question_id": "面试题 02.07", "is_new_question": false }, @@ -7677,9 +7677,9 @@ "question__title": "Palindrome Linked List LCCI", "question__title_slug": "palindrome-linked-list-lcci", "question__hide": false, - "total_acs": 56077, - "total_submitted": 115086, - "total_column_articles": 639, + "total_acs": 56262, + "total_submitted": 115516, + "total_column_articles": 642, "frontend_question_id": "面试题 02.06", "is_new_question": false }, @@ -7698,9 +7698,9 @@ "question__title": "Remove Duplicate Node LCCI", "question__title_slug": "remove-duplicate-node-lcci", "question__hide": false, - "total_acs": 84466, - "total_submitted": 125835, - "total_column_articles": 837, + "total_acs": 84672, + "total_submitted": 126182, + "total_column_articles": 839, "frontend_question_id": "面试题 02.01", "is_new_question": false }, @@ -7719,9 +7719,9 @@ "question__title": "String Rotation LCCI", "question__title_slug": "string-rotation-lcci", "question__hide": false, - "total_acs": 80655, - "total_submitted": 147807, - "total_column_articles": 815, + "total_acs": 80809, + "total_submitted": 148127, + "total_column_articles": 817, "frontend_question_id": "面试题 01.09", "is_new_question": false }, @@ -7740,9 +7740,9 @@ "question__title": "Compress String LCCI", "question__title_slug": "compress-string-lcci", "question__hide": false, - "total_acs": 98859, - "total_submitted": 212246, - "total_column_articles": 1390, + "total_acs": 99099, + "total_submitted": 212795, + "total_column_articles": 1391, "frontend_question_id": "面试题 01.06", "is_new_question": false }, @@ -7761,9 +7761,9 @@ "question__title": "String to URL LCCI", "question__title_slug": "string-to-url-lcci", "question__hide": false, - "total_acs": 67754, - "total_submitted": 117900, - "total_column_articles": 681, + "total_acs": 67998, + "total_submitted": 118301, + "total_column_articles": 686, "frontend_question_id": "面试题 01.03", "is_new_question": false }, @@ -7782,9 +7782,9 @@ "question__title": "Check Permutation LCCI", "question__title_slug": "check-permutation-lcci", "question__hide": false, - "total_acs": 118440, - "total_submitted": 178979, - "total_column_articles": 1790, + "total_acs": 118760, + "total_submitted": 179508, + "total_column_articles": 1793, "frontend_question_id": "面试题 01.02", "is_new_question": false }, @@ -7803,9 +7803,9 @@ "question__title": "Is Unique LCCI", "question__title_slug": "is-unique-lcci", "question__hide": false, - "total_acs": 136847, - "total_submitted": 192122, - "total_column_articles": 2035, + "total_acs": 137336, + "total_submitted": 192782, + "total_column_articles": 2045, "frontend_question_id": "面试题 01.01", "is_new_question": false }, @@ -7824,9 +7824,9 @@ "question__title": "Guess Numbers", "question__title_slug": "guess-numbers", "question__hide": false, - "total_acs": 93872, - "total_submitted": 110991, - "total_column_articles": 769, + "total_acs": 94068, + "total_submitted": 111203, + "total_column_articles": 770, "frontend_question_id": "LCP 01", "is_new_question": false }, @@ -7845,8 +7845,8 @@ "question__title": "Programmable Robot", "question__title_slug": "programmable-robot", "question__hide": false, - "total_acs": 14568, - "total_submitted": 63493, + "total_acs": 14631, + "total_submitted": 63741, "total_column_articles": 228, "frontend_question_id": "LCP 03", "is_new_question": false @@ -7866,8 +7866,8 @@ "question__title": "Coin Bonus", "question__title_slug": "coin-bonus", "question__hide": false, - "total_acs": 2768, - "total_submitted": 12617, + "total_acs": 2784, + "total_submitted": 12689, "total_column_articles": 65, "frontend_question_id": "LCP 05", "is_new_question": false @@ -7887,9 +7887,9 @@ "question__title": "Broken Board Dominoes", "question__title_slug": "broken-board-dominoes", "question__hide": false, - "total_acs": 3736, - "total_submitted": 9207, - "total_column_articles": 81, + "total_acs": 3753, + "total_submitted": 9243, + "total_column_articles": 82, "frontend_question_id": "LCP 04", "is_new_question": false }, @@ -7908,8 +7908,8 @@ "question__title": "Deep Dark Fraction", "question__title_slug": "deep-dark-fraction", "question__hide": false, - "total_acs": 18058, - "total_submitted": 25845, + "total_acs": 18134, + "total_submitted": 25954, "total_column_articles": 313, "frontend_question_id": "LCP 02", "is_new_question": false @@ -7929,11 +7929,11 @@ "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": 51, - "total_submitted": 59, - "total_column_articles": 3, + "total_acs": 60, + "total_submitted": 71, + "total_column_articles": 5, "frontend_question_id": "2450", - "is_new_question": true + "is_new_question": false }, "status": null, "difficulty": { @@ -7950,8 +7950,8 @@ "question__title": "Number of Nodes With Value One", "question__title_slug": "number-of-nodes-with-value-one", "question__hide": false, - "total_acs": 111, - "total_submitted": 127, + "total_acs": 119, + "total_submitted": 137, "total_column_articles": 7, "frontend_question_id": "2445", "is_new_question": false @@ -7971,8 +7971,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": 72, - "total_submitted": 102, + "total_acs": 74, + "total_submitted": 104, "total_column_articles": 5, "frontend_question_id": "2436", "is_new_question": false @@ -7992,8 +7992,8 @@ "question__title": "Maximize Total Tastiness of Purchased Fruits", "question__title_slug": "maximize-total-tastiness-of-purchased-fruits", "question__hide": false, - "total_acs": 84, - "total_submitted": 115, + "total_acs": 86, + "total_submitted": 122, "total_column_articles": 7, "frontend_question_id": "2431", "is_new_question": false @@ -8013,8 +8013,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": 111, - "total_submitted": 141, + "total_acs": 112, + "total_submitted": 142, "total_column_articles": 6, "frontend_question_id": "2422", "is_new_question": false @@ -8034,9 +8034,9 @@ "question__title": "Closest Fair Integer", "question__title_slug": "closest-fair-integer", "question__hide": false, - "total_acs": 75, - "total_submitted": 140, - "total_column_articles": 7, + "total_acs": 80, + "total_submitted": 150, + "total_column_articles": 8, "frontend_question_id": "2417", "is_new_question": false }, @@ -8070,15 +8070,99 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2554, + "question__title": "Minimum Total Distance Traveled", + "question__title_slug": "minimum-total-distance-traveled", + "question__hide": false, + "total_acs": 2460, + "total_submitted": 5614, + "total_column_articles": 42, + "frontend_question_id": "2463", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2553, + "question__title": "Total Cost to Hire K Workers", + "question__title_slug": "total-cost-to-hire-k-workers", + "question__hide": false, + "total_acs": 4267, + "total_submitted": 11910, + "total_column_articles": 95, + "frontend_question_id": "2462", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2552, + "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": 5646, + "total_submitted": 19847, + "total_column_articles": 109, + "frontend_question_id": "2461", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2551, + "question__title": "Apply Operations to an Array", + "question__title_slug": "apply-operations-to-an-array", + "question__hide": false, + "total_acs": 6748, + "total_submitted": 9809, + "total_column_articles": 57, + "frontend_question_id": "2460", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2550, "question__title": "Words Within Two Edits of Dictionary", "question__title_slug": "words-within-two-edits-of-dictionary", "question__hide": false, - "total_acs": 3285, - "total_submitted": 4993, - "total_column_articles": 27, + "total_acs": 3653, + "total_submitted": 5516, + "total_column_articles": 35, "frontend_question_id": "2452", "is_new_question": false }, @@ -8097,9 +8181,9 @@ "question__title": "Next Greater Element IV", "question__title_slug": "next-greater-element-iv", "question__hide": false, - "total_acs": 2353, - "total_submitted": 4960, - "total_column_articles": 53, + "total_acs": 2835, + "total_submitted": 5819, + "total_column_articles": 67, "frontend_question_id": "2454", "is_new_question": false }, @@ -8118,9 +8202,9 @@ "question__title": "Destroy Sequential Targets", "question__title_slug": "destroy-sequential-targets", "question__hide": false, - "total_acs": 2928, - "total_submitted": 8951, - "total_column_articles": 45, + "total_acs": 3320, + "total_submitted": 9869, + "total_column_articles": 54, "frontend_question_id": "2453", "is_new_question": false }, @@ -8139,9 +8223,9 @@ "question__title": "Odd String Difference", "question__title_slug": "odd-string-difference", "question__hide": false, - "total_acs": 3561, - "total_submitted": 6155, - "total_column_articles": 36, + "total_acs": 4036, + "total_submitted": 6870, + "total_column_articles": 46, "frontend_question_id": "2451", "is_new_question": false }, @@ -8160,9 +8244,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": 6118, - "total_submitted": 16269, - "total_column_articles": 55, + "total_acs": 6245, + "total_submitted": 16500, + "total_column_articles": 56, "frontend_question_id": "2447", "is_new_question": false }, @@ -8181,9 +8265,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": 2814, - "total_submitted": 7656, - "total_column_articles": 54, + "total_acs": 3550, + "total_submitted": 9031, + "total_column_articles": 69, "frontend_question_id": "2458", "is_new_question": false }, @@ -8202,9 +8286,9 @@ "question__title": "Minimum Addition to Make Integer Beautiful", "question__title_slug": "minimum-addition-to-make-integer-beautiful", "question__hide": false, - "total_acs": 5026, - "total_submitted": 13276, - "total_column_articles": 91, + "total_acs": 5786, + "total_submitted": 14913, + "total_column_articles": 109, "frontend_question_id": "2457", "is_new_question": false }, @@ -8223,9 +8307,9 @@ "question__title": "Most Popular Video Creator", "question__title_slug": "most-popular-video-creator", "question__hide": false, - "total_acs": 5499, - "total_submitted": 16716, - "total_column_articles": 85, + "total_acs": 7055, + "total_submitted": 18515, + "total_column_articles": 103, "frontend_question_id": "2456", "is_new_question": false }, @@ -8244,9 +8328,9 @@ "question__title": "Average Value of Even Numbers That Are Divisible by Three", "question__title_slug": "average-value-of-even-numbers-that-are-divisible-by-three", "question__hide": false, - "total_acs": 6855, - "total_submitted": 10898, - "total_column_articles": 35, + "total_acs": 7987, + "total_submitted": 12814, + "total_column_articles": 47, "frontend_question_id": "2455", "is_new_question": false }, @@ -8265,9 +8349,9 @@ "question__title": "Sum of Number and Its Reverse", "question__title_slug": "sum-of-number-and-its-reverse", "question__hide": false, - "total_acs": 8138, - "total_submitted": 17513, - "total_column_articles": 63, + "total_acs": 8267, + "total_submitted": 17780, + "total_column_articles": 64, "frontend_question_id": "2443", "is_new_question": false }, @@ -8286,9 +8370,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": 3195, - "total_submitted": 4915, - "total_column_articles": 37, + "total_acs": 3294, + "total_submitted": 5052, + "total_column_articles": 38, "frontend_question_id": "2449", "is_new_question": false }, @@ -8307,9 +8391,9 @@ "question__title": "Minimum Cost to Make Array Equal", "question__title_slug": "minimum-cost-to-make-array-equal", "question__hide": false, - "total_acs": 4463, - "total_submitted": 12926, - "total_column_articles": 67, + "total_acs": 4573, + "total_submitted": 13205, + "total_column_articles": 71, "frontend_question_id": "2448", "is_new_question": false }, @@ -8328,8 +8412,8 @@ "question__title": "Minimum Time to Kill All Monsters", "question__title_slug": "minimum-time-to-kill-all-monsters", "question__hide": false, - "total_acs": 155, - "total_submitted": 201, + "total_acs": 161, + "total_submitted": 209, "total_column_articles": 9, "frontend_question_id": "2403", "is_new_question": false @@ -8349,9 +8433,9 @@ "question__title": "Determine if Two Events Have Conflict", "question__title_slug": "determine-if-two-events-have-conflict", "question__hide": false, - "total_acs": 8189, - "total_submitted": 14485, - "total_column_articles": 63, + "total_acs": 8424, + "total_submitted": 14874, + "total_column_articles": 65, "frontend_question_id": "2446", "is_new_question": false }, @@ -8370,8 +8454,8 @@ "question__title": "Count Strictly Increasing Subarrays", "question__title_slug": "count-strictly-increasing-subarrays", "question__hide": false, - "total_acs": 133, - "total_submitted": 161, + "total_acs": 144, + "total_submitted": 177, "total_column_articles": 5, "frontend_question_id": "2393", "is_new_question": false @@ -8391,9 +8475,9 @@ "question__title": "Employees With Deductions", "question__title_slug": "employees-with-deductions", "question__hide": false, - "total_acs": 200, - "total_submitted": 371, - "total_column_articles": 5, + "total_acs": 214, + "total_submitted": 404, + "total_column_articles": 6, "frontend_question_id": "2394", "is_new_question": false }, @@ -8412,8 +8496,8 @@ "question__title": "Bitwise XOR of All Pairings", "question__title_slug": "bitwise-xor-of-all-pairings", "question__hide": false, - "total_acs": 3844, - "total_submitted": 5986, + "total_acs": 3931, + "total_submitted": 6115, "total_column_articles": 58, "frontend_question_id": "2425", "is_new_question": false @@ -8433,9 +8517,9 @@ "question__title": "Remove Letter To Equalize Frequency", "question__title_slug": "remove-letter-to-equalize-frequency", "question__hide": false, - "total_acs": 4769, - "total_submitted": 25382, - "total_column_articles": 90, + "total_acs": 5023, + "total_submitted": 26548, + "total_column_articles": 94, "frontend_question_id": "2423", "is_new_question": false }, @@ -8454,8 +8538,8 @@ "question__title": "Create Components With Same Value", "question__title_slug": "create-components-with-same-value", "question__hide": false, - "total_acs": 1795, - "total_submitted": 2944, + "total_acs": 1831, + "total_submitted": 3005, "total_column_articles": 26, "frontend_question_id": "2440", "is_new_question": false @@ -8475,9 +8559,9 @@ "question__title": "Minimize Maximum of Array", "question__title_slug": "minimize-maximum-of-array", "question__hide": false, - "total_acs": 3764, - "total_submitted": 10676, - "total_column_articles": 80, + "total_acs": 3852, + "total_submitted": 10882, + "total_column_articles": 81, "frontend_question_id": "2439", "is_new_question": false }, @@ -8496,9 +8580,9 @@ "question__title": "Range Product Queries of Powers", "question__title_slug": "range-product-queries-of-powers", "question__hide": false, - "total_acs": 4031, - "total_submitted": 10092, - "total_column_articles": 73, + "total_acs": 4113, + "total_submitted": 10233, + "total_column_articles": 75, "frontend_question_id": "2438", "is_new_question": false }, @@ -8517,9 +8601,9 @@ "question__title": "Number of Valid Clock Times", "question__title_slug": "number-of-valid-clock-times", "question__hide": false, - "total_acs": 4690, - "total_submitted": 10842, - "total_column_articles": 57, + "total_acs": 4825, + "total_submitted": 11127, + "total_column_articles": 58, "frontend_question_id": "2437", "is_new_question": false }, @@ -8538,9 +8622,9 @@ "question__title": "Count Subarrays With Fixed Bounds", "question__title_slug": "count-subarrays-with-fixed-bounds", "question__hide": false, - "total_acs": 5335, - "total_submitted": 12961, - "total_column_articles": 83, + "total_acs": 5428, + "total_submitted": 13140, + "total_column_articles": 84, "frontend_question_id": "2444", "is_new_question": false }, @@ -8559,8 +8643,8 @@ "question__title": "Longest Increasing Subsequence II", "question__title_slug": "longest-increasing-subsequence-ii", "question__hide": false, - "total_acs": 4001, - "total_submitted": 14345, + "total_acs": 4049, + "total_submitted": 14439, "total_column_articles": 71, "frontend_question_id": "2407", "is_new_question": false @@ -8580,9 +8664,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": 8503, - "total_submitted": 11377, - "total_column_articles": 69, + "total_acs": 8679, + "total_submitted": 11609, + "total_column_articles": 72, "frontend_question_id": "2442", "is_new_question": false }, @@ -8601,9 +8685,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": 9412, - "total_submitted": 13391, - "total_column_articles": 88, + "total_acs": 9650, + "total_submitted": 13754, + "total_column_articles": 91, "frontend_question_id": "2441", "is_new_question": false }, @@ -8622,8 +8706,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": 208, - "total_submitted": 291, + "total_acs": 212, + "total_submitted": 296, "total_column_articles": 6, "frontend_question_id": "2388", "is_new_question": false @@ -8643,8 +8727,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": 107, - "total_submitted": 129, + "total_acs": 110, + "total_submitted": 133, "total_column_articles": 2, "frontend_question_id": "2387", "is_new_question": false @@ -8664,8 +8748,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": 5080, - "total_submitted": 10112, + "total_acs": 5135, + "total_submitted": 10206, "total_column_articles": 86, "frontend_question_id": "2435", "is_new_question": false @@ -8685,9 +8769,9 @@ "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": 5676, - "total_submitted": 13845, - "total_column_articles": 105, + "total_acs": 5764, + "total_submitted": 14056, + "total_column_articles": 106, "frontend_question_id": "2434", "is_new_question": false }, @@ -8706,8 +8790,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": 6688, - "total_submitted": 7882, + "total_acs": 6776, + "total_submitted": 7989, "total_column_articles": 75, "frontend_question_id": "2433", "is_new_question": false @@ -8727,9 +8811,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": 7319, - "total_submitted": 15160, - "total_column_articles": 76, + "total_acs": 7419, + "total_submitted": 15368, + "total_column_articles": 77, "frontend_question_id": "2432", "is_new_question": false }, @@ -8748,8 +8832,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": 102, - "total_submitted": 153, + "total_acs": 109, + "total_submitted": 162, "total_column_articles": 8, "frontend_question_id": "2378", "is_new_question": false @@ -8769,9 +8853,9 @@ "question__title": "Sort the Olympic Table", "question__title_slug": "sort-the-olympic-table", "question__hide": false, - "total_acs": 261, - "total_submitted": 330, - "total_column_articles": 5, + "total_acs": 278, + "total_submitted": 355, + "total_column_articles": 6, "frontend_question_id": "2377", "is_new_question": false }, @@ -8790,8 +8874,8 @@ "question__title": "Calculate the Influence of Each Salesperson", "question__title_slug": "calculate-the-influence-of-each-salesperson", "question__hide": false, - "total_acs": 295, - "total_submitted": 390, + "total_acs": 307, + "total_submitted": 403, "total_column_articles": 3, "frontend_question_id": "2372", "is_new_question": false @@ -8811,9 +8895,9 @@ "question__title": "Number of Pairs Satisfying Inequality", "question__title_slug": "number-of-pairs-satisfying-inequality", "question__hide": false, - "total_acs": 3198, - "total_submitted": 7118, - "total_column_articles": 68, + "total_acs": 3278, + "total_submitted": 7258, + "total_column_articles": 69, "frontend_question_id": "2426", "is_new_question": false }, @@ -8832,9 +8916,9 @@ "question__title": "Longest Uploaded Prefix", "question__title_slug": "longest-uploaded-prefix", "question__hide": false, - "total_acs": 4527, - "total_submitted": 8208, - "total_column_articles": 61, + "total_acs": 4600, + "total_submitted": 8332, + "total_column_articles": 63, "frontend_question_id": "2424", "is_new_question": false }, @@ -8853,9 +8937,9 @@ "question__title": "Maximum Deletions on a String", "question__title_slug": "maximum-deletions-on-a-string", "question__hide": false, - "total_acs": 5979, - "total_submitted": 12674, - "total_column_articles": 100, + "total_acs": 6051, + "total_submitted": 12807, + "total_column_articles": 99, "frontend_question_id": "2430", "is_new_question": false }, @@ -8874,9 +8958,9 @@ "question__title": "Minimize XOR", "question__title_slug": "minimize-xor", "question__hide": false, - "total_acs": 6501, - "total_submitted": 15036, - "total_column_articles": 100, + "total_acs": 6557, + "total_submitted": 15168, + "total_column_articles": 102, "frontend_question_id": "2429", "is_new_question": false }, @@ -8895,9 +8979,9 @@ "question__title": "Maximum Sum of an Hourglass", "question__title_slug": "maximum-sum-of-an-hourglass", "question__hide": false, - "total_acs": 7072, - "total_submitted": 9401, - "total_column_articles": 82, + "total_acs": 7155, + "total_submitted": 9506, + "total_column_articles": 83, "frontend_question_id": "2428", "is_new_question": false }, @@ -8916,9 +9000,9 @@ "question__title": "Number of Common Factors", "question__title_slug": "number-of-common-factors", "question__hide": false, - "total_acs": 8365, - "total_submitted": 10223, - "total_column_articles": 72, + "total_acs": 8515, + "total_submitted": 10393, + "total_column_articles": 74, "frontend_question_id": "2427", "is_new_question": false }, @@ -8937,8 +9021,8 @@ "question__title": "Minimize Maximum Value in a Grid", "question__title_slug": "minimize-maximum-value-in-a-grid", "question__hide": false, - "total_acs": 144, - "total_submitted": 181, + "total_acs": 145, + "total_submitted": 183, "total_column_articles": 8, "frontend_question_id": "2371", "is_new_question": false @@ -8958,9 +9042,9 @@ "question__title": "Number of Good Paths", "question__title_slug": "number-of-good-paths", "question__hide": false, - "total_acs": 3277, - "total_submitted": 8128, - "total_column_articles": 46, + "total_acs": 3318, + "total_submitted": 8200, + "total_column_articles": 47, "frontend_question_id": "2421", "is_new_question": false }, @@ -8979,8 +9063,8 @@ "question__title": "Find All Good Indices", "question__title_slug": "find-all-good-indices", "question__hide": false, - "total_acs": 6538, - "total_submitted": 22005, + "total_acs": 6584, + "total_submitted": 22102, "total_column_articles": 127, "frontend_question_id": "2420", "is_new_question": false @@ -9000,9 +9084,9 @@ "question__title": "Longest Subarray With Maximum Bitwise AND", "question__title_slug": "longest-subarray-with-maximum-bitwise-and", "question__hide": false, - "total_acs": 7310, - "total_submitted": 17714, - "total_column_articles": 87, + "total_acs": 7382, + "total_submitted": 17868, + "total_column_articles": 88, "frontend_question_id": "2419", "is_new_question": false }, @@ -9021,9 +9105,9 @@ "question__title": "Sort the People", "question__title_slug": "sort-the-people", "question__hide": false, - "total_acs": 9739, - "total_submitted": 12353, - "total_column_articles": 112, + "total_acs": 9945, + "total_submitted": 12622, + "total_column_articles": 114, "frontend_question_id": "2418", "is_new_question": false }, @@ -9042,8 +9126,8 @@ "question__title": "Generate the Invoice", "question__title_slug": "generate-the-invoice", "question__hide": false, - "total_acs": 188, - "total_submitted": 254, + "total_acs": 192, + "total_submitted": 262, "total_column_articles": 7, "frontend_question_id": "2362", "is_new_question": false @@ -9063,8 +9147,8 @@ "question__title": "Minimum Costs Using the Train Line", "question__title_slug": "minimum-costs-using-the-train-line", "question__hide": false, - "total_acs": 206, - "total_submitted": 251, + "total_acs": 217, + "total_submitted": 263, "total_column_articles": 12, "frontend_question_id": "2361", "is_new_question": false @@ -9084,8 +9168,8 @@ "question__title": "Minimum Money Required Before Transactions", "question__title_slug": "minimum-money-required-before-transactions", "question__hide": false, - "total_acs": 2881, - "total_submitted": 6091, + "total_acs": 2915, + "total_submitted": 6138, "total_column_articles": 58, "frontend_question_id": "2412", "is_new_question": false @@ -9105,9 +9189,9 @@ "question__title": "Smallest Subarrays With Maximum Bitwise OR", "question__title_slug": "smallest-subarrays-with-maximum-bitwise-or", "question__hide": false, - "total_acs": 3819, - "total_submitted": 9417, - "total_column_articles": 53, + "total_acs": 3854, + "total_submitted": 9471, + "total_column_articles": 54, "frontend_question_id": "2411", "is_new_question": false }, @@ -9126,8 +9210,8 @@ "question__title": "Maximum Matching of Players With Trainers", "question__title_slug": "maximum-matching-of-players-with-trainers", "question__hide": false, - "total_acs": 5614, - "total_submitted": 8655, + "total_acs": 5656, + "total_submitted": 8714, "total_column_articles": 64, "frontend_question_id": "2410", "is_new_question": false @@ -9147,9 +9231,9 @@ "question__title": "Count Days Spent Together", "question__title_slug": "count-days-spent-together", "question__hide": false, - "total_acs": 5002, - "total_submitted": 10482, - "total_column_articles": 80, + "total_acs": 5062, + "total_submitted": 10598, + "total_column_articles": 81, "frontend_question_id": "2409", "is_new_question": false }, @@ -9168,8 +9252,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": 408, - "total_submitted": 458, + "total_acs": 422, + "total_submitted": 473, "total_column_articles": 6, "frontend_question_id": "2356", "is_new_question": false @@ -9189,8 +9273,8 @@ "question__title": "Sum of Prefix Scores of Strings", "question__title_slug": "sum-of-prefix-scores-of-strings", "question__hide": false, - "total_acs": 7967, - "total_submitted": 20029, + "total_acs": 8060, + "total_submitted": 20186, "total_column_articles": 112, "frontend_question_id": "2416", "is_new_question": false @@ -9210,8 +9294,8 @@ "question__title": "Reverse Odd Levels of Binary Tree", "question__title_slug": "reverse-odd-levels-of-binary-tree", "question__hide": false, - "total_acs": 8894, - "total_submitted": 12728, + "total_acs": 8968, + "total_submitted": 12818, "total_column_articles": 114, "frontend_question_id": "2415", "is_new_question": false @@ -9231,8 +9315,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": 10429, - "total_submitted": 17267, + "total_acs": 10491, + "total_submitted": 17365, "total_column_articles": 106, "frontend_question_id": "2414", "is_new_question": false @@ -9252,9 +9336,9 @@ "question__title": "Smallest Even Multiple", "question__title_slug": "smallest-even-multiple", "question__hide": false, - "total_acs": 13679, - "total_submitted": 15614, - "total_column_articles": 102, + "total_acs": 14030, + "total_submitted": 16031, + "total_column_articles": 104, "frontend_question_id": "2413", "is_new_question": false }, @@ -9273,8 +9357,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": 210, - "total_submitted": 327, + "total_acs": 219, + "total_submitted": 343, "total_column_articles": 8, "frontend_question_id": "2355", "is_new_question": false @@ -9294,11 +9378,11 @@ "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": 10, - "total_submitted": 21, - "total_column_articles": 1, + "total_acs": 34, + "total_submitted": 52, + "total_column_articles": 3, "frontend_question_id": "2459", - "is_new_question": true + "is_new_question": false }, "status": null, "difficulty": { @@ -9315,8 +9399,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": 7499, - "total_submitted": 17285, + "total_acs": 7556, + "total_submitted": 17372, "total_column_articles": 114, "frontend_question_id": "2406", "is_new_question": false @@ -9336,8 +9420,8 @@ "question__title": "Optimal Partition of String", "question__title_slug": "optimal-partition-of-string", "question__hide": false, - "total_acs": 8790, - "total_submitted": 11859, + "total_acs": 8837, + "total_submitted": 11916, "total_column_articles": 110, "frontend_question_id": "2405", "is_new_question": false @@ -9357,9 +9441,9 @@ "question__title": "Most Frequent Even Element", "question__title_slug": "most-frequent-even-element", "question__hide": false, - "total_acs": 9255, - "total_submitted": 16915, - "total_column_articles": 113, + "total_acs": 9328, + "total_submitted": 17050, + "total_column_articles": 115, "frontend_question_id": "2404", "is_new_question": false }, @@ -9399,8 +9483,8 @@ "question__title": "Compute the Rank as a Percentage", "question__title_slug": "compute-the-rank-as-a-percentage", "question__hide": false, - "total_acs": 299, - "total_submitted": 769, + "total_acs": 314, + "total_submitted": 814, "total_column_articles": 6, "frontend_question_id": "2346", "is_new_question": false @@ -9420,8 +9504,8 @@ "question__title": "Task Scheduler II", "question__title_slug": "task-scheduler-ii", "question__hide": false, - "total_acs": 5399, - "total_submitted": 11312, + "total_acs": 5438, + "total_submitted": 11373, "total_column_articles": 68, "frontend_question_id": "2365", "is_new_question": false @@ -9441,8 +9525,8 @@ "question__title": "Maximum Rows Covered by Columns", "question__title_slug": "maximum-rows-covered-by-columns", "question__hide": false, - "total_acs": 4522, - "total_submitted": 8746, + "total_acs": 4553, + "total_submitted": 8789, "total_column_articles": 80, "frontend_question_id": "2397", "is_new_question": false @@ -9462,8 +9546,8 @@ "question__title": "Strictly Palindromic Number", "question__title_slug": "strictly-palindromic-number", "question__hide": false, - "total_acs": 7204, - "total_submitted": 8168, + "total_acs": 7325, + "total_submitted": 8299, "total_column_articles": 68, "frontend_question_id": "2396", "is_new_question": false @@ -9483,8 +9567,8 @@ "question__title": "Find Subarrays With Equal Sum", "question__title_slug": "find-subarrays-with-equal-sum", "question__hide": false, - "total_acs": 6263, - "total_submitted": 8747, + "total_acs": 6351, + "total_submitted": 8875, "total_column_articles": 61, "frontend_question_id": "2395", "is_new_question": false @@ -9504,8 +9588,8 @@ "question__title": "Meeting Rooms III", "question__title_slug": "meeting-rooms-iii", "question__hide": false, - "total_acs": 5230, - "total_submitted": 16307, + "total_acs": 5276, + "total_submitted": 16495, "total_column_articles": 110, "frontend_question_id": "2402", "is_new_question": false @@ -9525,8 +9609,8 @@ "question__title": "Longest Nice Subarray", "question__title_slug": "longest-nice-subarray", "question__hide": false, - "total_acs": 8481, - "total_submitted": 17691, + "total_acs": 8556, + "total_submitted": 17810, "total_column_articles": 147, "frontend_question_id": "2401", "is_new_question": false @@ -9546,9 +9630,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": 9379, - "total_submitted": 29819, - "total_column_articles": 133, + "total_acs": 9450, + "total_submitted": 29996, + "total_column_articles": 135, "frontend_question_id": "2400", "is_new_question": false }, @@ -9567,8 +9651,8 @@ "question__title": "Check Distances Between Same Letters", "question__title_slug": "check-distances-between-same-letters", "question__hide": false, - "total_acs": 11360, - "total_submitted": 15686, + "total_acs": 11427, + "total_submitted": 15783, "total_column_articles": 132, "frontend_question_id": "2399", "is_new_question": false @@ -9588,9 +9672,9 @@ "question__title": "Largest Palindromic Number", "question__title_slug": "largest-palindromic-number", "question__hide": false, - "total_acs": 8658, - "total_submitted": 28181, - "total_column_articles": 137, + "total_acs": 8721, + "total_submitted": 28376, + "total_column_articles": 139, "frontend_question_id": "2384", "is_new_question": false }, @@ -9609,8 +9693,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": 162, - "total_submitted": 223, + "total_acs": 171, + "total_submitted": 232, "total_column_articles": 7, "frontend_question_id": "2340", "is_new_question": false @@ -9630,8 +9714,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": 10152, - "total_submitted": 19161, + "total_acs": 10183, + "total_submitted": 19212, "total_column_articles": 130, "frontend_question_id": "2342", "is_new_question": false @@ -9651,8 +9735,8 @@ "question__title": "Build a Matrix With Conditions", "question__title_slug": "build-a-matrix-with-conditions", "question__hide": false, - "total_acs": 4975, - "total_submitted": 9125, + "total_acs": 4986, + "total_submitted": 9145, "total_column_articles": 91, "frontend_question_id": "2392", "is_new_question": false @@ -9672,9 +9756,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": 8371, - "total_submitted": 9646, - "total_column_articles": 126, + "total_acs": 8449, + "total_submitted": 9745, + "total_column_articles": 129, "frontend_question_id": "2391", "is_new_question": false }, @@ -9693,9 +9777,9 @@ "question__title": "Removing Stars From a String", "question__title_slug": "removing-stars-from-a-string", "question__hide": false, - "total_acs": 9174, - "total_submitted": 13973, - "total_column_articles": 118, + "total_acs": 9274, + "total_submitted": 14108, + "total_column_articles": 120, "frontend_question_id": "2390", "is_new_question": false }, @@ -9714,9 +9798,9 @@ "question__title": "Longest Subsequence With Limited Sum", "question__title_slug": "longest-subsequence-with-limited-sum", "question__hide": false, - "total_acs": 9354, - "total_submitted": 14086, - "total_column_articles": 106, + "total_acs": 9451, + "total_submitted": 14221, + "total_column_articles": 108, "frontend_question_id": "2389", "is_new_question": false }, @@ -9735,8 +9819,8 @@ "question__title": "Valid Palindrome IV", "question__title_slug": "valid-palindrome-iv", "question__hide": false, - "total_acs": 216, - "total_submitted": 255, + "total_acs": 223, + "total_submitted": 266, "total_column_articles": 12, "frontend_question_id": "2330", "is_new_question": false @@ -9756,9 +9840,9 @@ "question__title": "Maximum Segment Sum After Removals", "question__title_slug": "maximum-segment-sum-after-removals", "question__hide": false, - "total_acs": 3262, - "total_submitted": 5924, - "total_column_articles": 80, + "total_acs": 3287, + "total_submitted": 5974, + "total_column_articles": 81, "frontend_question_id": "2382", "is_new_question": false }, @@ -9777,8 +9861,8 @@ "question__title": "Shifting Letters II", "question__title_slug": "shifting-letters-ii", "question__hide": false, - "total_acs": 4624, - "total_submitted": 12989, + "total_acs": 4672, + "total_submitted": 13113, "total_column_articles": 84, "frontend_question_id": "2381", "is_new_question": false @@ -9798,8 +9882,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": 5405, - "total_submitted": 9715, + "total_acs": 5462, + "total_submitted": 9816, "total_column_articles": 60, "frontend_question_id": "2380", "is_new_question": false @@ -9819,9 +9903,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": 6225, - "total_submitted": 10581, - "total_column_articles": 90, + "total_acs": 6328, + "total_submitted": 10754, + "total_column_articles": 91, "frontend_question_id": "2379", "is_new_question": false }, @@ -9840,8 +9924,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": 3244, - "total_submitted": 7929, + "total_acs": 3272, + "total_submitted": 7972, "total_column_articles": 48, "frontend_question_id": "2386", "is_new_question": false @@ -9861,9 +9945,9 @@ "question__title": "Amount of Time for Binary Tree to Be Infected", "question__title_slug": "amount-of-time-for-binary-tree-to-be-infected", "question__hide": false, - "total_acs": 7261, - "total_submitted": 15789, - "total_column_articles": 136, + "total_acs": 7327, + "total_submitted": 15971, + "total_column_articles": 138, "frontend_question_id": "2385", "is_new_question": false }, @@ -9882,9 +9966,9 @@ "question__title": "Minimum Hours of Training to Win a Competition", "question__title_slug": "minimum-hours-of-training-to-win-a-competition", "question__hide": false, - "total_acs": 9480, - "total_submitted": 22904, - "total_column_articles": 129, + "total_acs": 9578, + "total_submitted": 23112, + "total_column_articles": 134, "frontend_question_id": "2383", "is_new_question": false }, @@ -9903,8 +9987,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": 168, - "total_submitted": 240, + "total_acs": 172, + "total_submitted": 245, "total_column_articles": 9, "frontend_question_id": "2323", "is_new_question": false @@ -9924,9 +10008,9 @@ "question__title": "Count Special Integers", "question__title_slug": "count-special-integers", "question__hide": false, - "total_acs": 6633, - "total_submitted": 13491, - "total_column_articles": 105, + "total_acs": 6667, + "total_submitted": 13543, + "total_column_articles": 106, "frontend_question_id": "2376", "is_new_question": false }, @@ -9945,9 +10029,9 @@ "question__title": "Construct Smallest Number From DI String", "question__title_slug": "construct-smallest-number-from-di-string", "question__hide": false, - "total_acs": 8802, - "total_submitted": 12668, - "total_column_articles": 197, + "total_acs": 8842, + "total_submitted": 12726, + "total_column_articles": 198, "frontend_question_id": "2375", "is_new_question": false }, @@ -9966,8 +10050,8 @@ "question__title": "Node With Highest Edge Score", "question__title_slug": "node-with-highest-edge-score", "question__hide": false, - "total_acs": 8914, - "total_submitted": 21359, + "total_acs": 8970, + "total_submitted": 21466, "total_column_articles": 97, "frontend_question_id": "2374", "is_new_question": false @@ -9987,8 +10071,8 @@ "question__title": "Largest Local Values in a Matrix", "question__title_slug": "largest-local-values-in-a-matrix", "question__hide": false, - "total_acs": 10158, - "total_submitted": 11980, + "total_acs": 10243, + "total_submitted": 12081, "total_column_articles": 96, "frontend_question_id": "2373", "is_new_question": false @@ -10008,8 +10092,8 @@ "question__title": "All the Matches of the League", "question__title_slug": "all-the-matches-of-the-league", "question__hide": false, - "total_acs": 443, - "total_submitted": 600, + "total_acs": 459, + "total_submitted": 620, "total_column_articles": 11, "frontend_question_id": "2339", "is_new_question": false @@ -10029,8 +10113,8 @@ "question__title": "Product Sales Analysis V", "question__title_slug": "product-sales-analysis-v", "question__hide": false, - "total_acs": 527, - "total_submitted": 732, + "total_acs": 549, + "total_submitted": 765, "total_column_articles": 7, "frontend_question_id": "2329", "is_new_question": false @@ -10050,8 +10134,8 @@ "question__title": "Product Sales Analysis IV", "question__title_slug": "product-sales-analysis-iv", "question__hide": false, - "total_acs": 373, - "total_submitted": 512, + "total_acs": 381, + "total_submitted": 520, "total_column_articles": 5, "frontend_question_id": "2324", "is_new_question": false @@ -10071,8 +10155,8 @@ "question__title": "Minimum Replacements to Sort the Array", "question__title_slug": "minimum-replacements-to-sort-the-array", "question__hide": false, - "total_acs": 3672, - "total_submitted": 8817, + "total_acs": 3684, + "total_submitted": 8841, "total_column_articles": 46, "frontend_question_id": "2366", "is_new_question": false @@ -10092,8 +10176,8 @@ "question__title": "Maximum Number of Robots Within Budget", "question__title_slug": "maximum-number-of-robots-within-budget", "question__hide": false, - "total_acs": 3523, - "total_submitted": 10715, + "total_acs": 3556, + "total_submitted": 10793, "total_column_articles": 75, "frontend_question_id": "2398", "is_new_question": false @@ -10113,9 +10197,9 @@ "question__title": "Count Number of Bad Pairs", "question__title_slug": "count-number-of-bad-pairs", "question__hide": false, - "total_acs": 5372, - "total_submitted": 13033, - "total_column_articles": 80, + "total_acs": 5409, + "total_submitted": 13108, + "total_column_articles": 81, "frontend_question_id": "2364", "is_new_question": false }, @@ -10134,9 +10218,9 @@ "question__title": "Merge Similar Items", "question__title_slug": "merge-similar-items", "question__hide": false, - "total_acs": 6928, - "total_submitted": 9045, - "total_column_articles": 79, + "total_acs": 7013, + "total_submitted": 9175, + "total_column_articles": 81, "frontend_question_id": "2363", "is_new_question": false }, @@ -10155,8 +10239,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": 373, - "total_submitted": 525, + "total_acs": 381, + "total_submitted": 543, "total_column_articles": 7, "frontend_question_id": "2314", "is_new_question": false @@ -10176,9 +10260,9 @@ "question__title": "Reachable Nodes With Restrictions", "question__title_slug": "reachable-nodes-with-restrictions", "question__hide": false, - "total_acs": 8889, - "total_submitted": 19658, - "total_column_articles": 129, + "total_acs": 8919, + "total_submitted": 19699, + "total_column_articles": 130, "frontend_question_id": "2368", "is_new_question": false }, @@ -10197,8 +10281,8 @@ "question__title": "Longest Ideal Subsequence", "question__title_slug": "longest-ideal-subsequence", "question__hide": false, - "total_acs": 7219, - "total_submitted": 17154, + "total_acs": 7257, + "total_submitted": 17216, "total_column_articles": 104, "frontend_question_id": "2370", "is_new_question": false @@ -10218,8 +10302,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": 7593, - "total_submitted": 20519, + "total_acs": 7632, + "total_submitted": 20620, "total_column_articles": 106, "frontend_question_id": "2369", "is_new_question": false @@ -10239,8 +10323,8 @@ "question__title": "Number of Arithmetic Triplets", "question__title_slug": "number-of-arithmetic-triplets", "question__hide": false, - "total_acs": 12905, - "total_submitted": 15333, + "total_acs": 12991, + "total_submitted": 15437, "total_column_articles": 138, "frontend_question_id": "2367", "is_new_question": false @@ -10260,8 +10344,8 @@ "question__title": "Arrange Table by Gender", "question__title_slug": "arrange-table-by-gender", "question__hide": false, - "total_acs": 402, - "total_submitted": 503, + "total_acs": 415, + "total_submitted": 518, "total_column_articles": 8, "frontend_question_id": "2308", "is_new_question": false @@ -10281,8 +10365,8 @@ "question__title": "Tasks Count in the Weekend", "question__title_slug": "tasks-count-in-the-weekend", "question__hide": false, - "total_acs": 434, - "total_submitted": 521, + "total_acs": 441, + "total_submitted": 529, "total_column_articles": 7, "frontend_question_id": "2298", "is_new_question": false @@ -10302,8 +10386,8 @@ "question__title": "Longest Cycle in a Graph", "question__title_slug": "longest-cycle-in-a-graph", "question__hide": false, - "total_acs": 7034, - "total_submitted": 18888, + "total_acs": 7051, + "total_submitted": 18927, "total_column_articles": 131, "frontend_question_id": "2360", "is_new_question": false @@ -10323,9 +10407,9 @@ "question__title": "Find Closest Node to Given Two Nodes", "question__title_slug": "find-closest-node-to-given-two-nodes", "question__hide": false, - "total_acs": 7126, - "total_submitted": 24307, - "total_column_articles": 99, + "total_acs": 7143, + "total_submitted": 24341, + "total_column_articles": 102, "frontend_question_id": "2359", "is_new_question": false }, @@ -10344,9 +10428,9 @@ "question__title": "Maximum Number of Groups Entering a Competition", "question__title_slug": "maximum-number-of-groups-entering-a-competition", "question__hide": false, - "total_acs": 9468, - "total_submitted": 14783, - "total_column_articles": 153, + "total_acs": 9495, + "total_submitted": 14813, + "total_column_articles": 154, "frontend_question_id": "2358", "is_new_question": false }, @@ -10365,8 +10449,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": 12510, - "total_submitted": 16867, + "total_acs": 12624, + "total_submitted": 17017, "total_column_articles": 144, "frontend_question_id": "2357", "is_new_question": false @@ -10386,8 +10470,8 @@ "question__title": "Shortest Impossible Sequence of Rolls", "question__title_slug": "shortest-impossible-sequence-of-rolls", "question__hide": false, - "total_acs": 3602, - "total_submitted": 5680, + "total_acs": 3610, + "total_submitted": 5692, "total_column_articles": 69, "frontend_question_id": "2350", "is_new_question": false @@ -10407,8 +10491,8 @@ "question__title": "Design a Number Container System", "question__title_slug": "design-a-number-container-system", "question__hide": false, - "total_acs": 5271, - "total_submitted": 14336, + "total_acs": 5305, + "total_submitted": 14443, "total_column_articles": 83, "frontend_question_id": "2349", "is_new_question": false @@ -10428,8 +10512,8 @@ "question__title": "Best Poker Hand", "question__title_slug": "best-poker-hand", "question__hide": false, - "total_acs": 6559, - "total_submitted": 12109, + "total_acs": 6616, + "total_submitted": 12198, "total_column_articles": 74, "frontend_question_id": "2347", "is_new_question": false @@ -10449,9 +10533,9 @@ "question__title": "Number of Zero-Filled Subarrays", "question__title_slug": "number-of-zero-filled-subarrays", "question__hide": false, - "total_acs": 6420, - "total_submitted": 11719, - "total_column_articles": 94, + "total_acs": 6485, + "total_submitted": 11815, + "total_column_articles": 95, "frontend_question_id": "2348", "is_new_question": false }, @@ -10470,8 +10554,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": 482, - "total_submitted": 1071, + "total_acs": 490, + "total_submitted": 1085, "total_column_articles": 8, "frontend_question_id": "2292", "is_new_question": false @@ -10491,8 +10575,8 @@ "question__title": "Number of Excellent Pairs", "question__title_slug": "number-of-excellent-pairs", "question__hide": false, - "total_acs": 5733, - "total_submitted": 13191, + "total_acs": 5751, + "total_submitted": 13221, "total_column_articles": 72, "frontend_question_id": "2354", "is_new_question": false @@ -10512,8 +10596,8 @@ "question__title": "Design a Food Rating System", "question__title_slug": "design-a-food-rating-system", "question__hide": false, - "total_acs": 6758, - "total_submitted": 22154, + "total_acs": 6810, + "total_submitted": 22313, "total_column_articles": 108, "frontend_question_id": "2353", "is_new_question": false @@ -10533,9 +10617,9 @@ "question__title": "Equal Row and Column Pairs", "question__title_slug": "equal-row-and-column-pairs", "question__hide": false, - "total_acs": 10146, - "total_submitted": 14066, - "total_column_articles": 98, + "total_acs": 10199, + "total_submitted": 14127, + "total_column_articles": 100, "frontend_question_id": "2352", "is_new_question": false }, @@ -10554,9 +10638,9 @@ "question__title": "First Letter to Appear Twice", "question__title_slug": "first-letter-to-appear-twice", "question__hide": false, - "total_acs": 13137, - "total_submitted": 15565, - "total_column_articles": 149, + "total_acs": 13273, + "total_submitted": 15752, + "total_column_articles": 151, "frontend_question_id": "2351", "is_new_question": false }, @@ -10575,8 +10659,8 @@ "question__title": "Maximum Profit From Trading Stocks", "question__title_slug": "maximum-profit-from-trading-stocks", "question__hide": false, - "total_acs": 185, - "total_submitted": 267, + "total_acs": 186, + "total_submitted": 268, "total_column_articles": 9, "frontend_question_id": "2291", "is_new_question": false @@ -10596,8 +10680,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": 142, - "total_submitted": 276, + "total_acs": 158, + "total_submitted": 307, "total_column_articles": 9, "frontend_question_id": "2282", "is_new_question": false @@ -10617,8 +10701,8 @@ "question__title": "Minimum Deletions to Make Array Divisible", "question__title_slug": "minimum-deletions-to-make-array-divisible", "question__hide": false, - "total_acs": 7680, - "total_submitted": 14615, + "total_acs": 7698, + "total_submitted": 14636, "total_column_articles": 113, "frontend_question_id": "2344", "is_new_question": false @@ -10638,8 +10722,8 @@ "question__title": "Query Kth Smallest Trimmed Number", "question__title_slug": "query-kth-smallest-trimmed-number", "question__hide": false, - "total_acs": 8521, - "total_submitted": 20918, + "total_acs": 8552, + "total_submitted": 20976, "total_column_articles": 127, "frontend_question_id": "2343", "is_new_question": false @@ -10659,9 +10743,9 @@ "question__title": "Maximum Number of Pairs in Array", "question__title_slug": "maximum-number-of-pairs-in-array", "question__hide": false, - "total_acs": 11415, - "total_submitted": 14329, - "total_column_articles": 159, + "total_acs": 11489, + "total_submitted": 14424, + "total_column_articles": 160, "frontend_question_id": "2341", "is_new_question": false }, @@ -10680,8 +10764,8 @@ "question__title": "Closest Node to Path in Tree", "question__title_slug": "closest-node-to-path-in-tree", "question__hide": false, - "total_acs": 216, - "total_submitted": 307, + "total_acs": 224, + "total_submitted": 321, "total_column_articles": 12, "frontend_question_id": "2277", "is_new_question": false @@ -10701,9 +10785,9 @@ "question__title": "Subarray With Elements Greater Than Varying Threshold", "question__title_slug": "subarray-with-elements-greater-than-varying-threshold", "question__hide": false, - "total_acs": 2720, - "total_submitted": 5867, - "total_column_articles": 50, + "total_acs": 2760, + "total_submitted": 5931, + "total_column_articles": 51, "frontend_question_id": "2334", "is_new_question": false }, @@ -10722,8 +10806,8 @@ "question__title": "Minimum Sum of Squared Difference", "question__title_slug": "minimum-sum-of-squared-difference", "question__hide": false, - "total_acs": 4032, - "total_submitted": 15634, + "total_acs": 4091, + "total_submitted": 15795, "total_column_articles": 66, "frontend_question_id": "2333", "is_new_question": false @@ -10743,9 +10827,9 @@ "question__title": "The Latest Time to Catch a Bus", "question__title_slug": "the-latest-time-to-catch-a-bus", "question__hide": false, - "total_acs": 4447, - "total_submitted": 19235, - "total_column_articles": 82, + "total_acs": 4492, + "total_submitted": 19358, + "total_column_articles": 83, "frontend_question_id": "2332", "is_new_question": false }, @@ -10764,9 +10848,9 @@ "question__title": "Evaluate Boolean Binary Tree", "question__title_slug": "evaluate-boolean-binary-tree", "question__hide": false, - "total_acs": 6806, - "total_submitted": 8284, - "total_column_articles": 89, + "total_acs": 6910, + "total_submitted": 8415, + "total_column_articles": 90, "frontend_question_id": "2331", "is_new_question": false }, @@ -10785,8 +10869,8 @@ "question__title": "Count the Number of Ideal Arrays", "question__title_slug": "count-the-number-of-ideal-arrays", "question__hide": false, - "total_acs": 2493, - "total_submitted": 8447, + "total_acs": 2503, + "total_submitted": 8468, "total_column_articles": 43, "frontend_question_id": "2338", "is_new_question": false @@ -10806,8 +10890,8 @@ "question__title": "Move Pieces to Obtain a String", "question__title_slug": "move-pieces-to-obtain-a-string", "question__hide": false, - "total_acs": 7382, - "total_submitted": 19205, + "total_acs": 7409, + "total_submitted": 19257, "total_column_articles": 116, "frontend_question_id": "2337", "is_new_question": false @@ -10827,9 +10911,9 @@ "question__title": "Smallest Number in Infinite Set", "question__title_slug": "smallest-number-in-infinite-set", "question__hide": false, - "total_acs": 8751, - "total_submitted": 12510, - "total_column_articles": 111, + "total_acs": 8776, + "total_submitted": 12542, + "total_column_articles": 112, "frontend_question_id": "2336", "is_new_question": false }, @@ -10848,9 +10932,9 @@ "question__title": "Minimum Amount of Time to Fill Cups", "question__title_slug": "minimum-amount-of-time-to-fill-cups", "question__hide": false, - "total_acs": 11290, - "total_submitted": 19863, - "total_column_articles": 139, + "total_acs": 11388, + "total_submitted": 20034, + "total_column_articles": 140, "frontend_question_id": "2335", "is_new_question": false }, @@ -10869,8 +10953,8 @@ "question__title": "Spiral Matrix IV", "question__title_slug": "spiral-matrix-iv", "question__hide": false, - "total_acs": 8911, - "total_submitted": 13366, + "total_acs": 8951, + "total_submitted": 13420, "total_column_articles": 111, "frontend_question_id": "2326", "is_new_question": false @@ -10890,8 +10974,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": 5479, - "total_submitted": 11013, + "total_acs": 5506, + "total_submitted": 11058, "total_column_articles": 104, "frontend_question_id": "2328", "is_new_question": false @@ -10911,8 +10995,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": 8490, - "total_submitted": 18611, + "total_acs": 8532, + "total_submitted": 18704, "total_column_articles": 179, "frontend_question_id": "2327", "is_new_question": false @@ -10932,9 +11016,9 @@ "question__title": "Decode the Message", "question__title_slug": "decode-the-message", "question__hide": false, - "total_acs": 10901, - "total_submitted": 13331, - "total_column_articles": 104, + "total_acs": 11002, + "total_submitted": 13442, + "total_column_articles": 105, "frontend_question_id": "2325", "is_new_question": false }, @@ -10953,9 +11037,9 @@ "question__title": "Minimum Number of Keypresses", "question__title_slug": "minimum-number-of-keypresses", "question__hide": false, - "total_acs": 306, - "total_submitted": 463, - "total_column_articles": 15, + "total_acs": 324, + "total_submitted": 481, + "total_column_articles": 16, "frontend_question_id": "2268", "is_new_question": false }, @@ -10974,8 +11058,8 @@ "question__title": "Number of Distinct Roll Sequences", "question__title_slug": "number-of-distinct-roll-sequences", "question__hide": false, - "total_acs": 3092, - "total_submitted": 5477, + "total_acs": 3111, + "total_submitted": 5510, "total_column_articles": 63, "frontend_question_id": "2318", "is_new_question": false @@ -10995,9 +11079,9 @@ "question__title": "Count Unreachable Pairs of Nodes in an Undirected Graph", "question__title_slug": "count-unreachable-pairs-of-nodes-in-an-undirected-graph", "question__hide": false, - "total_acs": 5686, - "total_submitted": 14974, - "total_column_articles": 99, + "total_acs": 5727, + "total_submitted": 15072, + "total_column_articles": 101, "frontend_question_id": "2316", "is_new_question": false }, @@ -11016,9 +11100,9 @@ "question__title": "Maximum XOR After Operations ", "question__title_slug": "maximum-xor-after-operations", "question__hide": false, - "total_acs": 4261, - "total_submitted": 5009, - "total_column_articles": 59, + "total_acs": 4299, + "total_submitted": 5053, + "total_column_articles": 60, "frontend_question_id": "2317", "is_new_question": false }, @@ -11037,9 +11121,9 @@ "question__title": "Count Asterisks", "question__title_slug": "count-asterisks", "question__hide": false, - "total_acs": 7792, - "total_submitted": 9288, - "total_column_articles": 127, + "total_acs": 7890, + "total_submitted": 9406, + "total_column_articles": 129, "frontend_question_id": "2315", "is_new_question": false }, @@ -11058,8 +11142,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": 3173, - "total_submitted": 5407, + "total_acs": 3181, + "total_submitted": 5423, "total_column_articles": 54, "frontend_question_id": "2322", "is_new_question": false @@ -11079,8 +11163,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": 148, - "total_submitted": 215, + "total_acs": 149, + "total_submitted": 216, "total_column_articles": 12, "frontend_question_id": "2313", "is_new_question": false @@ -11100,8 +11184,8 @@ "question__title": "Check if Matrix Is X-Matrix", "question__title_slug": "check-if-matrix-is-x-matrix", "question__hide": false, - "total_acs": 9867, - "total_submitted": 13499, + "total_acs": 9928, + "total_submitted": 13578, "total_column_articles": 81, "frontend_question_id": "2319", "is_new_question": false @@ -11121,9 +11205,9 @@ "question__title": "Count Number of Ways to Place Houses", "question__title_slug": "count-number-of-ways-to-place-houses", "question__hide": false, - "total_acs": 7689, - "total_submitted": 19438, - "total_column_articles": 85, + "total_acs": 7710, + "total_submitted": 19483, + "total_column_articles": 86, "frontend_question_id": "2320", "is_new_question": false }, @@ -11163,9 +11247,9 @@ "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": 6580, - "total_submitted": 18157, - "total_column_articles": 123, + "total_acs": 6604, + "total_submitted": 18214, + "total_column_articles": 124, "frontend_question_id": "2311", "is_new_question": false }, @@ -11184,8 +11268,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": 4527, - "total_submitted": 9088, + "total_acs": 4554, + "total_submitted": 9138, "total_column_articles": 73, "frontend_question_id": "2302", "is_new_question": false @@ -11205,8 +11289,8 @@ "question__title": "Match Substring After Replacement", "question__title_slug": "match-substring-after-replacement", "question__hide": false, - "total_acs": 3873, - "total_submitted": 8672, + "total_acs": 3894, + "total_submitted": 8724, "total_column_articles": 66, "frontend_question_id": "2301", "is_new_question": false @@ -11226,9 +11310,9 @@ "question__title": "Successful Pairs of Spells and Potions", "question__title_slug": "successful-pairs-of-spells-and-potions", "question__hide": false, - "total_acs": 5713, - "total_submitted": 15075, - "total_column_articles": 88, + "total_acs": 5752, + "total_submitted": 15164, + "total_column_articles": 89, "frontend_question_id": "2300", "is_new_question": false }, @@ -11247,9 +11331,9 @@ "question__title": "Strong Password Checker II", "question__title_slug": "strong-password-checker-ii", "question__hide": false, - "total_acs": 6273, - "total_submitted": 10225, - "total_column_articles": 89, + "total_acs": 6351, + "total_submitted": 10340, + "total_column_articles": 90, "frontend_question_id": "2299", "is_new_question": false }, @@ -11268,8 +11352,8 @@ "question__title": "Naming a Company", "question__title_slug": "naming-a-company", "question__hide": false, - "total_acs": 4055, - "total_submitted": 9323, + "total_acs": 4070, + "total_submitted": 9363, "total_column_articles": 64, "frontend_question_id": "2306", "is_new_question": false @@ -11289,8 +11373,8 @@ "question__title": "Design a Text Editor", "question__title_slug": "design-a-text-editor", "question__hide": false, - "total_acs": 6139, - "total_submitted": 14246, + "total_acs": 6190, + "total_submitted": 14392, "total_column_articles": 116, "frontend_question_id": "2296", "is_new_question": false @@ -11310,9 +11394,9 @@ "question__title": "Replace Elements in an Array", "question__title_slug": "replace-elements-in-an-array", "question__hide": false, - "total_acs": 7809, - "total_submitted": 13689, - "total_column_articles": 109, + "total_acs": 7852, + "total_submitted": 13756, + "total_column_articles": 110, "frontend_question_id": "2295", "is_new_question": false }, @@ -11331,8 +11415,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": 7629, - "total_submitted": 11165, + "total_acs": 7658, + "total_submitted": 11300, "total_column_articles": 107, "frontend_question_id": "2294", "is_new_question": false @@ -11352,9 +11436,9 @@ "question__title": "Min Max Game", "question__title_slug": "min-max-game", "question__hide": false, - "total_acs": 8938, - "total_submitted": 12926, - "total_column_articles": 107, + "total_acs": 8976, + "total_submitted": 12980, + "total_column_articles": 108, "frontend_question_id": "2293", "is_new_question": false }, @@ -11373,8 +11457,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": 218, - "total_submitted": 278, + "total_acs": 221, + "total_submitted": 282, "total_column_articles": 13, "frontend_question_id": "2237", "is_new_question": false @@ -11394,9 +11478,9 @@ "question__title": "Root Equals Sum of Children", "question__title_slug": "root-equals-sum-of-children", "question__hide": false, - "total_acs": 13203, - "total_submitted": 15266, - "total_column_articles": 111, + "total_acs": 13678, + "total_submitted": 15799, + "total_column_articles": 114, "frontend_question_id": "2236", "is_new_question": false }, @@ -11415,9 +11499,9 @@ "question__title": "Add Two Integers", "question__title_slug": "add-two-integers", "question__hide": false, - "total_acs": 21281, - "total_submitted": 24507, - "total_column_articles": 108, + "total_acs": 21667, + "total_submitted": 24936, + "total_column_articles": 109, "frontend_question_id": "2235", "is_new_question": false }, @@ -11436,8 +11520,8 @@ "question__title": "Dynamic Unpivoting of a Table", "question__title_slug": "dynamic-unpivoting-of-a-table", "question__hide": false, - "total_acs": 159, - "total_submitted": 240, + "total_acs": 161, + "total_submitted": 243, "total_column_articles": 3, "frontend_question_id": "2253", "is_new_question": false @@ -11457,8 +11541,8 @@ "question__title": "Dynamic Pivoting of a Table", "question__title_slug": "dynamic-pivoting-of-a-table", "question__hide": false, - "total_acs": 151, - "total_submitted": 272, + "total_acs": 156, + "total_submitted": 285, "total_column_articles": 2, "frontend_question_id": "2252", "is_new_question": false @@ -11478,8 +11562,8 @@ "question__title": "Booking Concert Tickets in Groups", "question__title_slug": "booking-concert-tickets-in-groups", "question__hide": false, - "total_acs": 2679, - "total_submitted": 12009, + "total_acs": 2704, + "total_submitted": 12089, "total_column_articles": 46, "frontend_question_id": "2286", "is_new_question": false @@ -11499,8 +11583,8 @@ "question__title": "Maximum Total Importance of Roads", "question__title_slug": "maximum-total-importance-of-roads", "question__hide": false, - "total_acs": 5342, - "total_submitted": 9354, + "total_acs": 5373, + "total_submitted": 9420, "total_column_articles": 75, "frontend_question_id": "2285", "is_new_question": false @@ -11520,9 +11604,9 @@ "question__title": "Sender With Largest Word Count", "question__title_slug": "sender-with-largest-word-count", "question__hide": false, - "total_acs": 5460, - "total_submitted": 9626, - "total_column_articles": 75, + "total_acs": 5504, + "total_submitted": 9698, + "total_column_articles": 76, "frontend_question_id": "2284", "is_new_question": false }, @@ -11541,9 +11625,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": 7254, - "total_submitted": 9300, - "total_column_articles": 104, + "total_acs": 7334, + "total_submitted": 9437, + "total_column_articles": 105, "frontend_question_id": "2283", "is_new_question": false }, @@ -11562,8 +11646,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": 574, - "total_submitted": 838, + "total_acs": 580, + "total_submitted": 846, "total_column_articles": 10, "frontend_question_id": "2238", "is_new_question": false @@ -11583,9 +11667,9 @@ "question__title": "Minimum Obstacle Removal to Reach Corner", "question__title_slug": "minimum-obstacle-removal-to-reach-corner", "question__hide": false, - "total_acs": 5195, - "total_submitted": 9472, - "total_column_articles": 89, + "total_acs": 5230, + "total_submitted": 9531, + "total_column_articles": 91, "frontend_question_id": "2290", "is_new_question": false }, @@ -11604,8 +11688,8 @@ "question__title": "Steps to Make Array Non-decreasing", "question__title_slug": "steps-to-make-array-non-decreasing", "question__hide": false, - "total_acs": 4791, - "total_submitted": 22968, + "total_acs": 4824, + "total_submitted": 23115, "total_column_articles": 89, "frontend_question_id": "2289", "is_new_question": false @@ -11625,8 +11709,8 @@ "question__title": "Apply Discount to Prices", "question__title_slug": "apply-discount-to-prices", "question__hide": false, - "total_acs": 7502, - "total_submitted": 24272, + "total_acs": 7536, + "total_submitted": 24357, "total_column_articles": 105, "frontend_question_id": "2288", "is_new_question": false @@ -11646,9 +11730,9 @@ "question__title": "Rearrange Characters to Make Target String", "question__title_slug": "rearrange-characters-to-make-target-string", "question__hide": false, - "total_acs": 9436, - "total_submitted": 15629, - "total_column_articles": 125, + "total_acs": 9515, + "total_submitted": 15764, + "total_column_articles": 129, "frontend_question_id": "2287", "is_new_question": false }, @@ -11667,8 +11751,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": 648, - "total_submitted": 1290, + "total_acs": 665, + "total_submitted": 1322, "total_column_articles": 7, "frontend_question_id": "2230", "is_new_question": false @@ -11688,8 +11772,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": 663, - "total_submitted": 1402, + "total_acs": 675, + "total_submitted": 1445, "total_column_articles": 12, "frontend_question_id": "2228", "is_new_question": false @@ -11709,8 +11793,8 @@ "question__title": "Maximum Sum Score of Array", "question__title_slug": "maximum-sum-score-of-array", "question__hide": false, - "total_acs": 219, - "total_submitted": 345, + "total_acs": 221, + "total_submitted": 349, "total_column_articles": 13, "frontend_question_id": "2219", "is_new_question": false @@ -11730,8 +11814,8 @@ "question__title": "Sum of Total Strength of Wizards", "question__title_slug": "sum-of-total-strength-of-wizards", "question__hide": false, - "total_acs": 3513, - "total_submitted": 13581, + "total_acs": 3539, + "total_submitted": 13662, "total_column_articles": 65, "frontend_question_id": "2281", "is_new_question": false @@ -11751,8 +11835,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": 8747, - "total_submitted": 40308, + "total_acs": 8770, + "total_submitted": 40371, "total_column_articles": 149, "frontend_question_id": "2280", "is_new_question": false @@ -11772,8 +11856,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": 10960, - "total_submitted": 16897, + "total_acs": 11042, + "total_submitted": 17056, "total_column_articles": 113, "frontend_question_id": "2279", "is_new_question": false @@ -11793,8 +11877,8 @@ "question__title": "Percentage of Letter in String", "question__title_slug": "percentage-of-letter-in-string", "question__hide": false, - "total_acs": 12212, - "total_submitted": 15063, + "total_acs": 12293, + "total_submitted": 15165, "total_column_articles": 109, "frontend_question_id": "2278", "is_new_question": false @@ -11814,8 +11898,8 @@ "question__title": "Longest Path With Different Adjacent Characters", "question__title_slug": "longest-path-with-different-adjacent-characters", "question__hide": false, - "total_acs": 4136, - "total_submitted": 9276, + "total_acs": 4171, + "total_submitted": 9337, "total_column_articles": 57, "frontend_question_id": "2246", "is_new_question": false @@ -11835,8 +11919,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": 4311, - "total_submitted": 12282, + "total_acs": 4321, + "total_submitted": 12303, "total_column_articles": 95, "frontend_question_id": "2245", "is_new_question": false @@ -11856,8 +11940,8 @@ "question__title": "Minimum Rounds to Complete All Tasks", "question__title_slug": "minimum-rounds-to-complete-all-tasks", "question__hide": false, - "total_acs": 9815, - "total_submitted": 17469, + "total_acs": 9844, + "total_submitted": 17518, "total_column_articles": 149, "frontend_question_id": "2244", "is_new_question": false @@ -11877,9 +11961,9 @@ "question__title": "Calculate Digit Sum of a String", "question__title_slug": "calculate-digit-sum-of-a-string", "question__hide": false, - "total_acs": 10571, - "total_submitted": 16712, - "total_column_articles": 138, + "total_acs": 10622, + "total_submitted": 16795, + "total_column_articles": 139, "frontend_question_id": "2243", "is_new_question": false }, @@ -11898,8 +11982,8 @@ "question__title": "Substring With Largest Variance", "question__title_slug": "substring-with-largest-variance", "question__hide": false, - "total_acs": 3333, - "total_submitted": 8700, + "total_acs": 3350, + "total_submitted": 8756, "total_column_articles": 42, "frontend_question_id": "2272", "is_new_question": false @@ -11919,9 +12003,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": 5192, - "total_submitted": 16528, - "total_column_articles": 91, + "total_acs": 5217, + "total_submitted": 16595, + "total_column_articles": 92, "frontend_question_id": "2271", "is_new_question": false }, @@ -11940,8 +12024,8 @@ "question__title": "Number of Ways to Split Array", "question__title_slug": "number-of-ways-to-split-array", "question__hide": false, - "total_acs": 6057, - "total_submitted": 13018, + "total_acs": 6088, + "total_submitted": 13085, "total_column_articles": 72, "frontend_question_id": "2270", "is_new_question": false @@ -11961,8 +12045,8 @@ "question__title": "Count Integers in Intervals", "question__title_slug": "count-integers-in-intervals", "question__hide": false, - "total_acs": 5657, - "total_submitted": 15838, + "total_acs": 5679, + "total_submitted": 15877, "total_column_articles": 97, "frontend_question_id": "2276", "is_new_question": false @@ -11982,9 +12066,9 @@ "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": 7487, - "total_submitted": 12698, - "total_column_articles": 99, + "total_acs": 7506, + "total_submitted": 12735, + "total_column_articles": 100, "frontend_question_id": "2275", "is_new_question": false }, @@ -12003,8 +12087,8 @@ "question__title": "Maximum Consecutive Floors Without Special Floors", "question__title_slug": "maximum-consecutive-floors-without-special-floors", "question__hide": false, - "total_acs": 9019, - "total_submitted": 17041, + "total_acs": 9056, + "total_submitted": 17111, "total_column_articles": 108, "frontend_question_id": "2274", "is_new_question": false @@ -12024,8 +12108,8 @@ "question__title": "Minimum Health to Beat Game", "question__title_slug": "minimum-health-to-beat-game", "question__hide": false, - "total_acs": 502, - "total_submitted": 919, + "total_acs": 519, + "total_submitted": 942, "total_column_articles": 9, "frontend_question_id": "2214", "is_new_question": false @@ -12045,8 +12129,8 @@ "question__title": "Maximum Score of a Node Sequence", "question__title_slug": "maximum-score-of-a-node-sequence", "question__hide": false, - "total_acs": 2736, - "total_submitted": 8425, + "total_acs": 2752, + "total_submitted": 8474, "total_column_articles": 43, "frontend_question_id": "2242", "is_new_question": false @@ -12066,9 +12150,9 @@ "question__title": "Design an ATM Machine", "question__title_slug": "design-an-atm-machine", "question__hide": false, - "total_acs": 5936, - "total_submitted": 16535, - "total_column_articles": 71, + "total_acs": 5977, + "total_submitted": 16647, + "total_column_articles": 72, "frontend_question_id": "2241", "is_new_question": false }, @@ -12087,9 +12171,9 @@ "question__title": "Number of Ways to Buy Pens and Pencils", "question__title_slug": "number-of-ways-to-buy-pens-and-pencils", "question__hide": false, - "total_acs": 6060, - "total_submitted": 10461, - "total_column_articles": 72, + "total_acs": 6101, + "total_submitted": 10573, + "total_column_articles": 74, "frontend_question_id": "2240", "is_new_question": false }, @@ -12108,8 +12192,8 @@ "question__title": "Find Closest Number to Zero", "question__title_slug": "find-closest-number-to-zero", "question__hide": false, - "total_acs": 9008, - "total_submitted": 16529, + "total_acs": 9090, + "total_submitted": 16684, "total_column_articles": 111, "frontend_question_id": "2239", "is_new_question": false @@ -12129,8 +12213,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": 7437, - "total_submitted": 20019, + "total_acs": 7467, + "total_submitted": 20069, "total_column_articles": 126, "frontend_question_id": "2267", "is_new_question": false @@ -12150,8 +12234,8 @@ "question__title": "Count Number of Texts", "question__title_slug": "count-number-of-texts", "question__hide": false, - "total_acs": 7132, - "total_submitted": 16611, + "total_acs": 7158, + "total_submitted": 16653, "total_column_articles": 133, "frontend_question_id": "2266", "is_new_question": false @@ -12171,9 +12255,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": 9575, - "total_submitted": 11443, - "total_column_articles": 176, + "total_acs": 9618, + "total_submitted": 11500, + "total_column_articles": 177, "frontend_question_id": "2265", "is_new_question": false }, @@ -12192,9 +12276,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": 11297, - "total_submitted": 18163, - "total_column_articles": 149, + "total_acs": 11386, + "total_submitted": 18299, + "total_column_articles": 150, "frontend_question_id": "2264", "is_new_question": false }, @@ -12213,9 +12297,9 @@ "question__title": "Minimum Number of Operations to Convert Time", "question__title_slug": "minimum-number-of-operations-to-convert-time", "question__hide": false, - "total_acs": 10845, - "total_submitted": 15656, - "total_column_articles": 139, + "total_acs": 10898, + "total_submitted": 15742, + "total_column_articles": 141, "frontend_question_id": "2224", "is_new_question": false }, @@ -12234,8 +12318,8 @@ "question__title": "Escape the Spreading Fire", "question__title_slug": "escape-the-spreading-fire", "question__hide": false, - "total_acs": 2593, - "total_submitted": 7353, + "total_acs": 2601, + "total_submitted": 7372, "total_column_articles": 80, "frontend_question_id": "2258", "is_new_question": false @@ -12255,8 +12339,8 @@ "question__title": "Count Unguarded Cells in the Grid", "question__title_slug": "count-unguarded-cells-in-the-grid", "question__hide": false, - "total_acs": 4511, - "total_submitted": 8661, + "total_acs": 4543, + "total_submitted": 8710, "total_column_articles": 100, "frontend_question_id": "2257", "is_new_question": false @@ -12276,8 +12360,8 @@ "question__title": "Minimum Average Difference", "question__title_slug": "minimum-average-difference", "question__hide": false, - "total_acs": 5587, - "total_submitted": 15490, + "total_acs": 5622, + "total_submitted": 15578, "total_column_articles": 76, "frontend_question_id": "2256", "is_new_question": false @@ -12297,8 +12381,8 @@ "question__title": "Count Prefixes of a Given String", "question__title_slug": "count-prefixes-of-a-given-string", "question__hide": false, - "total_acs": 7893, - "total_submitted": 9930, + "total_acs": 7981, + "total_submitted": 10051, "total_column_articles": 117, "frontend_question_id": "2255", "is_new_question": false @@ -12318,9 +12402,9 @@ "question__title": "Total Appeal of A String", "question__title_slug": "total-appeal-of-a-string", "question__hide": false, - "total_acs": 6111, - "total_submitted": 10823, - "total_column_articles": 112, + "total_acs": 6151, + "total_submitted": 10883, + "total_column_articles": 114, "frontend_question_id": "2262", "is_new_question": false }, @@ -12339,9 +12423,9 @@ "question__title": "K Divisible Elements Subarrays", "question__title_slug": "k-divisible-elements-subarrays", "question__hide": false, - "total_acs": 7755, - "total_submitted": 14815, - "total_column_articles": 128, + "total_acs": 7797, + "total_submitted": 14910, + "total_column_articles": 127, "frontend_question_id": "2261", "is_new_question": false }, @@ -12360,9 +12444,9 @@ "question__title": "Minimum Consecutive Cards to Pick Up", "question__title_slug": "minimum-consecutive-cards-to-pick-up", "question__hide": false, - "total_acs": 9374, - "total_submitted": 18680, - "total_column_articles": 146, + "total_acs": 9438, + "total_submitted": 18806, + "total_column_articles": 147, "frontend_question_id": "2260", "is_new_question": false }, @@ -12381,9 +12465,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": 10642, - "total_submitted": 21368, - "total_column_articles": 137, + "total_acs": 10744, + "total_submitted": 21551, + "total_column_articles": 139, "frontend_question_id": "2259", "is_new_question": false }, @@ -12402,8 +12486,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": 739, - "total_submitted": 1558, + "total_acs": 758, + "total_submitted": 1612, "total_column_articles": 11, "frontend_question_id": "2205", "is_new_question": false @@ -12423,8 +12507,8 @@ "question__title": "Finding the Topic of Each Post", "question__title_slug": "finding-the-topic-of-each-post", "question__hide": false, - "total_acs": 416, - "total_submitted": 721, + "total_acs": 427, + "total_submitted": 747, "total_column_articles": 9, "frontend_question_id": "2199", "is_new_question": false @@ -12444,9 +12528,9 @@ "question__title": "Number of Flowers in Full Bloom", "question__title_slug": "number-of-flowers-in-full-bloom", "question__hide": false, - "total_acs": 5574, - "total_submitted": 11401, - "total_column_articles": 118, + "total_acs": 5611, + "total_submitted": 11475, + "total_column_articles": 119, "frontend_question_id": "2251", "is_new_question": false }, @@ -12465,8 +12549,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": 6013, - "total_submitted": 17786, + "total_acs": 6045, + "total_submitted": 17864, "total_column_articles": 118, "frontend_question_id": "2250", "is_new_question": false @@ -12486,9 +12570,9 @@ "question__title": "Count Lattice Points Inside a Circle", "question__title_slug": "count-lattice-points-inside-a-circle", "question__hide": false, - "total_acs": 8842, - "total_submitted": 16835, - "total_column_articles": 120, + "total_acs": 8906, + "total_submitted": 16941, + "total_column_articles": 121, "frontend_question_id": "2249", "is_new_question": false }, @@ -12507,8 +12591,8 @@ "question__title": "Intersection of Multiple Arrays", "question__title_slug": "intersection-of-multiple-arrays", "question__hide": false, - "total_acs": 12857, - "total_submitted": 19137, + "total_acs": 12941, + "total_submitted": 19262, "total_column_articles": 171, "frontend_question_id": "2248", "is_new_question": false @@ -12528,8 +12612,8 @@ "question__title": "Maximum Total Beauty of the Gardens", "question__title_slug": "maximum-total-beauty-of-the-gardens", "question__hide": false, - "total_acs": 2866, - "total_submitted": 10263, + "total_acs": 2874, + "total_submitted": 10293, "total_column_articles": 72, "frontend_question_id": "2234", "is_new_question": false @@ -12549,8 +12633,8 @@ "question__title": "Maximum Product After K Increments", "question__title_slug": "maximum-product-after-k-increments", "question__hide": false, - "total_acs": 7930, - "total_submitted": 21758, + "total_acs": 7948, + "total_submitted": 21806, "total_column_articles": 161, "frontend_question_id": "2233", "is_new_question": false @@ -12570,8 +12654,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": 6831, - "total_submitted": 11196, + "total_acs": 6857, + "total_submitted": 11232, "total_column_articles": 126, "frontend_question_id": "2232", "is_new_question": false @@ -12591,8 +12675,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": 10225, - "total_submitted": 16018, + "total_acs": 10279, + "total_submitted": 16095, "total_column_articles": 173, "frontend_question_id": "2231", "is_new_question": false @@ -12612,8 +12696,8 @@ "question__title": "Sum of Scores of Built Strings", "question__title_slug": "sum-of-scores-of-built-strings", "question__hide": false, - "total_acs": 3261, - "total_submitted": 8978, + "total_acs": 3275, + "total_submitted": 9003, "total_column_articles": 55, "frontend_question_id": "2223", "is_new_question": false @@ -12633,8 +12717,8 @@ "question__title": "Number of Ways to Select Buildings", "question__title_slug": "number-of-ways-to-select-buildings", "question__hide": false, - "total_acs": 5712, - "total_submitted": 11664, + "total_acs": 5752, + "total_submitted": 11729, "total_column_articles": 126, "frontend_question_id": "2222", "is_new_question": false @@ -12654,9 +12738,9 @@ "question__title": "Find Triangular Sum of an Array", "question__title_slug": "find-triangular-sum-of-an-array", "question__hide": false, - "total_acs": 7984, - "total_submitted": 9954, - "total_column_articles": 106, + "total_acs": 8065, + "total_submitted": 10069, + "total_column_articles": 107, "frontend_question_id": "2221", "is_new_question": false }, @@ -12675,9 +12759,9 @@ "question__title": "Minimum Bit Flips to Convert Number", "question__title_slug": "minimum-bit-flips-to-convert-number", "question__hide": false, - "total_acs": 8466, - "total_submitted": 10251, - "total_column_articles": 125, + "total_acs": 8547, + "total_submitted": 10350, + "total_column_articles": 127, "frontend_question_id": "2220", "is_new_question": false }, @@ -12696,8 +12780,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": 290, - "total_submitted": 531, + "total_acs": 293, + "total_submitted": 538, "total_column_articles": 15, "frontend_question_id": "2184", "is_new_question": false @@ -12717,8 +12801,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": 3807, - "total_submitted": 10263, + "total_acs": 3825, + "total_submitted": 10291, "total_column_articles": 67, "frontend_question_id": "2203", "is_new_question": false @@ -12738,9 +12822,9 @@ "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": 11135, - "total_submitted": 21115, - "total_column_articles": 137, + "total_acs": 11185, + "total_submitted": 21191, + "total_column_articles": 138, "frontend_question_id": "2200", "is_new_question": false }, @@ -12759,8 +12843,8 @@ "question__title": "Longest Substring of One Repeating Character", "question__title_slug": "longest-substring-of-one-repeating-character", "question__hide": false, - "total_acs": 2613, - "total_submitted": 6817, + "total_acs": 2635, + "total_submitted": 6860, "total_column_articles": 79, "frontend_question_id": "2213", "is_new_question": false @@ -12780,8 +12864,8 @@ "question__title": "Maximum Points in an Archery Competition", "question__title_slug": "maximum-points-in-an-archery-competition", "question__hide": false, - "total_acs": 6744, - "total_submitted": 14211, + "total_acs": 6768, + "total_submitted": 14297, "total_column_articles": 161, "frontend_question_id": "2212", "is_new_question": false @@ -12801,9 +12885,9 @@ "question__title": "Count Collisions on a Road", "question__title_slug": "count-collisions-on-a-road", "question__hide": false, - "total_acs": 8966, - "total_submitted": 22373, - "total_column_articles": 134, + "total_acs": 9000, + "total_submitted": 22436, + "total_column_articles": 135, "frontend_question_id": "2211", "is_new_question": false }, @@ -12822,8 +12906,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": 11068, - "total_submitted": 18940, + "total_acs": 11121, + "total_submitted": 19034, "total_column_articles": 136, "frontend_question_id": "2210", "is_new_question": false @@ -12843,8 +12927,8 @@ "question__title": "The Change in Global Rankings", "question__title_slug": "the-change-in-global-rankings", "question__hide": false, - "total_acs": 690, - "total_submitted": 1249, + "total_acs": 700, + "total_submitted": 1264, "total_column_articles": 10, "frontend_question_id": "2175", "is_new_question": false @@ -12864,8 +12948,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": 170, - "total_submitted": 248, + "total_acs": 172, + "total_submitted": 254, "total_column_articles": 9, "frontend_question_id": "2174", "is_new_question": false @@ -12885,8 +12969,8 @@ "question__title": "Longest Winning Streak", "question__title_slug": "longest-winning-streak", "question__hide": false, - "total_acs": 782, - "total_submitted": 1463, + "total_acs": 796, + "total_submitted": 1487, "total_column_articles": 21, "frontend_question_id": "2173", "is_new_question": false @@ -12906,9 +12990,9 @@ "question__title": "Most Frequent Number Following Key In an Array", "question__title_slug": "most-frequent-number-following-key-in-an-array", "question__hide": false, - "total_acs": 7861, - "total_submitted": 13443, - "total_column_articles": 90, + "total_acs": 7901, + "total_submitted": 13509, + "total_column_articles": 91, "frontend_question_id": "2190", "is_new_question": false }, @@ -12927,9 +13011,9 @@ "question__title": "Minimum White Tiles After Covering With Carpets", "question__title_slug": "minimum-white-tiles-after-covering-with-carpets", "question__hide": false, - "total_acs": 4134, - "total_submitted": 10839, - "total_column_articles": 48, + "total_acs": 4149, + "total_submitted": 10864, + "total_column_articles": 49, "frontend_question_id": "2209", "is_new_question": false }, @@ -12948,9 +13032,9 @@ "question__title": "Minimum Operations to Halve Array Sum", "question__title_slug": "minimum-operations-to-halve-array-sum", "question__hide": false, - "total_acs": 5843, - "total_submitted": 14613, - "total_column_articles": 92, + "total_acs": 5868, + "total_submitted": 14662, + "total_column_articles": 93, "frontend_question_id": "2208", "is_new_question": false }, @@ -12969,9 +13053,9 @@ "question__title": "Maximize Number of Subsequences in a String", "question__title_slug": "maximize-number-of-subsequences-in-a-string", "question__hide": false, - "total_acs": 6134, - "total_submitted": 20057, - "total_column_articles": 100, + "total_acs": 6164, + "total_submitted": 20145, + "total_column_articles": 101, "frontend_question_id": "2207", "is_new_question": false }, @@ -12990,9 +13074,9 @@ "question__title": "Divide Array Into Equal Pairs", "question__title_slug": "divide-array-into-equal-pairs", "question__hide": false, - "total_acs": 10759, - "total_submitted": 14419, - "total_column_articles": 123, + "total_acs": 10843, + "total_submitted": 14538, + "total_column_articles": 127, "frontend_question_id": "2206", "is_new_question": false }, @@ -13011,8 +13095,8 @@ "question__title": "Replace Non-Coprime Numbers in Array", "question__title_slug": "replace-non-coprime-numbers-in-array", "question__hide": false, - "total_acs": 5260, - "total_submitted": 15517, + "total_acs": 5277, + "total_submitted": 15556, "total_column_articles": 89, "frontend_question_id": "2197", "is_new_question": false @@ -13032,8 +13116,8 @@ "question__title": "Create Binary Tree From Descriptions", "question__title_slug": "create-binary-tree-from-descriptions", "question__hide": false, - "total_acs": 8267, - "total_submitted": 11338, + "total_acs": 8307, + "total_submitted": 11396, "total_column_articles": 141, "frontend_question_id": "2196", "is_new_question": false @@ -13053,8 +13137,8 @@ "question__title": "Append K Integers With Minimal Sum", "question__title_slug": "append-k-integers-with-minimal-sum", "question__hide": false, - "total_acs": 10642, - "total_submitted": 45096, + "total_acs": 10692, + "total_submitted": 45247, "total_column_articles": 209, "frontend_question_id": "2195", "is_new_question": false @@ -13074,8 +13158,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": 12214, - "total_submitted": 14427, + "total_acs": 12271, + "total_submitted": 14492, "total_column_articles": 127, "frontend_question_id": "2194", "is_new_question": false @@ -13095,8 +13179,8 @@ "question__title": "Unique Substrings With Equal Digit Frequency", "question__title_slug": "unique-substrings-with-equal-digit-frequency", "question__hide": false, - "total_acs": 310, - "total_submitted": 512, + "total_acs": 322, + "total_submitted": 525, "total_column_articles": 13, "frontend_question_id": "2168", "is_new_question": false @@ -13116,8 +13200,8 @@ "question__title": "Order Two Columns Independently", "question__title_slug": "order-two-columns-independently", "question__hide": false, - "total_acs": 805, - "total_submitted": 1314, + "total_acs": 819, + "total_submitted": 1337, "total_column_articles": 7, "frontend_question_id": "2159", "is_new_question": false @@ -13137,8 +13221,8 @@ "question__title": "Count Array Pairs Divisible by K", "question__title_slug": "count-array-pairs-divisible-by-k", "question__hide": false, - "total_acs": 4397, - "total_submitted": 15921, + "total_acs": 4419, + "total_submitted": 15995, "total_column_articles": 57, "frontend_question_id": "2183", "is_new_question": false @@ -13158,9 +13242,9 @@ "question__title": "Construct String With Repeat Limit", "question__title_slug": "construct-string-with-repeat-limit", "question__hide": false, - "total_acs": 6468, - "total_submitted": 13422, - "total_column_articles": 138, + "total_acs": 6485, + "total_submitted": 13453, + "total_column_articles": 139, "frontend_question_id": "2182", "is_new_question": false }, @@ -13179,9 +13263,9 @@ "question__title": "Merge Nodes in Between Zeros", "question__title_slug": "merge-nodes-in-between-zeros", "question__hide": false, - "total_acs": 12233, - "total_submitted": 14223, - "total_column_articles": 176, + "total_acs": 12323, + "total_submitted": 14326, + "total_column_articles": 178, "frontend_question_id": "2181", "is_new_question": false }, @@ -13200,9 +13284,9 @@ "question__title": "Count Integers With Even Digit Sum", "question__title_slug": "count-integers-with-even-digit-sum", "question__hide": false, - "total_acs": 10527, - "total_submitted": 16244, - "total_column_articles": 125, + "total_acs": 10610, + "total_submitted": 16359, + "total_column_articles": 124, "frontend_question_id": "2180", "is_new_question": false }, @@ -13221,8 +13305,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": 398, - "total_submitted": 706, + "total_acs": 403, + "total_submitted": 723, "total_column_articles": 16, "frontend_question_id": "2158", "is_new_question": false @@ -13242,8 +13326,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": 379, - "total_submitted": 874, + "total_acs": 395, + "total_submitted": 898, "total_column_articles": 5, "frontend_question_id": "2153", "is_new_question": false @@ -13263,9 +13347,9 @@ "question__title": "Minimum Time to Finish the Race", "question__title_slug": "minimum-time-to-finish-the-race", "question__hide": false, - "total_acs": 4041, - "total_submitted": 9278, - "total_column_articles": 66, + "total_acs": 4064, + "total_submitted": 9324, + "total_column_articles": 67, "frontend_question_id": "2188", "is_new_question": false }, @@ -13284,9 +13368,9 @@ "question__title": "Minimum Time to Complete Trips", "question__title_slug": "minimum-time-to-complete-trips", "question__hide": false, - "total_acs": 10968, - "total_submitted": 40296, - "total_column_articles": 146, + "total_acs": 11015, + "total_submitted": 40433, + "total_column_articles": 147, "frontend_question_id": "2187", "is_new_question": false }, @@ -13305,9 +13389,9 @@ "question__title": "Minimum Number of Steps to Make Two Strings Anagram II", "question__title_slug": "minimum-number-of-steps-to-make-two-strings-anagram-ii", "question__hide": false, - "total_acs": 9803, - "total_submitted": 13581, - "total_column_articles": 114, + "total_acs": 9852, + "total_submitted": 13642, + "total_column_articles": 118, "frontend_question_id": "2186", "is_new_question": false }, @@ -13326,9 +13410,9 @@ "question__title": "Counting Words With a Given Prefix", "question__title_slug": "counting-words-with-a-given-prefix", "question__hide": false, - "total_acs": 13393, - "total_submitted": 16935, - "total_column_articles": 146, + "total_acs": 13469, + "total_submitted": 17062, + "total_column_articles": 147, "frontend_question_id": "2185", "is_new_question": false }, @@ -13347,9 +13431,9 @@ "question__title": "Maximum AND Sum of Array", "question__title_slug": "maximum-and-sum-of-array", "question__hide": false, - "total_acs": 3833, - "total_submitted": 7763, - "total_column_articles": 71, + "total_acs": 3864, + "total_submitted": 7813, + "total_column_articles": 73, "frontend_question_id": "2172", "is_new_question": false }, @@ -13368,8 +13452,8 @@ "question__title": "Removing Minimum Number of Magic Beans", "question__title_slug": "removing-minimum-number-of-magic-beans", "question__hide": false, - "total_acs": 8344, - "total_submitted": 20984, + "total_acs": 8381, + "total_submitted": 21084, "total_column_articles": 177, "frontend_question_id": "2171", "is_new_question": false @@ -13389,9 +13473,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": 8516, - "total_submitted": 28021, - "total_column_articles": 151, + "total_acs": 8555, + "total_submitted": 28136, + "total_column_articles": 152, "frontend_question_id": "2170", "is_new_question": false }, @@ -13410,8 +13494,8 @@ "question__title": "Count Operations to Obtain Zero", "question__title_slug": "count-operations-to-obtain-zero", "question__hide": false, - "total_acs": 14014, - "total_submitted": 18497, + "total_acs": 14093, + "total_submitted": 18614, "total_column_articles": 117, "frontend_question_id": "2169", "is_new_question": false @@ -13431,8 +13515,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": 269, - "total_submitted": 524, + "total_acs": 272, + "total_submitted": 527, "total_column_articles": 15, "frontend_question_id": "2152", "is_new_question": false @@ -13452,9 +13536,9 @@ "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": 4106, - "total_submitted": 8547, - "total_column_articles": 75, + "total_acs": 4148, + "total_submitted": 8605, + "total_column_articles": 76, "frontend_question_id": "2167", "is_new_question": false }, @@ -13473,8 +13557,8 @@ "question__title": "Design Bitset", "question__title_slug": "design-bitset", "question__hide": false, - "total_acs": 5623, - "total_submitted": 18679, + "total_acs": 5640, + "total_submitted": 18737, "total_column_articles": 152, "frontend_question_id": "2166", "is_new_question": false @@ -13494,9 +13578,9 @@ "question__title": "Smallest Value of the Rearranged Number", "question__title_slug": "smallest-value-of-the-rearranged-number", "question__hide": false, - "total_acs": 7447, - "total_submitted": 13491, - "total_column_articles": 134, + "total_acs": 7483, + "total_submitted": 13558, + "total_column_articles": 135, "frontend_question_id": "2165", "is_new_question": false }, @@ -13515,9 +13599,9 @@ "question__title": "Sort Even and Odd Indices Independently", "question__title_slug": "sort-even-and-odd-indices-independently", "question__hide": false, - "total_acs": 9402, - "total_submitted": 13721, - "total_column_articles": 120, + "total_acs": 9488, + "total_submitted": 13842, + "total_column_articles": 121, "frontend_question_id": "2164", "is_new_question": false }, @@ -13537,7 +13621,7 @@ "question__title_slug": "choose-numbers-from-two-arrays-in-range", "question__hide": false, "total_acs": 150, - "total_submitted": 277, + "total_submitted": 278, "total_column_articles": 9, "frontend_question_id": "2143", "is_new_question": false @@ -13557,8 +13641,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": 919, - "total_submitted": 1847, + "total_acs": 922, + "total_submitted": 1855, "total_column_articles": 14, "frontend_question_id": "2142", "is_new_question": false @@ -13578,8 +13662,8 @@ "question__title": "Count Good Triplets in an Array", "question__title_slug": "count-good-triplets-in-an-array", "question__hide": false, - "total_acs": 2890, - "total_submitted": 8240, + "total_acs": 2899, + "total_submitted": 8258, "total_column_articles": 73, "frontend_question_id": "2179", "is_new_question": false @@ -13599,8 +13683,8 @@ "question__title": "Maximum Split of Positive Even Integers", "question__title_slug": "maximum-split-of-positive-even-integers", "question__hide": false, - "total_acs": 6436, - "total_submitted": 11440, + "total_acs": 6471, + "total_submitted": 11503, "total_column_articles": 106, "frontend_question_id": "2178", "is_new_question": false @@ -13620,8 +13704,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": 7709, - "total_submitted": 11118, + "total_acs": 7749, + "total_submitted": 11169, "total_column_articles": 81, "frontend_question_id": "2177", "is_new_question": false @@ -13641,9 +13725,9 @@ "question__title": "Count Equal and Divisible Pairs in an Array", "question__title_slug": "count-equal-and-divisible-pairs-in-an-array", "question__hide": false, - "total_acs": 8777, - "total_submitted": 11019, - "total_column_articles": 105, + "total_acs": 8821, + "total_submitted": 11082, + "total_column_articles": 106, "frontend_question_id": "2176", "is_new_question": false }, @@ -13662,8 +13746,8 @@ "question__title": "Groups of Strings", "question__title_slug": "groups-of-strings", "question__hide": false, - "total_acs": 3202, - "total_submitted": 10505, + "total_acs": 3223, + "total_submitted": 10537, "total_column_articles": 74, "frontend_question_id": "2157", "is_new_question": false @@ -13683,8 +13767,8 @@ "question__title": "Find Substring With Given Hash Value", "question__title_slug": "find-substring-with-given-hash-value", "question__hide": false, - "total_acs": 5281, - "total_submitted": 21681, + "total_acs": 5304, + "total_submitted": 21732, "total_column_articles": 90, "frontend_question_id": "2156", "is_new_question": false @@ -13704,9 +13788,9 @@ "question__title": "Keep Multiplying Found Values by Two", "question__title_slug": "keep-multiplying-found-values-by-two", "question__hide": false, - "total_acs": 13499, - "total_submitted": 18285, - "total_column_articles": 165, + "total_acs": 13596, + "total_submitted": 18420, + "total_column_articles": 166, "frontend_question_id": "2154", "is_new_question": false }, @@ -13725,8 +13809,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": 277, - "total_submitted": 475, + "total_acs": 279, + "total_submitted": 480, "total_column_articles": 12, "frontend_question_id": "2137", "is_new_question": false @@ -13746,8 +13830,8 @@ "question__title": "Maximum Good People Based on Statements", "question__title_slug": "maximum-good-people-based-on-statements", "question__hide": false, - "total_acs": 4925, - "total_submitted": 9987, + "total_acs": 4950, + "total_submitted": 10021, "total_column_articles": 89, "frontend_question_id": "2151", "is_new_question": false @@ -13767,8 +13851,8 @@ "question__title": "Rearrange Array Elements by Sign", "question__title_slug": "rearrange-array-elements-by-sign", "question__hide": false, - "total_acs": 10196, - "total_submitted": 12705, + "total_acs": 10246, + "total_submitted": 12764, "total_column_articles": 115, "frontend_question_id": "2149", "is_new_question": false @@ -13788,9 +13872,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": 8545, - "total_submitted": 14282, - "total_column_articles": 103, + "total_acs": 8593, + "total_submitted": 14363, + "total_column_articles": 105, "frontend_question_id": "2150", "is_new_question": false }, @@ -13809,9 +13893,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": 10773, - "total_submitted": 18671, - "total_column_articles": 146, + "total_acs": 10841, + "total_submitted": 18786, + "total_column_articles": 147, "frontend_question_id": "2148", "is_new_question": false }, @@ -13830,8 +13914,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": 473, - "total_submitted": 618, + "total_acs": 474, + "total_submitted": 620, "total_column_articles": 14, "frontend_question_id": "2128", "is_new_question": false @@ -13851,9 +13935,9 @@ "question__title": "Minimum Difference in Sums After Removal of Elements", "question__title_slug": "minimum-difference-in-sums-after-removal-of-elements", "question__hide": false, - "total_acs": 2777, - "total_submitted": 5747, - "total_column_articles": 56, + "total_acs": 2784, + "total_submitted": 5759, + "total_column_articles": 57, "frontend_question_id": "2163", "is_new_question": false }, @@ -13872,8 +13956,8 @@ "question__title": "Minimum Cost to Set Cooking Time", "question__title_slug": "minimum-cost-to-set-cooking-time", "question__hide": false, - "total_acs": 3083, - "total_submitted": 9360, + "total_acs": 3099, + "total_submitted": 9384, "total_column_articles": 78, "frontend_question_id": "2162", "is_new_question": false @@ -13893,8 +13977,8 @@ "question__title": "Partition Array According to Given Pivot", "question__title_slug": "partition-array-according-to-given-pivot", "question__hide": false, - "total_acs": 7157, - "total_submitted": 8599, + "total_acs": 7192, + "total_submitted": 8645, "total_column_articles": 109, "frontend_question_id": "2161", "is_new_question": false @@ -13914,9 +13998,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": 10958, - "total_submitted": 12866, - "total_column_articles": 170, + "total_acs": 11056, + "total_submitted": 12971, + "total_column_articles": 172, "frontend_question_id": "2160", "is_new_question": false }, @@ -13935,9 +14019,9 @@ "question__title": "Maximum Running Time of N Computers", "question__title_slug": "maximum-running-time-of-n-computers", "question__hide": false, - "total_acs": 5100, - "total_submitted": 12677, - "total_column_articles": 75, + "total_acs": 5126, + "total_submitted": 12742, + "total_column_articles": 76, "frontend_question_id": "2141", "is_new_question": false }, @@ -13956,8 +14040,8 @@ "question__title": "Solving Questions With Brainpower", "question__title_slug": "solving-questions-with-brainpower", "question__hide": false, - "total_acs": 7908, - "total_submitted": 18484, + "total_acs": 7940, + "total_submitted": 18536, "total_column_articles": 156, "frontend_question_id": "2140", "is_new_question": false @@ -13977,8 +14061,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": 7469, - "total_submitted": 11635, + "total_acs": 7489, + "total_submitted": 11665, "total_column_articles": 111, "frontend_question_id": "2155", "is_new_question": false @@ -13998,9 +14082,9 @@ "question__title": "Divide a String Into Groups of Size k", "question__title_slug": "divide-a-string-into-groups-of-size-k", "question__hide": false, - "total_acs": 9346, - "total_submitted": 14033, - "total_column_articles": 136, + "total_acs": 9392, + "total_submitted": 14107, + "total_column_articles": 137, "frontend_question_id": "2138", "is_new_question": false }, @@ -14019,8 +14103,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": 214, - "total_submitted": 410, + "total_acs": 219, + "total_submitted": 415, "total_column_articles": 5, "frontend_question_id": "2123", "is_new_question": false @@ -14041,7 +14125,7 @@ "question__title_slug": "elements-in-array-after-removing-and-replacing-elements", "question__hide": false, "total_acs": 236, - "total_submitted": 395, + "total_submitted": 396, "total_column_articles": 10, "frontend_question_id": "2113", "is_new_question": false @@ -14061,8 +14145,8 @@ "question__title": "Earliest Possible Day of Full Bloom", "question__title_slug": "earliest-possible-day-of-full-bloom", "question__hide": false, - "total_acs": 4001, - "total_submitted": 6092, + "total_acs": 4022, + "total_submitted": 6131, "total_column_articles": 71, "frontend_question_id": "2136", "is_new_question": false @@ -14082,8 +14166,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": 4997, - "total_submitted": 14076, + "total_acs": 5040, + "total_submitted": 14182, "total_column_articles": 101, "frontend_question_id": "2135", "is_new_question": false @@ -14103,9 +14187,9 @@ "question__title": "Minimum Swaps to Group All 1's Together II", "question__title_slug": "minimum-swaps-to-group-all-1s-together-ii", "question__hide": false, - "total_acs": 6889, - "total_submitted": 14335, - "total_column_articles": 166, + "total_acs": 6926, + "total_submitted": 14397, + "total_column_articles": 168, "frontend_question_id": "2134", "is_new_question": false }, @@ -14124,9 +14208,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": 9304, - "total_submitted": 16570, - "total_column_articles": 139, + "total_acs": 9347, + "total_submitted": 16671, + "total_column_articles": 140, "frontend_question_id": "2133", "is_new_question": false }, @@ -14145,8 +14229,8 @@ "question__title": "Build the Equation", "question__title_slug": "build-the-equation", "question__hide": false, - "total_acs": 519, - "total_submitted": 906, + "total_acs": 523, + "total_submitted": 910, "total_column_articles": 13, "frontend_question_id": "2118", "is_new_question": false @@ -14166,8 +14250,8 @@ "question__title": "The Airport With the Most Traffic", "question__title_slug": "the-airport-with-the-most-traffic", "question__hide": false, - "total_acs": 940, - "total_submitted": 1393, + "total_acs": 948, + "total_submitted": 1401, "total_column_articles": 15, "frontend_question_id": "2112", "is_new_question": false @@ -14187,8 +14271,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": 3276, - "total_submitted": 8130, + "total_acs": 3296, + "total_submitted": 8175, "total_column_articles": 80, "frontend_question_id": "2147", "is_new_question": false @@ -14208,8 +14292,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": 3697, - "total_submitted": 9355, + "total_acs": 3705, + "total_submitted": 9370, "total_column_articles": 90, "frontend_question_id": "2146", "is_new_question": false @@ -14229,9 +14313,9 @@ "question__title": "Count the Hidden Sequences", "question__title_slug": "count-the-hidden-sequences", "question__hide": false, - "total_acs": 4912, - "total_submitted": 14064, - "total_column_articles": 110, + "total_acs": 4941, + "total_submitted": 14129, + "total_column_articles": 111, "frontend_question_id": "2145", "is_new_question": false }, @@ -14250,9 +14334,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": 8435, - "total_submitted": 12529, - "total_column_articles": 150, + "total_acs": 8526, + "total_submitted": 12667, + "total_column_articles": 151, "frontend_question_id": "2144", "is_new_question": false }, @@ -14271,8 +14355,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": 359, - "total_submitted": 985, + "total_acs": 361, + "total_submitted": 992, "total_column_articles": 14, "frontend_question_id": "2107", "is_new_question": false @@ -14292,8 +14376,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": 3088, - "total_submitted": 9578, + "total_acs": 3099, + "total_submitted": 9614, "total_column_articles": 66, "frontend_question_id": "2127", "is_new_question": false @@ -14313,9 +14397,9 @@ "question__title": "Destroying Asteroids", "question__title_slug": "destroying-asteroids", "question__hide": false, - "total_acs": 7894, - "total_submitted": 16124, - "total_column_articles": 103, + "total_acs": 7963, + "total_submitted": 16286, + "total_column_articles": 105, "frontend_question_id": "2126", "is_new_question": false }, @@ -14334,9 +14418,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": 8744, - "total_submitted": 10457, - "total_column_articles": 118, + "total_acs": 8783, + "total_submitted": 10513, + "total_column_articles": 120, "frontend_question_id": "2125", "is_new_question": false }, @@ -14355,9 +14439,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": 10696, - "total_submitted": 15328, - "total_column_articles": 175, + "total_acs": 10768, + "total_submitted": 15429, + "total_column_articles": 180, "frontend_question_id": "2124", "is_new_question": false }, @@ -14376,8 +14460,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": 269, - "total_submitted": 724, + "total_acs": 275, + "total_submitted": 735, "total_column_articles": 10, "frontend_question_id": "2098", "is_new_question": false @@ -14397,9 +14481,9 @@ "question__title": "Recover the Original Array", "question__title_slug": "recover-the-original-array", "question__hide": false, - "total_acs": 3690, - "total_submitted": 8898, - "total_column_articles": 63, + "total_acs": 3714, + "total_submitted": 8931, + "total_column_articles": 64, "frontend_question_id": "2122", "is_new_question": false }, @@ -14418,8 +14502,8 @@ "question__title": "Intervals Between Identical Elements", "question__title_slug": "intervals-between-identical-elements", "question__hide": false, - "total_acs": 6039, - "total_submitted": 15961, + "total_acs": 6059, + "total_submitted": 16008, "total_column_articles": 153, "frontend_question_id": "2121", "is_new_question": false @@ -14439,8 +14523,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": 7225, - "total_submitted": 8758, + "total_acs": 7265, + "total_submitted": 8814, "total_column_articles": 110, "frontend_question_id": "2120", "is_new_question": false @@ -14460,9 +14544,9 @@ "question__title": "A Number After a Double Reversal", "question__title_slug": "a-number-after-a-double-reversal", "question__hide": false, - "total_acs": 14316, - "total_submitted": 19182, - "total_column_articles": 156, + "total_acs": 14414, + "total_submitted": 19317, + "total_column_articles": 159, "frontend_question_id": "2119", "is_new_question": false }, @@ -14481,9 +14565,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": 8028, - "total_submitted": 19194, - "total_column_articles": 134, + "total_acs": 8235, + "total_submitted": 19526, + "total_column_articles": 135, "frontend_question_id": "2131", "is_new_question": false }, @@ -14502,9 +14586,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": 8057, - "total_submitted": 9899, - "total_column_articles": 122, + "total_acs": 8126, + "total_submitted": 9985, + "total_column_articles": 125, "frontend_question_id": "2130", "is_new_question": false }, @@ -14523,8 +14607,8 @@ "question__title": "Capitalize the Title", "question__title_slug": "capitalize-the-title", "question__hide": false, - "total_acs": 7486, - "total_submitted": 12249, + "total_acs": 7565, + "total_submitted": 12382, "total_column_articles": 131, "frontend_question_id": "2129", "is_new_question": false @@ -14544,8 +14628,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": 4263, - "total_submitted": 12472, + "total_acs": 4273, + "total_submitted": 12506, "total_column_articles": 96, "frontend_question_id": "2111", "is_new_question": false @@ -14565,8 +14649,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": 8696, - "total_submitted": 16587, + "total_acs": 8737, + "total_submitted": 16657, "total_column_articles": 150, "frontend_question_id": "2110", "is_new_question": false @@ -14586,9 +14670,9 @@ "question__title": "Adding Spaces to a String", "question__title_slug": "adding-spaces-to-a-string", "question__hide": false, - "total_acs": 8814, - "total_submitted": 14363, - "total_column_articles": 110, + "total_acs": 8851, + "total_submitted": 14429, + "total_column_articles": 111, "frontend_question_id": "2109", "is_new_question": false }, @@ -14607,9 +14691,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": 11849, - "total_submitted": 15137, - "total_column_articles": 179, + "total_acs": 11927, + "total_submitted": 15229, + "total_column_articles": 180, "frontend_question_id": "2108", "is_new_question": false }, @@ -14628,8 +14712,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": 329, - "total_submitted": 553, + "total_acs": 330, + "total_submitted": 554, "total_column_articles": 18, "frontend_question_id": "2093", "is_new_question": false @@ -14649,9 +14733,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": 4619, - "total_submitted": 13518, - "total_column_articles": 95, + "total_acs": 4656, + "total_submitted": 13600, + "total_column_articles": 96, "frontend_question_id": "2106", "is_new_question": false }, @@ -14670,9 +14754,9 @@ "question__title": "Watering Plants II", "question__title_slug": "watering-plants-ii", "question__hide": false, - "total_acs": 7756, - "total_submitted": 14427, - "total_column_articles": 128, + "total_acs": 7827, + "total_submitted": 14600, + "total_column_articles": 130, "frontend_question_id": "2105", "is_new_question": false }, @@ -14691,9 +14775,9 @@ "question__title": "Sum of Subarray Ranges", "question__title_slug": "sum-of-subarray-ranges", "question__hide": false, - "total_acs": 39444, - "total_submitted": 62917, - "total_column_articles": 383, + "total_acs": 39538, + "total_submitted": 63055, + "total_column_articles": 384, "frontend_question_id": "2104", "is_new_question": false }, @@ -14712,9 +14796,9 @@ "question__title": "Rings and Rods", "question__title_slug": "rings-and-rods", "question__hide": false, - "total_acs": 9767, - "total_submitted": 12177, - "total_column_articles": 176, + "total_acs": 9841, + "total_submitted": 12279, + "total_column_articles": 177, "frontend_question_id": "2103", "is_new_question": false }, @@ -14733,8 +14817,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": 395, - "total_submitted": 673, + "total_acs": 396, + "total_submitted": 674, "total_column_articles": 15, "frontend_question_id": "2083", "is_new_question": false @@ -14754,8 +14838,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": 1555, - "total_submitted": 1890, + "total_acs": 1566, + "total_submitted": 1901, "total_column_articles": 31, "frontend_question_id": "2084", "is_new_question": false @@ -14775,8 +14859,8 @@ "question__title": "The Number of Rich Customers", "question__title_slug": "the-number-of-rich-customers", "question__hide": false, - "total_acs": 2014, - "total_submitted": 2690, + "total_acs": 2028, + "total_submitted": 2711, "total_column_articles": 25, "frontend_question_id": "2082", "is_new_question": false @@ -14796,8 +14880,8 @@ "question__title": "Abbreviating the Product of a Range", "question__title_slug": "abbreviating-the-product-of-a-range", "question__hide": false, - "total_acs": 1377, - "total_submitted": 4350, + "total_acs": 1380, + "total_submitted": 4359, "total_column_articles": 24, "frontend_question_id": "2117", "is_new_question": false @@ -14817,8 +14901,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": 3588, - "total_submitted": 11307, + "total_acs": 3615, + "total_submitted": 11359, "total_column_articles": 65, "frontend_question_id": "2116", "is_new_question": false @@ -14838,8 +14922,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": 5178, - "total_submitted": 12702, + "total_acs": 5223, + "total_submitted": 12778, "total_column_articles": 106, "frontend_question_id": "2115", "is_new_question": false @@ -14859,9 +14943,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": 15330, - "total_submitted": 17871, - "total_column_articles": 206, + "total_acs": 15499, + "total_submitted": 18075, + "total_column_articles": 209, "frontend_question_id": "2114", "is_new_question": false }, @@ -14880,8 +14964,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": 185, - "total_submitted": 294, + "total_acs": 186, + "total_submitted": 295, "total_column_articles": 9, "frontend_question_id": "2077", "is_new_question": false @@ -14901,8 +14985,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": 6732, - "total_submitted": 15325, + "total_acs": 6772, + "total_submitted": 15401, "total_column_articles": 192, "frontend_question_id": "2096", "is_new_question": false @@ -14922,9 +15006,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": 12176, - "total_submitted": 20990, - "total_column_articles": 172, + "total_acs": 12273, + "total_submitted": 21150, + "total_column_articles": 173, "frontend_question_id": "2095", "is_new_question": false }, @@ -14943,9 +15027,9 @@ "question__title": "Finding 3-Digit Even Numbers", "question__title_slug": "finding-3-digit-even-numbers", "question__hide": false, - "total_acs": 9957, - "total_submitted": 17880, - "total_column_articles": 160, + "total_acs": 10050, + "total_submitted": 18051, + "total_column_articles": 162, "frontend_question_id": "2094", "is_new_question": false }, @@ -14964,8 +15048,8 @@ "question__title": "The Winner University", "question__title_slug": "the-winner-university", "question__hide": false, - "total_acs": 1889, - "total_submitted": 2748, + "total_acs": 1904, + "total_submitted": 2766, "total_column_articles": 29, "frontend_question_id": "2072", "is_new_question": false @@ -14985,8 +15069,8 @@ "question__title": "Find All People With Secret", "question__title_slug": "find-all-people-with-secret", "question__hide": false, - "total_acs": 5438, - "total_submitted": 18919, + "total_acs": 5460, + "total_submitted": 19024, "total_column_articles": 128, "frontend_question_id": "2092", "is_new_question": false @@ -15006,8 +15090,8 @@ "question__title": "Removing Minimum and Maximum From Array", "question__title_slug": "removing-minimum-and-maximum-from-array", "question__hide": false, - "total_acs": 7494, - "total_submitted": 13160, + "total_acs": 7518, + "total_submitted": 13224, "total_column_articles": 139, "frontend_question_id": "2091", "is_new_question": false @@ -15027,8 +15111,8 @@ "question__title": "K Radius Subarray Averages", "question__title_slug": "k-radius-subarray-averages", "question__hide": false, - "total_acs": 7212, - "total_submitted": 19651, + "total_acs": 7237, + "total_submitted": 19720, "total_column_articles": 111, "frontend_question_id": "2090", "is_new_question": false @@ -15048,9 +15132,9 @@ "question__title": "Find Target Indices After Sorting Array", "question__title_slug": "find-target-indices-after-sorting-array", "question__hide": false, - "total_acs": 14863, - "total_submitted": 18681, - "total_column_articles": 196, + "total_acs": 14964, + "total_submitted": 18809, + "total_column_articles": 199, "frontend_question_id": "2089", "is_new_question": false }, @@ -15069,8 +15153,8 @@ "question__title": "Number of Equal Count Substrings", "question__title_slug": "number-of-equal-count-substrings", "question__hide": false, - "total_acs": 162, - "total_submitted": 315, + "total_acs": 163, + "total_submitted": 316, "total_column_articles": 11, "frontend_question_id": "2067", "is_new_question": false @@ -15090,8 +15174,8 @@ "question__title": "Account Balance", "question__title_slug": "account-balance", "question__hide": false, - "total_acs": 1494, - "total_submitted": 1889, + "total_acs": 1501, + "total_submitted": 1899, "total_column_articles": 25, "frontend_question_id": "2066", "is_new_question": false @@ -15111,8 +15195,8 @@ "question__title": "Sequentially Ordinal Rank Tracker", "question__title_slug": "sequentially-ordinal-rank-tracker", "question__hide": false, - "total_acs": 2861, - "total_submitted": 5289, + "total_acs": 2900, + "total_submitted": 5338, "total_column_articles": 82, "frontend_question_id": "2102", "is_new_question": false @@ -15132,8 +15216,8 @@ "question__title": "Detonate the Maximum Bombs", "question__title_slug": "detonate-the-maximum-bombs", "question__hide": false, - "total_acs": 4710, - "total_submitted": 11973, + "total_acs": 4736, + "total_submitted": 12047, "total_column_articles": 93, "frontend_question_id": "2101", "is_new_question": false @@ -15153,9 +15237,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": 33550, - "total_submitted": 68891, - "total_column_articles": 423, + "total_acs": 33581, + "total_submitted": 68965, + "total_column_articles": 424, "frontend_question_id": "2100", "is_new_question": false }, @@ -15174,8 +15258,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": 7676, - "total_submitted": 15821, + "total_acs": 7748, + "total_submitted": 15968, "total_column_articles": 159, "frontend_question_id": "2099", "is_new_question": false @@ -15195,8 +15279,8 @@ "question__title": "Number of Spaces Cleaning Robot Cleaned", "question__title_slug": "number-of-spaces-cleaning-robot-cleaned", "question__hide": false, - "total_acs": 551, - "total_submitted": 1147, + "total_acs": 556, + "total_submitted": 1158, "total_column_articles": 25, "frontend_question_id": "2061", "is_new_question": false @@ -15216,8 +15300,8 @@ "question__title": "Sum of k-Mirror Numbers", "question__title_slug": "sum-of-k-mirror-numbers", "question__hide": false, - "total_acs": 3010, - "total_submitted": 7061, + "total_acs": 3022, + "total_submitted": 7097, "total_column_articles": 79, "frontend_question_id": "2081", "is_new_question": false @@ -15237,8 +15321,8 @@ "question__title": "Valid Arrangement of Pairs", "question__title_slug": "valid-arrangement-of-pairs", "question__hide": false, - "total_acs": 2572, - "total_submitted": 6948, + "total_acs": 2579, + "total_submitted": 6979, "total_column_articles": 53, "frontend_question_id": "2097", "is_new_question": false @@ -15258,8 +15342,8 @@ "question__title": "Stamping the Grid", "question__title_slug": "stamping-the-grid", "question__hide": false, - "total_acs": 2199, - "total_submitted": 8002, + "total_acs": 2205, + "total_submitted": 8019, "total_column_articles": 53, "frontend_question_id": "2132", "is_new_question": false @@ -15279,9 +15363,9 @@ "question__title": "Two Furthest Houses With Different Colors", "question__title_slug": "two-furthest-houses-with-different-colors", "question__hide": false, - "total_acs": 10973, - "total_submitted": 15097, - "total_column_articles": 176, + "total_acs": 11063, + "total_submitted": 15225, + "total_column_articles": 177, "frontend_question_id": "2078", "is_new_question": false }, @@ -15300,9 +15384,9 @@ "question__title": "Process Restricted Friend Requests", "question__title_slug": "process-restricted-friend-requests", "question__hide": false, - "total_acs": 3344, - "total_submitted": 6644, - "total_column_articles": 81, + "total_acs": 3363, + "total_submitted": 6665, + "total_column_articles": 82, "frontend_question_id": "2076", "is_new_question": false }, @@ -15321,8 +15405,8 @@ "question__title": "Decode the Slanted Ciphertext", "question__title_slug": "decode-the-slanted-ciphertext", "question__hide": false, - "total_acs": 4215, - "total_submitted": 9050, + "total_acs": 4234, + "total_submitted": 9081, "total_column_articles": 79, "frontend_question_id": "2075", "is_new_question": false @@ -15342,8 +15426,8 @@ "question__title": "Reverse Nodes in Even Length Groups", "question__title_slug": "reverse-nodes-in-even-length-groups", "question__hide": false, - "total_acs": 5772, - "total_submitted": 12950, + "total_acs": 5808, + "total_submitted": 13015, "total_column_articles": 144, "frontend_question_id": "2074", "is_new_question": false @@ -15363,8 +15447,8 @@ "question__title": "Time Needed to Buy Tickets", "question__title_slug": "time-needed-to-buy-tickets", "question__hide": false, - "total_acs": 11026, - "total_submitted": 17769, + "total_acs": 11106, + "total_submitted": 17900, "total_column_articles": 182, "frontend_question_id": "2073", "is_new_question": false @@ -15384,8 +15468,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": 1070, - "total_submitted": 1644, + "total_acs": 1073, + "total_submitted": 1647, "total_column_articles": 17, "frontend_question_id": "2051", "is_new_question": false @@ -15405,9 +15489,9 @@ "question__title": "Count Fertile Pyramids in a Land", "question__title_slug": "count-fertile-pyramids-in-a-land", "question__hide": false, - "total_acs": 2192, - "total_submitted": 3463, - "total_column_articles": 49, + "total_acs": 2199, + "total_submitted": 3478, + "total_column_articles": 50, "frontend_question_id": "2088", "is_new_question": false }, @@ -15426,8 +15510,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": 3521, - "total_submitted": 7128, + "total_acs": 3543, + "total_submitted": 7163, "total_column_articles": 80, "frontend_question_id": "2087", "is_new_question": false @@ -15444,11 +15528,11 @@ { "stat": { "question_id": 2191, - "question__title": "Minimum Number of Buckets Required to Collect Rainwater from Houses", - "question__title_slug": "minimum-number-of-buckets-required-to-collect-rainwater-from-houses", + "question__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": 4728, - "total_submitted": 10267, + "total_acs": 4754, + "total_submitted": 10318, "total_column_articles": 96, "frontend_question_id": "2086", "is_new_question": false @@ -15468,9 +15552,9 @@ "question__title": "Count Common Words With One Occurrence", "question__title_slug": "count-common-words-with-one-occurrence", "question__hide": false, - "total_acs": 7265, - "total_submitted": 10045, - "total_column_articles": 123, + "total_acs": 7316, + "total_submitted": 10118, + "total_column_articles": 124, "frontend_question_id": "2085", "is_new_question": false }, @@ -15489,9 +15573,9 @@ "question__title": "Maximum Path Quality of a Graph", "question__title_slug": "maximum-path-quality-of-a-graph", "question__hide": false, - "total_acs": 2738, - "total_submitted": 5108, - "total_column_articles": 66, + "total_acs": 2748, + "total_submitted": 5127, + "total_column_articles": 67, "frontend_question_id": "2065", "is_new_question": false }, @@ -15510,8 +15594,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": 5208, - "total_submitted": 11872, + "total_acs": 5229, + "total_submitted": 11912, "total_column_articles": 95, "frontend_question_id": "2064", "is_new_question": false @@ -15531,9 +15615,9 @@ "question__title": "Vowels of All Substrings", "question__title_slug": "vowels-of-all-substrings", "question__hide": false, - "total_acs": 5951, - "total_submitted": 11636, - "total_column_articles": 126, + "total_acs": 5980, + "total_submitted": 11690, + "total_column_articles": 127, "frontend_question_id": "2063", "is_new_question": false }, @@ -15552,8 +15636,8 @@ "question__title": "Count Vowel Substrings of a String", "question__title_slug": "count-vowel-substrings-of-a-string", "question__hide": false, - "total_acs": 7666, - "total_submitted": 12386, + "total_acs": 7716, + "total_submitted": 12457, "total_column_articles": 134, "frontend_question_id": "2062", "is_new_question": false @@ -15573,8 +15657,8 @@ "question__title": "Accepted Candidates From the Interviews", "question__title_slug": "accepted-candidates-from-the-interviews", "question__hide": false, - "total_acs": 1556, - "total_submitted": 2038, + "total_acs": 1565, + "total_submitted": 2053, "total_column_articles": 25, "frontend_question_id": "2041", "is_new_question": false @@ -15594,8 +15678,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": 1402, - "total_submitted": 3590, + "total_acs": 1405, + "total_submitted": 3593, "total_column_articles": 25, "frontend_question_id": "2060", "is_new_question": false @@ -15615,8 +15699,8 @@ "question__title": "Minimum Operations to Convert Number", "question__title_slug": "minimum-operations-to-convert-number", "question__hide": false, - "total_acs": 6127, - "total_submitted": 13160, + "total_acs": 6136, + "total_submitted": 13175, "total_column_articles": 110, "frontend_question_id": "2059", "is_new_question": false @@ -15636,9 +15720,9 @@ "question__title": "Find the Minimum and Maximum Number of Nodes Between Critical Points", "question__title_slug": "find-the-minimum-and-maximum-number-of-nodes-between-critical-points", "question__hide": false, - "total_acs": 7095, - "total_submitted": 12605, - "total_column_articles": 102, + "total_acs": 7153, + "total_submitted": 12707, + "total_column_articles": 103, "frontend_question_id": "2058", "is_new_question": false }, @@ -15657,9 +15741,9 @@ "question__title": "Smallest Index With Equal Value", "question__title_slug": "smallest-index-with-equal-value", "question__hide": false, - "total_acs": 10369, - "total_submitted": 13617, - "total_column_articles": 101, + "total_acs": 10438, + "total_submitted": 13708, + "total_column_articles": 103, "frontend_question_id": "2057", "is_new_question": false }, @@ -15678,8 +15762,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": 1991, - "total_submitted": 5668, + "total_acs": 2012, + "total_submitted": 5748, "total_column_articles": 45, "frontend_question_id": "2071", "is_new_question": false @@ -15699,8 +15783,8 @@ "question__title": "Most Beautiful Item for Each Query", "question__title_slug": "most-beautiful-item-for-each-query", "question__hide": false, - "total_acs": 3734, - "total_submitted": 8390, + "total_acs": 3759, + "total_submitted": 8440, "total_column_articles": 108, "frontend_question_id": "2070", "is_new_question": false @@ -15720,8 +15804,8 @@ "question__title": "Walking Robot Simulation II", "question__title_slug": "walking-robot-simulation-ii", "question__hide": false, - "total_acs": 4144, - "total_submitted": 19300, + "total_acs": 4158, + "total_submitted": 19374, "total_column_articles": 107, "frontend_question_id": "2069", "is_new_question": false @@ -15741,9 +15825,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": 7601, - "total_submitted": 10751, - "total_column_articles": 129, + "total_acs": 7695, + "total_submitted": 10906, + "total_column_articles": 131, "frontend_question_id": "2068", "is_new_question": false }, @@ -15762,8 +15846,8 @@ "question__title": "Parallel Courses III", "question__title_slug": "parallel-courses-iii", "question__hide": false, - "total_acs": 3425, - "total_submitted": 5839, + "total_acs": 3437, + "total_submitted": 5871, "total_column_articles": 101, "frontend_question_id": "2050", "is_new_question": false @@ -15783,8 +15867,8 @@ "question__title": "Count Nodes With the Highest Score", "question__title_slug": "count-nodes-with-the-highest-score", "question__hide": false, - "total_acs": 26724, - "total_submitted": 51627, + "total_acs": 26754, + "total_submitted": 51690, "total_column_articles": 310, "frontend_question_id": "2049", "is_new_question": false @@ -15804,9 +15888,9 @@ "question__title": "Next Greater Numerically Balanced Number", "question__title_slug": "next-greater-numerically-balanced-number", "question__hide": false, - "total_acs": 5495, - "total_submitted": 12412, - "total_column_articles": 115, + "total_acs": 5527, + "total_submitted": 12465, + "total_column_articles": 116, "frontend_question_id": "2048", "is_new_question": false }, @@ -15825,8 +15909,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": 27282, - "total_submitted": 70141, + "total_acs": 27320, + "total_submitted": 70270, "total_column_articles": 414, "frontend_question_id": "2047", "is_new_question": false @@ -15846,8 +15930,8 @@ "question__title": "Low-Quality Problems", "question__title_slug": "low-quality-problems", "question__hide": false, - "total_acs": 2991, - "total_submitted": 3734, + "total_acs": 3009, + "total_submitted": 3753, "total_column_articles": 31, "frontend_question_id": "2026", "is_new_question": false @@ -15867,8 +15951,8 @@ "question__title": "Second Minimum Time to Reach Destination", "question__title_slug": "second-minimum-time-to-reach-destination", "question__hide": false, - "total_acs": 16250, - "total_submitted": 30462, + "total_acs": 16269, + "total_submitted": 30518, "total_column_articles": 165, "frontend_question_id": "2045", "is_new_question": false @@ -15888,8 +15972,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": 35001, - "total_submitted": 42812, + "total_acs": 35026, + "total_submitted": 42841, "total_column_articles": 389, "frontend_question_id": "2044", "is_new_question": false @@ -15909,8 +15993,8 @@ "question__title": "Simple Bank System", "question__title_slug": "simple-bank-system", "question__hide": false, - "total_acs": 34475, - "total_submitted": 51831, + "total_acs": 34552, + "total_submitted": 51980, "total_column_articles": 305, "frontend_question_id": "2043", "is_new_question": false @@ -15930,9 +16014,9 @@ "question__title": "Check if Numbers Are Ascending in a Sentence", "question__title_slug": "check-if-numbers-are-ascending-in-a-sentence", "question__hide": false, - "total_acs": 10978, - "total_submitted": 16682, - "total_column_articles": 195, + "total_acs": 11030, + "total_submitted": 16756, + "total_column_articles": 197, "frontend_question_id": "2042", "is_new_question": false }, @@ -15951,8 +16035,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": 1440, - "total_submitted": 2057, + "total_acs": 1450, + "total_submitted": 2068, "total_column_articles": 27, "frontend_question_id": "2020", "is_new_question": false @@ -15972,9 +16056,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": 936, - "total_submitted": 1557, - "total_column_articles": 20, + "total_acs": 943, + "total_submitted": 1589, + "total_column_articles": 21, "frontend_question_id": "2056", "is_new_question": false }, @@ -15993,8 +16077,8 @@ "question__title": "Plates Between Candles", "question__title_slug": "plates-between-candles", "question__hide": false, - "total_acs": 33487, - "total_submitted": 77067, + "total_acs": 33526, + "total_submitted": 77174, "total_column_articles": 434, "frontend_question_id": "2055", "is_new_question": false @@ -16014,9 +16098,9 @@ "question__title": "Two Best Non-Overlapping Events", "question__title_slug": "two-best-non-overlapping-events", "question__hide": false, - "total_acs": 3984, - "total_submitted": 10715, - "total_column_articles": 79, + "total_acs": 4016, + "total_submitted": 10790, + "total_column_articles": 80, "frontend_question_id": "2054", "is_new_question": false }, @@ -16035,8 +16119,8 @@ "question__title": "Kth Distinct String in an Array", "question__title_slug": "kth-distinct-string-in-an-array", "question__hide": false, - "total_acs": 8078, - "total_submitted": 11206, + "total_acs": 8118, + "total_submitted": 11262, "total_column_articles": 140, "frontend_question_id": "2053", "is_new_question": false @@ -16056,9 +16140,9 @@ "question__title": "Partition Array Into Two Arrays to Minimize Sum Difference", "question__title_slug": "partition-array-into-two-arrays-to-minimize-sum-difference", "question__hide": false, - "total_acs": 3284, - "total_submitted": 9811, - "total_column_articles": 66, + "total_acs": 3331, + "total_submitted": 9922, + "total_column_articles": 67, "frontend_question_id": "2035", "is_new_question": false }, @@ -16077,8 +16161,8 @@ "question__title": "Stock Price Fluctuation ", "question__title_slug": "stock-price-fluctuation", "question__hide": false, - "total_acs": 23042, - "total_submitted": 49943, + "total_acs": 23080, + "total_submitted": 50046, "total_column_articles": 237, "frontend_question_id": "2034", "is_new_question": false @@ -16098,9 +16182,9 @@ "question__title": "Minimum Operations to Make a Uni-Value Grid", "question__title_slug": "minimum-operations-to-make-a-uni-value-grid", "question__hide": false, - "total_acs": 5862, - "total_submitted": 13865, - "total_column_articles": 112, + "total_acs": 5888, + "total_submitted": 13938, + "total_column_articles": 113, "frontend_question_id": "2033", "is_new_question": false }, @@ -16119,9 +16203,9 @@ "question__title": "Two Out of Three", "question__title_slug": "two-out-of-three", "question__hide": false, - "total_acs": 10050, - "total_submitted": 15139, - "total_column_articles": 195, + "total_acs": 10120, + "total_submitted": 15229, + "total_column_articles": 196, "frontend_question_id": "2032", "is_new_question": false }, @@ -16140,9 +16224,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": 1373, - "total_submitted": 2217, - "total_column_articles": 38, + "total_acs": 1391, + "total_submitted": 2240, + "total_column_articles": 39, "frontend_question_id": "2010", "is_new_question": false }, @@ -16161,8 +16245,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": 1848, - "total_submitted": 5276, + "total_acs": 1853, + "total_submitted": 5287, "total_column_articles": 51, "frontend_question_id": "2030", "is_new_question": false @@ -16182,8 +16266,8 @@ "question__title": "Stone Game IX", "question__title_slug": "stone-game-ix", "question__hide": false, - "total_acs": 19767, - "total_submitted": 42094, + "total_acs": 19777, + "total_submitted": 42130, "total_column_articles": 197, "frontend_question_id": "2029", "is_new_question": false @@ -16203,9 +16287,9 @@ "question__title": "Find Missing Observations", "question__title_slug": "find-missing-observations", "question__hide": false, - "total_acs": 33861, - "total_submitted": 66857, - "total_column_articles": 392, + "total_acs": 33895, + "total_submitted": 66934, + "total_column_articles": 393, "frontend_question_id": "2028", "is_new_question": false }, @@ -16224,9 +16308,9 @@ "question__title": "Minimum Moves to Convert String", "question__title_slug": "minimum-moves-to-convert-string", "question__hide": false, - "total_acs": 8738, - "total_submitted": 15104, - "total_column_articles": 113, + "total_acs": 8796, + "total_submitted": 15188, + "total_column_articles": 114, "frontend_question_id": "2027", "is_new_question": false }, @@ -16266,8 +16350,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": 1012, - "total_submitted": 2382, + "total_acs": 1017, + "total_submitted": 2400, "total_column_articles": 27, "frontend_question_id": "2004", "is_new_question": false @@ -16287,8 +16371,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": 19881, - "total_submitted": 35643, + "total_acs": 19885, + "total_submitted": 35652, "total_column_articles": 179, "frontend_question_id": "2039", "is_new_question": false @@ -16308,8 +16392,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": 1723, - "total_submitted": 5145, + "total_acs": 1728, + "total_submitted": 5154, "total_column_articles": 32, "frontend_question_id": "2040", "is_new_question": false @@ -16329,9 +16413,9 @@ "question__title": "Remove Colored Pieces if Both Neighbors are the Same Color", "question__title_slug": "remove-colored-pieces-if-both-neighbors-are-the-same-color", "question__hide": false, - "total_acs": 34153, - "total_submitted": 53752, - "total_column_articles": 447, + "total_acs": 34170, + "total_submitted": 53785, + "total_column_articles": 448, "frontend_question_id": "2038", "is_new_question": false }, @@ -16350,9 +16434,9 @@ "question__title": "Minimum Number of Moves to Seat Everyone", "question__title_slug": "minimum-number-of-moves-to-seat-everyone", "question__hide": false, - "total_acs": 7712, - "total_submitted": 9380, - "total_column_articles": 118, + "total_acs": 7776, + "total_submitted": 9455, + "total_column_articles": 120, "frontend_question_id": "2037", "is_new_question": false }, @@ -16371,8 +16455,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": 1651, - "total_submitted": 4466, + "total_acs": 1652, + "total_submitted": 4469, "total_column_articles": 43, "frontend_question_id": "2019", "is_new_question": false @@ -16392,9 +16476,9 @@ "question__title": "Check if Word Can Be Placed In Crossword", "question__title_slug": "check-if-word-can-be-placed-in-crossword", "question__hide": false, - "total_acs": 2854, - "total_submitted": 6846, - "total_column_articles": 63, + "total_acs": 2885, + "total_submitted": 6894, + "total_column_articles": 64, "frontend_question_id": "2018", "is_new_question": false }, @@ -16413,8 +16497,8 @@ "question__title": "Grid Game", "question__title_slug": "grid-game", "question__hide": false, - "total_acs": 5243, - "total_submitted": 13881, + "total_acs": 5267, + "total_submitted": 13928, "total_column_articles": 120, "frontend_question_id": "2017", "is_new_question": false @@ -16434,8 +16518,8 @@ "question__title": "Maximum Difference Between Increasing Elements", "question__title_slug": "maximum-difference-between-increasing-elements", "question__hide": false, - "total_acs": 43033, - "total_submitted": 71940, + "total_acs": 43105, + "total_submitted": 72074, "total_column_articles": 495, "frontend_question_id": "2016", "is_new_question": false @@ -16455,8 +16539,8 @@ "question__title": "Count the Number of Experiments", "question__title_slug": "count-the-number-of-experiments", "question__hide": false, - "total_acs": 1988, - "total_submitted": 4231, + "total_acs": 2000, + "total_submitted": 4260, "total_column_articles": 24, "frontend_question_id": "1990", "is_new_question": false @@ -16497,8 +16581,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": 223, - "total_submitted": 504, + "total_acs": 226, + "total_submitted": 507, "total_column_articles": 15, "frontend_question_id": "1999", "is_new_question": false @@ -16518,8 +16602,8 @@ "question__title": "Longest Subsequence Repeated k Times", "question__title_slug": "longest-subsequence-repeated-k-times", "question__hide": false, - "total_acs": 2077, - "total_submitted": 3812, + "total_acs": 2085, + "total_submitted": 3826, "total_column_articles": 30, "frontend_question_id": "2014", "is_new_question": false @@ -16539,8 +16623,8 @@ "question__title": "Detect Squares", "question__title_slug": "detect-squares", "question__hide": false, - "total_acs": 21126, - "total_submitted": 37326, + "total_acs": 21148, + "total_submitted": 37357, "total_column_articles": 240, "frontend_question_id": "2013", "is_new_question": false @@ -16560,9 +16644,9 @@ "question__title": "Sum of Beauty in the Array", "question__title_slug": "sum-of-beauty-in-the-array", "question__hide": false, - "total_acs": 5501, - "total_submitted": 14301, - "total_column_articles": 95, + "total_acs": 5518, + "total_submitted": 14332, + "total_column_articles": 97, "frontend_question_id": "2012", "is_new_question": false }, @@ -16581,9 +16665,9 @@ "question__title": "Final Value of Variable After Performing Operations", "question__title_slug": "final-value-of-variable-after-performing-operations", "question__hide": false, - "total_acs": 19528, - "total_submitted": 22629, - "total_column_articles": 233, + "total_acs": 19662, + "total_submitted": 22772, + "total_column_articles": 235, "frontend_question_id": "2011", "is_new_question": false }, @@ -16602,9 +16686,9 @@ "question__title": "Find Cutoff Score for Each School", "question__title_slug": "find-cutoff-score-for-each-school", "question__hide": false, - "total_acs": 3565, - "total_submitted": 5473, - "total_column_articles": 50, + "total_acs": 3599, + "total_submitted": 5529, + "total_column_articles": 53, "frontend_question_id": "1988", "is_new_question": false }, @@ -16623,8 +16707,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": 2084, - "total_submitted": 7205, + "total_acs": 2120, + "total_submitted": 7293, "total_column_articles": 55, "frontend_question_id": "2025", "is_new_question": false @@ -16644,9 +16728,9 @@ "question__title": "Maximize the Confusion of an Exam", "question__title_slug": "maximize-the-confusion-of-an-exam", "question__hide": false, - "total_acs": 37114, - "total_submitted": 64709, - "total_column_articles": 429, + "total_acs": 37194, + "total_submitted": 64871, + "total_column_articles": 430, "frontend_question_id": "2024", "is_new_question": false }, @@ -16665,8 +16749,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": 5354, - "total_submitted": 7240, + "total_acs": 5382, + "total_submitted": 7277, "total_column_articles": 94, "frontend_question_id": "2023", "is_new_question": false @@ -16686,8 +16770,8 @@ "question__title": "Convert 1D Array Into 2D Array", "question__title_slug": "convert-1d-array-into-2d-array", "question__hide": false, - "total_acs": 38053, - "total_submitted": 57519, + "total_acs": 38125, + "total_submitted": 57625, "total_column_articles": 461, "frontend_question_id": "2022", "is_new_question": false @@ -16707,8 +16791,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": 2611, - "total_submitted": 6280, + "total_acs": 2621, + "total_submitted": 6302, "total_column_articles": 56, "frontend_question_id": "2003", "is_new_question": false @@ -16728,8 +16812,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": 5252, - "total_submitted": 8825, + "total_acs": 5282, + "total_submitted": 8861, "total_column_articles": 118, "frontend_question_id": "2002", "is_new_question": false @@ -16749,8 +16833,8 @@ "question__title": "Number of Pairs of Interchangeable Rectangles", "question__title_slug": "number-of-pairs-of-interchangeable-rectangles", "question__hide": false, - "total_acs": 7678, - "total_submitted": 20126, + "total_acs": 7702, + "total_submitted": 20158, "total_column_articles": 159, "frontend_question_id": "2001", "is_new_question": false @@ -16770,9 +16854,9 @@ "question__title": "Reverse Prefix of Word", "question__title_slug": "reverse-prefix-of-word", "question__hide": false, - "total_acs": 35158, - "total_submitted": 45085, - "total_column_articles": 444, + "total_acs": 35273, + "total_submitted": 45229, + "total_column_articles": 447, "frontend_question_id": "2000", "is_new_question": false }, @@ -16791,8 +16875,8 @@ "question__title": "Employees Whose Manager Left the Company", "question__title_slug": "employees-whose-manager-left-the-company", "question__hide": false, - "total_acs": 2318, - "total_submitted": 4453, + "total_acs": 2344, + "total_submitted": 4521, "total_column_articles": 24, "frontend_question_id": "1978", "is_new_question": false @@ -16812,8 +16896,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": 398, - "total_submitted": 674, + "total_acs": 400, + "total_submitted": 680, "total_column_articles": 20, "frontend_question_id": "1973", "is_new_question": false @@ -16833,9 +16917,9 @@ "question__title": "GCD Sort of an Array", "question__title_slug": "gcd-sort-of-an-array", "question__hide": false, - "total_acs": 2567, - "total_submitted": 5744, - "total_column_articles": 48, + "total_acs": 2582, + "total_submitted": 5778, + "total_column_articles": 49, "frontend_question_id": "1998", "is_new_question": false }, @@ -16854,9 +16938,9 @@ "question__title": "First Day Where You Have Been in All the Rooms", "question__title_slug": "first-day-where-you-have-been-in-all-the-rooms", "question__hide": false, - "total_acs": 3132, - "total_submitted": 8974, - "total_column_articles": 50, + "total_acs": 3154, + "total_submitted": 9024, + "total_column_articles": 52, "frontend_question_id": "1997", "is_new_question": false }, @@ -16875,8 +16959,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": 28373, - "total_submitted": 68386, + "total_acs": 28408, + "total_submitted": 68498, "total_column_articles": 298, "frontend_question_id": "1996", "is_new_question": false @@ -16896,8 +16980,8 @@ "question__title": "Count Special Quadruplets", "question__title_slug": "count-special-quadruplets", "question__hide": false, - "total_acs": 35819, - "total_submitted": 54036, + "total_acs": 35877, + "total_submitted": 54125, "total_column_articles": 276, "frontend_question_id": "1995", "is_new_question": false @@ -16917,9 +17001,9 @@ "question__title": "Find if Path Exists in Graph", "question__title_slug": "find-if-path-exists-in-graph", "question__hide": false, - "total_acs": 7146, - "total_submitted": 15752, - "total_column_articles": 124, + "total_acs": 7299, + "total_submitted": 16108, + "total_column_articles": 127, "frontend_question_id": "1971", "is_new_question": false }, @@ -16938,8 +17022,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": 1973, - "total_submitted": 4521, + "total_acs": 2007, + "total_submitted": 4596, "total_column_articles": 37, "frontend_question_id": "1972", "is_new_question": false @@ -16959,8 +17043,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": 2574, - "total_submitted": 6101, + "total_acs": 2585, + "total_submitted": 6130, "total_column_articles": 67, "frontend_question_id": "2009", "is_new_question": false @@ -16980,9 +17064,9 @@ "question__title": "Maximum Earnings From Taxi", "question__title_slug": "maximum-earnings-from-taxi", "question__hide": false, - "total_acs": 5189, - "total_submitted": 11371, - "total_column_articles": 89, + "total_acs": 5239, + "total_submitted": 11479, + "total_column_articles": 91, "frontend_question_id": "2008", "is_new_question": false }, @@ -17001,9 +17085,9 @@ "question__title": "Find Original Array From Doubled Array", "question__title_slug": "find-original-array-from-doubled-array", "question__hide": false, - "total_acs": 5826, - "total_submitted": 17524, - "total_column_articles": 116, + "total_acs": 5874, + "total_submitted": 17630, + "total_column_articles": 118, "frontend_question_id": "2007", "is_new_question": false }, @@ -17022,9 +17106,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": 49439, - "total_submitted": 58459, - "total_column_articles": 495, + "total_acs": 49609, + "total_submitted": 58686, + "total_column_articles": 498, "frontend_question_id": "2006", "is_new_question": false }, @@ -17043,9 +17127,9 @@ "question__title": "Number of Unique Good Subsequences", "question__title_slug": "number-of-unique-good-subsequences", "question__hide": false, - "total_acs": 2175, - "total_submitted": 4390, - "total_column_articles": 37, + "total_acs": 2180, + "total_submitted": 4398, + "total_column_articles": 38, "frontend_question_id": "1987", "is_new_question": false }, @@ -17064,8 +17148,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": 5649, - "total_submitted": 18107, + "total_acs": 5669, + "total_submitted": 18183, "total_column_articles": 100, "frontend_question_id": "1986", "is_new_question": false @@ -17085,9 +17169,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": 9808, - "total_submitted": 23336, - "total_column_articles": 138, + "total_acs": 9873, + "total_submitted": 23472, + "total_column_articles": 139, "frontend_question_id": "1985", "is_new_question": false }, @@ -17106,9 +17190,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": 43154, - "total_submitted": 69314, - "total_column_articles": 521, + "total_acs": 43235, + "total_submitted": 69455, + "total_column_articles": 522, "frontend_question_id": "1984", "is_new_question": false }, @@ -17128,7 +17212,7 @@ "question__title_slug": "binary-searchable-numbers-in-an-unsorted-array", "question__hide": false, "total_acs": 193, - "total_submitted": 305, + "total_submitted": 307, "total_column_articles": 10, "frontend_question_id": "1966", "is_new_question": false @@ -17148,9 +17232,9 @@ "question__title": "Employees With Missing Information", "question__title_slug": "employees-with-missing-information", "question__hide": false, - "total_acs": 29410, - "total_submitted": 40660, - "total_column_articles": 210, + "total_acs": 30027, + "total_submitted": 41522, + "total_column_articles": 213, "frontend_question_id": "1965", "is_new_question": false }, @@ -17169,8 +17253,8 @@ "question__title": "Find Array Given Subset Sums", "question__title_slug": "find-array-given-subset-sums", "question__hide": false, - "total_acs": 1306, - "total_submitted": 2798, + "total_acs": 1308, + "total_submitted": 2808, "total_column_articles": 26, "frontend_question_id": "1982", "is_new_question": false @@ -17190,8 +17274,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": 6290, - "total_submitted": 19448, + "total_acs": 6306, + "total_submitted": 19506, "total_column_articles": 100, "frontend_question_id": "1981", "is_new_question": false @@ -17211,8 +17295,8 @@ "question__title": "Find Unique Binary String", "question__title_slug": "find-unique-binary-string", "question__hide": false, - "total_acs": 7921, - "total_submitted": 13301, + "total_acs": 7931, + "total_submitted": 13316, "total_column_articles": 136, "frontend_question_id": "1980", "is_new_question": false @@ -17232,9 +17316,9 @@ "question__title": "Find Greatest Common Divisor of Array", "question__title_slug": "find-greatest-common-divisor-of-array", "question__hide": false, - "total_acs": 17422, - "total_submitted": 22468, - "total_column_articles": 227, + "total_acs": 17569, + "total_submitted": 22664, + "total_column_articles": 229, "frontend_question_id": "1979", "is_new_question": false }, @@ -17253,8 +17337,8 @@ "question__title": "The Number of Good Subsets", "question__title_slug": "the-number-of-good-subsets", "question__hide": false, - "total_acs": 15863, - "total_submitted": 27958, + "total_acs": 15890, + "total_submitted": 28029, "total_column_articles": 178, "frontend_question_id": "1994", "is_new_question": false @@ -17274,9 +17358,9 @@ "question__title": "Operations on Tree", "question__title_slug": "operations-on-tree", "question__hide": false, - "total_acs": 2931, - "total_submitted": 7412, - "total_column_articles": 62, + "total_acs": 2944, + "total_submitted": 7448, + "total_column_articles": 63, "frontend_question_id": "1993", "is_new_question": false }, @@ -17295,8 +17379,8 @@ "question__title": "Find All Groups of Farmland", "question__title_slug": "find-all-groups-of-farmland", "question__hide": false, - "total_acs": 5090, - "total_submitted": 8436, + "total_acs": 5116, + "total_submitted": 8471, "total_column_articles": 110, "frontend_question_id": "1992", "is_new_question": false @@ -17316,8 +17400,8 @@ "question__title": "Find the Middle Index in Array", "question__title_slug": "find-the-middle-index-in-array", "question__hide": false, - "total_acs": 16115, - "total_submitted": 25095, + "total_acs": 16305, + "total_submitted": 25391, "total_column_articles": 237, "frontend_question_id": "1991", "is_new_question": false @@ -17337,8 +17421,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": 3141, - "total_submitted": 6345, + "total_acs": 3145, + "total_submitted": 6358, "total_column_articles": 66, "frontend_question_id": "1970", "is_new_question": false @@ -17358,9 +17442,9 @@ "question__title": "Minimum Non-Zero Product of the Array Elements", "question__title_slug": "minimum-non-zero-product-of-the-array-elements", "question__hide": false, - "total_acs": 3586, - "total_submitted": 12126, - "total_column_articles": 54, + "total_acs": 3600, + "total_submitted": 12158, + "total_column_articles": 55, "frontend_question_id": "1969", "is_new_question": false }, @@ -17379,8 +17463,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": 10223, - "total_submitted": 12925, + "total_acs": 10277, + "total_submitted": 12993, "total_column_articles": 137, "frontend_question_id": "1967", "is_new_question": false @@ -17400,9 +17484,9 @@ "question__title": "All the Pairs With the Maximum Number of Common Followers", "question__title_slug": "all-the-pairs-with-the-maximum-number-of-common-followers", "question__hide": false, - "total_acs": 2944, - "total_submitted": 4430, - "total_column_articles": 45, + "total_acs": 2974, + "total_submitted": 4469, + "total_column_articles": 46, "frontend_question_id": "1951", "is_new_question": false }, @@ -17421,9 +17505,9 @@ "question__title": "Strong Friendship", "question__title_slug": "strong-friendship", "question__hide": false, - "total_acs": 2637, - "total_submitted": 4895, - "total_column_articles": 40, + "total_acs": 2673, + "total_submitted": 4951, + "total_column_articles": 41, "frontend_question_id": "1949", "is_new_question": false }, @@ -17442,9 +17526,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": 4094, - "total_submitted": 9978, - "total_column_articles": 61, + "total_acs": 4117, + "total_submitted": 10006, + "total_column_articles": 62, "frontend_question_id": "1964", "is_new_question": false }, @@ -17463,8 +17547,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": 6173, - "total_submitted": 9666, + "total_acs": 6208, + "total_submitted": 9708, "total_column_articles": 81, "frontend_question_id": "1963", "is_new_question": false @@ -17484,8 +17568,8 @@ "question__title": "Remove Stones to Minimize the Total", "question__title_slug": "remove-stones-to-minimize-the-total", "question__hide": false, - "total_acs": 7540, - "total_submitted": 16392, + "total_acs": 7574, + "total_submitted": 16458, "total_column_articles": 102, "frontend_question_id": "1962", "is_new_question": false @@ -17505,8 +17589,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": 11082, - "total_submitted": 20757, + "total_acs": 11131, + "total_submitted": 20866, "total_column_articles": 132, "frontend_question_id": "1961", "is_new_question": false @@ -17526,8 +17610,8 @@ "question__title": "Users That Actively Request Confirmation Messages", "question__title_slug": "users-that-actively-request-confirmation-messages", "question__hide": false, - "total_acs": 2202, - "total_submitted": 3699, + "total_acs": 2228, + "total_submitted": 3733, "total_column_articles": 23, "frontend_question_id": "1939", "is_new_question": false @@ -17547,8 +17631,8 @@ "question__title": "Number of Ways to Separate Numbers", "question__title_slug": "number-of-ways-to-separate-numbers", "question__hide": false, - "total_acs": 1369, - "total_submitted": 4730, + "total_acs": 1375, + "total_submitted": 4745, "total_column_articles": 24, "frontend_question_id": "1977", "is_new_question": false @@ -17568,8 +17652,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": 4871, - "total_submitted": 13684, + "total_acs": 4893, + "total_submitted": 13743, "total_column_articles": 90, "frontend_question_id": "1976", "is_new_question": false @@ -17589,9 +17673,9 @@ "question__title": "Maximum Matrix Sum", "question__title_slug": "maximum-matrix-sum", "question__hide": false, - "total_acs": 4560, - "total_submitted": 11197, - "total_column_articles": 65, + "total_acs": 4586, + "total_submitted": 11253, + "total_column_articles": 66, "frontend_question_id": "1975", "is_new_question": false }, @@ -17610,9 +17694,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": 7895, - "total_submitted": 11037, - "total_column_articles": 120, + "total_acs": 7945, + "total_submitted": 11104, + "total_column_articles": 121, "frontend_question_id": "1974", "is_new_question": false }, @@ -17631,8 +17715,8 @@ "question__title": "Confirmation Rate", "question__title_slug": "confirmation-rate", "question__hide": false, - "total_acs": 1580, - "total_submitted": 2176, + "total_acs": 1589, + "total_submitted": 2185, "total_column_articles": 28, "frontend_question_id": "1934", "is_new_question": false @@ -17652,9 +17736,9 @@ "question__title": "Count Number of Special Subsequences", "question__title_slug": "count-number-of-special-subsequences", "question__hide": false, - "total_acs": 3456, - "total_submitted": 6671, - "total_column_articles": 57, + "total_acs": 3474, + "total_submitted": 6698, + "total_column_articles": 58, "frontend_question_id": "1955", "is_new_question": false }, @@ -17673,8 +17757,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": 6008, - "total_submitted": 15613, + "total_acs": 6024, + "total_submitted": 15650, "total_column_articles": 91, "frontend_question_id": "1968", "is_new_question": false @@ -17694,9 +17778,9 @@ "question__title": "Maximum Number of Weeks for Which You Can Work", "question__title_slug": "maximum-number-of-weeks-for-which-you-can-work", "question__hide": false, - "total_acs": 5846, - "total_submitted": 16290, - "total_column_articles": 105, + "total_acs": 5873, + "total_submitted": 16354, + "total_column_articles": 106, "frontend_question_id": "1953", "is_new_question": false }, @@ -17715,9 +17799,9 @@ "question__title": "Three Divisors", "question__title_slug": "three-divisors", "question__hide": false, - "total_acs": 11962, - "total_submitted": 21981, - "total_column_articles": 143, + "total_acs": 12012, + "total_submitted": 22072, + "total_column_articles": 144, "frontend_question_id": "1952", "is_new_question": false }, @@ -17736,9 +17820,9 @@ "question__title": "Minimum Cost to Separate Sentence Into Rows", "question__title_slug": "minimum-cost-to-separate-sentence-into-rows", "question__hide": false, - "total_acs": 248, - "total_submitted": 523, - "total_column_articles": 18, + "total_acs": 254, + "total_submitted": 536, + "total_column_articles": 19, "frontend_question_id": "2052", "is_new_question": false }, @@ -17757,8 +17841,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": 2153, - "total_submitted": 4811, + "total_acs": 2169, + "total_submitted": 4841, "total_column_articles": 47, "frontend_question_id": "1959", "is_new_question": false @@ -17778,8 +17862,8 @@ "question__title": "Check if Move is Legal", "question__title_slug": "check-if-move-is-legal", "question__hide": false, - "total_acs": 3196, - "total_submitted": 7307, + "total_acs": 3210, + "total_submitted": 7336, "total_column_articles": 57, "frontend_question_id": "1958", "is_new_question": false @@ -17799,8 +17883,8 @@ "question__title": "Delete Duplicate Folders in System", "question__title_slug": "delete-duplicate-folders-in-system", "question__hide": false, - "total_acs": 1446, - "total_submitted": 2730, + "total_acs": 1450, + "total_submitted": 2734, "total_column_articles": 26, "frontend_question_id": "1948", "is_new_question": false @@ -17820,8 +17904,8 @@ "question__title": "Maximum Compatibility Score Sum", "question__title_slug": "maximum-compatibility-score-sum", "question__hide": false, - "total_acs": 5682, - "total_submitted": 9925, + "total_acs": 5712, + "total_submitted": 9966, "total_column_articles": 113, "frontend_question_id": "1947", "is_new_question": false @@ -17841,9 +17925,9 @@ "question__title": "Largest Number After Mutating Substring", "question__title_slug": "largest-number-after-mutating-substring", "question__hide": false, - "total_acs": 6727, - "total_submitted": 21278, - "total_column_articles": 98, + "total_acs": 6770, + "total_submitted": 21385, + "total_column_articles": 99, "frontend_question_id": "1946", "is_new_question": false }, @@ -17862,8 +17946,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": 10034, - "total_submitted": 15471, + "total_acs": 10090, + "total_submitted": 15556, "total_column_articles": 148, "frontend_question_id": "1945", "is_new_question": false @@ -17883,8 +17967,8 @@ "question__title": "Brightest Position on Street", "question__title_slug": "brightest-position-on-street", "question__hide": false, - "total_acs": 512, - "total_submitted": 820, + "total_acs": 517, + "total_submitted": 825, "total_column_articles": 19, "frontend_question_id": "2021", "is_new_question": false @@ -17904,8 +17988,8 @@ "question__title": "Erect the Fence II", "question__title_slug": "erect-the-fence-ii", "question__hide": false, - "total_acs": 159, - "total_submitted": 396, + "total_acs": 160, + "total_submitted": 398, "total_column_articles": 10, "frontend_question_id": "1924", "is_new_question": false @@ -17926,7 +18010,7 @@ "question__title_slug": "minimum-time-for-k-virus-variants-to-spread", "question__hide": false, "total_acs": 268, - "total_submitted": 723, + "total_submitted": 724, "total_column_articles": 14, "frontend_question_id": "1956", "is_new_question": false @@ -17946,8 +18030,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": 351, - "total_submitted": 680, + "total_acs": 352, + "total_submitted": 683, "total_column_articles": 13, "frontend_question_id": "1950", "is_new_question": false @@ -17967,8 +18051,8 @@ "question__title": "Longest Common Subsequence Between Sorted Arrays", "question__title_slug": "longest-common-subsequence-between-sorted-arrays", "question__hide": false, - "total_acs": 749, - "total_submitted": 1015, + "total_acs": 753, + "total_submitted": 1020, "total_column_articles": 36, "frontend_question_id": "1940", "is_new_question": false @@ -17988,9 +18072,9 @@ "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": 910, - "total_submitted": 1828, - "total_column_articles": 36, + "total_acs": 920, + "total_submitted": 1846, + "total_column_articles": 37, "frontend_question_id": "1933", "is_new_question": false }, @@ -18009,8 +18093,8 @@ "question__title": "Kth Smallest Subarray Sum", "question__title_slug": "kth-smallest-subarray-sum", "question__hide": false, - "total_acs": 634, - "total_submitted": 1326, + "total_acs": 635, + "total_submitted": 1333, "total_column_articles": 9, "frontend_question_id": "1918", "is_new_question": false @@ -18030,9 +18114,9 @@ "question__title": "Maximum Genetic Difference Query", "question__title_slug": "maximum-genetic-difference-query", "question__hide": false, - "total_acs": 1519, - "total_submitted": 4059, - "total_column_articles": 48, + "total_acs": 1525, + "total_submitted": 4069, + "total_column_articles": 49, "frontend_question_id": "1938", "is_new_question": false }, @@ -18051,9 +18135,9 @@ "question__title": "Maximum Number of Points with Cost", "question__title_slug": "maximum-number-of-points-with-cost", "question__hide": false, - "total_acs": 4563, - "total_submitted": 16409, - "total_column_articles": 79, + "total_acs": 4594, + "total_submitted": 16473, + "total_column_articles": 80, "frontend_question_id": "1937", "is_new_question": false }, @@ -18072,9 +18156,9 @@ "question__title": "Add Minimum Number of Rungs", "question__title_slug": "add-minimum-number-of-rungs", "question__hide": false, - "total_acs": 7629, - "total_submitted": 16643, - "total_column_articles": 99, + "total_acs": 7662, + "total_submitted": 16714, + "total_column_articles": 100, "frontend_question_id": "1936", "is_new_question": false }, @@ -18093,8 +18177,8 @@ "question__title": "Check for Contradictions in Equations", "question__title_slug": "check-for-contradictions-in-equations", "question__hide": false, - "total_acs": 119, - "total_submitted": 284, + "total_acs": 121, + "total_submitted": 286, "total_column_articles": 4, "frontend_question_id": "2307", "is_new_question": false @@ -18114,8 +18198,8 @@ "question__title": "Leetcodify Similar Friends", "question__title_slug": "leetcodify-similar-friends", "question__hide": false, - "total_acs": 1523, - "total_submitted": 3558, + "total_acs": 1532, + "total_submitted": 3581, "total_column_articles": 35, "frontend_question_id": "1919", "is_new_question": false @@ -18135,8 +18219,8 @@ "question__title": "Leetcodify Friends Recommendations", "question__title_slug": "leetcodify-friends-recommendations", "question__hide": false, - "total_acs": 1623, - "total_submitted": 5061, + "total_acs": 1628, + "total_submitted": 5097, "total_column_articles": 23, "frontend_question_id": "1917", "is_new_question": false @@ -18156,8 +18240,8 @@ "question__title": "Game of Nim", "question__title_slug": "game-of-nim", "question__hide": false, - "total_acs": 464, - "total_submitted": 725, + "total_acs": 470, + "total_submitted": 735, "total_column_articles": 18, "frontend_question_id": "1908", "is_new_question": false @@ -18177,8 +18261,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": 2823, - "total_submitted": 4818, + "total_acs": 2833, + "total_submitted": 4830, "total_column_articles": 83, "frontend_question_id": "1931", "is_new_question": false @@ -18198,9 +18282,9 @@ "question__title": "Merge BSTs to Create Single BST", "question__title_slug": "merge-bsts-to-create-single-bst", "question__hide": false, - "total_acs": 1800, - "total_submitted": 5379, - "total_column_articles": 50, + "total_acs": 1808, + "total_submitted": 5464, + "total_column_articles": 51, "frontend_question_id": "1932", "is_new_question": false }, @@ -18219,8 +18303,8 @@ "question__title": "Unique Length-3 Palindromic Subsequences", "question__title_slug": "unique-length-3-palindromic-subsequences", "question__hide": false, - "total_acs": 7307, - "total_submitted": 14773, + "total_acs": 7344, + "total_submitted": 14850, "total_column_articles": 135, "frontend_question_id": "1930", "is_new_question": false @@ -18240,9 +18324,9 @@ "question__title": "Concatenation of Array", "question__title_slug": "concatenation-of-array", "question__hide": false, - "total_acs": 32207, - "total_submitted": 37251, - "total_column_articles": 287, + "total_acs": 32390, + "total_submitted": 37455, + "total_column_articles": 291, "frontend_question_id": "1929", "is_new_question": false }, @@ -18261,8 +18345,8 @@ "question__title": "Count Salary Categories", "question__title_slug": "count-salary-categories", "question__hide": false, - "total_acs": 2073, - "total_submitted": 3381, + "total_acs": 2082, + "total_submitted": 3390, "total_column_articles": 37, "frontend_question_id": "1907", "is_new_question": false @@ -18282,8 +18366,8 @@ "question__title": "Jump Game VIII", "question__title_slug": "jump-game-viii", "question__hide": false, - "total_acs": 135, - "total_submitted": 216, + "total_acs": 136, + "total_submitted": 219, "total_column_articles": 9, "frontend_question_id": "2297", "is_new_question": false @@ -18303,8 +18387,8 @@ "question__title": "Describe the Painting", "question__title_slug": "describe-the-painting", "question__hide": false, - "total_acs": 2780, - "total_submitted": 6424, + "total_acs": 2802, + "total_submitted": 6470, "total_column_articles": 73, "frontend_question_id": "1943", "is_new_question": false @@ -18324,8 +18408,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": 4488, - "total_submitted": 10922, + "total_acs": 4507, + "total_submitted": 10963, "total_column_articles": 100, "frontend_question_id": "1942", "is_new_question": false @@ -18345,9 +18429,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": 10482, - "total_submitted": 14221, - "total_column_articles": 159, + "total_acs": 10587, + "total_submitted": 14396, + "total_column_articles": 162, "frontend_question_id": "1941", "is_new_question": false }, @@ -18366,8 +18450,8 @@ "question__title": "Depth of BST Given Insertion Order", "question__title_slug": "depth-of-bst-given-insertion-order", "question__hide": false, - "total_acs": 348, - "total_submitted": 713, + "total_acs": 350, + "total_submitted": 718, "total_column_articles": 13, "frontend_question_id": "1902", "is_new_question": false @@ -18387,8 +18471,8 @@ "question__title": "Longest Common Subpath", "question__title_slug": "longest-common-subpath", "question__hide": false, - "total_acs": 2285, - "total_submitted": 8789, + "total_acs": 2305, + "total_submitted": 8864, "total_column_articles": 43, "frontend_question_id": "1923", "is_new_question": false @@ -18408,8 +18492,8 @@ "question__title": "Count Good Numbers", "question__title_slug": "count-good-numbers", "question__hide": false, - "total_acs": 6205, - "total_submitted": 17243, + "total_acs": 6226, + "total_submitted": 17297, "total_column_articles": 94, "frontend_question_id": "1922", "is_new_question": false @@ -18429,8 +18513,8 @@ "question__title": "Eliminate Maximum Number of Monsters", "question__title_slug": "eliminate-maximum-number-of-monsters", "question__hide": false, - "total_acs": 7520, - "total_submitted": 20682, + "total_acs": 7550, + "total_submitted": 20770, "total_column_articles": 120, "frontend_question_id": "1921", "is_new_question": false @@ -18450,9 +18534,9 @@ "question__title": "Build Array from Permutation", "question__title_slug": "build-array-from-permutation", "question__hide": false, - "total_acs": 28730, - "total_submitted": 32962, - "total_column_articles": 267, + "total_acs": 28905, + "total_submitted": 33156, + "total_column_articles": 270, "frontend_question_id": "1920", "is_new_question": false }, @@ -18471,9 +18555,9 @@ "question__title": "Find a Peak Element II", "question__title_slug": "find-a-peak-element-ii", "question__hide": false, - "total_acs": 5784, - "total_submitted": 9790, - "total_column_articles": 113, + "total_acs": 5884, + "total_submitted": 9977, + "total_column_articles": 115, "frontend_question_id": "1901", "is_new_question": false }, @@ -18492,8 +18576,8 @@ "question__title": "Page Recommendations II", "question__title_slug": "page-recommendations-ii", "question__hide": false, - "total_acs": 1725, - "total_submitted": 4722, + "total_acs": 1743, + "total_submitted": 4773, "total_column_articles": 29, "frontend_question_id": "1892", "is_new_question": false @@ -18513,9 +18597,9 @@ "question__title": "Cutting Ribbons", "question__title_slug": "cutting-ribbons", "question__hide": false, - "total_acs": 3978, - "total_submitted": 9560, - "total_column_articles": 45, + "total_acs": 4009, + "total_submitted": 9626, + "total_column_articles": 46, "frontend_question_id": "1891", "is_new_question": false }, @@ -18534,8 +18618,8 @@ "question__title": "Number of Wonderful Substrings", "question__title_slug": "number-of-wonderful-substrings", "question__hide": false, - "total_acs": 4087, - "total_submitted": 9528, + "total_acs": 4106, + "total_submitted": 9569, "total_column_articles": 74, "frontend_question_id": "1915", "is_new_question": false @@ -18555,9 +18639,9 @@ "question__title": "Cyclically Rotating a Grid", "question__title_slug": "cyclically-rotating-a-grid", "question__hide": false, - "total_acs": 3959, - "total_submitted": 8642, - "total_column_articles": 89, + "total_acs": 3971, + "total_submitted": 8662, + "total_column_articles": 90, "frontend_question_id": "1914", "is_new_question": false }, @@ -18576,9 +18660,9 @@ "question__title": "Maximum Product Difference Between Two Pairs", "question__title_slug": "maximum-product-difference-between-two-pairs", "question__hide": false, - "total_acs": 16250, - "total_submitted": 19835, - "total_column_articles": 197, + "total_acs": 16322, + "total_submitted": 19918, + "total_column_articles": 200, "frontend_question_id": "1913", "is_new_question": false }, @@ -18597,9 +18681,9 @@ "question__title": "The Latest Login in 2020", "question__title_slug": "the-latest-login-in-2020", "question__hide": false, - "total_acs": 18649, - "total_submitted": 26294, - "total_column_articles": 139, + "total_acs": 19037, + "total_submitted": 26869, + "total_column_articles": 140, "frontend_question_id": "1890", "is_new_question": false }, @@ -18618,9 +18702,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": 4643, - "total_submitted": 10240, - "total_column_articles": 69, + "total_acs": 4675, + "total_submitted": 10320, + "total_column_articles": 70, "frontend_question_id": "1928", "is_new_question": false }, @@ -18639,8 +18723,8 @@ "question__title": "Sum Game", "question__title_slug": "sum-game", "question__hide": false, - "total_acs": 2670, - "total_submitted": 6214, + "total_acs": 2682, + "total_submitted": 6235, "total_column_articles": 61, "frontend_question_id": "1927", "is_new_question": false @@ -18660,9 +18744,9 @@ "question__title": "Nearest Exit from Entrance in Maze", "question__title_slug": "nearest-exit-from-entrance-in-maze", "question__hide": false, - "total_acs": 8903, - "total_submitted": 22815, - "total_column_articles": 145, + "total_acs": 8996, + "total_submitted": 23004, + "total_column_articles": 147, "frontend_question_id": "1926", "is_new_question": false }, @@ -18681,9 +18765,9 @@ "question__title": "Count Square Sum Triples", "question__title_slug": "count-square-sum-triples", "question__hide": false, - "total_acs": 9819, - "total_submitted": 14073, - "total_column_articles": 130, + "total_acs": 9895, + "total_submitted": 14187, + "total_column_articles": 131, "frontend_question_id": "1925", "is_new_question": false }, @@ -18702,8 +18786,8 @@ "question__title": "Count Pairs in Two Arrays", "question__title_slug": "count-pairs-in-two-arrays", "question__hide": false, - "total_acs": 1049, - "total_submitted": 1816, + "total_acs": 1059, + "total_submitted": 1836, "total_column_articles": 28, "frontend_question_id": "1885", "is_new_question": false @@ -18723,9 +18807,9 @@ "question__title": "Count Sub Islands", "question__title_slug": "count-sub-islands", "question__hide": false, - "total_acs": 20274, - "total_submitted": 30304, - "total_column_articles": 336, + "total_acs": 20460, + "total_submitted": 30569, + "total_column_articles": 339, "frontend_question_id": "1905", "is_new_question": false }, @@ -18744,9 +18828,9 @@ "question__title": "Minimum Absolute Difference Queries", "question__title_slug": "minimum-absolute-difference-queries", "question__hide": false, - "total_acs": 3494, - "total_submitted": 7950, - "total_column_articles": 68, + "total_acs": 3519, + "total_submitted": 7995, + "total_column_articles": 69, "frontend_question_id": "1906", "is_new_question": false }, @@ -18765,8 +18849,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": 5143, - "total_submitted": 16801, + "total_acs": 5153, + "total_submitted": 16823, "total_column_articles": 99, "frontend_question_id": "1904", "is_new_question": false @@ -18786,9 +18870,9 @@ "question__title": "Largest Odd Number in String", "question__title_slug": "largest-odd-number-in-string", "question__hide": false, - "total_acs": 13888, - "total_submitted": 22627, - "total_column_articles": 177, + "total_acs": 13979, + "total_submitted": 22809, + "total_column_articles": 180, "frontend_question_id": "1903", "is_new_question": false }, @@ -18807,9 +18891,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": 6469, - "total_submitted": 9300, - "total_column_articles": 92, + "total_acs": 6516, + "total_submitted": 9375, + "total_column_articles": 93, "frontend_question_id": "1884", "is_new_question": false }, @@ -18828,8 +18912,8 @@ "question__title": "Group Employees of the Same Salary", "question__title_slug": "group-employees-of-the-same-salary", "question__hide": false, - "total_acs": 1816, - "total_submitted": 2835, + "total_acs": 1830, + "total_submitted": 2853, "total_column_articles": 40, "frontend_question_id": "1875", "is_new_question": false @@ -18849,8 +18933,8 @@ "question__title": "Minimize Product Sum of Two Arrays", "question__title_slug": "minimize-product-sum-of-two-arrays", "question__hide": false, - "total_acs": 887, - "total_submitted": 1029, + "total_acs": 898, + "total_submitted": 1042, "total_column_articles": 33, "frontend_question_id": "1874", "is_new_question": false @@ -18870,8 +18954,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": 1660, - "total_submitted": 3681, + "total_acs": 1662, + "total_submitted": 3685, "total_column_articles": 44, "frontend_question_id": "1900", "is_new_question": false @@ -18891,8 +18975,8 @@ "question__title": "Maximum Number of Removable Characters", "question__title_slug": "maximum-number-of-removable-characters", "question__hide": false, - "total_acs": 7337, - "total_submitted": 20251, + "total_acs": 7409, + "total_submitted": 20397, "total_column_articles": 105, "frontend_question_id": "1898", "is_new_question": false @@ -18912,8 +18996,8 @@ "question__title": "Merge Triplets to Form Target Triplet", "question__title_slug": "merge-triplets-to-form-target-triplet", "question__hide": false, - "total_acs": 4953, - "total_submitted": 7678, + "total_acs": 4974, + "total_submitted": 7708, "total_column_articles": 66, "frontend_question_id": "1899", "is_new_question": false @@ -18933,9 +19017,9 @@ "question__title": "Redistribute Characters to Make All Strings Equal", "question__title_slug": "redistribute-characters-to-make-all-strings-equal", "question__hide": false, - "total_acs": 9498, - "total_submitted": 17210, - "total_column_articles": 128, + "total_acs": 9551, + "total_submitted": 17319, + "total_column_articles": 129, "frontend_question_id": "1897", "is_new_question": false }, @@ -18954,9 +19038,9 @@ "question__title": "Calculate Special Bonus", "question__title_slug": "calculate-special-bonus", "question__hide": false, - "total_acs": 52539, - "total_submitted": 81400, - "total_column_articles": 271, + "total_acs": 53650, + "total_submitted": 83212, + "total_column_articles": 273, "frontend_question_id": "1873", "is_new_question": false }, @@ -18975,9 +19059,9 @@ "question__title": "Design Movie Rental System", "question__title_slug": "design-movie-rental-system", "question__hide": false, - "total_acs": 3756, - "total_submitted": 15994, - "total_column_articles": 74, + "total_acs": 3779, + "total_submitted": 16132, + "total_column_articles": 75, "frontend_question_id": "1912", "is_new_question": false }, @@ -18996,8 +19080,8 @@ "question__title": "Maximum Alternating Subsequence Sum", "question__title_slug": "maximum-alternating-subsequence-sum", "question__hide": false, - "total_acs": 5597, - "total_submitted": 9665, + "total_acs": 5626, + "total_submitted": 9708, "total_column_articles": 104, "frontend_question_id": "1911", "is_new_question": false @@ -19017,9 +19101,9 @@ "question__title": "Remove All Occurrences of a Substring", "question__title_slug": "remove-all-occurrences-of-a-substring", "question__hide": false, - "total_acs": 5754, - "total_submitted": 8659, - "total_column_articles": 110, + "total_acs": 5800, + "total_submitted": 8733, + "total_column_articles": 111, "frontend_question_id": "1910", "is_new_question": false }, @@ -19038,9 +19122,9 @@ "question__title": "Remove One Element to Make the Array Strictly Increasing", "question__title_slug": "remove-one-element-to-make-the-array-strictly-increasing", "question__hide": false, - "total_acs": 8564, - "total_submitted": 28086, - "total_column_articles": 144, + "total_acs": 8630, + "total_submitted": 28328, + "total_column_articles": 145, "frontend_question_id": "1909", "is_new_question": false }, @@ -19059,8 +19143,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": 2018, - "total_submitted": 4217, + "total_acs": 2035, + "total_submitted": 4245, "total_column_articles": 49, "frontend_question_id": "1868", "is_new_question": false @@ -19080,9 +19164,9 @@ "question__title": "Minimum Space Wasted From Packaging", "question__title_slug": "minimum-space-wasted-from-packaging", "question__hide": false, - "total_acs": 3322, - "total_submitted": 11549, - "total_column_articles": 63, + "total_acs": 3339, + "total_submitted": 11596, + "total_column_articles": 64, "frontend_question_id": "1889", "is_new_question": false }, @@ -19101,8 +19185,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": 3782, - "total_submitted": 10764, + "total_acs": 3807, + "total_submitted": 10806, "total_column_articles": 87, "frontend_question_id": "1888", "is_new_question": false @@ -19122,8 +19206,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": 7252, - "total_submitted": 11048, + "total_acs": 7267, + "total_submitted": 11070, "total_column_articles": 106, "frontend_question_id": "1887", "is_new_question": false @@ -19143,8 +19227,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": 9384, - "total_submitted": 15974, + "total_acs": 9452, + "total_submitted": 16088, "total_column_articles": 152, "frontend_question_id": "1886", "is_new_question": false @@ -19164,9 +19248,9 @@ "question__title": "Orders With Maximum Quantity Above Average", "question__title_slug": "orders-with-maximum-quantity-above-average", "question__hide": false, - "total_acs": 3628, - "total_submitted": 5217, - "total_column_articles": 44, + "total_acs": 3673, + "total_submitted": 5267, + "total_column_articles": 46, "frontend_question_id": "1867", "is_new_question": false }, @@ -19185,8 +19269,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": 2233, - "total_submitted": 5646, + "total_acs": 2241, + "total_submitted": 5666, "total_column_articles": 38, "frontend_question_id": "1883", "is_new_question": false @@ -19206,8 +19290,8 @@ "question__title": "Process Tasks Using Servers", "question__title_slug": "process-tasks-using-servers", "question__hide": false, - "total_acs": 5063, - "total_submitted": 16912, + "total_acs": 5079, + "total_submitted": 16935, "total_column_articles": 143, "frontend_question_id": "1882", "is_new_question": false @@ -19227,8 +19311,8 @@ "question__title": "Maximum Value after Insertion", "question__title_slug": "maximum-value-after-insertion", "question__hide": false, - "total_acs": 8178, - "total_submitted": 21956, + "total_acs": 8206, + "total_submitted": 22032, "total_column_articles": 89, "frontend_question_id": "1881", "is_new_question": false @@ -19248,9 +19332,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": 11193, - "total_submitted": 14644, - "total_column_articles": 182, + "total_acs": 11247, + "total_submitted": 14719, + "total_column_articles": 183, "frontend_question_id": "1880", "is_new_question": false }, @@ -19269,8 +19353,8 @@ "question__title": "Longest Word With All Prefixes", "question__title_slug": "longest-word-with-all-prefixes", "question__hide": false, - "total_acs": 936, - "total_submitted": 1426, + "total_acs": 941, + "total_submitted": 1435, "total_column_articles": 38, "frontend_question_id": "1858", "is_new_question": false @@ -19290,8 +19374,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": 1178, - "total_submitted": 2217, + "total_acs": 1181, + "total_submitted": 2260, "total_column_articles": 37, "frontend_question_id": "1896", "is_new_question": false @@ -19311,8 +19395,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": 156, - "total_submitted": 266, + "total_acs": 161, + "total_submitted": 271, "total_column_articles": 10, "frontend_question_id": "2247", "is_new_question": false @@ -19332,9 +19416,9 @@ "question__title": "Find the Student that Will Replace the Chalk", "question__title_slug": "find-the-student-that-will-replace-the-chalk", "question__hide": false, - "total_acs": 45793, - "total_submitted": 99840, - "total_column_articles": 599, + "total_acs": 45912, + "total_submitted": 100096, + "total_column_articles": 601, "frontend_question_id": "1894", "is_new_question": false }, @@ -19353,8 +19437,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": 37421, - "total_submitted": 63319, + "total_acs": 37473, + "total_submitted": 63421, "total_column_articles": 506, "frontend_question_id": "1893", "is_new_question": false @@ -19374,8 +19458,8 @@ "question__title": "Convert Date Format", "question__title_slug": "convert-date-format", "question__hide": false, - "total_acs": 2846, - "total_submitted": 4529, + "total_acs": 2863, + "total_submitted": 4551, "total_column_articles": 29, "frontend_question_id": "1853", "is_new_question": false @@ -19395,8 +19479,8 @@ "question__title": "Distinct Numbers in Each Subarray", "question__title_slug": "distinct-numbers-in-each-subarray", "question__hide": false, - "total_acs": 722, - "total_submitted": 1256, + "total_acs": 725, + "total_submitted": 1261, "total_column_articles": 20, "frontend_question_id": "1852", "is_new_question": false @@ -19416,8 +19500,8 @@ "question__title": "Stone Game VIII", "question__title_slug": "stone-game-viii", "question__hide": false, - "total_acs": 3008, - "total_submitted": 4827, + "total_acs": 3018, + "total_submitted": 4842, "total_column_articles": 42, "frontend_question_id": "1872", "is_new_question": false @@ -19437,8 +19521,8 @@ "question__title": "Jump Game VII", "question__title_slug": "jump-game-vii", "question__hide": false, - "total_acs": 8348, - "total_submitted": 29635, + "total_acs": 8365, + "total_submitted": 29689, "total_column_articles": 168, "frontend_question_id": "1871", "is_new_question": false @@ -19458,8 +19542,8 @@ "question__title": "Minimum Speed to Arrive on Time", "question__title_slug": "minimum-speed-to-arrive-on-time", "question__hide": false, - "total_acs": 11519, - "total_submitted": 26980, + "total_acs": 11591, + "total_submitted": 27182, "total_column_articles": 120, "frontend_question_id": "1870", "is_new_question": false @@ -19479,9 +19563,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": 16753, - "total_submitted": 23127, - "total_column_articles": 230, + "total_acs": 16793, + "total_submitted": 23190, + "total_column_articles": 231, "frontend_question_id": "1869", "is_new_question": false }, @@ -19500,8 +19584,8 @@ "question__title": "Suspicious Bank Accounts", "question__title_slug": "suspicious-bank-accounts", "question__hide": false, - "total_acs": 2190, - "total_submitted": 4816, + "total_acs": 2206, + "total_submitted": 4852, "total_column_articles": 39, "frontend_question_id": "1843", "is_new_question": false @@ -19521,8 +19605,8 @@ "question__title": "Next Palindrome Using Same Digits", "question__title_slug": "next-palindrome-using-same-digits", "question__hide": false, - "total_acs": 306, - "total_submitted": 556, + "total_acs": 308, + "total_submitted": 565, "total_column_articles": 18, "frontend_question_id": "1842", "is_new_question": false @@ -19542,8 +19626,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": 3303, - "total_submitted": 5391, + "total_acs": 3311, + "total_submitted": 5406, "total_column_articles": 68, "frontend_question_id": "1866", "is_new_question": false @@ -19563,9 +19647,9 @@ "question__title": "Finding Pairs With a Certain Sum", "question__title_slug": "finding-pairs-with-a-certain-sum", "question__hide": false, - "total_acs": 6722, - "total_submitted": 13271, - "total_column_articles": 82, + "total_acs": 6761, + "total_submitted": 13332, + "total_column_articles": 83, "frontend_question_id": "1865", "is_new_question": false }, @@ -19584,8 +19668,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": 6311, - "total_submitted": 15620, + "total_acs": 6332, + "total_submitted": 15665, "total_column_articles": 142, "frontend_question_id": "1864", "is_new_question": false @@ -19605,9 +19689,9 @@ "question__title": "Sum of All Subset XOR Totals", "question__title_slug": "sum-of-all-subset-xor-totals", "question__hide": false, - "total_acs": 19616, - "total_submitted": 23082, - "total_column_articles": 247, + "total_acs": 19692, + "total_submitted": 23194, + "total_column_articles": 249, "frontend_question_id": "1863", "is_new_question": false }, @@ -19626,8 +19710,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": 626, - "total_submitted": 986, + "total_acs": 630, + "total_submitted": 997, "total_column_articles": 30, "frontend_question_id": "2046", "is_new_question": false @@ -19647,8 +19731,8 @@ "question__title": "League Statistics", "question__title_slug": "league-statistics", "question__hide": false, - "total_acs": 2355, - "total_submitted": 4443, + "total_acs": 2375, + "total_submitted": 4472, "total_column_articles": 59, "frontend_question_id": "1841", "is_new_question": false @@ -19668,8 +19752,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": 2825, - "total_submitted": 6273, + "total_acs": 2829, + "total_submitted": 6291, "total_column_articles": 70, "frontend_question_id": "1878", "is_new_question": false @@ -19689,8 +19773,8 @@ "question__title": "Minimum XOR Sum of Two Arrays", "question__title_slug": "minimum-xor-sum-of-two-arrays", "question__hide": false, - "total_acs": 3197, - "total_submitted": 6814, + "total_acs": 3226, + "total_submitted": 6848, "total_column_articles": 59, "frontend_question_id": "1879", "is_new_question": false @@ -19710,9 +19794,9 @@ "question__title": "Minimize Maximum Pair Sum in Array", "question__title_slug": "minimize-maximum-pair-sum-in-array", "question__hide": false, - "total_acs": 36105, - "total_submitted": 44417, - "total_column_articles": 467, + "total_acs": 36153, + "total_submitted": 44474, + "total_column_articles": 468, "frontend_question_id": "1877", "is_new_question": false }, @@ -19731,9 +19815,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": 13242, - "total_submitted": 18646, - "total_column_articles": 223, + "total_acs": 13356, + "total_submitted": 18799, + "total_column_articles": 224, "frontend_question_id": "1876", "is_new_question": false }, @@ -19752,9 +19836,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": 3434, - "total_submitted": 7145, - "total_column_articles": 57, + "total_acs": 3454, + "total_submitted": 7181, + "total_column_articles": 58, "frontend_question_id": "1857", "is_new_question": false }, @@ -19773,8 +19857,8 @@ "question__title": "Maximum Subarray Min-Product", "question__title_slug": "maximum-subarray-min-product", "question__hide": false, - "total_acs": 7961, - "total_submitted": 21490, + "total_acs": 8026, + "total_submitted": 21685, "total_column_articles": 131, "frontend_question_id": "1856", "is_new_question": false @@ -19794,8 +19878,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": 18845, - "total_submitted": 31172, + "total_acs": 18946, + "total_submitted": 31355, "total_column_articles": 217, "frontend_question_id": "1855", "is_new_question": false @@ -19815,9 +19899,9 @@ "question__title": "Maximum Population Year", "question__title_slug": "maximum-population-year", "question__hide": false, - "total_acs": 15977, - "total_submitted": 21699, - "total_column_articles": 195, + "total_acs": 16039, + "total_submitted": 21809, + "total_column_articles": 198, "frontend_question_id": "1854", "is_new_question": false }, @@ -19836,9 +19920,9 @@ "question__title": "Remove Duplicates From an Unsorted Linked List", "question__title_slug": "remove-duplicates-from-an-unsorted-linked-list", "question__hide": false, - "total_acs": 1628, - "total_submitted": 2238, - "total_column_articles": 60, + "total_acs": 1645, + "total_submitted": 2270, + "total_column_articles": 59, "frontend_question_id": "1836", "is_new_question": false }, @@ -19857,8 +19941,8 @@ "question__title": "Maximum Transaction Each Day", "question__title_slug": "maximum-transaction-each-day", "question__hide": false, - "total_acs": 3519, - "total_submitted": 4517, + "total_acs": 3563, + "total_submitted": 4572, "total_column_articles": 57, "frontend_question_id": "1831", "is_new_question": false @@ -19878,8 +19962,8 @@ "question__title": "Faulty Sensor", "question__title_slug": "faulty-sensor", "question__hide": false, - "total_acs": 673, - "total_submitted": 1624, + "total_acs": 679, + "total_submitted": 1639, "total_column_articles": 35, "frontend_question_id": "1826", "is_new_question": false @@ -19899,8 +19983,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": 219, - "total_submitted": 400, + "total_acs": 221, + "total_submitted": 403, "total_column_articles": 12, "frontend_question_id": "1989", "is_new_question": false @@ -19920,8 +20004,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": 3207, - "total_submitted": 5189, + "total_acs": 3220, + "total_submitted": 5207, "total_column_articles": 63, "frontend_question_id": "1850", "is_new_question": false @@ -19941,8 +20025,8 @@ "question__title": "Minimum Interval to Include Each Query", "question__title_slug": "minimum-interval-to-include-each-query", "question__hide": false, - "total_acs": 2992, - "total_submitted": 7045, + "total_acs": 3006, + "total_submitted": 7074, "total_column_articles": 67, "frontend_question_id": "1851", "is_new_question": false @@ -19962,8 +20046,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": 6954, - "total_submitted": 21165, + "total_acs": 6971, + "total_submitted": 21221, "total_column_articles": 131, "frontend_question_id": "1849", "is_new_question": false @@ -19983,9 +20067,9 @@ "question__title": "Minimum Distance to the Target Element", "question__title_slug": "minimum-distance-to-the-target-element", "question__hide": false, - "total_acs": 11820, - "total_submitted": 17485, - "total_column_articles": 160, + "total_acs": 11869, + "total_submitted": 17554, + "total_column_articles": 163, "frontend_question_id": "1848", "is_new_question": false }, @@ -20004,8 +20088,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": 4992, - "total_submitted": 5548, + "total_acs": 5007, + "total_submitted": 5565, "total_column_articles": 34, "frontend_question_id": "1821", "is_new_question": false @@ -20025,8 +20109,8 @@ "question__title": "Rotating the Box", "question__title_slug": "rotating-the-box", "question__hide": false, - "total_acs": 5157, - "total_submitted": 8217, + "total_acs": 5175, + "total_submitted": 8244, "total_column_articles": 105, "frontend_question_id": "1861", "is_new_question": false @@ -20046,8 +20130,8 @@ "question__title": "Incremental Memory Leak", "question__title_slug": "incremental-memory-leak", "question__hide": false, - "total_acs": 5899, - "total_submitted": 7738, + "total_acs": 5922, + "total_submitted": 7769, "total_column_articles": 114, "frontend_question_id": "1860", "is_new_question": false @@ -20067,9 +20151,9 @@ "question__title": "Sorting the Sentence", "question__title_slug": "sorting-the-sentence", "question__hide": false, - "total_acs": 12793, - "total_submitted": 17354, - "total_column_articles": 276, + "total_acs": 12877, + "total_submitted": 17459, + "total_column_articles": 283, "frontend_question_id": "1859", "is_new_question": false }, @@ -20088,8 +20172,8 @@ "question__title": "Maximum Number of Accepted Invitations", "question__title_slug": "maximum-number-of-accepted-invitations", "question__hide": false, - "total_acs": 335, - "total_submitted": 708, + "total_acs": 337, + "total_submitted": 711, "total_column_articles": 16, "frontend_question_id": "1820", "is_new_question": false @@ -20109,8 +20193,8 @@ "question__title": "Maximum Building Height", "question__title_slug": "maximum-building-height", "question__hide": false, - "total_acs": 2610, - "total_submitted": 6622, + "total_acs": 2619, + "total_submitted": 6648, "total_column_articles": 62, "frontend_question_id": "1840", "is_new_question": false @@ -20130,9 +20214,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": 10103, - "total_submitted": 19714, - "total_column_articles": 177, + "total_acs": 10172, + "total_submitted": 19881, + "total_column_articles": 178, "frontend_question_id": "1839", "is_new_question": false }, @@ -20151,9 +20235,9 @@ "question__title": "Frequency of the Most Frequent Element", "question__title_slug": "frequency-of-the-most-frequent-element", "question__hide": false, - "total_acs": 34941, - "total_submitted": 81383, - "total_column_articles": 370, + "total_acs": 35018, + "total_submitted": 81555, + "total_column_articles": 369, "frontend_question_id": "1838", "is_new_question": false }, @@ -20172,9 +20256,9 @@ "question__title": "Sum of Digits in Base K", "question__title_slug": "sum-of-digits-in-base-k", "question__hide": false, - "total_acs": 12874, - "total_submitted": 16213, - "total_column_articles": 148, + "total_acs": 12947, + "total_submitted": 16297, + "total_column_articles": 150, "frontend_question_id": "1837", "is_new_question": false }, @@ -20193,8 +20277,8 @@ "question__title": "Find Interview Candidates", "question__title_slug": "find-interview-candidates", "question__hide": false, - "total_acs": 2645, - "total_submitted": 4121, + "total_acs": 2669, + "total_submitted": 4155, "total_column_articles": 49, "frontend_question_id": "1811", "is_new_question": false @@ -20214,8 +20298,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": 4579, - "total_submitted": 8441, + "total_acs": 4617, + "total_submitted": 8490, "total_column_articles": 73, "frontend_question_id": "1835", "is_new_question": false @@ -20235,9 +20319,9 @@ "question__title": "Single-Threaded CPU", "question__title_slug": "single-threaded-cpu", "question__hide": false, - "total_acs": 8890, - "total_submitted": 24096, - "total_column_articles": 160, + "total_acs": 8925, + "total_submitted": 24190, + "total_column_articles": 162, "frontend_question_id": "1834", "is_new_question": false }, @@ -20256,9 +20340,9 @@ "question__title": "Maximum Ice Cream Bars", "question__title_slug": "maximum-ice-cream-bars", "question__hide": false, - "total_acs": 47449, - "total_submitted": 69767, - "total_column_articles": 448, + "total_acs": 47515, + "total_submitted": 69855, + "total_column_articles": 449, "frontend_question_id": "1833", "is_new_question": false }, @@ -20277,9 +20361,9 @@ "question__title": "Check if the Sentence Is Pangram", "question__title_slug": "check-if-the-sentence-is-pangram", "question__hide": false, - "total_acs": 21491, - "total_submitted": 26276, - "total_column_articles": 351, + "total_acs": 21617, + "total_submitted": 26450, + "total_column_articles": 354, "frontend_question_id": "1832", "is_new_question": false }, @@ -20298,8 +20382,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": 352, - "total_submitted": 562, + "total_acs": 354, + "total_submitted": 564, "total_column_articles": 10, "frontend_question_id": "1810", "is_new_question": false @@ -20319,8 +20403,8 @@ "question__title": "Ad-Free Sessions", "question__title_slug": "ad-free-sessions", "question__hide": false, - "total_acs": 3911, - "total_submitted": 6381, + "total_acs": 3936, + "total_submitted": 6414, "total_column_articles": 47, "frontend_question_id": "1809", "is_new_question": false @@ -20340,8 +20424,8 @@ "question__title": "Closest Room", "question__title_slug": "closest-room", "question__hide": false, - "total_acs": 3501, - "total_submitted": 8970, + "total_acs": 3533, + "total_submitted": 9025, "total_column_articles": 68, "frontend_question_id": "1847", "is_new_question": false @@ -20361,8 +20445,8 @@ "question__title": "Maximum Element After Decreasing and Rearranging", "question__title_slug": "maximum-element-after-decreasing-and-rearranging", "question__hide": false, - "total_acs": 29985, - "total_submitted": 47477, + "total_acs": 30025, + "total_submitted": 47561, "total_column_articles": 407, "frontend_question_id": "1846", "is_new_question": false @@ -20382,8 +20466,8 @@ "question__title": "Seat Reservation Manager", "question__title_slug": "seat-reservation-manager", "question__hide": false, - "total_acs": 13427, - "total_submitted": 28152, + "total_acs": 13526, + "total_submitted": 28349, "total_column_articles": 145, "frontend_question_id": "1845", "is_new_question": false @@ -20403,9 +20487,9 @@ "question__title": "Replace All Digits with Characters", "question__title_slug": "replace-all-digits-with-characters", "question__hide": false, - "total_acs": 11368, - "total_submitted": 14453, - "total_column_articles": 192, + "total_acs": 11446, + "total_submitted": 14568, + "total_column_articles": 193, "frontend_question_id": "1844", "is_new_question": false }, @@ -20424,8 +20508,8 @@ "question__title": "Finding MK Average", "question__title_slug": "finding-mk-average", "question__hide": false, - "total_acs": 3263, - "total_submitted": 11052, + "total_acs": 3266, + "total_submitted": 11076, "total_column_articles": 71, "frontend_question_id": "1825", "is_new_question": false @@ -20445,8 +20529,8 @@ "question__title": "Minimum Sideway Jumps", "question__title_slug": "minimum-sideway-jumps", "question__hide": false, - "total_acs": 9483, - "total_submitted": 14841, + "total_acs": 9493, + "total_submitted": 14864, "total_column_articles": 183, "frontend_question_id": "1824", "is_new_question": false @@ -20466,9 +20550,9 @@ "question__title": "Find the Winner of the Circular Game", "question__title_slug": "find-the-winner-of-the-circular-game", "question__hide": false, - "total_acs": 49618, - "total_submitted": 62972, - "total_column_articles": 542, + "total_acs": 49789, + "total_submitted": 63180, + "total_column_articles": 543, "frontend_question_id": "1823", "is_new_question": false }, @@ -20487,9 +20571,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": 67804, - "total_submitted": 92725, - "total_column_articles": 681, + "total_acs": 68136, + "total_submitted": 93256, + "total_column_articles": 683, "frontend_question_id": "1822", "is_new_question": false }, @@ -20508,8 +20592,8 @@ "question__title": "Implement Trie II (Prefix Tree)", "question__title_slug": "implement-trie-ii-prefix-tree", "question__hide": false, - "total_acs": 1890, - "total_submitted": 3273, + "total_acs": 1904, + "total_submitted": 3307, "total_column_articles": 57, "frontend_question_id": "1804", "is_new_question": false @@ -20529,9 +20613,9 @@ "question__title": "Rearrange Products Table", "question__title_slug": "rearrange-products-table", "question__hide": false, - "total_acs": 26357, - "total_submitted": 33400, - "total_column_articles": 134, + "total_acs": 26876, + "total_submitted": 34076, + "total_column_articles": 135, "frontend_question_id": "1795", "is_new_question": false }, @@ -20550,8 +20634,8 @@ "question__title": "Number of Different Subsequences GCDs", "question__title_slug": "number-of-different-subsequences-gcds", "question__hide": false, - "total_acs": 3386, - "total_submitted": 8138, + "total_acs": 3395, + "total_submitted": 8148, "total_column_articles": 42, "frontend_question_id": "1819", "is_new_question": false @@ -20571,8 +20655,8 @@ "question__title": "Minimum Absolute Sum Difference", "question__title_slug": "minimum-absolute-sum-difference", "question__hide": false, - "total_acs": 30014, - "total_submitted": 80040, + "total_acs": 30086, + "total_submitted": 80207, "total_column_articles": 384, "frontend_question_id": "1818", "is_new_question": false @@ -20592,9 +20676,9 @@ "question__title": "Finding the Users Active Minutes", "question__title_slug": "finding-the-users-active-minutes", "question__hide": false, - "total_acs": 7718, - "total_submitted": 11001, - "total_column_articles": 129, + "total_acs": 7747, + "total_submitted": 11037, + "total_column_articles": 130, "frontend_question_id": "1817", "is_new_question": false }, @@ -20613,9 +20697,9 @@ "question__title": "Truncate Sentence", "question__title_slug": "truncate-sentence", "question__hide": false, - "total_acs": 52432, - "total_submitted": 72108, - "total_column_articles": 708, + "total_acs": 52516, + "total_submitted": 72244, + "total_column_articles": 709, "frontend_question_id": "1816", "is_new_question": false }, @@ -20634,8 +20718,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": 317, - "total_submitted": 595, + "total_acs": 318, + "total_submitted": 596, "total_column_articles": 13, "frontend_question_id": "1794", "is_new_question": false @@ -20655,8 +20739,8 @@ "question__title": "Primary Department for Each Employee", "question__title_slug": "primary-department-for-each-employee", "question__hide": false, - "total_acs": 3703, - "total_submitted": 5152, + "total_acs": 3722, + "total_submitted": 5178, "total_column_articles": 44, "frontend_question_id": "1789", "is_new_question": false @@ -20676,9 +20760,9 @@ "question__title": "Minimum Number of Operations to Make String Sorted", "question__title_slug": "minimum-number-of-operations-to-make-string-sorted", "question__hide": false, - "total_acs": 1244, - "total_submitted": 2407, - "total_column_articles": 27, + "total_acs": 1246, + "total_submitted": 2414, + "total_column_articles": 28, "frontend_question_id": "1830", "is_new_question": false }, @@ -20697,9 +20781,9 @@ "question__title": "Maximum XOR for Each Query", "question__title_slug": "maximum-xor-for-each-query", "question__hide": false, - "total_acs": 5591, - "total_submitted": 7868, - "total_column_articles": 106, + "total_acs": 5611, + "total_submitted": 7892, + "total_column_articles": 107, "frontend_question_id": "1829", "is_new_question": false }, @@ -20718,9 +20802,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": 12341, - "total_submitted": 14215, - "total_column_articles": 175, + "total_acs": 12423, + "total_submitted": 14302, + "total_column_articles": 174, "frontend_question_id": "1828", "is_new_question": false }, @@ -20739,9 +20823,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": 17124, - "total_submitted": 22167, - "total_column_articles": 239, + "total_acs": 17247, + "total_submitted": 22341, + "total_column_articles": 241, "frontend_question_id": "1827", "is_new_question": false }, @@ -20760,8 +20844,8 @@ "question__title": "Maximize the Beauty of the Garden", "question__title_slug": "maximize-the-beauty-of-the-garden", "question__hide": false, - "total_acs": 551, - "total_submitted": 846, + "total_acs": 565, + "total_submitted": 868, "total_column_articles": 30, "frontend_question_id": "1788", "is_new_question": false @@ -20781,8 +20865,8 @@ "question__title": "Maximize Number of Nice Divisors", "question__title_slug": "maximize-number-of-nice-divisors", "question__hide": false, - "total_acs": 3015, - "total_submitted": 10759, + "total_acs": 3021, + "total_submitted": 10777, "total_column_articles": 56, "frontend_question_id": "1808", "is_new_question": false @@ -20802,8 +20886,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": 6172, - "total_submitted": 9502, + "total_acs": 6190, + "total_submitted": 9525, "total_column_articles": 97, "frontend_question_id": "1806", "is_new_question": false @@ -20823,8 +20907,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": 7687, - "total_submitted": 12923, + "total_acs": 7728, + "total_submitted": 12989, "total_column_articles": 120, "frontend_question_id": "1807", "is_new_question": false @@ -20844,9 +20928,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": 15168, - "total_submitted": 33662, - "total_column_articles": 229, + "total_acs": 15231, + "total_submitted": 33839, + "total_column_articles": 232, "frontend_question_id": "1805", "is_new_question": false }, @@ -20865,9 +20949,9 @@ "question__title": "Grand Slam Titles", "question__title_slug": "grand-slam-titles", "question__hide": false, - "total_acs": 4553, - "total_submitted": 5587, - "total_column_articles": 70, + "total_acs": 4602, + "total_submitted": 5641, + "total_column_articles": 72, "frontend_question_id": "1783", "is_new_question": false }, @@ -20886,8 +20970,8 @@ "question__title": "Shortest Path in a Hidden Grid", "question__title_slug": "shortest-path-in-a-hidden-grid", "question__hide": false, - "total_acs": 400, - "total_submitted": 843, + "total_acs": 401, + "total_submitted": 844, "total_column_articles": 16, "frontend_question_id": "1778", "is_new_question": false @@ -20907,9 +20991,9 @@ "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": 4522, - "total_submitted": 8171, - "total_column_articles": 69, + "total_acs": 4564, + "total_submitted": 8224, + "total_column_articles": 71, "frontend_question_id": "1798", "is_new_question": false }, @@ -20928,8 +21012,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": 6370, - "total_submitted": 21937, + "total_acs": 6401, + "total_submitted": 22005, "total_column_articles": 151, "frontend_question_id": "1802", "is_new_question": false @@ -20949,8 +21033,8 @@ "question__title": "Number of Orders in the Backlog", "question__title_slug": "number-of-orders-in-the-backlog", "question__hide": false, - "total_acs": 5640, - "total_submitted": 14203, + "total_acs": 5870, + "total_submitted": 14880, "total_column_articles": 141, "frontend_question_id": "1801", "is_new_question": false @@ -20970,9 +21054,9 @@ "question__title": "Maximum Ascending Subarray Sum", "question__title_slug": "maximum-ascending-subarray-sum", "question__hide": false, - "total_acs": 41735, - "total_submitted": 60464, - "total_column_articles": 608, + "total_acs": 41858, + "total_submitted": 60659, + "total_column_articles": 613, "frontend_question_id": "1800", "is_new_question": false }, @@ -20991,8 +21075,8 @@ "question__title": "Product's Price for Each Store", "question__title_slug": "products-price-for-each-store", "question__hide": false, - "total_acs": 7921, - "total_submitted": 10055, + "total_acs": 7951, + "total_submitted": 10087, "total_column_articles": 77, "frontend_question_id": "1777", "is_new_question": false @@ -21012,8 +21096,8 @@ "question__title": "Count Nice Pairs in an Array", "question__title_slug": "count-nice-pairs-in-an-array", "question__hide": false, - "total_acs": 5025, - "total_submitted": 13717, + "total_acs": 5046, + "total_submitted": 13759, "total_column_articles": 103, "frontend_question_id": "1814", "is_new_question": false @@ -21033,8 +21117,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": 2462, - "total_submitted": 7768, + "total_acs": 2482, + "total_submitted": 7803, "total_column_articles": 55, "frontend_question_id": "1815", "is_new_question": false @@ -21054,8 +21138,8 @@ "question__title": "Sentence Similarity III", "question__title_slug": "sentence-similarity-iii", "question__hide": false, - "total_acs": 6657, - "total_submitted": 14301, + "total_acs": 6681, + "total_submitted": 14358, "total_column_articles": 101, "frontend_question_id": "1813", "is_new_question": false @@ -21075,9 +21159,9 @@ "question__title": "Determine Color of a Chessboard Square", "question__title_slug": "determine-color-of-a-chessboard-square", "question__hide": false, - "total_acs": 14268, - "total_submitted": 18298, - "total_column_articles": 339, + "total_acs": 14397, + "total_submitted": 18492, + "total_column_articles": 342, "frontend_question_id": "1812", "is_new_question": false }, @@ -21096,8 +21180,8 @@ "question__title": "Sort Features by Popularity", "question__title_slug": "sort-features-by-popularity", "question__hide": false, - "total_acs": 717, - "total_submitted": 1520, + "total_acs": 727, + "total_submitted": 1553, "total_column_articles": 18, "frontend_question_id": "1772", "is_new_question": false @@ -21117,8 +21201,8 @@ "question__title": "Maximum Score of a Good Subarray", "question__title_slug": "maximum-score-of-a-good-subarray", "question__hide": false, - "total_acs": 5230, - "total_submitted": 11779, + "total_acs": 5247, + "total_submitted": 11802, "total_column_articles": 122, "frontend_question_id": "1793", "is_new_question": false @@ -21138,8 +21222,8 @@ "question__title": "Maximum Average Pass Ratio", "question__title_slug": "maximum-average-pass-ratio", "question__hide": false, - "total_acs": 8185, - "total_submitted": 16003, + "total_acs": 8218, + "total_submitted": 16064, "total_column_articles": 126, "frontend_question_id": "1792", "is_new_question": false @@ -21159,9 +21243,9 @@ "question__title": "Find Center of Star Graph", "question__title_slug": "find-center-of-star-graph", "question__hide": false, - "total_acs": 52648, - "total_submitted": 63150, - "total_column_articles": 487, + "total_acs": 52753, + "total_submitted": 63271, + "total_column_articles": 488, "frontend_question_id": "1791", "is_new_question": false }, @@ -21180,9 +21264,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": 59719, - "total_submitted": 112279, - "total_column_articles": 808, + "total_acs": 59965, + "total_submitted": 112778, + "total_column_articles": 814, "frontend_question_id": "1790", "is_new_question": false }, @@ -21201,9 +21285,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": 2693, - "total_submitted": 3363, - "total_column_articles": 48, + "total_acs": 2718, + "total_submitted": 3403, + "total_column_articles": 49, "frontend_question_id": "1767", "is_new_question": false }, @@ -21222,8 +21306,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": 12473, - "total_submitted": 19250, + "total_acs": 12481, + "total_submitted": 19266, "total_column_articles": 66, "frontend_question_id": "1787", "is_new_question": false @@ -21243,9 +21327,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": 5012, - "total_submitted": 14184, - "total_column_articles": 117, + "total_acs": 5029, + "total_submitted": 14229, + "total_column_articles": 118, "frontend_question_id": "1786", "is_new_question": false }, @@ -21264,8 +21348,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": 7903, - "total_submitted": 21684, + "total_acs": 7929, + "total_submitted": 21750, "total_column_articles": 82, "frontend_question_id": "1785", "is_new_question": false @@ -21285,9 +21369,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": 38016, - "total_submitted": 63846, - "total_column_articles": 518, + "total_acs": 38101, + "total_submitted": 63974, + "total_column_articles": 522, "frontend_question_id": "1784", "is_new_question": false }, @@ -21306,8 +21390,8 @@ "question__title": "Buildings With an Ocean View", "question__title_slug": "buildings-with-an-ocean-view", "question__hide": false, - "total_acs": 2494, - "total_submitted": 3490, + "total_acs": 2505, + "total_submitted": 3509, "total_column_articles": 43, "frontend_question_id": "1762", "is_new_question": false @@ -21327,9 +21411,9 @@ "question__title": "Recyclable and Low Fat Products", "question__title_slug": "recyclable-and-low-fat-products", "question__hide": false, - "total_acs": 73126, - "total_submitted": 83091, - "total_column_articles": 190, + "total_acs": 74712, + "total_submitted": 84888, + "total_column_articles": 195, "frontend_question_id": "1757", "is_new_question": false }, @@ -21348,8 +21432,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": 2778, - "total_submitted": 6492, + "total_acs": 2785, + "total_submitted": 6501, "total_column_articles": 62, "frontend_question_id": "1803", "is_new_question": false @@ -21369,8 +21453,8 @@ "question__title": "Maximize Score After N Operations", "question__title_slug": "maximize-score-after-n-operations", "question__hide": false, - "total_acs": 3500, - "total_submitted": 6437, + "total_acs": 3509, + "total_submitted": 6451, "total_column_articles": 55, "frontend_question_id": "1799", "is_new_question": false @@ -21390,9 +21474,9 @@ "question__title": "Design Authentication Manager", "question__title_slug": "design-authentication-manager", "question__hide": false, - "total_acs": 10120, - "total_submitted": 17465, - "total_column_articles": 145, + "total_acs": 10221, + "total_submitted": 17633, + "total_column_articles": 147, "frontend_question_id": "1797", "is_new_question": false }, @@ -21411,9 +21495,9 @@ "question__title": "Second Largest Digit in a String", "question__title_slug": "second-largest-digit-in-a-string", "question__hide": false, - "total_acs": 11890, - "total_submitted": 24370, - "total_column_articles": 214, + "total_acs": 11970, + "total_submitted": 24525, + "total_column_articles": 217, "frontend_question_id": "1796", "is_new_question": false }, @@ -21432,8 +21516,8 @@ "question__title": "Design Most Recently Used Queue", "question__title_slug": "design-most-recently-used-queue", "question__hide": false, - "total_acs": 1201, - "total_submitted": 1468, + "total_acs": 1220, + "total_submitted": 1489, "total_column_articles": 32, "frontend_question_id": "1756", "is_new_question": false @@ -21453,9 +21537,9 @@ "question__title": "Car Fleet II", "question__title_slug": "car-fleet-ii", "question__hide": false, - "total_acs": 2673, - "total_submitted": 5633, - "total_column_articles": 61, + "total_acs": 2689, + "total_submitted": 5659, + "total_column_articles": 62, "frontend_question_id": "1776", "is_new_question": false }, @@ -21474,9 +21558,9 @@ "question__title": "Equal Sum Arrays With Minimum Number of Operations", "question__title_slug": "equal-sum-arrays-with-minimum-number-of-operations", "question__hide": false, - "total_acs": 5772, - "total_submitted": 11818, - "total_column_articles": 125, + "total_acs": 5800, + "total_submitted": 11872, + "total_column_articles": 128, "frontend_question_id": "1775", "is_new_question": false }, @@ -21495,9 +21579,9 @@ "question__title": "Closest Dessert Cost", "question__title_slug": "closest-dessert-cost", "question__hide": false, - "total_acs": 7990, - "total_submitted": 15294, - "total_column_articles": 121, + "total_acs": 8045, + "total_submitted": 15385, + "total_column_articles": 124, "frontend_question_id": "1774", "is_new_question": false }, @@ -21516,9 +21600,9 @@ "question__title": "Count Items Matching a Rule", "question__title_slug": "count-items-matching-a-rule", "question__hide": false, - "total_acs": 45266, - "total_submitted": 51728, - "total_column_articles": 467, + "total_acs": 45673, + "total_submitted": 52210, + "total_column_articles": 469, "frontend_question_id": "1773", "is_new_question": false }, @@ -21537,9 +21621,9 @@ "question__title": "Leetflex Banned Accounts", "question__title_slug": "leetflex-banned-accounts", "question__hide": false, - "total_acs": 4470, - "total_submitted": 6661, - "total_column_articles": 72, + "total_acs": 4513, + "total_submitted": 6713, + "total_column_articles": 74, "frontend_question_id": "1747", "is_new_question": false }, @@ -21558,8 +21642,8 @@ "question__title": "Maximize Palindrome Length From Subsequences", "question__title_slug": "maximize-palindrome-length-from-subsequences", "question__hide": false, - "total_acs": 3004, - "total_submitted": 7989, + "total_acs": 3011, + "total_submitted": 7997, "total_column_articles": 58, "frontend_question_id": "1771", "is_new_question": false @@ -21579,9 +21663,9 @@ "question__title": "Maximum Score from Performing Multiplication Operations", "question__title_slug": "maximum-score-from-performing-multiplication-operations", "question__hide": false, - "total_acs": 5570, - "total_submitted": 14320, - "total_column_articles": 123, + "total_acs": 5594, + "total_submitted": 14365, + "total_column_articles": 124, "frontend_question_id": "1770", "is_new_question": false }, @@ -21600,8 +21684,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": 13344, - "total_submitted": 15657, + "total_acs": 13388, + "total_submitted": 15711, "total_column_articles": 235, "frontend_question_id": "1769", "is_new_question": false @@ -21621,9 +21705,9 @@ "question__title": "Merge Strings Alternately", "question__title_slug": "merge-strings-alternately", "question__hide": false, - "total_acs": 47267, - "total_submitted": 60097, - "total_column_articles": 691, + "total_acs": 47502, + "total_submitted": 60401, + "total_column_articles": 694, "frontend_question_id": "1768", "is_new_question": false }, @@ -21642,8 +21726,8 @@ "question__title": "Maximum Subarray Sum After One Operation", "question__title_slug": "maximum-subarray-sum-after-one-operation", "question__hide": false, - "total_acs": 2418, - "total_submitted": 4019, + "total_acs": 2429, + "total_submitted": 4036, "total_column_articles": 72, "frontend_question_id": "1746", "is_new_question": false @@ -21663,9 +21747,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": 19515, - "total_submitted": 22875, - "total_column_articles": 121, + "total_acs": 19936, + "total_submitted": 23368, + "total_column_articles": 127, "frontend_question_id": "1741", "is_new_question": false }, @@ -21684,8 +21768,8 @@ "question__title": "Count Pairs Of Nodes", "question__title_slug": "count-pairs-of-nodes", "question__hide": false, - "total_acs": 1757, - "total_submitted": 5133, + "total_acs": 1763, + "total_submitted": 5143, "total_column_articles": 51, "frontend_question_id": "1782", "is_new_question": false @@ -21705,8 +21789,8 @@ "question__title": "Sum of Beauty of All Substrings", "question__title_slug": "sum-of-beauty-of-all-substrings", "question__hide": false, - "total_acs": 5447, - "total_submitted": 10042, + "total_acs": 5469, + "total_submitted": 10076, "total_column_articles": 83, "frontend_question_id": "1781", "is_new_question": false @@ -21726,9 +21810,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": 7895, - "total_submitted": 11741, - "total_column_articles": 155, + "total_acs": 7940, + "total_submitted": 11797, + "total_column_articles": 157, "frontend_question_id": "1780", "is_new_question": false }, @@ -21747,9 +21831,9 @@ "question__title": "Find Nearest Point That Has the Same X or Y Coordinate", "question__title_slug": "find-nearest-point-that-has-the-same-x-or-y-coordinate", "question__hide": false, - "total_acs": 17693, - "total_submitted": 27553, - "total_column_articles": 275, + "total_acs": 17907, + "total_submitted": 27863, + "total_column_articles": 281, "frontend_question_id": "1779", "is_new_question": false }, @@ -21768,8 +21852,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": 3519, - "total_submitted": 7709, + "total_acs": 3534, + "total_submitted": 7749, "total_column_articles": 51, "frontend_question_id": "1761", "is_new_question": false @@ -21789,9 +21873,9 @@ "question__title": "Minimum Limit of Balls in a Bag", "question__title_slug": "minimum-limit-of-balls-in-a-bag", "question__hide": false, - "total_acs": 9149, - "total_submitted": 15771, - "total_column_articles": 146, + "total_acs": 9253, + "total_submitted": 15940, + "total_column_articles": 147, "frontend_question_id": "1760", "is_new_question": false }, @@ -21810,9 +21894,9 @@ "question__title": "Count Number of Homogenous Substrings", "question__title_slug": "count-number-of-homogenous-substrings", "question__hide": false, - "total_acs": 6242, - "total_submitted": 13987, - "total_column_articles": 129, + "total_acs": 6285, + "total_submitted": 14054, + "total_column_articles": 131, "frontend_question_id": "1759", "is_new_question": false }, @@ -21831,9 +21915,9 @@ "question__title": "Minimum Changes To Make Alternating Binary String", "question__title_slug": "minimum-changes-to-make-alternating-binary-string", "question__hide": false, - "total_acs": 10598, - "total_submitted": 16751, - "total_column_articles": 171, + "total_acs": 10657, + "total_submitted": 16829, + "total_column_articles": 174, "frontend_question_id": "1758", "is_new_question": false }, @@ -21852,9 +21936,9 @@ "question__title": "Find Distance in a Binary Tree", "question__title_slug": "find-distance-in-a-binary-tree", "question__hide": false, - "total_acs": 1377, - "total_submitted": 2081, - "total_column_articles": 49, + "total_acs": 1382, + "total_submitted": 2086, + "total_column_articles": 50, "frontend_question_id": "1740", "is_new_question": false }, @@ -21873,9 +21957,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": 5645, - "total_submitted": 11919, - "total_column_articles": 66, + "total_acs": 5697, + "total_submitted": 12020, + "total_column_articles": 68, "frontend_question_id": "1731", "is_new_question": false }, @@ -21894,9 +21978,9 @@ "question__title": "Closest Subsequence Sum", "question__title_slug": "closest-subsequence-sum", "question__hide": false, - "total_acs": 4994, - "total_submitted": 11372, - "total_column_articles": 81, + "total_acs": 5018, + "total_submitted": 11421, + "total_column_articles": 82, "frontend_question_id": "1755", "is_new_question": false }, @@ -21915,9 +21999,9 @@ "question__title": "Largest Merge Of Two Strings", "question__title_slug": "largest-merge-of-two-strings", "question__hide": false, - "total_acs": 5513, - "total_submitted": 12683, - "total_column_articles": 110, + "total_acs": 5575, + "total_submitted": 12778, + "total_column_articles": 111, "frontend_question_id": "1754", "is_new_question": false }, @@ -21936,9 +22020,9 @@ "question__title": "Maximum Score From Removing Stones", "question__title_slug": "maximum-score-from-removing-stones", "question__hide": false, - "total_acs": 8688, - "total_submitted": 13724, - "total_column_articles": 171, + "total_acs": 8728, + "total_submitted": 13788, + "total_column_articles": 174, "frontend_question_id": "1753", "is_new_question": false }, @@ -21957,9 +22041,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": 12541, - "total_submitted": 20319, - "total_column_articles": 179, + "total_acs": 12579, + "total_submitted": 20392, + "total_column_articles": 180, "frontend_question_id": "1752", "is_new_question": false }, @@ -21978,9 +22062,9 @@ "question__title": "Find Followers Count", "question__title_slug": "find-followers-count", "question__hide": false, - "total_acs": 19940, - "total_submitted": 32083, - "total_column_articles": 99, + "total_acs": 20353, + "total_submitted": 32764, + "total_column_articles": 102, "frontend_question_id": "1729", "is_new_question": false }, @@ -21999,8 +22083,8 @@ "question__title": "Map of Highest Peak", "question__title_slug": "map-of-highest-peak", "question__hide": false, - "total_acs": 23219, - "total_submitted": 34930, + "total_acs": 23256, + "total_submitted": 34983, "total_column_articles": 319, "frontend_question_id": "1765", "is_new_question": false @@ -22020,8 +22104,8 @@ "question__title": "Tree of Coprimes", "question__title_slug": "tree-of-coprimes", "question__hide": false, - "total_acs": 2088, - "total_submitted": 5254, + "total_acs": 2095, + "total_submitted": 5264, "total_column_articles": 44, "frontend_question_id": "1766", "is_new_question": false @@ -22041,8 +22125,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": 3733, - "total_submitted": 7813, + "total_acs": 3759, + "total_submitted": 7862, "total_column_articles": 88, "frontend_question_id": "1764", "is_new_question": false @@ -22062,9 +22146,9 @@ "question__title": "Longest Nice Substring", "question__title_slug": "longest-nice-substring", "question__hide": false, - "total_acs": 26732, - "total_submitted": 39120, - "total_column_articles": 286, + "total_acs": 26777, + "total_submitted": 39195, + "total_column_articles": 288, "frontend_question_id": "1763", "is_new_question": false }, @@ -22083,8 +22167,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": 29858, - "total_submitted": 82335, + "total_acs": 29879, + "total_submitted": 82372, "total_column_articles": 386, "frontend_question_id": "1744", "is_new_question": false @@ -22104,9 +22188,9 @@ "question__title": "Palindrome Partitioning IV", "question__title_slug": "palindrome-partitioning-iv", "question__hide": false, - "total_acs": 4738, - "total_submitted": 9498, - "total_column_articles": 98, + "total_acs": 4767, + "total_submitted": 9543, + "total_column_articles": 100, "frontend_question_id": "1745", "is_new_question": false }, @@ -22125,9 +22209,9 @@ "question__title": "Restore the Array From Adjacent Pairs", "question__title_slug": "restore-the-array-from-adjacent-pairs", "question__hide": false, - "total_acs": 23947, - "total_submitted": 34436, - "total_column_articles": 356, + "total_acs": 23970, + "total_submitted": 34468, + "total_column_articles": 357, "frontend_question_id": "1743", "is_new_question": false }, @@ -22146,8 +22230,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": 587, - "total_submitted": 1010, + "total_acs": 590, + "total_submitted": 1014, "total_column_articles": 20, "frontend_question_id": "1724", "is_new_question": false @@ -22167,8 +22251,8 @@ "question__title": "Count Apples and Oranges", "question__title_slug": "count-apples-and-oranges", "question__hide": false, - "total_acs": 3483, - "total_submitted": 4856, + "total_acs": 3502, + "total_submitted": 4890, "total_column_articles": 52, "frontend_question_id": "1715", "is_new_question": false @@ -22188,8 +22272,8 @@ "question__title": "Building Boxes", "question__title_slug": "building-boxes", "question__hide": false, - "total_acs": 3753, - "total_submitted": 7566, + "total_acs": 3774, + "total_submitted": 7597, "total_column_articles": 78, "frontend_question_id": "1739", "is_new_question": false @@ -22209,8 +22293,8 @@ "question__title": "Find Kth Largest XOR Coordinate Value", "question__title_slug": "find-kth-largest-xor-coordinate-value", "question__hide": false, - "total_acs": 30817, - "total_submitted": 47366, + "total_acs": 30852, + "total_submitted": 47426, "total_column_articles": 426, "frontend_question_id": "1738", "is_new_question": false @@ -22230,8 +22314,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": 5229, - "total_submitted": 14917, + "total_acs": 5257, + "total_submitted": 14990, "total_column_articles": 124, "frontend_question_id": "1737", "is_new_question": false @@ -22251,9 +22335,9 @@ "question__title": "Latest Time by Replacing Hidden Digits", "question__title_slug": "latest-time-by-replacing-hidden-digits", "question__hide": false, - "total_acs": 31825, - "total_submitted": 71434, - "total_column_articles": 404, + "total_acs": 31903, + "total_submitted": 71650, + "total_column_articles": 407, "frontend_question_id": "1736", "is_new_question": false }, @@ -22272,9 +22356,9 @@ "question__title": "Biggest Window Between Visits", "question__title_slug": "biggest-window-between-visits", "question__hide": false, - "total_acs": 4438, - "total_submitted": 6186, - "total_column_articles": 71, + "total_acs": 4474, + "total_submitted": 6224, + "total_column_articles": 72, "frontend_question_id": "1709", "is_new_question": false }, @@ -22293,8 +22377,8 @@ "question__title": "Maximum Number of Events That Can Be Attended II", "question__title_slug": "maximum-number-of-events-that-can-be-attended-ii", "question__hide": false, - "total_acs": 5327, - "total_submitted": 10120, + "total_acs": 5369, + "total_submitted": 10197, "total_column_articles": 76, "frontend_question_id": "1751", "is_new_question": false @@ -22314,8 +22398,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": 5022, - "total_submitted": 11320, + "total_acs": 5048, + "total_submitted": 11369, "total_column_articles": 110, "frontend_question_id": "1750", "is_new_question": false @@ -22335,9 +22419,9 @@ "question__title": "Maximum Absolute Sum of Any Subarray", "question__title_slug": "maximum-absolute-sum-of-any-subarray", "question__hide": false, - "total_acs": 6126, - "total_submitted": 11379, - "total_column_articles": 131, + "total_acs": 6172, + "total_submitted": 11458, + "total_column_articles": 134, "frontend_question_id": "1749", "is_new_question": false }, @@ -22356,9 +22440,9 @@ "question__title": "Sum of Unique Elements", "question__title_slug": "sum-of-unique-elements", "question__hide": false, - "total_acs": 44411, - "total_submitted": 57237, - "total_column_articles": 619, + "total_acs": 44535, + "total_submitted": 57430, + "total_column_articles": 620, "frontend_question_id": "1748", "is_new_question": false }, @@ -22377,8 +22461,8 @@ "question__title": "Largest Subarray Length K", "question__title_slug": "largest-subarray-length-k", "question__hide": false, - "total_acs": 1589, - "total_submitted": 2338, + "total_acs": 1599, + "total_submitted": 2349, "total_column_articles": 47, "frontend_question_id": "1708", "is_new_question": false @@ -22398,8 +22482,8 @@ "question__title": "Largest Submatrix With Rearrangements", "question__title_slug": "largest-submatrix-with-rearrangements", "question__hide": false, - "total_acs": 4348, - "total_submitted": 7441, + "total_acs": 4363, + "total_submitted": 7469, "total_column_articles": 92, "frontend_question_id": "1727", "is_new_question": false @@ -22419,9 +22503,9 @@ "question__title": "Maximum Number of Balls in a Box", "question__title_slug": "maximum-number-of-balls-in-a-box", "question__hide": false, - "total_acs": 11895, - "total_submitted": 16704, - "total_column_articles": 177, + "total_acs": 11938, + "total_submitted": 16769, + "total_column_articles": 178, "frontend_question_id": "1742", "is_new_question": false }, @@ -22440,9 +22524,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": 37097, - "total_submitted": 44626, - "total_column_articles": 462, + "total_acs": 37160, + "total_submitted": 44706, + "total_column_articles": 464, "frontend_question_id": "1725", "is_new_question": false }, @@ -22461,9 +22545,9 @@ "question__title": "Number of Calls Between Two Persons", "question__title_slug": "number-of-calls-between-two-persons", "question__hide": false, - "total_acs": 8404, - "total_submitted": 10838, - "total_column_articles": 94, + "total_acs": 8521, + "total_submitted": 10978, + "total_column_articles": 97, "frontend_question_id": "1699", "is_new_question": false }, @@ -22482,8 +22566,8 @@ "question__title": "Minimize Hamming Distance After Swap Operations", "question__title_slug": "minimize-hamming-distance-after-swap-operations", "question__hide": false, - "total_acs": 5763, - "total_submitted": 11331, + "total_acs": 5774, + "total_submitted": 11358, "total_column_articles": 138, "frontend_question_id": "1722", "is_new_question": false @@ -22503,9 +22587,9 @@ "question__title": "Decode XORed Array", "question__title_slug": "decode-xored-array", "question__hide": false, - "total_acs": 53030, - "total_submitted": 61370, - "total_column_articles": 572, + "total_acs": 53118, + "total_submitted": 61471, + "total_column_articles": 574, "frontend_question_id": "1720", "is_new_question": false }, @@ -22524,8 +22608,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": 901, - "total_submitted": 1664, + "total_acs": 905, + "total_submitted": 1668, "total_column_articles": 26, "frontend_question_id": "1698", "is_new_question": false @@ -22545,9 +22629,9 @@ "question__title": "Daily Leads and Partners", "question__title_slug": "daily-leads-and-partners", "question__hide": false, - "total_acs": 19208, - "total_submitted": 23412, - "total_column_articles": 118, + "total_acs": 19581, + "total_submitted": 23872, + "total_column_articles": 122, "frontend_question_id": "1693", "is_new_question": false }, @@ -22566,8 +22650,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": 1580, - "total_submitted": 3039, + "total_acs": 1592, + "total_submitted": 3062, "total_column_articles": 46, "frontend_question_id": "1735", "is_new_question": false @@ -22587,8 +22671,8 @@ "question__title": "Decode XORed Permutation", "question__title_slug": "decode-xored-permutation", "question__hide": false, - "total_acs": 29217, - "total_submitted": 40344, + "total_acs": 29232, + "total_submitted": 40362, "total_column_articles": 381, "frontend_question_id": "1734", "is_new_question": false @@ -22608,9 +22692,9 @@ "question__title": "Minimum Number of People to Teach", "question__title_slug": "minimum-number-of-people-to-teach", "question__hide": false, - "total_acs": 3047, - "total_submitted": 6359, - "total_column_articles": 70, + "total_acs": 3072, + "total_submitted": 6404, + "total_column_articles": 71, "frontend_question_id": "1733", "is_new_question": false }, @@ -22629,9 +22713,9 @@ "question__title": "Find the Highest Altitude", "question__title_slug": "find-the-highest-altitude", "question__hide": false, - "total_acs": 18680, - "total_submitted": 23893, - "total_column_articles": 317, + "total_acs": 18793, + "total_submitted": 24026, + "total_column_articles": 320, "frontend_question_id": "1732", "is_new_question": false }, @@ -22650,8 +22734,8 @@ "question__title": "Minimum Operations to Make a Subsequence", "question__title_slug": "minimum-operations-to-make-a-subsequence", "question__hide": false, - "total_acs": 18010, - "total_submitted": 36246, + "total_acs": 18043, + "total_submitted": 36303, "total_column_articles": 194, "frontend_question_id": "1713", "is_new_question": false @@ -22671,9 +22755,9 @@ "question__title": "Ways to Split Array Into Three Subarrays", "question__title_slug": "ways-to-split-array-into-three-subarrays", "question__hide": false, - "total_acs": 11398, - "total_submitted": 40890, - "total_column_articles": 161, + "total_acs": 11503, + "total_submitted": 41241, + "total_column_articles": 162, "frontend_question_id": "1712", "is_new_question": false }, @@ -22692,8 +22776,8 @@ "question__title": "Count Good Meals", "question__title_slug": "count-good-meals", "question__hide": false, - "total_acs": 32133, - "total_submitted": 89432, + "total_acs": 32168, + "total_submitted": 89523, "total_column_articles": 385, "frontend_question_id": "1711", "is_new_question": false @@ -22713,9 +22797,9 @@ "question__title": "Maximum Units on a Truck", "question__title_slug": "maximum-units-on-a-truck", "question__hide": false, - "total_acs": 19256, - "total_submitted": 27650, - "total_column_articles": 296, + "total_acs": 19409, + "total_submitted": 27869, + "total_column_articles": 300, "frontend_question_id": "1710", "is_new_question": false }, @@ -22734,8 +22818,8 @@ "question__title": "Count Ways to Distribute Candies", "question__title_slug": "count-ways-to-distribute-candies", "question__hide": false, - "total_acs": 589, - "total_submitted": 874, + "total_acs": 594, + "total_submitted": 879, "total_column_articles": 20, "frontend_question_id": "1692", "is_new_question": false @@ -22755,8 +22839,8 @@ "question__title": "Invalid Tweets", "question__title_slug": "invalid-tweets", "question__hide": false, - "total_acs": 6040, - "total_submitted": 6709, + "total_acs": 6060, + "total_submitted": 6730, "total_column_articles": 46, "frontend_question_id": "1683", "is_new_question": false @@ -22776,8 +22860,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": 15946, - "total_submitted": 31454, + "total_acs": 15961, + "total_submitted": 31478, "total_column_articles": 165, "frontend_question_id": "1707", "is_new_question": false @@ -22797,9 +22881,9 @@ "question__title": "Find Minimum Time to Finish All Jobs", "question__title_slug": "find-minimum-time-to-finish-all-jobs", "question__hide": false, - "total_acs": 29136, - "total_submitted": 57359, - "total_column_articles": 210, + "total_acs": 29197, + "total_submitted": 57477, + "total_column_articles": 211, "frontend_question_id": "1723", "is_new_question": false }, @@ -22818,8 +22902,8 @@ "question__title": "Maximum Number of Eaten Apples", "question__title_slug": "maximum-number-of-eaten-apples", "question__hide": false, - "total_acs": 28535, - "total_submitted": 62921, + "total_acs": 28595, + "total_submitted": 63079, "total_column_articles": 385, "frontend_question_id": "1705", "is_new_question": false @@ -22839,8 +22923,8 @@ "question__title": "Determine if String Halves Are Alike", "question__title_slug": "determine-if-string-halves-are-alike", "question__hide": false, - "total_acs": 16884, - "total_submitted": 21913, + "total_acs": 16963, + "total_submitted": 22021, "total_column_articles": 281, "frontend_question_id": "1704", "is_new_question": false @@ -22860,8 +22944,8 @@ "question__title": "Longest Palindromic Subsequence II", "question__title_slug": "longest-palindromic-subsequence-ii", "question__hide": false, - "total_acs": 930, - "total_submitted": 1623, + "total_acs": 955, + "total_submitted": 1660, "total_column_articles": 36, "frontend_question_id": "1682", "is_new_question": false @@ -22881,8 +22965,8 @@ "question__title": "Product's Worth Over Invoices", "question__title_slug": "products-worth-over-invoices", "question__hide": false, - "total_acs": 3941, - "total_submitted": 11241, + "total_acs": 3958, + "total_submitted": 11306, "total_column_articles": 51, "frontend_question_id": "1677", "is_new_question": false @@ -22902,8 +22986,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": 12857, - "total_submitted": 18550, + "total_acs": 12867, + "total_submitted": 18564, "total_column_articles": 94, "frontend_question_id": "1719", "is_new_question": false @@ -22923,8 +23007,8 @@ "question__title": "Construct the Lexicographically Largest Valid Sequence", "question__title_slug": "construct-the-lexicographically-largest-valid-sequence", "question__hide": false, - "total_acs": 2993, - "total_submitted": 6021, + "total_acs": 3012, + "total_submitted": 6059, "total_column_articles": 70, "frontend_question_id": "1718", "is_new_question": false @@ -22944,8 +23028,8 @@ "question__title": "Maximum Score From Removing Substrings", "question__title_slug": "maximum-score-from-removing-substrings", "question__hide": false, - "total_acs": 3278, - "total_submitted": 7193, + "total_acs": 3303, + "total_submitted": 7246, "total_column_articles": 73, "frontend_question_id": "1717", "is_new_question": false @@ -22965,8 +23049,8 @@ "question__title": "Calculate Money in Leetcode Bank", "question__title_slug": "calculate-money-in-leetcode-bank", "question__hide": false, - "total_acs": 40083, - "total_submitted": 57637, + "total_acs": 40140, + "total_submitted": 57721, "total_column_articles": 725, "frontend_question_id": "1716", "is_new_question": false @@ -22986,8 +23070,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": 2643, - "total_submitted": 3228, + "total_acs": 2676, + "total_submitted": 3278, "total_column_articles": 48, "frontend_question_id": "1676", "is_new_question": false @@ -23007,8 +23091,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": 3145, - "total_submitted": 5726, + "total_acs": 3154, + "total_submitted": 5737, "total_column_articles": 63, "frontend_question_id": "1697", "is_new_question": false @@ -23028,8 +23112,8 @@ "question__title": "Jump Game VI", "question__title_slug": "jump-game-vi", "question__hide": false, - "total_acs": 10911, - "total_submitted": 27251, + "total_acs": 11004, + "total_submitted": 27415, "total_column_articles": 174, "frontend_question_id": "1696", "is_new_question": false @@ -23049,9 +23133,9 @@ "question__title": "Maximum Erasure Value", "question__title_slug": "maximum-erasure-value", "question__hide": false, - "total_acs": 12036, - "total_submitted": 23596, - "total_column_articles": 207, + "total_acs": 12098, + "total_submitted": 23707, + "total_column_articles": 208, "frontend_question_id": "1695", "is_new_question": false }, @@ -23070,9 +23154,9 @@ "question__title": "Reformat Phone Number", "question__title_slug": "reformat-phone-number", "question__hide": false, - "total_acs": 35944, - "total_submitted": 54051, - "total_column_articles": 541, + "total_acs": 36060, + "total_submitted": 54226, + "total_column_articles": 542, "frontend_question_id": "1694", "is_new_question": false }, @@ -23091,9 +23175,9 @@ "question__title": "Fix Names in a Table", "question__title_slug": "fix-names-in-a-table", "question__hide": false, - "total_acs": 34796, - "total_submitted": 54375, - "total_column_articles": 202, + "total_acs": 35545, + "total_submitted": 55521, + "total_column_articles": 208, "frontend_question_id": "1667", "is_new_question": false }, @@ -23133,8 +23217,8 @@ "question__title": "Sum Of Special Evenly-Spaced Elements In Array", "question__title_slug": "sum-of-special-evenly-spaced-elements-in-array", "question__hide": false, - "total_acs": 390, - "total_submitted": 681, + "total_acs": 391, + "total_submitted": 684, "total_column_articles": 12, "frontend_question_id": "1714", "is_new_question": false @@ -23154,8 +23238,8 @@ "question__title": "Stone Game VII", "question__title_slug": "stone-game-vii", "question__hide": false, - "total_acs": 5828, - "total_submitted": 10630, + "total_acs": 5845, + "total_submitted": 10653, "total_column_articles": 124, "frontend_question_id": "1690", "is_new_question": false @@ -23175,8 +23259,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": 19904, - "total_submitted": 22972, + "total_acs": 19984, + "total_submitted": 23064, "total_column_articles": 279, "frontend_question_id": "1689", "is_new_question": false @@ -23196,8 +23280,8 @@ "question__title": "Count of Matches in Tournament", "question__title_slug": "count-of-matches-in-tournament", "question__hide": false, - "total_acs": 57483, - "total_submitted": 68412, + "total_acs": 57603, + "total_submitted": 68564, "total_column_articles": 621, "frontend_question_id": "1688", "is_new_question": false @@ -23217,9 +23301,9 @@ "question__title": "Minimum Adjacent Swaps for K Consecutive Ones", "question__title_slug": "minimum-adjacent-swaps-for-k-consecutive-ones", "question__hide": false, - "total_acs": 2472, - "total_submitted": 6545, - "total_column_articles": 37, + "total_acs": 2507, + "total_submitted": 6606, + "total_column_articles": 38, "frontend_question_id": "1703", "is_new_question": false }, @@ -23238,9 +23322,9 @@ "question__title": "Maximum Binary String After Change", "question__title_slug": "maximum-binary-string-after-change", "question__hide": false, - "total_acs": 4313, - "total_submitted": 8941, - "total_column_articles": 83, + "total_acs": 4344, + "total_submitted": 9008, + "total_column_articles": 85, "frontend_question_id": "1702", "is_new_question": false }, @@ -23259,9 +23343,9 @@ "question__title": "Average Waiting Time", "question__title_slug": "average-waiting-time", "question__hide": false, - "total_acs": 6382, - "total_submitted": 10544, - "total_column_articles": 127, + "total_acs": 6419, + "total_submitted": 10603, + "total_column_articles": 128, "frontend_question_id": "1701", "is_new_question": false }, @@ -23280,9 +23364,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": 46257, - "total_submitted": 62467, - "total_column_articles": 716, + "total_acs": 46411, + "total_submitted": 62671, + "total_column_articles": 717, "frontend_question_id": "1700", "is_new_question": false }, @@ -23301,8 +23385,8 @@ "question__title": "Average Time of Process per Machine", "question__title_slug": "average-time-of-process-per-machine", "question__hide": false, - "total_acs": 5294, - "total_submitted": 7086, + "total_acs": 5321, + "total_submitted": 7118, "total_column_articles": 80, "frontend_question_id": "1661", "is_new_question": false @@ -23322,9 +23406,9 @@ "question__title": "Concatenation of Consecutive Binary Numbers", "question__title_slug": "concatenation-of-consecutive-binary-numbers", "question__hide": false, - "total_acs": 7158, - "total_submitted": 14698, - "total_column_articles": 87, + "total_acs": 7227, + "total_submitted": 14829, + "total_column_articles": 88, "frontend_question_id": "1680", "is_new_question": false }, @@ -23343,9 +23427,9 @@ "question__title": "Minimum Incompatibility", "question__title_slug": "minimum-incompatibility", "question__hide": false, - "total_acs": 3478, - "total_submitted": 8250, - "total_column_articles": 68, + "total_acs": 3505, + "total_submitted": 8317, + "total_column_articles": 69, "frontend_question_id": "1681", "is_new_question": false }, @@ -23364,9 +23448,9 @@ "question__title": "Max Number of K-Sum Pairs", "question__title_slug": "max-number-of-k-sum-pairs", "question__hide": false, - "total_acs": 9605, - "total_submitted": 18540, - "total_column_articles": 158, + "total_acs": 9768, + "total_submitted": 18852, + "total_column_articles": 163, "frontend_question_id": "1679", "is_new_question": false }, @@ -23385,9 +23469,9 @@ "question__title": "Goal Parser Interpretation", "question__title_slug": "goal-parser-interpretation", "question__hide": false, - "total_acs": 26636, - "total_submitted": 31900, - "total_column_articles": 469, + "total_acs": 51036, + "total_submitted": 58829, + "total_column_articles": 706, "frontend_question_id": "1678", "is_new_question": false }, @@ -23406,8 +23490,8 @@ "question__title": "Correct a Binary Tree", "question__title_slug": "correct-a-binary-tree", "question__hide": false, - "total_acs": 777, - "total_submitted": 1037, + "total_acs": 781, + "total_submitted": 1041, "total_column_articles": 34, "frontend_question_id": "1660", "is_new_question": false @@ -23427,8 +23511,8 @@ "question__title": "Hopper Company Queries III", "question__title_slug": "hopper-company-queries-iii", "question__hide": false, - "total_acs": 1613, - "total_submitted": 2479, + "total_acs": 1623, + "total_submitted": 2500, "total_column_articles": 34, "frontend_question_id": "1651", "is_new_question": false @@ -23448,9 +23532,9 @@ "question__title": "Minimize Deviation in Array", "question__title_slug": "minimize-deviation-in-array", "question__hide": false, - "total_acs": 5466, - "total_submitted": 12144, - "total_column_articles": 68, + "total_acs": 5493, + "total_submitted": 12198, + "total_column_articles": 69, "frontend_question_id": "1675", "is_new_question": false }, @@ -23469,8 +23553,8 @@ "question__title": "Minimum Moves to Make Array Complementary", "question__title_slug": "minimum-moves-to-make-array-complementary", "question__hide": false, - "total_acs": 3677, - "total_submitted": 9015, + "total_acs": 3722, + "total_submitted": 9101, "total_column_articles": 77, "frontend_question_id": "1674", "is_new_question": false @@ -23490,8 +23574,8 @@ "question__title": "Find the Most Competitive Subsequence", "question__title_slug": "find-the-most-competitive-subsequence", "question__hide": false, - "total_acs": 10598, - "total_submitted": 27451, + "total_acs": 10657, + "total_submitted": 27567, "total_column_articles": 216, "frontend_question_id": "1673", "is_new_question": false @@ -23511,9 +23595,9 @@ "question__title": "Richest Customer Wealth", "question__title_slug": "richest-customer-wealth", "question__hide": false, - "total_acs": 110740, - "total_submitted": 128140, - "total_column_articles": 1109, + "total_acs": 111724, + "total_submitted": 129315, + "total_column_articles": 1123, "frontend_question_id": "1672", "is_new_question": false }, @@ -23532,8 +23616,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": 4267, - "total_submitted": 5343, + "total_acs": 4291, + "total_submitted": 5373, "total_column_articles": 58, "frontend_question_id": "1650", "is_new_question": false @@ -23553,8 +23637,8 @@ "question__title": "Delivering Boxes from Storage to Ports", "question__title_slug": "delivering-boxes-from-storage-to-ports", "question__hide": false, - "total_acs": 1690, - "total_submitted": 4022, + "total_acs": 1706, + "total_submitted": 4051, "total_column_articles": 36, "frontend_question_id": "1687", "is_new_question": false @@ -23574,9 +23658,9 @@ "question__title": "Stone Game VI", "question__title_slug": "stone-game-vi", "question__hide": false, - "total_acs": 4075, - "total_submitted": 8353, - "total_column_articles": 69, + "total_acs": 4130, + "total_submitted": 8438, + "total_column_articles": 70, "frontend_question_id": "1686", "is_new_question": false }, @@ -23595,9 +23679,9 @@ "question__title": "Sum of Absolute Differences in a Sorted Array", "question__title_slug": "sum-of-absolute-differences-in-a-sorted-array", "question__hide": false, - "total_acs": 6320, - "total_submitted": 9834, - "total_column_articles": 140, + "total_acs": 6488, + "total_submitted": 10204, + "total_column_articles": 145, "frontend_question_id": "1685", "is_new_question": false }, @@ -23616,9 +23700,9 @@ "question__title": "Count the Number of Consistent Strings", "question__title_slug": "count-the-number-of-consistent-strings", "question__hide": false, - "total_acs": 24385, - "total_submitted": 29699, - "total_column_articles": 485, + "total_acs": 56002, + "total_submitted": 65269, + "total_column_articles": 802, "frontend_question_id": "1684", "is_new_question": false }, @@ -23637,8 +23721,8 @@ "question__title": "Hopper Company Queries II", "question__title_slug": "hopper-company-queries-ii", "question__hide": false, - "total_acs": 1555, - "total_submitted": 3756, + "total_acs": 1568, + "total_submitted": 3794, "total_column_articles": 33, "frontend_question_id": "1645", "is_new_question": false @@ -23658,9 +23742,9 @@ "question__title": "Minimum Initial Energy to Finish Tasks", "question__title_slug": "minimum-initial-energy-to-finish-tasks", "question__hide": false, - "total_acs": 6933, - "total_submitted": 10636, - "total_column_articles": 111, + "total_acs": 6968, + "total_submitted": 10702, + "total_column_articles": 112, "frontend_question_id": "1665", "is_new_question": false }, @@ -23679,8 +23763,8 @@ "question__title": "Ways to Make a Fair Array", "question__title_slug": "ways-to-make-a-fair-array", "question__hide": false, - "total_acs": 6953, - "total_submitted": 12460, + "total_acs": 6988, + "total_submitted": 12559, "total_column_articles": 133, "frontend_question_id": "1664", "is_new_question": false @@ -23700,9 +23784,9 @@ "question__title": "Smallest String With A Given Numeric Value", "question__title_slug": "smallest-string-with-a-given-numeric-value", "question__hide": false, - "total_acs": 9971, - "total_submitted": 17393, - "total_column_articles": 169, + "total_acs": 10044, + "total_submitted": 17541, + "total_column_articles": 171, "frontend_question_id": "1663", "is_new_question": false }, @@ -23721,9 +23805,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": 54977, - "total_submitted": 67456, - "total_column_articles": 622, + "total_acs": 64273, + "total_submitted": 79156, + "total_column_articles": 675, "frontend_question_id": "1662", "is_new_question": false }, @@ -23742,8 +23826,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": 3579, - "total_submitted": 6472, + "total_acs": 3621, + "total_submitted": 6543, "total_column_articles": 49, "frontend_question_id": "1644", "is_new_question": false @@ -23763,8 +23847,8 @@ "question__title": "Hopper Company Queries I", "question__title_slug": "hopper-company-queries-i", "question__hide": false, - "total_acs": 2269, - "total_submitted": 4263, + "total_acs": 2286, + "total_submitted": 4286, "total_column_articles": 50, "frontend_question_id": "1635", "is_new_question": false @@ -23784,8 +23868,8 @@ "question__title": "Maximize Grid Happiness", "question__title_slug": "maximize-grid-happiness", "question__hide": false, - "total_acs": 1822, - "total_submitted": 4279, + "total_acs": 1829, + "total_submitted": 4299, "total_column_articles": 33, "frontend_question_id": "1659", "is_new_question": false @@ -23805,9 +23889,9 @@ "question__title": "Determine if Two Strings Are Close", "question__title_slug": "determine-if-two-strings-are-close", "question__hide": false, - "total_acs": 7276, - "total_submitted": 15577, - "total_column_articles": 114, + "total_acs": 7344, + "total_submitted": 15694, + "total_column_articles": 116, "frontend_question_id": "1657", "is_new_question": false }, @@ -23826,9 +23910,9 @@ "question__title": "Minimum Operations to Reduce X to Zero", "question__title_slug": "minimum-operations-to-reduce-x-to-zero", "question__hide": false, - "total_acs": 15619, - "total_submitted": 47845, - "total_column_articles": 228, + "total_acs": 15763, + "total_submitted": 48223, + "total_column_articles": 232, "frontend_question_id": "1658", "is_new_question": false }, @@ -23847,8 +23931,8 @@ "question__title": "Design an Ordered Stream", "question__title_slug": "design-an-ordered-stream", "question__hide": false, - "total_acs": 38044, - "total_submitted": 45118, + "total_acs": 38130, + "total_submitted": 45234, "total_column_articles": 361, "frontend_question_id": "1656", "is_new_question": false @@ -23868,9 +23952,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": 1565, - "total_submitted": 2648, - "total_column_articles": 49, + "total_acs": 1584, + "total_submitted": 2682, + "total_column_articles": 50, "frontend_question_id": "1634", "is_new_question": false }, @@ -23889,8 +23973,8 @@ "question__title": "Percentage of Users Attended a Contest", "question__title_slug": "percentage-of-users-attended-a-contest", "question__hide": false, - "total_acs": 7443, - "total_submitted": 11460, + "total_acs": 7532, + "total_submitted": 11594, "total_column_articles": 58, "frontend_question_id": "1633", "is_new_question": false @@ -23910,9 +23994,9 @@ "question__title": "Create Sorted Array through Instructions", "question__title_slug": "create-sorted-array-through-instructions", "question__hide": false, - "total_acs": 3726, - "total_submitted": 7661, - "total_column_articles": 94, + "total_acs": 3768, + "total_submitted": 7725, + "total_column_articles": 95, "frontend_question_id": "1649", "is_new_question": false }, @@ -23931,9 +24015,9 @@ "question__title": "Sell Diminishing-Valued Colored Balls", "question__title_slug": "sell-diminishing-valued-colored-balls", "question__hide": false, - "total_acs": 6107, - "total_submitted": 19788, - "total_column_articles": 135, + "total_acs": 6146, + "total_submitted": 19889, + "total_column_articles": 136, "frontend_question_id": "1648", "is_new_question": false }, @@ -23952,9 +24036,9 @@ "question__title": "Minimum Deletions to Make Character Frequencies Unique", "question__title_slug": "minimum-deletions-to-make-character-frequencies-unique", "question__hide": false, - "total_acs": 11054, - "total_submitted": 20572, - "total_column_articles": 163, + "total_acs": 11131, + "total_submitted": 20697, + "total_column_articles": 164, "frontend_question_id": "1647", "is_new_question": false }, @@ -23973,9 +24057,9 @@ "question__title": "Get Maximum in Generated Array", "question__title_slug": "get-maximum-in-generated-array", "question__hide": false, - "total_acs": 44868, - "total_submitted": 85424, - "total_column_articles": 462, + "total_acs": 45053, + "total_submitted": 85776, + "total_column_articles": 466, "frontend_question_id": "1646", "is_new_question": false }, @@ -23994,8 +24078,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": 832, - "total_submitted": 1013, + "total_acs": 844, + "total_submitted": 1025, "total_column_articles": 30, "frontend_question_id": "1628", "is_new_question": false @@ -24015,8 +24099,8 @@ "question__title": "Design Front Middle Back Queue", "question__title_slug": "design-front-middle-back-queue", "question__hide": false, - "total_acs": 6802, - "total_submitted": 13000, + "total_acs": 6849, + "total_submitted": 13085, "total_column_articles": 133, "frontend_question_id": "1670", "is_new_question": false @@ -24036,9 +24120,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": 3134, - "total_submitted": 6698, - "total_column_articles": 62, + "total_acs": 3180, + "total_submitted": 6787, + "total_column_articles": 63, "frontend_question_id": "1671", "is_new_question": false }, @@ -24057,9 +24141,9 @@ "question__title": "Merge In Between Linked Lists", "question__title_slug": "merge-in-between-linked-lists", "question__hide": false, - "total_acs": 20430, - "total_submitted": 27240, - "total_column_articles": 361, + "total_acs": 20611, + "total_submitted": 27513, + "total_column_articles": 365, "frontend_question_id": "1669", "is_new_question": false }, @@ -24078,9 +24162,9 @@ "question__title": "Maximum Repeating Substring", "question__title_slug": "maximum-repeating-substring", "question__hide": false, - "total_acs": 11234, - "total_submitted": 25269, - "total_column_articles": 217, + "total_acs": 40724, + "total_submitted": 85961, + "total_column_articles": 558, "frontend_question_id": "1668", "is_new_question": false }, @@ -24099,8 +24183,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": 5515, - "total_submitted": 7052, + "total_acs": 5541, + "total_submitted": 7081, "total_column_articles": 57, "frontend_question_id": "1623", "is_new_question": false @@ -24120,9 +24204,9 @@ "question__title": "Furthest Building You Can Reach", "question__title_slug": "furthest-building-you-can-reach", "question__hide": false, - "total_acs": 9407, - "total_submitted": 20760, - "total_column_articles": 154, + "total_acs": 9457, + "total_submitted": 20852, + "total_column_articles": 156, "frontend_question_id": "1642", "is_new_question": false }, @@ -24141,9 +24225,9 @@ "question__title": "Count Sorted Vowel Strings", "question__title_slug": "count-sorted-vowel-strings", "question__hide": false, - "total_acs": 14903, - "total_submitted": 19167, - "total_column_articles": 340, + "total_acs": 14953, + "total_submitted": 19232, + "total_column_articles": 341, "frontend_question_id": "1641", "is_new_question": false }, @@ -24162,9 +24246,9 @@ "question__title": "Check Array Formation Through Concatenation", "question__title_slug": "check-array-formation-through-concatenation", "question__hide": false, - "total_acs": 43087, - "total_submitted": 70447, - "total_column_articles": 646, + "total_acs": 43141, + "total_submitted": 70530, + "total_column_articles": 647, "frontend_question_id": "1640", "is_new_question": false }, @@ -24183,9 +24267,9 @@ "question__title": "Find the Missing IDs", "question__title_slug": "find-the-missing-ids", "question__hide": false, - "total_acs": 4359, - "total_submitted": 5921, - "total_column_articles": 58, + "total_acs": 4406, + "total_submitted": 5982, + "total_column_articles": 59, "frontend_question_id": "1613", "is_new_question": false }, @@ -24204,8 +24288,8 @@ "question__title": "Distribute Repeating Integers", "question__title_slug": "distribute-repeating-integers", "question__hide": false, - "total_acs": 3388, - "total_submitted": 8640, + "total_acs": 3411, + "total_submitted": 8705, "total_column_articles": 53, "frontend_question_id": "1655", "is_new_question": false @@ -24225,9 +24309,9 @@ "question__title": "Minimum Jumps to Reach Home", "question__title_slug": "minimum-jumps-to-reach-home", "question__hide": false, - "total_acs": 7559, - "total_submitted": 24447, - "total_column_articles": 103, + "total_acs": 7600, + "total_submitted": 24601, + "total_column_articles": 104, "frontend_question_id": "1654", "is_new_question": false }, @@ -24246,9 +24330,9 @@ "question__title": "Minimum Deletions to Make String Balanced", "question__title_slug": "minimum-deletions-to-make-string-balanced", "question__hide": false, - "total_acs": 6071, - "total_submitted": 11186, - "total_column_articles": 136, + "total_acs": 6101, + "total_submitted": 11239, + "total_column_articles": 137, "frontend_question_id": "1653", "is_new_question": false }, @@ -24267,9 +24351,9 @@ "question__title": "Defuse the Bomb", "question__title_slug": "defuse-the-bomb", "question__hide": false, - "total_acs": 35589, - "total_submitted": 53380, - "total_column_articles": 591, + "total_acs": 35661, + "total_submitted": 53484, + "total_column_articles": 592, "frontend_question_id": "1652", "is_new_question": false }, @@ -24288,9 +24372,9 @@ "question__title": "Path With Minimum Effort", "question__title_slug": "path-with-minimum-effort", "question__hide": false, - "total_acs": 37220, - "total_submitted": 73601, - "total_column_articles": 405, + "total_acs": 37362, + "total_submitted": 73842, + "total_column_articles": 407, "frontend_question_id": "1631", "is_new_question": false }, @@ -24309,9 +24393,9 @@ "question__title": "Arithmetic Subarrays", "question__title_slug": "arithmetic-subarrays", "question__hide": false, - "total_acs": 10994, - "total_submitted": 14501, - "total_column_articles": 200, + "total_acs": 11061, + "total_submitted": 14584, + "total_column_articles": 204, "frontend_question_id": "1630", "is_new_question": false }, @@ -24330,9 +24414,9 @@ "question__title": "Slowest Key", "question__title_slug": "slowest-key", "question__hide": false, - "total_acs": 35602, - "total_submitted": 63769, - "total_column_articles": 432, + "total_acs": 35683, + "total_submitted": 63886, + "total_column_articles": 433, "frontend_question_id": "1629", "is_new_question": false }, @@ -24351,8 +24435,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": 765, - "total_submitted": 1040, + "total_acs": 768, + "total_submitted": 1045, "total_column_articles": 35, "frontend_question_id": "1612", "is_new_question": false @@ -24372,8 +24456,8 @@ "question__title": "Sellers With No Sales", "question__title_slug": "sellers-with-no-sales", "question__hide": false, - "total_acs": 7599, - "total_submitted": 13894, + "total_acs": 7692, + "total_submitted": 14062, "total_column_articles": 80, "frontend_question_id": "1607", "is_new_question": false @@ -24393,9 +24477,9 @@ "question__title": "Best Team With No Conflicts", "question__title_slug": "best-team-with-no-conflicts", "question__hide": false, - "total_acs": 5368, - "total_submitted": 13107, - "total_column_articles": 113, + "total_acs": 5414, + "total_submitted": 13217, + "total_column_articles": 114, "frontend_question_id": "1626", "is_new_question": false }, @@ -24414,9 +24498,9 @@ "question__title": "Lexicographically Smallest String After Applying Operations", "question__title_slug": "lexicographically-smallest-string-after-applying-operations", "question__hide": false, - "total_acs": 3767, - "total_submitted": 6757, - "total_column_articles": 78, + "total_acs": 3779, + "total_submitted": 6776, + "total_column_articles": 79, "frontend_question_id": "1625", "is_new_question": false }, @@ -24435,8 +24519,8 @@ "question__title": "Largest Substring Between Two Equal Characters", "question__title_slug": "largest-substring-between-two-equal-characters", "question__hide": false, - "total_acs": 44225, - "total_submitted": 68494, + "total_acs": 44339, + "total_submitted": 68682, "total_column_articles": 666, "frontend_question_id": "1624", "is_new_question": false @@ -24456,8 +24540,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": 1657, - "total_submitted": 2224, + "total_acs": 1664, + "total_submitted": 2232, "total_column_articles": 59, "frontend_question_id": "1602", "is_new_question": false @@ -24477,8 +24561,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": 1993, - "total_submitted": 4508, + "total_acs": 2007, + "total_submitted": 4529, "total_column_articles": 46, "frontend_question_id": "1639", "is_new_question": false @@ -24498,8 +24582,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": 4163, - "total_submitted": 5804, + "total_acs": 4180, + "total_submitted": 5826, "total_column_articles": 72, "frontend_question_id": "1638", "is_new_question": false @@ -24519,8 +24603,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": 7879, - "total_submitted": 9714, + "total_acs": 7923, + "total_submitted": 9764, "total_column_articles": 119, "frontend_question_id": "1637", "is_new_question": false @@ -24540,9 +24624,9 @@ "question__title": "Sort Array by Increasing Frequency", "question__title_slug": "sort-array-by-increasing-frequency", "question__hide": false, - "total_acs": 45286, - "total_submitted": 60527, - "total_column_articles": 574, + "total_acs": 45375, + "total_submitted": 60637, + "total_column_articles": 575, "frontend_question_id": "1636", "is_new_question": false }, @@ -24561,8 +24645,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": 2481, - "total_submitted": 3841, + "total_acs": 2491, + "total_submitted": 3853, "total_column_articles": 53, "frontend_question_id": "1617", "is_new_question": false @@ -24582,9 +24666,9 @@ "question__title": "Split Two Strings to Make Palindrome", "question__title_slug": "split-two-strings-to-make-palindrome", "question__hide": false, - "total_acs": 6223, - "total_submitted": 22104, - "total_column_articles": 119, + "total_acs": 6245, + "total_submitted": 22150, + "total_column_articles": 120, "frontend_question_id": "1616", "is_new_question": false }, @@ -24603,9 +24687,9 @@ "question__title": "Maximal Network Rank", "question__title_slug": "maximal-network-rank", "question__hide": false, - "total_acs": 9167, - "total_submitted": 16340, - "total_column_articles": 113, + "total_acs": 9293, + "total_submitted": 16566, + "total_column_articles": 114, "frontend_question_id": "1615", "is_new_question": false }, @@ -24624,9 +24708,9 @@ "question__title": "Maximum Nesting Depth of the Parentheses", "question__title_slug": "maximum-nesting-depth-of-the-parentheses", "question__hide": false, - "total_acs": 57098, - "total_submitted": 68495, - "total_column_articles": 785, + "total_acs": 57306, + "total_submitted": 68747, + "total_column_articles": 786, "frontend_question_id": "1614", "is_new_question": false }, @@ -24645,9 +24729,9 @@ "question__title": "Build Binary Expression Tree From Infix Expression", "question__title_slug": "build-binary-expression-tree-from-infix-expression", "question__hide": false, - "total_acs": 681, - "total_submitted": 997, - "total_column_articles": 27, + "total_acs": 690, + "total_submitted": 1008, + "total_column_articles": 28, "frontend_question_id": "1597", "is_new_question": false }, @@ -24666,9 +24750,9 @@ "question__title": "The Most Frequently Ordered Products for Each Customer", "question__title_slug": "the-most-frequently-ordered-products-for-each-customer", "question__hide": false, - "total_acs": 5770, - "total_submitted": 7775, - "total_column_articles": 84, + "total_acs": 5824, + "total_submitted": 7834, + "total_column_articles": 85, "frontend_question_id": "1596", "is_new_question": false }, @@ -24687,9 +24771,9 @@ "question__title": "Bank Account Summary II", "question__title_slug": "bank-account-summary-ii", "question__hide": false, - "total_acs": 19206, - "total_submitted": 23074, - "total_column_articles": 128, + "total_acs": 19573, + "total_submitted": 23524, + "total_column_articles": 131, "frontend_question_id": "1587", "is_new_question": false }, @@ -24708,8 +24792,8 @@ "question__title": "Maximum Number of Visible Points", "question__title_slug": "maximum-number-of-visible-points", "question__hide": false, - "total_acs": 16984, - "total_submitted": 38409, + "total_acs": 16994, + "total_submitted": 38430, "total_column_articles": 159, "frontend_question_id": "1610", "is_new_question": false @@ -24729,9 +24813,9 @@ "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": 2914, - "total_submitted": 4725, - "total_column_articles": 69, + "total_acs": 2927, + "total_submitted": 4741, + "total_column_articles": 70, "frontend_question_id": "1611", "is_new_question": false }, @@ -24750,9 +24834,9 @@ "question__title": "Even Odd Tree", "question__title_slug": "even-odd-tree", "question__hide": false, - "total_acs": 31442, - "total_submitted": 53819, - "total_column_articles": 488, + "total_acs": 31497, + "total_submitted": 53925, + "total_column_articles": 489, "frontend_question_id": "1609", "is_new_question": false }, @@ -24771,9 +24855,9 @@ "question__title": "Special Array With X Elements Greater Than or Equal X", "question__title_slug": "special-array-with-x-elements-greater-than-or-equal-x", "question__hide": false, - "total_acs": 49968, - "total_submitted": 81047, - "total_column_articles": 751, + "total_acs": 50185, + "total_submitted": 81438, + "total_column_articles": 752, "frontend_question_id": "1608", "is_new_question": false }, @@ -24792,8 +24876,8 @@ "question__title": "Binary Search Tree Iterator II", "question__title_slug": "binary-search-tree-iterator-ii", "question__hide": false, - "total_acs": 750, - "total_submitted": 1193, + "total_acs": 757, + "total_submitted": 1203, "total_column_articles": 37, "frontend_question_id": "1586", "is_new_question": false @@ -24813,9 +24897,9 @@ "question__title": "Fancy Sequence", "question__title_slug": "fancy-sequence", "question__hide": false, - "total_acs": 4075, - "total_submitted": 24456, - "total_column_articles": 92, + "total_acs": 4122, + "total_submitted": 24645, + "total_column_articles": 93, "frontend_question_id": "1622", "is_new_question": false }, @@ -24834,8 +24918,8 @@ "question__title": "Cat and Mouse II", "question__title_slug": "cat-and-mouse-ii", "question__hide": false, - "total_acs": 13550, - "total_submitted": 21027, + "total_acs": 13561, + "total_submitted": 21045, "total_column_articles": 82, "frontend_question_id": "1728", "is_new_question": false @@ -24855,9 +24939,9 @@ "question__title": "Coordinate With Maximum Network Quality", "question__title_slug": "coordinate-with-maximum-network-quality", "question__hide": false, - "total_acs": 3568, - "total_submitted": 9426, - "total_column_articles": 61, + "total_acs": 28043, + "total_submitted": 60640, + "total_column_articles": 276, "frontend_question_id": "1620", "is_new_question": false }, @@ -24876,8 +24960,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": 2525, - "total_submitted": 5438, + "total_acs": 2552, + "total_submitted": 5503, "total_column_articles": 49, "frontend_question_id": "1621", "is_new_question": false @@ -24897,9 +24981,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": 28100, - "total_submitted": 34522, - "total_column_articles": 208, + "total_acs": 28604, + "total_submitted": 35158, + "total_column_articles": 214, "frontend_question_id": "1581", "is_new_question": false }, @@ -24918,8 +25002,8 @@ "question__title": "Maximum Number of Achievable Transfer Requests", "question__title_slug": "maximum-number-of-achievable-transfer-requests", "question__hide": false, - "total_acs": 21218, - "total_submitted": 34347, + "total_acs": 21234, + "total_submitted": 34388, "total_column_articles": 233, "frontend_question_id": "1601", "is_new_question": false @@ -24939,9 +25023,9 @@ "question__title": "Throne Inheritance", "question__title_slug": "throne-inheritance", "question__hide": false, - "total_acs": 18648, - "total_submitted": 28207, - "total_column_articles": 227, + "total_acs": 18684, + "total_submitted": 28265, + "total_column_articles": 228, "frontend_question_id": "1600", "is_new_question": false }, @@ -24960,8 +25044,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": 4883, - "total_submitted": 11470, + "total_acs": 4899, + "total_submitted": 11512, "total_column_articles": 85, "frontend_question_id": "1599", "is_new_question": false @@ -24981,8 +25065,8 @@ "question__title": "Crawler Log Folder", "question__title_slug": "crawler-log-folder", "question__hide": false, - "total_acs": 42580, - "total_submitted": 61031, + "total_acs": 42653, + "total_submitted": 61148, "total_column_articles": 539, "frontend_question_id": "1598", "is_new_question": false @@ -25002,8 +25086,8 @@ "question__title": "Put Boxes Into the Warehouse II", "question__title_slug": "put-boxes-into-the-warehouse-ii", "question__hide": false, - "total_acs": 521, - "total_submitted": 883, + "total_acs": 527, + "total_submitted": 895, "total_column_articles": 30, "frontend_question_id": "1580", "is_new_question": false @@ -25023,9 +25107,9 @@ "question__title": "Warehouse Manager", "question__title_slug": "warehouse-manager", "question__hide": false, - "total_acs": 8711, - "total_submitted": 11182, - "total_column_articles": 75, + "total_acs": 8813, + "total_submitted": 11314, + "total_column_articles": 76, "frontend_question_id": "1571", "is_new_question": false }, @@ -25044,9 +25128,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": 2682, - "total_submitted": 5418, - "total_column_articles": 48, + "total_acs": 2694, + "total_submitted": 5438, + "total_column_articles": 49, "frontend_question_id": "1595", "is_new_question": false }, @@ -25065,9 +25149,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": 5625, - "total_submitted": 16993, - "total_column_articles": 119, + "total_acs": 5648, + "total_submitted": 17047, + "total_column_articles": 120, "frontend_question_id": "1594", "is_new_question": false }, @@ -25086,8 +25170,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": 8084, - "total_submitted": 14239, + "total_acs": 8113, + "total_submitted": 14303, "total_column_articles": 134, "frontend_question_id": "1593", "is_new_question": false @@ -25107,9 +25191,9 @@ "question__title": "Rearrange Spaces Between Words", "question__title_slug": "rearrange-spaces-between-words", "question__hide": false, - "total_acs": 39080, - "total_submitted": 82929, - "total_column_articles": 562, + "total_acs": 39139, + "total_submitted": 83085, + "total_column_articles": 563, "frontend_question_id": "1592", "is_new_question": false }, @@ -25128,8 +25212,8 @@ "question__title": "Dot Product of Two Sparse Vectors", "question__title_slug": "dot-product-of-two-sparse-vectors", "question__hide": false, - "total_acs": 3795, - "total_submitted": 4261, + "total_acs": 3813, + "total_submitted": 4281, "total_column_articles": 55, "frontend_question_id": "1570", "is_new_question": false @@ -25149,8 +25233,8 @@ "question__title": "Unique Orders and Customers Per Month", "question__title_slug": "unique-orders-and-customers-per-month", "question__hide": false, - "total_acs": 5507, - "total_submitted": 7481, + "total_acs": 5524, + "total_submitted": 7499, "total_column_articles": 53, "frontend_question_id": "1565", "is_new_question": false @@ -25170,9 +25254,9 @@ "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": 5412, - "total_submitted": 7133, - "total_column_articles": 98, + "total_acs": 5435, + "total_submitted": 7161, + "total_column_articles": 99, "frontend_question_id": "1605", "is_new_question": false }, @@ -25191,8 +25275,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": 20471, - "total_submitted": 42181, + "total_acs": 20493, + "total_submitted": 42239, "total_column_articles": 198, "frontend_question_id": "1606", "is_new_question": false @@ -25212,9 +25296,9 @@ "question__title": "Alert Using Same Key-Card Three or More Times in a One Hour Period", "question__title_slug": "alert-using-same-key-card-three-or-more-times-in-a-one-hour-period", "question__hide": false, - "total_acs": 5542, - "total_submitted": 12996, - "total_column_articles": 96, + "total_acs": 5575, + "total_submitted": 13081, + "total_column_articles": 98, "frontend_question_id": "1604", "is_new_question": false }, @@ -25233,8 +25317,8 @@ "question__title": "Design Parking System", "question__title_slug": "design-parking-system", "question__hide": false, - "total_acs": 70075, - "total_submitted": 83281, + "total_acs": 70263, + "total_submitted": 83517, "total_column_articles": 559, "frontend_question_id": "1603", "is_new_question": false @@ -25254,8 +25338,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": 2983, - "total_submitted": 6866, + "total_acs": 2989, + "total_submitted": 6877, "total_column_articles": 52, "frontend_question_id": "1585", "is_new_question": false @@ -25275,9 +25359,9 @@ "question__title": "Min Cost to Connect All Points", "question__title_slug": "min-cost-to-connect-all-points", "question__hide": false, - "total_acs": 43291, - "total_submitted": 65390, - "total_column_articles": 544, + "total_acs": 43539, + "total_submitted": 65791, + "total_column_articles": 548, "frontend_question_id": "1584", "is_new_question": false }, @@ -25296,8 +25380,8 @@ "question__title": "Count Unhappy Friends", "question__title_slug": "count-unhappy-friends", "question__hide": false, - "total_acs": 20008, - "total_submitted": 29360, + "total_acs": 20040, + "total_submitted": 29412, "total_column_articles": 253, "frontend_question_id": "1583", "is_new_question": false @@ -25317,8 +25401,8 @@ "question__title": "Special Positions in a Binary Matrix", "question__title_slug": "special-positions-in-a-binary-matrix", "question__hide": false, - "total_acs": 39867, - "total_submitted": 57174, + "total_acs": 39927, + "total_submitted": 57277, "total_column_articles": 452, "frontend_question_id": "1582", "is_new_question": false @@ -25338,8 +25422,8 @@ "question__title": "Put Boxes Into the Warehouse I", "question__title_slug": "put-boxes-into-the-warehouse-i", "question__hide": false, - "total_acs": 1016, - "total_submitted": 1773, + "total_acs": 1031, + "total_submitted": 1803, "total_column_articles": 39, "frontend_question_id": "1564", "is_new_question": false @@ -25359,8 +25443,8 @@ "question__title": "Bank Account Summary", "question__title_slug": "bank-account-summary", "question__hide": false, - "total_acs": 4728, - "total_submitted": 10649, + "total_acs": 4743, + "total_submitted": 10681, "total_column_articles": 72, "frontend_question_id": "1555", "is_new_question": false @@ -25380,9 +25464,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": 17877, - "total_submitted": 28902, - "total_column_articles": 320, + "total_acs": 17903, + "total_submitted": 28939, + "total_column_articles": 321, "frontend_question_id": "1579", "is_new_question": false }, @@ -25401,8 +25485,8 @@ "question__title": "Minimum Time to Make Rope Colorful", "question__title_slug": "minimum-time-to-make-rope-colorful", "question__hide": false, - "total_acs": 14075, - "total_submitted": 23649, + "total_acs": 14123, + "total_submitted": 23738, "total_column_articles": 249, "frontend_question_id": "1578", "is_new_question": false @@ -25422,9 +25506,9 @@ "question__title": "Number of Ways Where Square of Number Is Equal to Product of Two Numbers", "question__title_slug": "number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers", "question__hide": false, - "total_acs": 6266, - "total_submitted": 18502, - "total_column_articles": 102, + "total_acs": 6293, + "total_submitted": 18573, + "total_column_articles": 103, "frontend_question_id": "1577", "is_new_question": false }, @@ -25443,9 +25527,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": 50867, - "total_submitted": 99429, - "total_column_articles": 629, + "total_acs": 50987, + "total_submitted": 99699, + "total_column_articles": 630, "frontend_question_id": "1576", "is_new_question": false }, @@ -25464,8 +25548,8 @@ "question__title": "Strings Differ by One Character", "question__title_slug": "strings-differ-by-one-character", "question__hide": false, - "total_acs": 1089, - "total_submitted": 2077, + "total_acs": 1098, + "total_submitted": 2089, "total_column_articles": 30, "frontend_question_id": "1554", "is_new_question": false @@ -25485,8 +25569,8 @@ "question__title": "Strange Printer II", "question__title_slug": "strange-printer-ii", "question__hide": false, - "total_acs": 1959, - "total_submitted": 3126, + "total_acs": 1969, + "total_submitted": 3136, "total_column_articles": 59, "frontend_question_id": "1591", "is_new_question": false @@ -25506,8 +25590,8 @@ "question__title": "Maximum Sum Obtained of Any Permutation", "question__title_slug": "maximum-sum-obtained-of-any-permutation", "question__hide": false, - "total_acs": 5674, - "total_submitted": 17940, + "total_acs": 5693, + "total_submitted": 17989, "total_column_articles": 88, "frontend_question_id": "1589", "is_new_question": false @@ -25527,8 +25611,8 @@ "question__title": "Make Sum Divisible by P", "question__title_slug": "make-sum-divisible-by-p", "question__hide": false, - "total_acs": 5643, - "total_submitted": 19667, + "total_acs": 5674, + "total_submitted": 19792, "total_column_articles": 76, "frontend_question_id": "1590", "is_new_question": false @@ -25548,9 +25632,9 @@ "question__title": "Sum of All Odd Length Subarrays", "question__title_slug": "sum-of-all-odd-length-subarrays", "question__hide": false, - "total_acs": 59266, - "total_submitted": 70858, - "total_column_articles": 921, + "total_acs": 59523, + "total_submitted": 71156, + "total_column_articles": 923, "frontend_question_id": "1588", "is_new_question": false }, @@ -25569,9 +25653,9 @@ "question__title": "Number of Ways to Reorder Array to Get Same BST", "question__title_slug": "number-of-ways-to-reorder-array-to-get-same-bst", "question__hide": false, - "total_acs": 2791, - "total_submitted": 5802, - "total_column_articles": 61, + "total_acs": 2810, + "total_submitted": 5835, + "total_column_articles": 62, "frontend_question_id": "1569", "is_new_question": false }, @@ -25590,8 +25674,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": 3522, - "total_submitted": 7739, + "total_acs": 3537, + "total_submitted": 7783, "total_column_articles": 74, "frontend_question_id": "1568", "is_new_question": false @@ -25611,9 +25695,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": 30559, - "total_submitted": 71964, - "total_column_articles": 415, + "total_acs": 30703, + "total_submitted": 72266, + "total_column_articles": 417, "frontend_question_id": "1567", "is_new_question": false }, @@ -25632,8 +25716,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": 11028, - "total_submitted": 24753, + "total_acs": 11090, + "total_submitted": 24910, "total_column_articles": 169, "frontend_question_id": "1566", "is_new_question": false @@ -25653,9 +25737,9 @@ "question__title": "The Most Recent Orders for Each Product", "question__title_slug": "the-most-recent-orders-for-each-product", "question__hide": false, - "total_acs": 6943, - "total_submitted": 10179, - "total_column_articles": 107, + "total_acs": 7014, + "total_submitted": 10281, + "total_column_articles": 109, "frontend_question_id": "1549", "is_new_question": false }, @@ -25674,8 +25758,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": 546, - "total_submitted": 803, + "total_acs": 548, + "total_submitted": 806, "total_column_articles": 21, "frontend_question_id": "1548", "is_new_question": false @@ -25695,8 +25779,8 @@ "question__title": "Fix Product Name Format", "question__title_slug": "fix-product-name-format", "question__hide": false, - "total_acs": 5086, - "total_submitted": 9208, + "total_acs": 5106, + "total_submitted": 9247, "total_column_articles": 53, "frontend_question_id": "1543", "is_new_question": false @@ -25716,8 +25800,8 @@ "question__title": "Stone Game V", "question__title_slug": "stone-game-v", "question__hide": false, - "total_acs": 5163, - "total_submitted": 13096, + "total_acs": 5197, + "total_submitted": 13155, "total_column_articles": 74, "frontend_question_id": "1563", "is_new_question": false @@ -25737,9 +25821,9 @@ "question__title": "Find Latest Group of Size M", "question__title_slug": "find-latest-group-of-size-m", "question__hide": false, - "total_acs": 6091, - "total_submitted": 17288, - "total_column_articles": 123, + "total_acs": 6141, + "total_submitted": 17378, + "total_column_articles": 124, "frontend_question_id": "1562", "is_new_question": false }, @@ -25758,9 +25842,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": 15272, - "total_submitted": 19624, - "total_column_articles": 230, + "total_acs": 15345, + "total_submitted": 19719, + "total_column_articles": 233, "frontend_question_id": "1561", "is_new_question": false }, @@ -25779,8 +25863,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": 10877, - "total_submitted": 18904, + "total_acs": 10905, + "total_submitted": 18960, "total_column_articles": 121, "frontend_question_id": "1560", "is_new_question": false @@ -25800,8 +25884,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": 237, - "total_submitted": 444, + "total_acs": 238, + "total_submitted": 446, "total_column_articles": 11, "frontend_question_id": "1538", "is_new_question": false @@ -25821,9 +25905,9 @@ "question__title": "Count All Possible Routes", "question__title_slug": "count-all-possible-routes", "question__hide": false, - "total_acs": 9633, - "total_submitted": 16375, - "total_column_articles": 107, + "total_acs": 9773, + "total_submitted": 16747, + "total_column_articles": 108, "frontend_question_id": "1575", "is_new_question": false }, @@ -25842,8 +25926,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": 9348, - "total_submitted": 25491, + "total_acs": 9413, + "total_submitted": 25657, "total_column_articles": 157, "frontend_question_id": "1574", "is_new_question": false @@ -25863,9 +25947,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": 5927, - "total_submitted": 19330, - "total_column_articles": 85, + "total_acs": 5952, + "total_submitted": 19418, + "total_column_articles": 86, "frontend_question_id": "1573", "is_new_question": false }, @@ -25884,9 +25968,9 @@ "question__title": "Matrix Diagonal Sum", "question__title_slug": "matrix-diagonal-sum", "question__hide": false, - "total_acs": 31138, - "total_submitted": 38674, - "total_column_articles": 517, + "total_acs": 31319, + "total_submitted": 38890, + "total_column_articles": 519, "frontend_question_id": "1572", "is_new_question": false }, @@ -25905,9 +25989,9 @@ "question__title": "Minimum Number of Days to Eat N Oranges", "question__title_slug": "minimum-number-of-days-to-eat-n-oranges", "question__hide": false, - "total_acs": 9819, - "total_submitted": 30895, - "total_column_articles": 141, + "total_acs": 9836, + "total_submitted": 30937, + "total_column_articles": 142, "frontend_question_id": "1553", "is_new_question": false }, @@ -25926,8 +26010,8 @@ "question__title": "Magnetic Force Between Two Balls", "question__title_slug": "magnetic-force-between-two-balls", "question__hide": false, - "total_acs": 14565, - "total_submitted": 26657, + "total_acs": 14659, + "total_submitted": 26790, "total_column_articles": 192, "frontend_question_id": "1552", "is_new_question": false @@ -25947,8 +26031,8 @@ "question__title": "Minimum Operations to Make Array Equal", "question__title_slug": "minimum-operations-to-make-array-equal", "question__hide": false, - "total_acs": 13960, - "total_submitted": 17021, + "total_acs": 14004, + "total_submitted": 17074, "total_column_articles": 204, "frontend_question_id": "1551", "is_new_question": false @@ -25968,8 +26052,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": 797, - "total_submitted": 1368, + "total_acs": 807, + "total_submitted": 1382, "total_column_articles": 37, "frontend_question_id": "1533", "is_new_question": false @@ -25989,9 +26073,9 @@ "question__title": "The Most Recent Three Orders", "question__title_slug": "the-most-recent-three-orders", "question__hide": false, - "total_acs": 6254, - "total_submitted": 9956, - "total_column_articles": 86, + "total_acs": 6297, + "total_submitted": 10028, + "total_column_articles": 87, "frontend_question_id": "1532", "is_new_question": false }, @@ -26010,9 +26094,9 @@ "question__title": "Patients With a Condition", "question__title_slug": "patients-with-a-condition", "question__hide": false, - "total_acs": 36035, - "total_submitted": 75189, - "total_column_articles": 196, + "total_acs": 36705, + "total_submitted": 76661, + "total_column_articles": 200, "frontend_question_id": "1527", "is_new_question": false }, @@ -26031,8 +26115,8 @@ "question__title": "Minimum Cost to Cut a Stick", "question__title_slug": "minimum-cost-to-cut-a-stick", "question__hide": false, - "total_acs": 5386, - "total_submitted": 9618, + "total_acs": 5410, + "total_submitted": 9663, "total_column_articles": 90, "frontend_question_id": "1547", "is_new_question": false @@ -26052,8 +26136,8 @@ "question__title": "Find Longest Awesome Substring", "question__title_slug": "find-longest-awesome-substring", "question__hide": false, - "total_acs": 3697, - "total_submitted": 8749, + "total_acs": 3712, + "total_submitted": 8776, "total_column_articles": 71, "frontend_question_id": "1542", "is_new_question": false @@ -26073,9 +26157,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": 13131, - "total_submitted": 22585, - "total_column_articles": 174, + "total_acs": 13224, + "total_submitted": 22725, + "total_column_articles": 175, "frontend_question_id": "1545", "is_new_question": false }, @@ -26094,9 +26178,9 @@ "question__title": "Make The String Great", "question__title_slug": "make-the-string-great", "question__hide": false, - "total_acs": 25952, - "total_submitted": 46618, - "total_column_articles": 417, + "total_acs": 26167, + "total_submitted": 46970, + "total_column_articles": 420, "frontend_question_id": "1544", "is_new_question": false }, @@ -26115,8 +26199,8 @@ "question__title": "Diameter of N-Ary Tree", "question__title_slug": "diameter-of-n-ary-tree", "question__hide": false, - "total_acs": 1981, - "total_submitted": 2763, + "total_acs": 1995, + "total_submitted": 2786, "total_column_articles": 56, "frontend_question_id": "1522", "is_new_question": false @@ -26136,8 +26220,8 @@ "question__title": "Find Users With Valid E-Mails", "question__title_slug": "find-users-with-valid-e-mails", "question__hide": false, - "total_acs": 5627, - "total_submitted": 10416, + "total_acs": 5667, + "total_submitted": 10496, "total_column_articles": 48, "frontend_question_id": "1517", "is_new_question": false @@ -26157,8 +26241,8 @@ "question__title": "Detect Cycles in 2D Grid", "question__title_slug": "detect-cycles-in-2d-grid", "question__hide": false, - "total_acs": 5937, - "total_submitted": 15082, + "total_acs": 5965, + "total_submitted": 15134, "total_column_articles": 104, "frontend_question_id": "1559", "is_new_question": false @@ -26178,9 +26262,9 @@ "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": 5787, - "total_submitted": 9227, - "total_column_articles": 92, + "total_acs": 5811, + "total_submitted": 9259, + "total_column_articles": 93, "frontend_question_id": "1558", "is_new_question": false }, @@ -26199,9 +26283,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": 15304, - "total_submitted": 18941, - "total_column_articles": 211, + "total_acs": 15393, + "total_submitted": 19039, + "total_column_articles": 212, "frontend_question_id": "1557", "is_new_question": false }, @@ -26220,9 +26304,9 @@ "question__title": "Thousand Separator", "question__title_slug": "thousand-separator", "question__hide": false, - "total_acs": 17077, - "total_submitted": 30132, - "total_column_articles": 273, + "total_acs": 17216, + "total_submitted": 30393, + "total_column_articles": 274, "frontend_question_id": "1556", "is_new_question": false }, @@ -26241,8 +26325,8 @@ "question__title": "Get the Maximum Score", "question__title_slug": "get-the-maximum-score", "question__hide": false, - "total_acs": 6105, - "total_submitted": 15656, + "total_acs": 6133, + "total_submitted": 15711, "total_column_articles": 121, "frontend_question_id": "1537", "is_new_question": false @@ -26262,9 +26346,9 @@ "question__title": "Minimum Swaps to Arrange a Binary Grid", "question__title_slug": "minimum-swaps-to-arrange-a-binary-grid", "question__hide": false, - "total_acs": 4873, - "total_submitted": 10744, - "total_column_articles": 93, + "total_acs": 4886, + "total_submitted": 10766, + "total_column_articles": 94, "frontend_question_id": "1536", "is_new_question": false }, @@ -26283,9 +26367,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": 15787, - "total_submitted": 34280, - "total_column_articles": 213, + "total_acs": 15917, + "total_submitted": 34519, + "total_column_articles": 214, "frontend_question_id": "1535", "is_new_question": false }, @@ -26304,9 +26388,9 @@ "question__title": "Count Good Triplets", "question__title_slug": "count-good-triplets", "question__hide": false, - "total_acs": 22782, - "total_submitted": 29220, - "total_column_articles": 216, + "total_acs": 22887, + "total_submitted": 29353, + "total_column_articles": 219, "frontend_question_id": "1534", "is_new_question": false }, @@ -26346,8 +26430,8 @@ "question__title": "Customer Order Frequency", "question__title_slug": "customer-order-frequency", "question__hide": false, - "total_acs": 7209, - "total_submitted": 10443, + "total_acs": 7261, + "total_submitted": 10515, "total_column_articles": 91, "frontend_question_id": "1511", "is_new_question": false @@ -26367,9 +26451,9 @@ "question__title": "Number of Good Leaf Nodes Pairs", "question__title_slug": "number-of-good-leaf-nodes-pairs", "question__hide": false, - "total_acs": 10647, - "total_submitted": 18325, - "total_column_articles": 186, + "total_acs": 10688, + "total_submitted": 18409, + "total_column_articles": 188, "frontend_question_id": "1530", "is_new_question": false }, @@ -26388,9 +26472,9 @@ "question__title": "Minimum Suffix Flips", "question__title_slug": "minimum-suffix-flips", "question__hide": false, - "total_acs": 10770, - "total_submitted": 15376, - "total_column_articles": 167, + "total_acs": 10806, + "total_submitted": 15426, + "total_column_articles": 169, "frontend_question_id": "1529", "is_new_question": false }, @@ -26409,9 +26493,9 @@ "question__title": "Shuffle String", "question__title_slug": "shuffle-string", "question__hide": false, - "total_acs": 36264, - "total_submitted": 46280, - "total_column_articles": 452, + "total_acs": 36393, + "total_submitted": 46442, + "total_column_articles": 455, "frontend_question_id": "1528", "is_new_question": false }, @@ -26430,9 +26514,9 @@ "question__title": "Find Root of N-Ary Tree", "question__title_slug": "find-root-of-n-ary-tree", "question__hide": false, - "total_acs": 930, - "total_submitted": 1131, - "total_column_articles": 26, + "total_acs": 938, + "total_submitted": 1141, + "total_column_articles": 27, "frontend_question_id": "1506", "is_new_question": false }, @@ -26451,8 +26535,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": 6635, - "total_submitted": 15229, + "total_acs": 6649, + "total_submitted": 15249, "total_column_articles": 102, "frontend_question_id": "1546", "is_new_question": false @@ -26472,8 +26556,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": 15382, - "total_submitted": 31788, + "total_acs": 15520, + "total_submitted": 32030, "total_column_articles": 192, "frontend_question_id": "1541", "is_new_question": false @@ -26493,9 +26577,9 @@ "question__title": "Can Convert String in K Moves", "question__title_slug": "can-convert-string-in-k-moves", "question__hide": false, - "total_acs": 6100, - "total_submitted": 18535, - "total_column_articles": 103, + "total_acs": 6126, + "total_submitted": 18615, + "total_column_articles": 104, "frontend_question_id": "1540", "is_new_question": false }, @@ -26514,9 +26598,9 @@ "question__title": "Kth Missing Positive Number", "question__title_slug": "kth-missing-positive-number", "question__hide": false, - "total_acs": 34513, - "total_submitted": 64058, - "total_column_articles": 490, + "total_acs": 34829, + "total_submitted": 64623, + "total_column_articles": 492, "frontend_question_id": "1539", "is_new_question": false }, @@ -26535,8 +26619,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": 3620, - "total_submitted": 8556, + "total_acs": 3658, + "total_submitted": 8614, "total_column_articles": 75, "frontend_question_id": "1521", "is_new_question": false @@ -26556,8 +26640,8 @@ "question__title": "Maximum Number of Non-Overlapping Substrings", "question__title_slug": "maximum-number-of-non-overlapping-substrings", "question__hide": false, - "total_acs": 3000, - "total_submitted": 8696, + "total_acs": 3011, + "total_submitted": 8721, "total_column_articles": 83, "frontend_question_id": "1520", "is_new_question": false @@ -26577,8 +26661,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": 6698, - "total_submitted": 20980, + "total_acs": 6717, + "total_submitted": 21030, "total_column_articles": 140, "frontend_question_id": "1519", "is_new_question": false @@ -26598,9 +26682,9 @@ "question__title": "Water Bottles", "question__title_slug": "water-bottles", "question__hide": false, - "total_acs": 59086, - "total_submitted": 84751, - "total_column_articles": 885, + "total_acs": 59194, + "total_submitted": 84934, + "total_column_articles": 887, "frontend_question_id": "1518", "is_new_question": false }, @@ -26619,9 +26703,9 @@ "question__title": "Countries You Can Safely Invest In", "question__title_slug": "countries-you-can-safely-invest-in", "question__hide": false, - "total_acs": 10178, - "total_submitted": 16724, - "total_column_articles": 130, + "total_acs": 10278, + "total_submitted": 16876, + "total_column_articles": 131, "frontend_question_id": "1501", "is_new_question": false }, @@ -26640,8 +26724,8 @@ "question__title": "Design a File Sharing System", "question__title_slug": "design-a-file-sharing-system", "question__hide": false, - "total_acs": 1783, - "total_submitted": 6046, + "total_acs": 1791, + "total_submitted": 6075, "total_column_articles": 48, "frontend_question_id": "1500", "is_new_question": false @@ -26661,8 +26745,8 @@ "question__title": "Friendly Movies Streamed Last Month", "question__title_slug": "friendly-movies-streamed-last-month", "question__hide": false, - "total_acs": 6359, - "total_submitted": 11967, + "total_acs": 6410, + "total_submitted": 12043, "total_column_articles": 47, "frontend_question_id": "1495", "is_new_question": false @@ -26682,9 +26766,9 @@ "question__title": "Best Position for a Service Centre", "question__title_slug": "best-position-for-a-service-centre", "question__hide": false, - "total_acs": 4071, - "total_submitted": 11693, - "total_column_articles": 72, + "total_acs": 4089, + "total_submitted": 11757, + "total_column_articles": 71, "frontend_question_id": "1515", "is_new_question": false }, @@ -26703,9 +26787,9 @@ "question__title": "String Compression II", "question__title_slug": "string-compression-ii", "question__hide": false, - "total_acs": 2601, - "total_submitted": 7025, - "total_column_articles": 45, + "total_acs": 2619, + "total_submitted": 7054, + "total_column_articles": 46, "frontend_question_id": "1531", "is_new_question": false }, @@ -26724,8 +26808,8 @@ "question__title": "Number of Substrings With Only 1s", "question__title_slug": "number-of-substrings-with-only-1s", "question__hide": false, - "total_acs": 13308, - "total_submitted": 34077, + "total_acs": 13359, + "total_submitted": 34207, "total_column_articles": 189, "frontend_question_id": "1513", "is_new_question": false @@ -26745,9 +26829,9 @@ "question__title": "Number of Good Pairs", "question__title_slug": "number-of-good-pairs", "question__hide": false, - "total_acs": 70020, - "total_submitted": 82679, - "total_column_articles": 906, + "total_acs": 70269, + "total_submitted": 82992, + "total_column_articles": 909, "frontend_question_id": "1512", "is_new_question": false }, @@ -26766,9 +26850,9 @@ "question__title": "Clone N-ary Tree", "question__title_slug": "clone-n-ary-tree", "question__hide": false, - "total_acs": 1726, - "total_submitted": 2062, - "total_column_articles": 42, + "total_acs": 1732, + "total_submitted": 2069, + "total_column_articles": 43, "frontend_question_id": "1490", "is_new_question": false }, @@ -26787,8 +26871,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": 4440, - "total_submitted": 6945, + "total_acs": 4465, + "total_submitted": 6981, "total_column_articles": 77, "frontend_question_id": "1526", "is_new_question": false @@ -26808,8 +26892,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": 7599, - "total_submitted": 11508, + "total_acs": 7631, + "total_submitted": 11558, "total_column_articles": 141, "frontend_question_id": "1525", "is_new_question": false @@ -26829,9 +26913,9 @@ "question__title": "Number of Sub-arrays With Odd Sum", "question__title_slug": "number-of-sub-arrays-with-odd-sum", "question__hide": false, - "total_acs": 8238, - "total_submitted": 18348, - "total_column_articles": 146, + "total_acs": 8279, + "total_submitted": 18448, + "total_column_articles": 147, "frontend_question_id": "1524", "is_new_question": false }, @@ -26850,9 +26934,9 @@ "question__title": "Count Odd Numbers in an Interval Range", "question__title_slug": "count-odd-numbers-in-an-interval-range", "question__hide": false, - "total_acs": 36717, - "total_submitted": 73429, - "total_column_articles": 566, + "total_acs": 37228, + "total_submitted": 74618, + "total_column_articles": 573, "frontend_question_id": "1523", "is_new_question": false }, @@ -26871,8 +26955,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": 4181, - "total_submitted": 10871, + "total_acs": 4194, + "total_submitted": 10891, "total_column_articles": 87, "frontend_question_id": "1505", "is_new_question": false @@ -26892,9 +26976,9 @@ "question__title": "Count Submatrices With All Ones", "question__title_slug": "count-submatrices-with-all-ones", "question__hide": false, - "total_acs": 10372, - "total_submitted": 16864, - "total_column_articles": 166, + "total_acs": 10422, + "total_submitted": 16938, + "total_column_articles": 167, "frontend_question_id": "1504", "is_new_question": false }, @@ -26913,8 +26997,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": 10691, - "total_submitted": 20246, + "total_acs": 10738, + "total_submitted": 20321, "total_column_articles": 110, "frontend_question_id": "1503", "is_new_question": false @@ -26934,9 +27018,9 @@ "question__title": "Can Make Arithmetic Progression From Sequence", "question__title_slug": "can-make-arithmetic-progression-from-sequence", "question__hide": false, - "total_acs": 39797, - "total_submitted": 56755, - "total_column_articles": 515, + "total_acs": 40040, + "total_submitted": 57117, + "total_column_articles": 521, "frontend_question_id": "1502", "is_new_question": false }, @@ -26955,9 +27039,9 @@ "question__title": "Group Sold Products By The Date", "question__title_slug": "group-sold-products-by-the-date", "question__hide": false, - "total_acs": 36181, - "total_submitted": 53339, - "total_column_articles": 219, + "total_acs": 36883, + "total_submitted": 54379, + "total_column_articles": 224, "frontend_question_id": "1484", "is_new_question": false }, @@ -26976,8 +27060,8 @@ "question__title": "Clone Binary Tree With Random Pointer", "question__title_slug": "clone-binary-tree-with-random-pointer", "question__hide": false, - "total_acs": 1288, - "total_submitted": 1635, + "total_acs": 1296, + "total_submitted": 1648, "total_column_articles": 39, "frontend_question_id": "1485", "is_new_question": false @@ -26997,8 +27081,8 @@ "question__title": "Sales by Day of the Week", "question__title_slug": "sales-by-day-of-the-week", "question__hide": false, - "total_acs": 3426, - "total_submitted": 6128, + "total_acs": 3440, + "total_submitted": 6149, "total_column_articles": 58, "frontend_question_id": "1479", "is_new_question": false @@ -27018,8 +27102,8 @@ "question__title": "Max Value of Equation", "question__title_slug": "max-value-of-equation", "question__hide": false, - "total_acs": 4134, - "total_submitted": 10405, + "total_acs": 4201, + "total_submitted": 10510, "total_column_articles": 88, "frontend_question_id": "1499", "is_new_question": false @@ -27039,9 +27123,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": 8602, - "total_submitted": 23190, - "total_column_articles": 119, + "total_acs": 8671, + "total_submitted": 23343, + "total_column_articles": 120, "frontend_question_id": "1498", "is_new_question": false }, @@ -27060,8 +27144,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": 11669, - "total_submitted": 29136, + "total_acs": 11715, + "total_submitted": 29238, "total_column_articles": 142, "frontend_question_id": "1497", "is_new_question": false @@ -27081,9 +27165,9 @@ "question__title": "Path Crossing", "question__title_slug": "path-crossing", "question__hide": false, - "total_acs": 14835, - "total_submitted": 27790, - "total_column_articles": 227, + "total_acs": 14915, + "total_submitted": 27917, + "total_column_articles": 229, "frontend_question_id": "1496", "is_new_question": false }, @@ -27102,8 +27186,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": 2908, - "total_submitted": 4148, + "total_acs": 2922, + "total_submitted": 4170, "total_column_articles": 95, "frontend_question_id": "1474", "is_new_question": false @@ -27123,8 +27207,8 @@ "question__title": "Stone Game IV", "question__title_slug": "stone-game-iv", "question__hide": false, - "total_acs": 7294, - "total_submitted": 12196, + "total_acs": 7328, + "total_submitted": 12241, "total_column_articles": 93, "frontend_question_id": "1510", "is_new_question": false @@ -27144,9 +27228,9 @@ "question__title": "Minimum Difference Between Largest and Smallest Value in Three Moves", "question__title_slug": "minimum-difference-between-largest-and-smallest-value-in-three-moves", "question__hide": false, - "total_acs": 7199, - "total_submitted": 13034, - "total_column_articles": 124, + "total_acs": 7244, + "total_submitted": 13103, + "total_column_articles": 125, "frontend_question_id": "1509", "is_new_question": false }, @@ -27165,8 +27249,8 @@ "question__title": "Range Sum of Sorted Subarray Sums", "question__title_slug": "range-sum-of-sorted-subarray-sums", "question__hide": false, - "total_acs": 9465, - "total_submitted": 16609, + "total_acs": 9563, + "total_submitted": 16743, "total_column_articles": 101, "frontend_question_id": "1508", "is_new_question": false @@ -27186,8 +27270,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": 12724, - "total_submitted": 18747, + "total_acs": 12744, + "total_submitted": 18776, "total_column_articles": 145, "frontend_question_id": "1489", "is_new_question": false @@ -27207,8 +27291,8 @@ "question__title": "Avoid Flood in The City", "question__title_slug": "avoid-flood-in-the-city", "question__hide": false, - "total_acs": 11061, - "total_submitted": 42792, + "total_acs": 11113, + "total_submitted": 42964, "total_column_articles": 162, "frontend_question_id": "1488", "is_new_question": false @@ -27228,8 +27312,8 @@ "question__title": "Making File Names Unique", "question__title_slug": "making-file-names-unique", "question__hide": false, - "total_acs": 10358, - "total_submitted": 31692, + "total_acs": 10392, + "total_submitted": 31762, "total_column_articles": 133, "frontend_question_id": "1487", "is_new_question": false @@ -27249,9 +27333,9 @@ "question__title": "XOR Operation in an Array", "question__title_slug": "xor-operation-in-an-array", "question__hide": false, - "total_acs": 79059, - "total_submitted": 92281, - "total_column_articles": 768, + "total_acs": 79201, + "total_submitted": 92435, + "total_column_articles": 770, "frontend_question_id": "1486", "is_new_question": false }, @@ -27270,9 +27354,9 @@ "question__title": "Find All The Lonely Nodes", "question__title_slug": "find-all-the-lonely-nodes", "question__hide": false, - "total_acs": 4467, - "total_submitted": 5448, - "total_column_articles": 130, + "total_acs": 4498, + "total_submitted": 5486, + "total_column_articles": 131, "frontend_question_id": "1469", "is_new_question": false }, @@ -27291,8 +27375,8 @@ "question__title": "Calculate Salaries", "question__title_slug": "calculate-salaries", "question__hide": false, - "total_acs": 4851, - "total_submitted": 6944, + "total_acs": 4874, + "total_submitted": 6982, "total_column_articles": 63, "frontend_question_id": "1468", "is_new_question": false @@ -27312,9 +27396,9 @@ "question__title": "Rectangles Area", "question__title_slug": "rectangles-area", "question__hide": false, - "total_acs": 5047, - "total_submitted": 8035, - "total_column_articles": 84, + "total_acs": 5085, + "total_submitted": 8096, + "total_column_articles": 86, "frontend_question_id": "1459", "is_new_question": false }, @@ -27333,9 +27417,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": 38380, - "total_submitted": 65848, - "total_column_articles": 490, + "total_acs": 38516, + "total_submitted": 66204, + "total_column_articles": 491, "frontend_question_id": "1482", "is_new_question": false }, @@ -27354,9 +27438,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": 16317, - "total_submitted": 34745, - "total_column_articles": 215, + "total_acs": 16470, + "total_submitted": 35183, + "total_column_articles": 217, "frontend_question_id": "1481", "is_new_question": false }, @@ -27375,9 +27459,9 @@ "question__title": "Running Sum of 1d Array", "question__title_slug": "running-sum-of-1d-array", "question__hide": false, - "total_acs": 242825, - "total_submitted": 303222, - "total_column_articles": 2047, + "total_acs": 246323, + "total_submitted": 308367, + "total_column_articles": 2072, "frontend_question_id": "1480", "is_new_question": false }, @@ -27396,8 +27480,8 @@ "question__title": "Parallel Courses II", "question__title_slug": "parallel-courses-ii", "question__hide": false, - "total_acs": 3884, - "total_submitted": 9689, + "total_acs": 3903, + "total_submitted": 9725, "total_column_articles": 56, "frontend_question_id": "1494", "is_new_question": false @@ -27417,9 +27501,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": 14160, - "total_submitted": 24166, - "total_column_articles": 251, + "total_acs": 14259, + "total_submitted": 24314, + "total_column_articles": 252, "frontend_question_id": "1493", "is_new_question": false }, @@ -27438,9 +27522,9 @@ "question__title": "The kth Factor of n", "question__title_slug": "the-kth-factor-of-n", "question__hide": false, - "total_acs": 13088, - "total_submitted": 21378, - "total_column_articles": 141, + "total_acs": 13165, + "total_submitted": 21491, + "total_column_articles": 142, "frontend_question_id": "1492", "is_new_question": false }, @@ -27459,9 +27543,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": 42732, - "total_submitted": 67076, - "total_column_articles": 605, + "total_acs": 43127, + "total_submitted": 67764, + "total_column_articles": 610, "frontend_question_id": "1491", "is_new_question": false }, @@ -27480,8 +27564,8 @@ "question__title": "Paint House III", "question__title_slug": "paint-house-iii", "question__hide": false, - "total_acs": 16902, - "total_submitted": 25410, + "total_acs": 16921, + "total_submitted": 25436, "total_column_articles": 180, "frontend_question_id": "1473", "is_new_question": false @@ -27501,9 +27585,9 @@ "question__title": "Design Browser History", "question__title_slug": "design-browser-history", "question__hide": false, - "total_acs": 14491, - "total_submitted": 23640, - "total_column_articles": 230, + "total_acs": 14600, + "total_submitted": 23820, + "total_column_articles": 231, "frontend_question_id": "1472", "is_new_question": false }, @@ -27522,8 +27606,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": 9108, - "total_submitted": 16563, + "total_acs": 9152, + "total_submitted": 16624, "total_column_articles": 133, "frontend_question_id": "1471", "is_new_question": false @@ -27543,9 +27627,9 @@ "question__title": "Shuffle the Array", "question__title_slug": "shuffle-the-array", "question__hide": false, - "total_acs": 95585, - "total_submitted": 112127, - "total_column_articles": 1109, + "total_acs": 95806, + "total_submitted": 112368, + "total_column_articles": 1112, "frontend_question_id": "1470", "is_new_question": false }, @@ -27564,9 +27648,9 @@ "question__title": "Active Users", "question__title_slug": "active-users", "question__hide": false, - "total_acs": 9029, - "total_submitted": 22898, - "total_column_articles": 120, + "total_acs": 9087, + "total_submitted": 23055, + "total_column_articles": 121, "frontend_question_id": "1454", "is_new_question": false }, @@ -27585,8 +27669,8 @@ "question__title": "Apples & Oranges", "question__title_slug": "apples-oranges", "question__hide": false, - "total_acs": 9895, - "total_submitted": 11624, + "total_acs": 10003, + "total_submitted": 11742, "total_column_articles": 105, "frontend_question_id": "1445", "is_new_question": false @@ -27606,9 +27690,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": 2176, - "total_submitted": 3488, - "total_column_articles": 59, + "total_acs": 2191, + "total_submitted": 3507, + "total_column_articles": 60, "frontend_question_id": "1467", "is_new_question": false }, @@ -27627,9 +27711,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": 9669, - "total_submitted": 19160, - "total_column_articles": 199, + "total_acs": 9708, + "total_submitted": 19222, + "total_column_articles": 201, "frontend_question_id": "1466", "is_new_question": false }, @@ -27648,8 +27732,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": 8336, - "total_submitted": 25748, + "total_acs": 8370, + "total_submitted": 25875, "total_column_articles": 100, "frontend_question_id": "1465", "is_new_question": false @@ -27669,8 +27753,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": 70771, - "total_submitted": 89826, + "total_acs": 70931, + "total_submitted": 90014, "total_column_articles": 820, "frontend_question_id": "1464", "is_new_question": false @@ -27690,8 +27774,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": 7643, - "total_submitted": 25239, + "total_acs": 7693, + "total_submitted": 25366, "total_column_articles": 129, "frontend_question_id": "1477", "is_new_question": false @@ -27711,8 +27795,8 @@ "question__title": "Subrectangle Queries", "question__title_slug": "subrectangle-queries", "question__hide": false, - "total_acs": 15019, - "total_submitted": 17369, + "total_acs": 15057, + "total_submitted": 17412, "total_column_articles": 141, "frontend_question_id": "1476", "is_new_question": false @@ -27732,9 +27816,9 @@ "question__title": "Allocate Mailboxes", "question__title_slug": "allocate-mailboxes", "question__hide": false, - "total_acs": 4450, - "total_submitted": 7235, - "total_column_articles": 80, + "total_acs": 4697, + "total_submitted": 7574, + "total_column_articles": 81, "frontend_question_id": "1478", "is_new_question": false }, @@ -27753,8 +27837,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": 63157, - "total_submitted": 86043, + "total_acs": 63357, + "total_submitted": 86286, "total_column_articles": 818, "frontend_question_id": "1475", "is_new_question": false @@ -27774,8 +27858,8 @@ "question__title": "Max Dot Product of Two Subsequences", "question__title_slug": "max-dot-product-of-two-subsequences", "question__hide": false, - "total_acs": 6878, - "total_submitted": 15072, + "total_acs": 6906, + "total_submitted": 15116, "total_column_articles": 111, "frontend_question_id": "1458", "is_new_question": false @@ -27795,9 +27879,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": 10500, - "total_submitted": 16824, - "total_column_articles": 174, + "total_acs": 10540, + "total_submitted": 16898, + "total_column_articles": 176, "frontend_question_id": "1457", "is_new_question": false }, @@ -27816,9 +27900,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": 22663, - "total_submitted": 42563, - "total_column_articles": 313, + "total_acs": 22750, + "total_submitted": 42712, + "total_column_articles": 316, "frontend_question_id": "1456", "is_new_question": false }, @@ -27837,9 +27921,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": 39586, - "total_submitted": 60709, - "total_column_articles": 665, + "total_acs": 39672, + "total_submitted": 60856, + "total_column_articles": 667, "frontend_question_id": "1455", "is_new_question": false }, @@ -27858,8 +27942,8 @@ "question__title": "Evaluate Boolean Expression", "question__title_slug": "evaluate-boolean-expression", "question__hide": false, - "total_acs": 6420, - "total_submitted": 9106, + "total_acs": 6481, + "total_submitted": 9186, "total_column_articles": 75, "frontend_question_id": "1440", "is_new_question": false @@ -27879,8 +27963,8 @@ "question__title": "Create a Session Bar Chart", "question__title_slug": "create-a-session-bar-chart", "question__hide": false, - "total_acs": 6398, - "total_submitted": 10130, + "total_acs": 6424, + "total_submitted": 10160, "total_column_articles": 57, "frontend_question_id": "1435", "is_new_question": false @@ -27900,8 +27984,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": 2065, - "total_submitted": 5511, + "total_acs": 2074, + "total_submitted": 5535, "total_column_articles": 37, "frontend_question_id": "1453", "is_new_question": false @@ -27921,9 +28005,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": 7439, - "total_submitted": 14590, - "total_column_articles": 114, + "total_acs": 7465, + "total_submitted": 14661, + "total_column_articles": 115, "frontend_question_id": "1452", "is_new_question": false }, @@ -27942,9 +28026,9 @@ "question__title": "Rearrange Words in a Sentence", "question__title_slug": "rearrange-words-in-a-sentence", "question__hide": false, - "total_acs": 12951, - "total_submitted": 24203, - "total_column_articles": 199, + "total_acs": 12993, + "total_submitted": 24269, + "total_column_articles": 201, "frontend_question_id": "1451", "is_new_question": false }, @@ -27963,8 +28047,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": 57722, - "total_submitted": 69961, + "total_acs": 57836, + "total_submitted": 70102, "total_column_articles": 665, "frontend_question_id": "1450", "is_new_question": false @@ -27984,8 +28068,8 @@ "question__title": "Cherry Pickup II", "question__title_slug": "cherry-pickup-ii", "question__hide": false, - "total_acs": 4070, - "total_submitted": 6606, + "total_acs": 4097, + "total_submitted": 6656, "total_column_articles": 92, "frontend_question_id": "1463", "is_new_question": false @@ -28005,8 +28089,8 @@ "question__title": "Course Schedule IV", "question__title_slug": "course-schedule-iv", "question__hide": false, - "total_acs": 10836, - "total_submitted": 23882, + "total_acs": 10882, + "total_submitted": 23986, "total_column_articles": 201, "frontend_question_id": "1462", "is_new_question": false @@ -28026,8 +28110,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": 8671, - "total_submitted": 16607, + "total_acs": 8715, + "total_submitted": 16688, "total_column_articles": 124, "frontend_question_id": "1461", "is_new_question": false @@ -28047,9 +28131,9 @@ "question__title": "Make Two Arrays Equal by Reversing Subarrays", "question__title_slug": "make-two-arrays-equal-by-reversing-subarrays", "question__hide": false, - "total_acs": 51561, - "total_submitted": 66716, - "total_column_articles": 731, + "total_acs": 51666, + "total_submitted": 66847, + "total_column_articles": 733, "frontend_question_id": "1460", "is_new_question": false }, @@ -28068,8 +28152,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": 4534, - "total_submitted": 8204, + "total_acs": 4563, + "total_submitted": 8252, "total_column_articles": 89, "frontend_question_id": "1444", "is_new_question": false @@ -28089,8 +28173,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": 7002, - "total_submitted": 16572, + "total_acs": 7028, + "total_submitted": 16622, "total_column_articles": 170, "frontend_question_id": "1443", "is_new_question": false @@ -28110,8 +28194,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": 37814, - "total_submitted": 47720, + "total_acs": 37863, + "total_submitted": 47780, "total_column_articles": 406, "frontend_question_id": "1442", "is_new_question": false @@ -28131,8 +28215,8 @@ "question__title": "Build an Array With Stack Operations", "question__title_slug": "build-an-array-with-stack-operations", "question__hide": false, - "total_acs": 47169, - "total_submitted": 65940, + "total_acs": 47243, + "total_submitted": 66033, "total_column_articles": 886, "frontend_question_id": "1441", "is_new_question": false @@ -28152,8 +28236,8 @@ "question__title": "NPV Queries", "question__title_slug": "npv-queries", "question__hide": false, - "total_acs": 5308, - "total_submitted": 7437, + "total_acs": 5335, + "total_submitted": 7475, "total_column_articles": 47, "frontend_question_id": "1421", "is_new_question": false @@ -28173,8 +28257,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": 6896, - "total_submitted": 12265, + "total_acs": 6918, + "total_submitted": 12298, "total_column_articles": 95, "frontend_question_id": "1439", "is_new_question": false @@ -28194,8 +28278,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": 41818, - "total_submitted": 84878, + "total_acs": 41987, + "total_submitted": 85234, "total_column_articles": 563, "frontend_question_id": "1438", "is_new_question": false @@ -28215,9 +28299,9 @@ "question__title": "Check If All 1's Are at Least Length K Places Away", "question__title_slug": "check-if-all-1s-are-at-least-length-k-places-away", "question__hide": false, - "total_acs": 14555, - "total_submitted": 25553, - "total_column_articles": 237, + "total_acs": 14635, + "total_submitted": 25691, + "total_column_articles": 238, "frontend_question_id": "1437", "is_new_question": false }, @@ -28236,9 +28320,9 @@ "question__title": "Destination City", "question__title_slug": "destination-city", "question__hide": false, - "total_acs": 50921, - "total_submitted": 62090, - "total_column_articles": 743, + "total_acs": 51007, + "total_submitted": 62204, + "total_column_articles": 744, "frontend_question_id": "1436", "is_new_question": false }, @@ -28257,9 +28341,9 @@ "question__title": "Find the Quiet Students in All Exams", "question__title_slug": "find-the-quiet-students-in-all-exams", "question__hide": false, - "total_acs": 5462, - "total_submitted": 9882, - "total_column_articles": 107, + "total_acs": 5503, + "total_submitted": 9946, + "total_column_articles": 108, "frontend_question_id": "1412", "is_new_question": false }, @@ -28278,9 +28362,9 @@ "question__title": "Form Largest Integer With Digits That Add up to Target", "question__title_slug": "form-largest-integer-with-digits-that-add-up-to-target", "question__hide": false, - "total_acs": 18352, - "total_submitted": 29365, - "total_column_articles": 222, + "total_acs": 18394, + "total_submitted": 29429, + "total_column_articles": 223, "frontend_question_id": "1449", "is_new_question": false }, @@ -28299,8 +28383,8 @@ "question__title": "Count Good Nodes in Binary Tree", "question__title_slug": "count-good-nodes-in-binary-tree", "question__hide": false, - "total_acs": 17005, - "total_submitted": 23553, + "total_acs": 17073, + "total_submitted": 23691, "total_column_articles": 279, "frontend_question_id": "1448", "is_new_question": false @@ -28320,9 +28404,9 @@ "question__title": "Simplified Fractions", "question__title_slug": "simplified-fractions", "question__hide": false, - "total_acs": 40656, - "total_submitted": 60129, - "total_column_articles": 523, + "total_acs": 40688, + "total_submitted": 60184, + "total_column_articles": 524, "frontend_question_id": "1447", "is_new_question": false }, @@ -28341,9 +28425,9 @@ "question__title": "Consecutive Characters", "question__title_slug": "consecutive-characters", "question__hide": false, - "total_acs": 56530, - "total_submitted": 93102, - "total_column_articles": 764, + "total_acs": 56658, + "total_submitted": 93351, + "total_column_articles": 765, "frontend_question_id": "1446", "is_new_question": false }, @@ -28362,9 +28446,9 @@ "question__title": "Top Travellers", "question__title_slug": "top-travellers", "question__hide": false, - "total_acs": 24527, - "total_submitted": 41342, - "total_column_articles": 210, + "total_acs": 24945, + "total_submitted": 42162, + "total_column_articles": 211, "frontend_question_id": "1407", "is_new_question": false }, @@ -28383,9 +28467,9 @@ "question__title": "Diagonal Traverse II", "question__title_slug": "diagonal-traverse-ii", "question__hide": false, - "total_acs": 9418, - "total_submitted": 22500, - "total_column_articles": 195, + "total_acs": 9452, + "total_submitted": 22587, + "total_column_articles": 196, "frontend_question_id": "1424", "is_new_question": false }, @@ -28404,9 +28488,9 @@ "question__title": "Maximum Points You Can Obtain from Cards", "question__title_slug": "maximum-points-you-can-obtain-from-cards", "question__hide": false, - "total_acs": 44185, - "total_submitted": 79956, - "total_column_articles": 624, + "total_acs": 44292, + "total_submitted": 80172, + "total_column_articles": 625, "frontend_question_id": "1423", "is_new_question": false }, @@ -28425,9 +28509,9 @@ "question__title": "Maximum Score After Splitting a String", "question__title_slug": "maximum-score-after-splitting-a-string", "question__hide": false, - "total_acs": 39652, - "total_submitted": 69802, - "total_column_articles": 664, + "total_acs": 39744, + "total_submitted": 69945, + "total_column_articles": 667, "frontend_question_id": "1422", "is_new_question": false }, @@ -28446,8 +28530,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": 9315, - "total_submitted": 12628, + "total_acs": 9411, + "total_submitted": 12741, "total_column_articles": 125, "frontend_question_id": "1398", "is_new_question": false @@ -28467,9 +28551,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": 3319, - "total_submitted": 5320, - "total_column_articles": 61, + "total_acs": 3340, + "total_submitted": 5345, + "total_column_articles": 62, "frontend_question_id": "1420", "is_new_question": false }, @@ -28488,8 +28572,8 @@ "question__title": "Minimum Number of Frogs Croaking", "question__title_slug": "minimum-number-of-frogs-croaking", "question__hide": false, - "total_acs": 10645, - "total_submitted": 24652, + "total_acs": 10683, + "total_submitted": 24740, "total_column_articles": 202, "frontend_question_id": "1419", "is_new_question": false @@ -28509,8 +28593,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": 28063, - "total_submitted": 38376, + "total_acs": 28328, + "total_submitted": 38753, "total_column_articles": 449, "frontend_question_id": "1418", "is_new_question": false @@ -28530,8 +28614,8 @@ "question__title": "Reformat The String", "question__title_slug": "reformat-the-string", "question__hide": false, - "total_acs": 45146, - "total_submitted": 81212, + "total_acs": 45207, + "total_submitted": 81341, "total_column_articles": 603, "frontend_question_id": "1417", "is_new_question": false @@ -28551,8 +28635,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": 3608, - "total_submitted": 7174, + "total_acs": 3619, + "total_submitted": 7191, "total_column_articles": 60, "frontend_question_id": "1434", "is_new_question": false @@ -28572,9 +28656,9 @@ "question__title": "Check If a String Can Break Another String", "question__title_slug": "check-if-a-string-can-break-another-string", "question__hide": false, - "total_acs": 7687, - "total_submitted": 11941, - "total_column_articles": 141, + "total_acs": 7716, + "total_submitted": 11985, + "total_column_articles": 142, "frontend_question_id": "1433", "is_new_question": false }, @@ -28593,9 +28677,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": 5764, - "total_submitted": 14489, - "total_column_articles": 127, + "total_acs": 5792, + "total_submitted": 14563, + "total_column_articles": 129, "frontend_question_id": "1432", "is_new_question": false }, @@ -28614,8 +28698,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": 86154, - "total_submitted": 101899, + "total_acs": 86262, + "total_submitted": 102021, "total_column_articles": 1138, "frontend_question_id": "1431", "is_new_question": false @@ -28635,8 +28719,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": 9318, - "total_submitted": 16519, + "total_acs": 9333, + "total_submitted": 16535, "total_column_articles": 162, "frontend_question_id": "1411", "is_new_question": false @@ -28656,9 +28740,9 @@ "question__title": "HTML Entity Parser", "question__title_slug": "html-entity-parser", "question__hide": false, - "total_acs": 8799, - "total_submitted": 18662, - "total_column_articles": 134, + "total_acs": 8836, + "total_submitted": 18757, + "total_column_articles": 136, "frontend_question_id": "1410", "is_new_question": false }, @@ -28677,9 +28761,9 @@ "question__title": "Queries on a Permutation With Key", "question__title_slug": "queries-on-a-permutation-with-key", "question__hide": false, - "total_acs": 10369, - "total_submitted": 12746, - "total_column_articles": 180, + "total_acs": 10404, + "total_submitted": 12794, + "total_column_articles": 182, "frontend_question_id": "1409", "is_new_question": false }, @@ -28698,9 +28782,9 @@ "question__title": "String Matching in an Array", "question__title_slug": "string-matching-in-an-array", "question__hide": false, - "total_acs": 42783, - "total_submitted": 66175, - "total_column_articles": 534, + "total_acs": 42913, + "total_submitted": 66386, + "total_column_articles": 537, "frontend_question_id": "1408", "is_new_question": false }, @@ -28719,9 +28803,9 @@ "question__title": "Capital Gain/Loss", "question__title_slug": "capital-gainloss", "question__hide": false, - "total_acs": 20875, - "total_submitted": 24644, - "total_column_articles": 196, + "total_acs": 21251, + "total_submitted": 25104, + "total_column_articles": 197, "frontend_question_id": "1393", "is_new_question": false }, @@ -28740,8 +28824,8 @@ "question__title": "Stone Game III", "question__title_slug": "stone-game-iii", "question__hide": false, - "total_acs": 6903, - "total_submitted": 11712, + "total_acs": 6931, + "total_submitted": 11764, "total_column_articles": 103, "frontend_question_id": "1406", "is_new_question": false @@ -28761,9 +28845,9 @@ "question__title": "Number of Steps to Reduce a Number in Binary Representation to One", "question__title_slug": "number-of-steps-to-reduce-a-number-in-binary-representation-to-one", "question__hide": false, - "total_acs": 9129, - "total_submitted": 18121, - "total_column_articles": 185, + "total_acs": 9166, + "total_submitted": 18189, + "total_column_articles": 186, "frontend_question_id": "1404", "is_new_question": false }, @@ -28782,9 +28866,9 @@ "question__title": "Minimum Subsequence in Non-Increasing Order", "question__title_slug": "minimum-subsequence-in-non-increasing-order", "question__hide": false, - "total_acs": 53920, - "total_submitted": 73334, - "total_column_articles": 730, + "total_acs": 54028, + "total_submitted": 73471, + "total_column_articles": 732, "frontend_question_id": "1403", "is_new_question": false }, @@ -28803,9 +28887,9 @@ "question__title": "Total Sales Amount by Year", "question__title_slug": "total-sales-amount-by-year", "question__hide": false, - "total_acs": 4129, - "total_submitted": 7051, - "total_column_articles": 88, + "total_acs": 4160, + "total_submitted": 7093, + "total_column_articles": 89, "frontend_question_id": "1384", "is_new_question": false }, @@ -28824,8 +28908,8 @@ "question__title": "Restore The Array", "question__title_slug": "restore-the-array", "question__hide": false, - "total_acs": 3652, - "total_submitted": 8737, + "total_acs": 3669, + "total_submitted": 8777, "total_column_articles": 71, "frontend_question_id": "1416", "is_new_question": false @@ -28845,9 +28929,9 @@ "question__title": "The k-th Lexicographical String of All Happy Strings of Length n", "question__title_slug": "the-k-th-lexicographical-string-of-all-happy-strings-of-length-n", "question__hide": false, - "total_acs": 8330, - "total_submitted": 12239, - "total_column_articles": 221, + "total_acs": 8356, + "total_submitted": 12276, + "total_column_articles": 223, "frontend_question_id": "1415", "is_new_question": false }, @@ -28866,8 +28950,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": 29489, - "total_submitted": 41848, + "total_acs": 29516, + "total_submitted": 41911, "total_column_articles": 448, "frontend_question_id": "1414", "is_new_question": false @@ -28887,8 +28971,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": 44670, - "total_submitted": 60972, + "total_acs": 44785, + "total_submitted": 61143, "total_column_articles": 676, "frontend_question_id": "1413", "is_new_question": false @@ -28908,8 +28992,8 @@ "question__title": "Find All Good Strings", "question__title_slug": "find-all-good-strings", "question__hide": false, - "total_acs": 1676, - "total_submitted": 3915, + "total_acs": 1680, + "total_submitted": 3924, "total_column_articles": 58, "frontend_question_id": "1397", "is_new_question": false @@ -28929,9 +29013,9 @@ "question__title": "Design Underground System", "question__title_slug": "design-underground-system", "question__hide": false, - "total_acs": 18750, - "total_submitted": 45298, - "total_column_articles": 241, + "total_acs": 18924, + "total_submitted": 45731, + "total_column_articles": 244, "frontend_question_id": "1396", "is_new_question": false }, @@ -28950,9 +29034,9 @@ "question__title": "Count Number of Teams", "question__title_slug": "count-number-of-teams", "question__hide": false, - "total_acs": 18405, - "total_submitted": 25494, - "total_column_articles": 270, + "total_acs": 18446, + "total_submitted": 25570, + "total_column_articles": 273, "frontend_question_id": "1395", "is_new_question": false }, @@ -28971,9 +29055,9 @@ "question__title": "Find Lucky Integer in an Array", "question__title_slug": "find-lucky-integer-in-an-array", "question__hide": false, - "total_acs": 23060, - "total_submitted": 35138, - "total_column_articles": 392, + "total_acs": 23164, + "total_submitted": 35290, + "total_column_articles": 397, "frontend_question_id": "1394", "is_new_question": false }, @@ -28992,8 +29076,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": 10017, - "total_submitted": 11517, + "total_acs": 10056, + "total_submitted": 11563, "total_column_articles": 75, "frontend_question_id": "1378", "is_new_question": false @@ -29013,8 +29097,8 @@ "question__title": "Longest Happy Prefix", "question__title_slug": "longest-happy-prefix", "question__hide": false, - "total_acs": 12634, - "total_submitted": 28794, + "total_acs": 12686, + "total_submitted": 28886, "total_column_articles": 208, "frontend_question_id": "1392", "is_new_question": false @@ -29034,9 +29118,9 @@ "question__title": "Check if There is a Valid Path in a Grid", "question__title_slug": "check-if-there-is-a-valid-path-in-a-grid", "question__hide": false, - "total_acs": 8167, - "total_submitted": 19790, - "total_column_articles": 254, + "total_acs": 8186, + "total_submitted": 19822, + "total_column_articles": 255, "frontend_question_id": "1391", "is_new_question": false }, @@ -29055,9 +29139,9 @@ "question__title": "Create Target Array in the Given Order", "question__title_slug": "create-target-array-in-the-given-order", "question__hide": false, - "total_acs": 33156, - "total_submitted": 39904, - "total_column_articles": 556, + "total_acs": 33239, + "total_submitted": 40000, + "total_column_articles": 557, "frontend_question_id": "1389", "is_new_question": false }, @@ -29076,9 +29160,9 @@ "question__title": "Get the Second Most Recent Activity", "question__title_slug": "get-the-second-most-recent-activity", "question__hide": false, - "total_acs": 5466, - "total_submitted": 8795, - "total_column_articles": 75, + "total_acs": 5509, + "total_submitted": 8858, + "total_column_articles": 76, "frontend_question_id": "1369", "is_new_question": false }, @@ -29097,9 +29181,9 @@ "question__title": "Reducing Dishes", "question__title_slug": "reducing-dishes", "question__hide": false, - "total_acs": 13207, - "total_submitted": 17351, - "total_column_articles": 226, + "total_acs": 13241, + "total_submitted": 17389, + "total_column_articles": 227, "frontend_question_id": "1402", "is_new_question": false }, @@ -29118,9 +29202,9 @@ "question__title": "Construct K Palindrome Strings", "question__title_slug": "construct-k-palindrome-strings", "question__hide": false, - "total_acs": 8646, - "total_submitted": 14125, - "total_column_articles": 147, + "total_acs": 8676, + "total_submitted": 14183, + "total_column_articles": 148, "frontend_question_id": "1400", "is_new_question": false }, @@ -29139,8 +29223,8 @@ "question__title": "Circle and Rectangle Overlapping", "question__title_slug": "circle-and-rectangle-overlapping", "question__hide": false, - "total_acs": 5424, - "total_submitted": 12728, + "total_acs": 5450, + "total_submitted": 12809, "total_column_articles": 121, "frontend_question_id": "1401", "is_new_question": false @@ -29160,8 +29244,8 @@ "question__title": "Count Largest Group", "question__title_slug": "count-largest-group", "question__hide": false, - "total_acs": 12558, - "total_submitted": 18711, + "total_acs": 12613, + "total_submitted": 18787, "total_column_articles": 200, "frontend_question_id": "1399", "is_new_question": false @@ -29181,9 +29265,9 @@ "question__title": "Maximum Performance of a Team", "question__title_slug": "maximum-performance-of-a-team", "question__hide": false, - "total_acs": 5925, - "total_submitted": 17304, - "total_column_articles": 114, + "total_acs": 5949, + "total_submitted": 17348, + "total_column_articles": 116, "frontend_question_id": "1383", "is_new_question": false }, @@ -29202,9 +29286,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": 14870, - "total_submitted": 17654, - "total_column_articles": 221, + "total_acs": 14994, + "total_submitted": 17816, + "total_column_articles": 222, "frontend_question_id": "1379", "is_new_question": false }, @@ -29223,9 +29307,9 @@ "question__title": "Design a Stack With Increment Operation", "question__title_slug": "design-a-stack-with-increment-operation", "question__hide": false, - "total_acs": 16438, - "total_submitted": 22572, - "total_column_articles": 216, + "total_acs": 16581, + "total_submitted": 22776, + "total_column_articles": 219, "frontend_question_id": "1381", "is_new_question": false }, @@ -29244,9 +29328,9 @@ "question__title": "Lucky Numbers in a Matrix", "question__title_slug": "lucky-numbers-in-a-matrix", "question__hide": false, - "total_acs": 54285, - "total_submitted": 70742, - "total_column_articles": 734, + "total_acs": 54379, + "total_submitted": 70870, + "total_column_articles": 736, "frontend_question_id": "1380", "is_new_question": false }, @@ -29265,8 +29349,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": 5424, - "total_submitted": 7928, + "total_acs": 5450, + "total_submitted": 7977, "total_column_articles": 83, "frontend_question_id": "1364", "is_new_question": false @@ -29286,8 +29370,8 @@ "question__title": "Activity Participants", "question__title_slug": "activity-participants", "question__hide": false, - "total_acs": 6312, - "total_submitted": 9449, + "total_acs": 6332, + "total_submitted": 9483, "total_column_articles": 80, "frontend_question_id": "1355", "is_new_question": false @@ -29307,8 +29391,8 @@ "question__title": "Frog Position After T Seconds", "question__title_slug": "frog-position-after-t-seconds", "question__hide": false, - "total_acs": 5529, - "total_submitted": 16439, + "total_acs": 5540, + "total_submitted": 16469, "total_column_articles": 157, "frontend_question_id": "1377", "is_new_question": false @@ -29328,9 +29412,9 @@ "question__title": "Time Needed to Inform All Employees", "question__title_slug": "time-needed-to-inform-all-employees", "question__hide": false, - "total_acs": 13684, - "total_submitted": 25233, - "total_column_articles": 272, + "total_acs": 13800, + "total_submitted": 25416, + "total_column_articles": 273, "frontend_question_id": "1376", "is_new_question": false }, @@ -29349,9 +29433,9 @@ "question__title": "Number of Times Binary String Is Prefix-Aligned", "question__title_slug": "number-of-times-binary-string-is-prefix-aligned", "question__hide": false, - "total_acs": 10291, - "total_submitted": 17446, - "total_column_articles": 203, + "total_acs": 10313, + "total_submitted": 17480, + "total_column_articles": 204, "frontend_question_id": "1375", "is_new_question": false }, @@ -29370,9 +29454,9 @@ "question__title": "Generate a String With Characters That Have Odd Counts", "question__title_slug": "generate-a-string-with-characters-that-have-odd-counts", "question__hide": false, - "total_acs": 51895, - "total_submitted": 66819, - "total_column_articles": 530, + "total_acs": 51984, + "total_submitted": 66925, + "total_column_articles": 532, "frontend_question_id": "1374", "is_new_question": false }, @@ -29391,8 +29475,8 @@ "question__title": "Pizza With 3n Slices", "question__title_slug": "pizza-with-3n-slices", "question__hide": false, - "total_acs": 6348, - "total_submitted": 11240, + "total_acs": 6368, + "total_submitted": 11272, "total_column_articles": 69, "frontend_question_id": "1388", "is_new_question": false @@ -29412,9 +29496,9 @@ "question__title": "Sort Integers by The Power Value", "question__title_slug": "sort-integers-by-the-power-value", "question__hide": false, - "total_acs": 13724, - "total_submitted": 19775, - "total_column_articles": 247, + "total_acs": 13803, + "total_submitted": 19896, + "total_column_articles": 248, "frontend_question_id": "1387", "is_new_question": false }, @@ -29433,8 +29517,8 @@ "question__title": "Cinema Seat Allocation", "question__title_slug": "cinema-seat-allocation", "question__hide": false, - "total_acs": 9084, - "total_submitted": 26382, + "total_acs": 9122, + "total_submitted": 26480, "total_column_articles": 163, "frontend_question_id": "1386", "is_new_question": false @@ -29454,9 +29538,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": 33754, - "total_submitted": 52511, - "total_column_articles": 448, + "total_acs": 34064, + "total_submitted": 52978, + "total_column_articles": 450, "frontend_question_id": "1385", "is_new_question": false }, @@ -29475,8 +29559,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": 6707, - "total_submitted": 11459, + "total_acs": 6754, + "total_submitted": 11525, "total_column_articles": 139, "frontend_question_id": "1368", "is_new_question": false @@ -29496,9 +29580,9 @@ "question__title": "Linked List in Binary Tree", "question__title_slug": "linked-list-in-binary-tree", "question__hide": false, - "total_acs": 21483, - "total_submitted": 49734, - "total_column_articles": 325, + "total_acs": 21603, + "total_submitted": 49983, + "total_column_articles": 326, "frontend_question_id": "1367", "is_new_question": false }, @@ -29517,9 +29601,9 @@ "question__title": "Rank Teams by Votes", "question__title_slug": "rank-teams-by-votes", "question__hide": false, - "total_acs": 10679, - "total_submitted": 20710, - "total_column_articles": 196, + "total_acs": 10826, + "total_submitted": 21013, + "total_column_articles": 198, "frontend_question_id": "1366", "is_new_question": false }, @@ -29538,9 +29622,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": 104667, - "total_submitted": 126977, - "total_column_articles": 1256, + "total_acs": 105007, + "total_submitted": 127362, + "total_column_articles": 1258, "frontend_question_id": "1365", "is_new_question": false }, @@ -29559,8 +29643,8 @@ "question__title": "Students With Invalid Departments", "question__title_slug": "students-with-invalid-departments", "question__hide": false, - "total_acs": 11541, - "total_submitted": 13611, + "total_acs": 11577, + "total_submitted": 13655, "total_column_articles": 101, "frontend_question_id": "1350", "is_new_question": false @@ -29580,9 +29664,9 @@ "question__title": "Movie Rating", "question__title_slug": "movie-rating", "question__hide": false, - "total_acs": 6511, - "total_submitted": 15925, - "total_column_articles": 87, + "total_acs": 6562, + "total_submitted": 16015, + "total_column_articles": 91, "frontend_question_id": "1341", "is_new_question": false }, @@ -29601,9 +29685,9 @@ "question__title": "Construct Target Array With Multiple Sums", "question__title_slug": "construct-target-array-with-multiple-sums", "question__hide": false, - "total_acs": 3854, - "total_submitted": 13388, - "total_column_articles": 86, + "total_acs": 3876, + "total_submitted": 13473, + "total_column_articles": 88, "frontend_question_id": "1354", "is_new_question": false }, @@ -29622,8 +29706,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": 16861, - "total_submitted": 57259, + "total_acs": 16912, + "total_submitted": 57472, "total_column_articles": 200, "frontend_question_id": "1353", "is_new_question": false @@ -29643,9 +29727,9 @@ "question__title": "Product of the Last K Numbers", "question__title_slug": "product-of-the-last-k-numbers", "question__hide": false, - "total_acs": 10214, - "total_submitted": 21738, - "total_column_articles": 112, + "total_acs": 10312, + "total_submitted": 21908, + "total_column_articles": 113, "frontend_question_id": "1352", "is_new_question": false }, @@ -29664,9 +29748,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": 45103, - "total_submitted": 60529, - "total_column_articles": 725, + "total_acs": 45358, + "total_submitted": 60851, + "total_column_articles": 728, "frontend_question_id": "1351", "is_new_question": false }, @@ -29685,9 +29769,9 @@ "question__title": "Maximum Sum BST in Binary Tree", "question__title_slug": "maximum-sum-bst-in-binary-tree", "question__hide": false, - "total_acs": 17144, - "total_submitted": 40032, - "total_column_articles": 307, + "total_acs": 17233, + "total_submitted": 40220, + "total_column_articles": 310, "frontend_question_id": "1373", "is_new_question": false }, @@ -29706,9 +29790,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": 12887, - "total_submitted": 23722, - "total_column_articles": 226, + "total_acs": 12978, + "total_submitted": 23897, + "total_column_articles": 227, "frontend_question_id": "1372", "is_new_question": false }, @@ -29727,9 +29811,9 @@ "question__title": "Find the Longest Substring Containing Vowels in Even Counts", "question__title_slug": "find-the-longest-substring-containing-vowels-in-even-counts", "question__hide": false, - "total_acs": 25276, - "total_submitted": 43093, - "total_column_articles": 311, + "total_acs": 25328, + "total_submitted": 43198, + "total_column_articles": 312, "frontend_question_id": "1371", "is_new_question": false }, @@ -29748,9 +29832,9 @@ "question__title": "Increasing Decreasing String", "question__title_slug": "increasing-decreasing-string", "question__hide": false, - "total_acs": 52769, - "total_submitted": 66830, - "total_column_articles": 647, + "total_acs": 52841, + "total_submitted": 66922, + "total_column_articles": 648, "frontend_question_id": "1370", "is_new_question": false }, @@ -29769,8 +29853,8 @@ "question__title": "Maximum Students Taking Exam", "question__title_slug": "maximum-students-taking-exam", "question__hide": false, - "total_acs": 5157, - "total_submitted": 9693, + "total_acs": 5185, + "total_submitted": 9736, "total_column_articles": 126, "frontend_question_id": "1349", "is_new_question": false @@ -29790,9 +29874,9 @@ "question__title": "Tweet Counts Per Frequency", "question__title_slug": "tweet-counts-per-frequency", "question__hide": false, - "total_acs": 4898, - "total_submitted": 14465, - "total_column_articles": 74, + "total_acs": 4925, + "total_submitted": 14517, + "total_column_articles": 75, "frontend_question_id": "1348", "is_new_question": false }, @@ -29811,9 +29895,9 @@ "question__title": "Minimum Number of Steps to Make Two Strings Anagram", "question__title_slug": "minimum-number-of-steps-to-make-two-strings-anagram", "question__hide": false, - "total_acs": 10793, - "total_submitted": 14298, - "total_column_articles": 166, + "total_acs": 10874, + "total_submitted": 14394, + "total_column_articles": 168, "frontend_question_id": "1347", "is_new_question": false }, @@ -29832,9 +29916,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": 30303, - "total_submitted": 71069, - "total_column_articles": 482, + "total_acs": 30527, + "total_submitted": 71620, + "total_column_articles": 486, "frontend_question_id": "1346", "is_new_question": false }, @@ -29853,8 +29937,8 @@ "question__title": "Number of Transactions per Visit", "question__title_slug": "number-of-transactions-per-visit", "question__hide": false, - "total_acs": 3191, - "total_submitted": 7107, + "total_acs": 3216, + "total_submitted": 7144, "total_column_articles": 70, "frontend_question_id": "1336", "is_new_question": false @@ -29874,8 +29958,8 @@ "question__title": "Jump Game V", "question__title_slug": "jump-game-v", "question__hide": false, - "total_acs": 6267, - "total_submitted": 10739, + "total_acs": 6297, + "total_submitted": 10787, "total_column_articles": 124, "frontend_question_id": "1340", "is_new_question": false @@ -29895,9 +29979,9 @@ "question__title": "Maximum Product of Splitted Binary Tree", "question__title_slug": "maximum-product-of-splitted-binary-tree", "question__hide": false, - "total_acs": 11729, - "total_submitted": 28513, - "total_column_articles": 179, + "total_acs": 11805, + "total_submitted": 28718, + "total_column_articles": 180, "frontend_question_id": "1339", "is_new_question": false }, @@ -29916,9 +30000,9 @@ "question__title": "Reduce Array Size to The Half", "question__title_slug": "reduce-array-size-to-the-half", "question__hide": false, - "total_acs": 11904, - "total_submitted": 18358, - "total_column_articles": 175, + "total_acs": 11957, + "total_submitted": 18451, + "total_column_articles": 177, "frontend_question_id": "1338", "is_new_question": false }, @@ -29937,9 +30021,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": 53331, - "total_submitted": 77340, - "total_column_articles": 844, + "total_acs": 53534, + "total_submitted": 77609, + "total_column_articles": 846, "frontend_question_id": "1337", "is_new_question": false }, @@ -29958,8 +30042,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": 8356, - "total_submitted": 12075, + "total_acs": 8385, + "total_submitted": 12118, "total_column_articles": 73, "frontend_question_id": "1327", "is_new_question": false @@ -29979,8 +30063,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": 5080, - "total_submitted": 8834, + "total_acs": 5119, + "total_submitted": 8889, "total_column_articles": 110, "frontend_question_id": "1359", "is_new_question": false @@ -30000,8 +30084,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": 9614, - "total_submitted": 18392, + "total_acs": 9673, + "total_submitted": 18508, "total_column_articles": 170, "frontend_question_id": "1358", "is_new_question": false @@ -30021,8 +30105,8 @@ "question__title": "Apply Discount Every n Orders", "question__title_slug": "apply-discount-every-n-orders", "question__hide": false, - "total_acs": 6206, - "total_submitted": 11524, + "total_acs": 6251, + "total_submitted": 11588, "total_column_articles": 68, "frontend_question_id": "1357", "is_new_question": false @@ -30042,9 +30126,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": 56972, - "total_submitted": 77867, - "total_column_articles": 640, + "total_acs": 57159, + "total_submitted": 78103, + "total_column_articles": 641, "frontend_question_id": "1356", "is_new_question": false }, @@ -30063,8 +30147,8 @@ "question__title": "Minimum Difficulty of a Job Schedule", "question__title_slug": "minimum-difficulty-of-a-job-schedule", "question__hide": false, - "total_acs": 5209, - "total_submitted": 8750, + "total_acs": 5242, + "total_submitted": 8796, "total_column_articles": 85, "frontend_question_id": "1335", "is_new_question": false @@ -30084,8 +30168,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": 9453, - "total_submitted": 18272, + "total_acs": 9501, + "total_submitted": 18379, "total_column_articles": 142, "frontend_question_id": "1334", "is_new_question": false @@ -30105,8 +30189,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": 7357, - "total_submitted": 13123, + "total_acs": 7398, + "total_submitted": 13203, "total_column_articles": 158, "frontend_question_id": "1333", "is_new_question": false @@ -30126,9 +30210,9 @@ "question__title": "Remove Palindromic Subsequences", "question__title_slug": "remove-palindromic-subsequences", "question__hide": false, - "total_acs": 33881, - "total_submitted": 43500, - "total_column_articles": 360, + "total_acs": 33980, + "total_submitted": 43638, + "total_column_articles": 362, "frontend_question_id": "1332", "is_new_question": false }, @@ -30147,8 +30231,8 @@ "question__title": "Ads Performance", "question__title_slug": "ads-performance", "question__hide": false, - "total_acs": 8327, - "total_submitted": 13965, + "total_acs": 8353, + "total_submitted": 14000, "total_column_articles": 84, "frontend_question_id": "1322", "is_new_question": false @@ -30168,9 +30252,9 @@ "question__title": "Restaurant Growth", "question__title_slug": "restaurant-growth", "question__hide": false, - "total_acs": 8891, - "total_submitted": 14165, - "total_column_articles": 129, + "total_acs": 8945, + "total_submitted": 14250, + "total_column_articles": 131, "frontend_question_id": "1321", "is_new_question": false }, @@ -30189,8 +30273,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": 7641, - "total_submitted": 15948, + "total_acs": 7677, + "total_submitted": 16017, "total_column_articles": 117, "frontend_question_id": "1326", "is_new_question": false @@ -30210,9 +30294,9 @@ "question__title": "Delete Leaves With a Given Value", "question__title_slug": "delete-leaves-with-a-given-value", "question__hide": false, - "total_acs": 14954, - "total_submitted": 20407, - "total_column_articles": 250, + "total_acs": 15092, + "total_submitted": 20623, + "total_column_articles": 251, "frontend_question_id": "1325", "is_new_question": false }, @@ -30231,9 +30315,9 @@ "question__title": "Print Words Vertically", "question__title_slug": "print-words-vertically", "question__hide": false, - "total_acs": 8058, - "total_submitted": 13681, - "total_column_articles": 166, + "total_acs": 8103, + "total_submitted": 13776, + "total_column_articles": 168, "frontend_question_id": "1324", "is_new_question": false }, @@ -30252,9 +30336,9 @@ "question__title": "Maximum 69 Number", "question__title_slug": "maximum-69-number", "question__hide": false, - "total_acs": 32690, - "total_submitted": 43595, - "total_column_articles": 595, + "total_acs": 32943, + "total_submitted": 43882, + "total_column_articles": 597, "frontend_question_id": "1323", "is_new_question": false }, @@ -30273,9 +30357,9 @@ "question__title": "Jump Game IV", "question__title_slug": "jump-game-iv", "question__hide": false, - "total_acs": 27744, - "total_submitted": 60207, - "total_column_articles": 299, + "total_acs": 27778, + "total_submitted": 60296, + "total_column_articles": 300, "frontend_question_id": "1345", "is_new_question": false }, @@ -30294,9 +30378,9 @@ "question__title": "Angle Between Hands of a Clock", "question__title_slug": "angle-between-hands-of-a-clock", "question__hide": false, - "total_acs": 10136, - "total_submitted": 16779, - "total_column_articles": 165, + "total_acs": 10181, + "total_submitted": 16856, + "total_column_articles": 167, "frontend_question_id": "1344", "is_new_question": false }, @@ -30315,9 +30399,9 @@ "question__title": "Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold", "question__title_slug": "number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold", "question__hide": false, - "total_acs": 17610, - "total_submitted": 30698, - "total_column_articles": 288, + "total_acs": 17686, + "total_submitted": 30840, + "total_column_articles": 290, "frontend_question_id": "1343", "is_new_question": false }, @@ -30336,9 +30420,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": 94883, - "total_submitted": 117511, - "total_column_articles": 1210, + "total_acs": 95916, + "total_submitted": 118881, + "total_column_articles": 1219, "frontend_question_id": "1342", "is_new_question": false }, @@ -30357,8 +30441,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": 3290, - "total_submitted": 5489, + "total_acs": 3325, + "total_submitted": 5530, "total_column_articles": 73, "frontend_question_id": "1320", "is_new_question": false @@ -30378,8 +30462,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": 41125, - "total_submitted": 66131, + "total_acs": 41243, + "total_submitted": 66317, "total_column_articles": 652, "frontend_question_id": "1319", "is_new_question": false @@ -30399,9 +30483,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": 8141, - "total_submitted": 12320, - "total_column_articles": 150, + "total_acs": 8164, + "total_submitted": 12352, + "total_column_articles": 151, "frontend_question_id": "1318", "is_new_question": false }, @@ -30420,9 +30504,9 @@ "question__title": "Convert Integer to the Sum of Two No-Zero Integers", "question__title_slug": "convert-integer-to-the-sum-of-two-no-zero-integers", "question__hide": false, - "total_acs": 13339, - "total_submitted": 21573, - "total_column_articles": 248, + "total_acs": 13403, + "total_submitted": 21664, + "total_column_articles": 249, "frontend_question_id": "1317", "is_new_question": false }, @@ -30441,9 +30525,9 @@ "question__title": "Running Total for Different Genders", "question__title_slug": "running-total-for-different-genders", "question__hide": false, - "total_acs": 10681, - "total_submitted": 14400, - "total_column_articles": 94, + "total_acs": 10760, + "total_submitted": 14493, + "total_column_articles": 95, "frontend_question_id": "1308", "is_new_question": false }, @@ -30462,8 +30546,8 @@ "question__title": "Find the Team Size", "question__title_slug": "find-the-team-size", "question__hide": false, - "total_acs": 17838, - "total_submitted": 21639, + "total_acs": 17971, + "total_submitted": 21789, "total_column_articles": 149, "frontend_question_id": "1303", "is_new_question": false @@ -30483,9 +30567,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": 19868, - "total_submitted": 28913, - "total_column_articles": 216, + "total_acs": 19999, + "total_submitted": 29100, + "total_column_articles": 218, "frontend_question_id": "1312", "is_new_question": false }, @@ -30504,9 +30588,9 @@ "question__title": "Get Watched Videos by Your Friends", "question__title_slug": "get-watched-videos-by-your-friends", "question__hide": false, - "total_acs": 7027, - "total_submitted": 17974, - "total_column_articles": 109, + "total_acs": 7052, + "total_submitted": 18035, + "total_column_articles": 110, "frontend_question_id": "1311", "is_new_question": false }, @@ -30525,9 +30609,9 @@ "question__title": "XOR Queries of a Subarray", "question__title_slug": "xor-queries-of-a-subarray", "question__hide": false, - "total_acs": 40996, - "total_submitted": 57149, - "total_column_articles": 546, + "total_acs": 41041, + "total_submitted": 57214, + "total_column_articles": 548, "frontend_question_id": "1310", "is_new_question": false }, @@ -30546,9 +30630,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": 24439, - "total_submitted": 31905, - "total_column_articles": 439, + "total_acs": 24571, + "total_submitted": 32051, + "total_column_articles": 441, "frontend_question_id": "1309", "is_new_question": false }, @@ -30567,8 +30651,8 @@ "question__title": "Encrypt and Decrypt Strings", "question__title_slug": "encrypt-and-decrypt-strings", "question__hide": false, - "total_acs": 5034, - "total_submitted": 12962, + "total_acs": 5052, + "total_submitted": 13021, "total_column_articles": 81, "frontend_question_id": "2227", "is_new_question": false @@ -30588,8 +30672,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": 1203, - "total_submitted": 2213, + "total_acs": 1204, + "total_submitted": 2214, "total_column_articles": 49, "frontend_question_id": "1430", "is_new_question": false @@ -30609,9 +30693,9 @@ "question__title": "All Ancestors of a Node in a Directed Acyclic Graph", "question__title_slug": "all-ancestors-of-a-node-in-a-directed-acyclic-graph", "question__hide": false, - "total_acs": 5451, - "total_submitted": 12482, - "total_column_articles": 101, + "total_acs": 5486, + "total_submitted": 12533, + "total_column_articles": 102, "frontend_question_id": "2192", "is_new_question": false }, @@ -30630,9 +30714,9 @@ "question__title": "Find the K-Beauty of a Number", "question__title_slug": "find-the-k-beauty-of-a-number", "question__hide": false, - "total_acs": 7814, - "total_submitted": 12422, - "total_column_articles": 96, + "total_acs": 7903, + "total_submitted": 12581, + "total_column_articles": 97, "frontend_question_id": "2269", "is_new_question": false }, @@ -30651,9 +30735,9 @@ "question__title": "Verbal Arithmetic Puzzle", "question__title_slug": "verbal-arithmetic-puzzle", "question__hide": false, - "total_acs": 2344, - "total_submitted": 6899, - "total_column_articles": 68, + "total_acs": 2356, + "total_submitted": 6936, + "total_column_articles": 70, "frontend_question_id": "1307", "is_new_question": false }, @@ -30672,9 +30756,9 @@ "question__title": "Jump Game III", "question__title_slug": "jump-game-iii", "question__hide": false, - "total_acs": 27737, - "total_submitted": 47490, - "total_column_articles": 413, + "total_acs": 27849, + "total_submitted": 47700, + "total_column_articles": 415, "frontend_question_id": "1306", "is_new_question": false }, @@ -30693,9 +30777,9 @@ "question__title": "All Elements in Two Binary Search Trees", "question__title_slug": "all-elements-in-two-binary-search-trees", "question__hide": false, - "total_acs": 48972, - "total_submitted": 62707, - "total_column_articles": 670, + "total_acs": 49070, + "total_submitted": 62818, + "total_column_articles": 671, "frontend_question_id": "1305", "is_new_question": false }, @@ -30714,9 +30798,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": 26631, - "total_submitted": 37462, - "total_column_articles": 463, + "total_acs": 26731, + "total_submitted": 37621, + "total_column_articles": 465, "frontend_question_id": "1304", "is_new_question": false }, @@ -30735,9 +30819,9 @@ "question__title": "Weather Type in Each Country", "question__title_slug": "weather-type-in-each-country", "question__hide": false, - "total_acs": 12688, - "total_submitted": 19335, - "total_column_articles": 121, + "total_acs": 12757, + "total_submitted": 19428, + "total_column_articles": 122, "frontend_question_id": "1294", "is_new_question": false }, @@ -30756,9 +30840,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": 3368, - "total_submitted": 5617, - "total_column_articles": 111, + "total_acs": 3392, + "total_submitted": 5653, + "total_column_articles": 112, "frontend_question_id": "1298", "is_new_question": false }, @@ -30777,9 +30861,9 @@ "question__title": "Maximum Number of Occurrences of a Substring", "question__title_slug": "maximum-number-of-occurrences-of-a-substring", "question__hide": false, - "total_acs": 9130, - "total_submitted": 19321, - "total_column_articles": 117, + "total_acs": 9167, + "total_submitted": 19393, + "total_column_articles": 118, "frontend_question_id": "1297", "is_new_question": false }, @@ -30798,9 +30882,9 @@ "question__title": "Divide Array in Sets of K Consecutive Numbers", "question__title_slug": "divide-array-in-sets-of-k-consecutive-numbers", "question__hide": false, - "total_acs": 11527, - "total_submitted": 23645, - "total_column_articles": 162, + "total_acs": 11562, + "total_submitted": 23706, + "total_column_articles": 163, "frontend_question_id": "1296", "is_new_question": false }, @@ -30819,9 +30903,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": 55346, - "total_submitted": 68701, - "total_column_articles": 739, + "total_acs": 55475, + "total_submitted": 68904, + "total_column_articles": 740, "frontend_question_id": "1295", "is_new_question": false }, @@ -30840,8 +30924,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": 8943, - "total_submitted": 10882, + "total_acs": 9020, + "total_submitted": 10973, "total_column_articles": 105, "frontend_question_id": "1285", "is_new_question": false @@ -30861,9 +30945,9 @@ "question__title": "Make Array Non-decreasing or Non-increasing", "question__title_slug": "make-array-non-decreasing-or-non-increasing", "question__hide": false, - "total_acs": 173, - "total_submitted": 235, - "total_column_articles": 13, + "total_acs": 181, + "total_submitted": 246, + "total_column_articles": 14, "frontend_question_id": "2263", "is_new_question": false }, @@ -30882,9 +30966,9 @@ "question__title": "Fair Distribution of Cookies", "question__title_slug": "fair-distribution-of-cookies", "question__hide": false, - "total_acs": 9332, - "total_submitted": 13043, - "total_column_articles": 116, + "total_acs": 9473, + "total_submitted": 13218, + "total_column_articles": 117, "frontend_question_id": "2305", "is_new_question": false }, @@ -30903,9 +30987,9 @@ "question__title": "Check if an Array Is Consecutive", "question__title_slug": "check-if-an-array-is-consecutive", "question__hide": false, - "total_acs": 447, - "total_submitted": 632, - "total_column_articles": 22, + "total_acs": 452, + "total_submitted": 641, + "total_column_articles": 23, "frontend_question_id": "2229", "is_new_question": false }, @@ -30924,8 +31008,8 @@ "question__title": "Students and Examinations", "question__title_slug": "students-and-examinations", "question__hide": false, - "total_acs": 12533, - "total_submitted": 25053, + "total_acs": 12629, + "total_submitted": 25225, "total_column_articles": 113, "frontend_question_id": "1280", "is_new_question": false @@ -30945,9 +31029,9 @@ "question__title": "Shortest Path in a Grid with Obstacles Elimination", "question__title_slug": "shortest-path-in-a-grid-with-obstacles-elimination", "question__hide": false, - "total_acs": 20054, - "total_submitted": 52860, - "total_column_articles": 178, + "total_acs": 20129, + "total_submitted": 53078, + "total_column_articles": 179, "frontend_question_id": "1293", "is_new_question": false }, @@ -30966,9 +31050,9 @@ "question__title": "Maximum Side Length of a Square with Sum Less than or Equal to Threshold", "question__title_slug": "maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold", "question__hide": false, - "total_acs": 9777, - "total_submitted": 19712, - "total_column_articles": 145, + "total_acs": 9844, + "total_submitted": 19827, + "total_column_articles": 147, "frontend_question_id": "1292", "is_new_question": false }, @@ -30987,9 +31071,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": 72302, - "total_submitted": 89629, - "total_column_articles": 924, + "total_acs": 72648, + "total_submitted": 90068, + "total_column_articles": 927, "frontend_question_id": "1290", "is_new_question": false }, @@ -31008,8 +31092,8 @@ "question__title": "Traffic Light Controlled Intersection", "question__title_slug": "traffic-light-controlled-intersection", "question__hide": false, - "total_acs": 2253, - "total_submitted": 3673, + "total_acs": 2257, + "total_submitted": 3695, "total_column_articles": 25, "frontend_question_id": "1279", "is_new_question": false @@ -31029,9 +31113,9 @@ "question__title": "Minimum Number of Flips to Convert Binary Matrix to Zero Matrix", "question__title_slug": "minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix", "question__hide": false, - "total_acs": 3507, - "total_submitted": 5174, - "total_column_articles": 90, + "total_acs": 3529, + "total_submitted": 5208, + "total_column_articles": 92, "frontend_question_id": "1284", "is_new_question": false }, @@ -31050,8 +31134,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": 12263, - "total_submitted": 25887, + "total_acs": 12361, + "total_submitted": 26087, "total_column_articles": 166, "frontend_question_id": "1283", "is_new_question": false @@ -31071,9 +31155,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": 47548, - "total_submitted": 54876, - "total_column_articles": 780, + "total_acs": 47602, + "total_submitted": 54947, + "total_column_articles": 781, "frontend_question_id": "1282", "is_new_question": false }, @@ -31092,9 +31176,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": 63467, - "total_submitted": 76198, - "total_column_articles": 847, + "total_acs": 63804, + "total_submitted": 76635, + "total_column_articles": 848, "frontend_question_id": "1281", "is_new_question": false }, @@ -31113,8 +31197,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": 10220, - "total_submitted": 12643, + "total_acs": 10299, + "total_submitted": 12758, "total_column_articles": 121, "frontend_question_id": "1270", "is_new_question": false @@ -31134,8 +31218,8 @@ "question__title": "Print Immutable Linked List in Reverse", "question__title_slug": "print-immutable-linked-list-in-reverse", "question__hide": false, - "total_acs": 4287, - "total_submitted": 4720, + "total_acs": 4299, + "total_submitted": 4733, "total_column_articles": 92, "frontend_question_id": "1265", "is_new_question": false @@ -31155,8 +31239,8 @@ "question__title": "Palindrome Partitioning III", "question__title_slug": "palindrome-partitioning-iii", "question__hide": false, - "total_acs": 5447, - "total_submitted": 8788, + "total_acs": 5469, + "total_submitted": 8828, "total_column_articles": 83, "frontend_question_id": "1278", "is_new_question": false @@ -31176,8 +31260,8 @@ "question__title": "Count Square Submatrices with All Ones", "question__title_slug": "count-square-submatrices-with-all-ones", "question__hide": false, - "total_acs": 27630, - "total_submitted": 37611, + "total_acs": 27756, + "total_submitted": 37770, "total_column_articles": 316, "frontend_question_id": "1277", "is_new_question": false @@ -31197,9 +31281,9 @@ "question__title": "Number of Burgers with No Waste of Ingredients", "question__title_slug": "number-of-burgers-with-no-waste-of-ingredients", "question__hide": false, - "total_acs": 8179, - "total_submitted": 16291, - "total_column_articles": 124, + "total_acs": 8193, + "total_submitted": 16313, + "total_column_articles": 125, "frontend_question_id": "1276", "is_new_question": false }, @@ -31218,9 +31302,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": 10993, - "total_submitted": 19932, - "total_column_articles": 221, + "total_acs": 11054, + "total_submitted": 20037, + "total_column_articles": 222, "frontend_question_id": "1275", "is_new_question": false }, @@ -31239,8 +31323,8 @@ "question__title": "Page Recommendations", "question__title_slug": "page-recommendations", "question__hide": false, - "total_acs": 10181, - "total_submitted": 17745, + "total_acs": 10281, + "total_submitted": 17917, "total_column_articles": 141, "frontend_question_id": "1264", "is_new_question": false @@ -31260,8 +31344,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": 31873, - "total_submitted": 65049, + "total_acs": 31893, + "total_submitted": 65091, "total_column_articles": 342, "frontend_question_id": "1269", "is_new_question": false @@ -31281,9 +31365,9 @@ "question__title": "Search Suggestions System", "question__title_slug": "search-suggestions-system", "question__hide": false, - "total_acs": 12986, - "total_submitted": 21854, - "total_column_articles": 213, + "total_acs": 13059, + "total_submitted": 21962, + "total_column_articles": 215, "frontend_question_id": "1268", "is_new_question": false }, @@ -31302,8 +31386,8 @@ "question__title": "Count Servers that Communicate", "question__title_slug": "count-servers-that-communicate", "question__hide": false, - "total_acs": 12407, - "total_submitted": 20174, + "total_acs": 12469, + "total_submitted": 20264, "total_column_articles": 194, "frontend_question_id": "1267", "is_new_question": false @@ -31323,8 +31407,8 @@ "question__title": "Minimum Time Visiting All Points", "question__title_slug": "minimum-time-visiting-all-points", "question__hide": false, - "total_acs": 33899, - "total_submitted": 40926, + "total_acs": 33986, + "total_submitted": 41025, "total_column_articles": 513, "frontend_question_id": "1266", "is_new_question": false @@ -31344,8 +31428,8 @@ "question__title": "Minimum Path Cost in a Grid", "question__title_slug": "minimum-path-cost-in-a-grid", "question__hide": false, - "total_acs": 6449, - "total_submitted": 10154, + "total_acs": 6466, + "total_submitted": 10179, "total_column_articles": 116, "frontend_question_id": "2304", "is_new_question": false @@ -31365,8 +31449,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": 5343, - "total_submitted": 9871, + "total_acs": 5381, + "total_submitted": 9939, "total_column_articles": 81, "frontend_question_id": "2218", "is_new_question": false @@ -31386,9 +31470,9 @@ "question__title": "Find the Difference of Two Arrays", "question__title_slug": "find-the-difference-of-two-arrays", "question__hide": false, - "total_acs": 11952, - "total_submitted": 17973, - "total_column_articles": 131, + "total_acs": 12009, + "total_submitted": 18054, + "total_column_articles": 132, "frontend_question_id": "2215", "is_new_question": false }, @@ -31407,9 +31491,9 @@ "question__title": "Counting Elements", "question__title_slug": "counting-elements", "question__hide": false, - "total_acs": 2177, - "total_submitted": 3115, - "total_column_articles": 72, + "total_acs": 2190, + "total_submitted": 3130, + "total_column_articles": 73, "frontend_question_id": "1426", "is_new_question": false }, @@ -31428,9 +31512,9 @@ "question__title": "Average Selling Price", "question__title_slug": "average-selling-price", "question__hide": false, - "total_acs": 15739, - "total_submitted": 20495, - "total_column_articles": 153, + "total_acs": 15887, + "total_submitted": 20698, + "total_column_articles": 155, "frontend_question_id": "1251", "is_new_question": false }, @@ -31449,8 +31533,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": 4790, - "total_submitted": 11046, + "total_acs": 4824, + "total_submitted": 11110, "total_column_articles": 82, "frontend_question_id": "1263", "is_new_question": false @@ -31470,9 +31554,9 @@ "question__title": "Greatest Sum Divisible by Three", "question__title_slug": "greatest-sum-divisible-by-three", "question__hide": false, - "total_acs": 19069, - "total_submitted": 35996, - "total_column_articles": 263, + "total_acs": 19154, + "total_submitted": 36153, + "total_column_articles": 264, "frontend_question_id": "1262", "is_new_question": false }, @@ -31491,9 +31575,9 @@ "question__title": "Find Elements in a Contaminated Binary Tree", "question__title_slug": "find-elements-in-a-contaminated-binary-tree", "question__hide": false, - "total_acs": 10776, - "total_submitted": 14696, - "total_column_articles": 156, + "total_acs": 10811, + "total_submitted": 14745, + "total_column_articles": 157, "frontend_question_id": "1261", "is_new_question": false }, @@ -31512,8 +31596,8 @@ "question__title": "Shift 2D Grid", "question__title_slug": "shift-2d-grid", "question__hide": false, - "total_acs": 40899, - "total_submitted": 62501, + "total_acs": 41013, + "total_submitted": 62662, "total_column_articles": 645, "frontend_question_id": "1260", "is_new_question": false @@ -31554,8 +31638,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": 703, - "total_submitted": 1174, + "total_acs": 712, + "total_submitted": 1188, "total_column_articles": 26, "frontend_question_id": "1618", "is_new_question": false @@ -31596,9 +31680,9 @@ "question__title": "Calculate Amount Paid in Taxes", "question__title_slug": "calculate-amount-paid-in-taxes", "question__hide": false, - "total_acs": 8763, - "total_submitted": 13815, - "total_column_articles": 82, + "total_acs": 8821, + "total_submitted": 13927, + "total_column_articles": 83, "frontend_question_id": "2303", "is_new_question": false }, @@ -31617,8 +31701,8 @@ "question__title": "Maximum Score Words Formed by Letters", "question__title_slug": "maximum-score-words-formed-by-letters", "question__hide": false, - "total_acs": 4362, - "total_submitted": 6114, + "total_acs": 4391, + "total_submitted": 6149, "total_column_articles": 101, "frontend_question_id": "1255", "is_new_question": false @@ -31638,9 +31722,9 @@ "question__title": "Number of Closed Islands", "question__title_slug": "number-of-closed-islands", "question__hide": false, - "total_acs": 36240, - "total_submitted": 58229, - "total_column_articles": 597, + "total_acs": 36494, + "total_submitted": 58631, + "total_column_articles": 601, "frontend_question_id": "1254", "is_new_question": false }, @@ -31659,9 +31743,9 @@ "question__title": "Reconstruct a 2-Row Binary Matrix", "question__title_slug": "reconstruct-a-2-row-binary-matrix", "question__hide": false, - "total_acs": 6709, - "total_submitted": 16717, - "total_column_articles": 111, + "total_acs": 6746, + "total_submitted": 16794, + "total_column_articles": 113, "frontend_question_id": "1253", "is_new_question": false }, @@ -31680,8 +31764,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": 48423, - "total_submitted": 60810, + "total_acs": 48484, + "total_submitted": 60910, "total_column_articles": 636, "frontend_question_id": "1252", "is_new_question": false @@ -31701,8 +31785,8 @@ "question__title": "Number of Comments per Post", "question__title_slug": "number-of-comments-per-post", "question__hide": false, - "total_acs": 10122, - "total_submitted": 17001, + "total_acs": 10152, + "total_submitted": 17070, "total_column_articles": 86, "frontend_question_id": "1241", "is_new_question": false @@ -31722,8 +31806,8 @@ "question__title": "Selling Pieces of Wood", "question__title_slug": "selling-pieces-of-wood", "question__hide": false, - "total_acs": 4046, - "total_submitted": 7681, + "total_acs": 4057, + "total_submitted": 7703, "total_column_articles": 56, "frontend_question_id": "2312", "is_new_question": false @@ -31743,8 +31827,8 @@ "question__title": "Find Palindrome With Fixed Length", "question__title_slug": "find-palindrome-with-fixed-length", "question__hide": false, - "total_acs": 6766, - "total_submitted": 20397, + "total_acs": 6779, + "total_submitted": 20440, "total_column_articles": 151, "frontend_question_id": "2217", "is_new_question": false @@ -31764,8 +31848,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": 2090, - "total_submitted": 3422, + "total_acs": 2120, + "total_submitted": 3462, "total_column_articles": 37, "frontend_question_id": "1428", "is_new_question": false @@ -31785,8 +31869,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": 4078, - "total_submitted": 6919, + "total_acs": 4095, + "total_submitted": 6946, "total_column_articles": 55, "frontend_question_id": "1250", "is_new_question": false @@ -31806,9 +31890,9 @@ "question__title": "Minimum Remove to Make Valid Parentheses", "question__title_slug": "minimum-remove-to-make-valid-parentheses", "question__hide": false, - "total_acs": 38266, - "total_submitted": 64834, - "total_column_articles": 503, + "total_acs": 38408, + "total_submitted": 65040, + "total_column_articles": 504, "frontend_question_id": "1249", "is_new_question": false }, @@ -31827,9 +31911,9 @@ "question__title": "Count Number of Nice Subarrays", "question__title_slug": "count-number-of-nice-subarrays", "question__hide": false, - "total_acs": 46713, - "total_submitted": 81115, - "total_column_articles": 595, + "total_acs": 46891, + "total_submitted": 81400, + "total_column_articles": 600, "frontend_question_id": "1248", "is_new_question": false }, @@ -31848,9 +31932,9 @@ "question__title": "Minimum Swaps to Make Strings Equal", "question__title_slug": "minimum-swaps-to-make-strings-equal", "question__hide": false, - "total_acs": 12243, - "total_submitted": 19567, - "total_column_articles": 209, + "total_acs": 12308, + "total_submitted": 19666, + "total_column_articles": 212, "frontend_question_id": "1247", "is_new_question": false }, @@ -31869,8 +31953,8 @@ "question__title": "Web Crawler Multithreaded", "question__title_slug": "web-crawler-multithreaded", "question__hide": false, - "total_acs": 1997, - "total_submitted": 4129, + "total_acs": 2007, + "total_submitted": 4151, "total_column_articles": 26, "frontend_question_id": "1242", "is_new_question": false @@ -31890,8 +31974,8 @@ "question__title": "Maximum Height by Stacking Cuboids ", "question__title_slug": "maximum-height-by-stacking-cuboids", "question__hide": false, - "total_acs": 3230, - "total_submitted": 6398, + "total_acs": 3266, + "total_submitted": 6443, "total_column_articles": 74, "frontend_question_id": "1691", "is_new_question": false @@ -31911,9 +31995,9 @@ "question__title": "First Unique Number", "question__title_slug": "first-unique-number", "question__hide": false, - "total_acs": 2376, - "total_submitted": 4596, - "total_column_articles": 71, + "total_acs": 2388, + "total_submitted": 4610, + "total_column_articles": 72, "frontend_question_id": "1429", "is_new_question": false }, @@ -31932,9 +32016,9 @@ "question__title": "Tuple with Same Product", "question__title_slug": "tuple-with-same-product", "question__hide": false, - "total_acs": 7371, - "total_submitted": 14360, - "total_column_articles": 140, + "total_acs": 7409, + "total_submitted": 14409, + "total_column_articles": 141, "frontend_question_id": "1726", "is_new_question": false }, @@ -31953,8 +32037,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": 9736, - "total_submitted": 14476, + "total_acs": 9796, + "total_submitted": 14559, "total_column_articles": 128, "frontend_question_id": "2309", "is_new_question": false @@ -31974,9 +32058,9 @@ "question__title": "Airplane Seat Assignment Probability", "question__title_slug": "airplane-seat-assignment-probability", "question__hide": false, - "total_acs": 13105, - "total_submitted": 19594, - "total_column_articles": 183, + "total_acs": 13152, + "total_submitted": 19650, + "total_column_articles": 184, "frontend_question_id": "1227", "is_new_question": false }, @@ -31995,8 +32079,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": 3534, - "total_submitted": 6894, + "total_acs": 3559, + "total_submitted": 6945, "total_column_articles": 53, "frontend_question_id": "1240", "is_new_question": false @@ -32016,9 +32100,9 @@ "question__title": "Maximum Length of a Concatenated String with Unique Characters", "question__title_slug": "maximum-length-of-a-concatenated-string-with-unique-characters", "question__hide": false, - "total_acs": 39206, - "total_submitted": 79962, - "total_column_articles": 436, + "total_acs": 39267, + "total_submitted": 80078, + "total_column_articles": 438, "frontend_question_id": "1239", "is_new_question": false }, @@ -32037,9 +32121,9 @@ "question__title": "Circular Permutation in Binary Representation", "question__title_slug": "circular-permutation-in-binary-representation", "question__hide": false, - "total_acs": 4349, - "total_submitted": 6494, - "total_column_articles": 99, + "total_acs": 4367, + "total_submitted": 6521, + "total_column_articles": 100, "frontend_question_id": "1238", "is_new_question": false }, @@ -32058,9 +32142,9 @@ "question__title": "Find Positive Integer Solution for a Given Equation", "question__title_slug": "find-positive-integer-solution-for-a-given-equation", "question__hide": false, - "total_acs": 12040, - "total_submitted": 16812, - "total_column_articles": 175, + "total_acs": 12077, + "total_submitted": 16855, + "total_column_articles": 176, "frontend_question_id": "1237", "is_new_question": false }, @@ -32079,9 +32163,9 @@ "question__title": "Report Contiguous Dates", "question__title_slug": "report-contiguous-dates", "question__hide": false, - "total_acs": 6250, - "total_submitted": 11485, - "total_column_articles": 122, + "total_acs": 6296, + "total_submitted": 11603, + "total_column_articles": 124, "frontend_question_id": "1225", "is_new_question": false }, @@ -32100,8 +32184,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": 2815, - "total_submitted": 5855, + "total_acs": 2837, + "total_submitted": 5904, "total_column_articles": 59, "frontend_question_id": "2193", "is_new_question": false @@ -32121,9 +32205,9 @@ "question__title": "Minimum Deletions to Make Array Beautiful", "question__title_slug": "minimum-deletions-to-make-array-beautiful", "question__hide": false, - "total_acs": 8786, - "total_submitted": 18346, - "total_column_articles": 164, + "total_acs": 8812, + "total_submitted": 18393, + "total_column_articles": 165, "frontend_question_id": "2216", "is_new_question": false }, @@ -32142,9 +32226,9 @@ "question__title": "Find Players With Zero or One Losses", "question__title_slug": "find-players-with-zero-or-one-losses", "question__hide": false, - "total_acs": 9527, - "total_submitted": 15106, - "total_column_articles": 108, + "total_acs": 9570, + "total_submitted": 15178, + "total_column_articles": 109, "frontend_question_id": "2225", "is_new_question": false }, @@ -32163,9 +32247,9 @@ "question__title": "Find Resultant Array After Removing Anagrams", "question__title_slug": "find-resultant-array-after-removing-anagrams", "question__hide": false, - "total_acs": 10412, - "total_submitted": 17588, - "total_column_articles": 133, + "total_acs": 10468, + "total_submitted": 17666, + "total_column_articles": 134, "frontend_question_id": "2273", "is_new_question": false }, @@ -32184,9 +32268,9 @@ "question__title": "Maximum Profit in Job Scheduling", "question__title_slug": "maximum-profit-in-job-scheduling", "question__hide": false, - "total_acs": 29165, - "total_submitted": 50436, - "total_column_articles": 361, + "total_acs": 29330, + "total_submitted": 50727, + "total_column_articles": 362, "frontend_question_id": "1235", "is_new_question": false }, @@ -32205,9 +32289,9 @@ "question__title": "Replace the Substring for Balanced String", "question__title_slug": "replace-the-substring-for-balanced-string", "question__hide": false, - "total_acs": 8369, - "total_submitted": 23409, - "total_column_articles": 122, + "total_acs": 8413, + "total_submitted": 23499, + "total_column_articles": 123, "frontend_question_id": "1234", "is_new_question": false }, @@ -32226,9 +32310,9 @@ "question__title": "Remove Sub-Folders from the Filesystem", "question__title_slug": "remove-sub-folders-from-the-filesystem", "question__hide": false, - "total_acs": 11553, - "total_submitted": 22600, - "total_column_articles": 166, + "total_acs": 11611, + "total_submitted": 22696, + "total_column_articles": 169, "frontend_question_id": "1233", "is_new_question": false }, @@ -32247,9 +32331,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": 43873, - "total_submitted": 95485, - "total_column_articles": 555, + "total_acs": 44039, + "total_submitted": 95891, + "total_column_articles": 561, "frontend_question_id": "1232", "is_new_question": false }, @@ -32268,8 +32352,8 @@ "question__title": "Maximum Score Of Spliced Array", "question__title_slug": "maximum-score-of-spliced-array", "question__hide": false, - "total_acs": 5925, - "total_submitted": 11761, + "total_acs": 5937, + "total_submitted": 11781, "total_column_articles": 99, "frontend_question_id": "2321", "is_new_question": false @@ -32289,8 +32373,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": 225, - "total_submitted": 299, + "total_acs": 228, + "total_submitted": 302, "total_column_articles": 17, "frontend_question_id": "2204", "is_new_question": false @@ -32310,9 +32394,9 @@ "question__title": "Maximize the Topmost Element After K Moves", "question__title_slug": "maximize-the-topmost-element-after-k-moves", "question__hide": false, - "total_acs": 8396, - "total_submitted": 39785, - "total_column_articles": 142, + "total_acs": 8432, + "total_submitted": 39928, + "total_column_articles": 143, "frontend_question_id": "2202", "is_new_question": false }, @@ -32331,9 +32415,9 @@ "question__title": "Perform String Shifts", "question__title_slug": "perform-string-shifts", "question__hide": false, - "total_acs": 2619, - "total_submitted": 4248, - "total_column_articles": 94, + "total_acs": 2644, + "total_submitted": 4306, + "total_column_articles": 95, "frontend_question_id": "1427", "is_new_question": false }, @@ -32352,9 +32436,9 @@ "question__title": "Maximum Equal Frequency", "question__title_slug": "maximum-equal-frequency", "question__hide": false, - "total_acs": 26211, - "total_submitted": 60046, - "total_column_articles": 286, + "total_acs": 26256, + "total_submitted": 60149, + "total_column_articles": 287, "frontend_question_id": "1224", "is_new_question": false }, @@ -32373,8 +32457,8 @@ "question__title": "Dice Roll Simulation", "question__title_slug": "dice-roll-simulation", "question__hide": false, - "total_acs": 4319, - "total_submitted": 8748, + "total_acs": 4330, + "total_submitted": 8769, "total_column_articles": 77, "frontend_question_id": "1223", "is_new_question": false @@ -32394,9 +32478,9 @@ "question__title": "Queens That Can Attack the King", "question__title_slug": "queens-that-can-attack-the-king", "question__hide": false, - "total_acs": 8032, - "total_submitted": 11656, - "total_column_articles": 180, + "total_acs": 8083, + "total_submitted": 11730, + "total_column_articles": 181, "frontend_question_id": "1222", "is_new_question": false }, @@ -32415,9 +32499,9 @@ "question__title": "Split a String in Balanced Strings", "question__title_slug": "split-a-string-in-balanced-strings", "question__hide": false, - "total_acs": 92605, - "total_submitted": 109353, - "total_column_articles": 1300, + "total_acs": 92931, + "total_submitted": 109709, + "total_column_articles": 1302, "frontend_question_id": "1221", "is_new_question": false }, @@ -32436,8 +32520,8 @@ "question__title": "The Dining Philosophers", "question__title_slug": "the-dining-philosophers", "question__hide": false, - "total_acs": 16524, - "total_submitted": 27878, + "total_acs": 16580, + "total_submitted": 27974, "total_column_articles": 171, "frontend_question_id": "1226", "is_new_question": false @@ -32457,8 +32541,8 @@ "question__title": "Team Scores in Football Tournament", "question__title_slug": "team-scores-in-football-tournament", "question__hide": false, - "total_acs": 8685, - "total_submitted": 16965, + "total_acs": 8719, + "total_submitted": 17048, "total_column_articles": 148, "frontend_question_id": "1212", "is_new_question": false @@ -32478,8 +32562,8 @@ "question__title": "Queries Quality and Percentage", "question__title_slug": "queries-quality-and-percentage", "question__hide": false, - "total_acs": 14020, - "total_submitted": 20827, + "total_acs": 14115, + "total_submitted": 20968, "total_column_articles": 101, "frontend_question_id": "1211", "is_new_question": false @@ -32499,8 +32583,8 @@ "question__title": "Design Skiplist", "question__title_slug": "design-skiplist", "question__hide": false, - "total_acs": 26918, - "total_submitted": 38898, + "total_acs": 26968, + "total_submitted": 38975, "total_column_articles": 232, "frontend_question_id": "1206", "is_new_question": false @@ -32520,9 +32604,9 @@ "question__title": "Maximum Product of the Length of Two Palindromic Substrings", "question__title_slug": "maximum-product-of-the-length-of-two-palindromic-substrings", "question__hide": false, - "total_acs": 1015, - "total_submitted": 3279, - "total_column_articles": 34, + "total_acs": 1027, + "total_submitted": 3299, + "total_column_articles": 35, "frontend_question_id": "1960", "is_new_question": false }, @@ -32541,9 +32625,9 @@ "question__title": "Maximum Candies Allocated to K Children", "question__title_slug": "maximum-candies-allocated-to-k-children", "question__hide": false, - "total_acs": 9778, - "total_submitted": 29397, - "total_column_articles": 160, + "total_acs": 9822, + "total_submitted": 29535, + "total_column_articles": 161, "frontend_question_id": "2226", "is_new_question": false }, @@ -32562,8 +32646,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": 7891, - "total_submitted": 29439, + "total_acs": 7922, + "total_submitted": 29527, "total_column_articles": 123, "frontend_question_id": "2310", "is_new_question": false @@ -32583,8 +32667,8 @@ "question__title": "Sort the Jumbled Numbers", "question__title_slug": "sort-the-jumbled-numbers", "question__hide": false, - "total_acs": 6355, - "total_submitted": 14843, + "total_acs": 6380, + "total_submitted": 14880, "total_column_articles": 108, "frontend_question_id": "2191", "is_new_question": false @@ -32604,9 +32688,9 @@ "question__title": "Count Vowels Permutation", "question__title_slug": "count-vowels-permutation", "question__hide": false, - "total_acs": 25948, - "total_submitted": 42751, - "total_column_articles": 363, + "total_acs": 25976, + "total_submitted": 42786, + "total_column_articles": 365, "frontend_question_id": "1220", "is_new_question": false }, @@ -32625,9 +32709,9 @@ "question__title": "Path with Maximum Gold", "question__title_slug": "path-with-maximum-gold", "question__hide": false, - "total_acs": 38284, - "total_submitted": 55205, - "total_column_articles": 506, + "total_acs": 38574, + "total_submitted": 55666, + "total_column_articles": 507, "frontend_question_id": "1219", "is_new_question": false }, @@ -32646,9 +32730,9 @@ "question__title": "Longest Arithmetic Subsequence of Given Difference", "question__title_slug": "longest-arithmetic-subsequence-of-given-difference", "question__hide": false, - "total_acs": 41661, - "total_submitted": 80559, - "total_column_articles": 404, + "total_acs": 41726, + "total_submitted": 80679, + "total_column_articles": 406, "frontend_question_id": "1218", "is_new_question": false }, @@ -32667,9 +32751,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": 54492, - "total_submitted": 72940, - "total_column_articles": 714, + "total_acs": 54685, + "total_submitted": 73197, + "total_column_articles": 715, "frontend_question_id": "1217", "is_new_question": false }, @@ -32688,8 +32772,8 @@ "question__title": "Monthly Transactions II", "question__title_slug": "monthly-transactions-ii", "question__hide": false, - "total_acs": 8150, - "total_submitted": 17729, + "total_acs": 8185, + "total_submitted": 17844, "total_column_articles": 102, "frontend_question_id": "1205", "is_new_question": false @@ -32709,8 +32793,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": 9027, - "total_submitted": 12243, + "total_acs": 9080, + "total_submitted": 12317, "total_column_articles": 111, "frontend_question_id": "1204", "is_new_question": false @@ -32730,9 +32814,9 @@ "question__title": "Sum of Floored Pairs", "question__title_slug": "sum-of-floored-pairs", "question__hide": false, - "total_acs": 3287, - "total_submitted": 9827, - "total_column_articles": 60, + "total_acs": 3335, + "total_submitted": 9949, + "total_column_articles": 61, "frontend_question_id": "1862", "is_new_question": false }, @@ -32751,8 +32835,8 @@ "question__title": "Path with Maximum Probability", "question__title_slug": "path-with-maximum-probability", "question__hide": false, - "total_acs": 15943, - "total_submitted": 40918, + "total_acs": 16035, + "total_submitted": 41052, "total_column_articles": 226, "frontend_question_id": "1514", "is_new_question": false @@ -32772,8 +32856,8 @@ "question__title": "Where Will the Ball Fall", "question__title_slug": "where-will-the-ball-fall", "question__hide": false, - "total_acs": 37520, - "total_submitted": 54285, + "total_acs": 37686, + "total_submitted": 54500, "total_column_articles": 675, "frontend_question_id": "1706", "is_new_question": false @@ -32793,9 +32877,9 @@ "question__title": "Minimum Moves to Reach Target with Rotations", "question__title_slug": "minimum-moves-to-reach-target-with-rotations", "question__hide": false, - "total_acs": 3379, - "total_submitted": 7240, - "total_column_articles": 72, + "total_acs": 3392, + "total_submitted": 7264, + "total_column_articles": 73, "frontend_question_id": "1210", "is_new_question": false }, @@ -32814,9 +32898,9 @@ "question__title": "Get Equal Substrings Within Budget", "question__title_slug": "get-equal-substrings-within-budget", "question__hide": false, - "total_acs": 63480, - "total_submitted": 126806, - "total_column_articles": 744, + "total_acs": 63786, + "total_submitted": 127529, + "total_column_articles": 746, "frontend_question_id": "1208", "is_new_question": false }, @@ -32835,9 +32919,9 @@ "question__title": "Remove All Adjacent Duplicates in String II", "question__title_slug": "remove-all-adjacent-duplicates-in-string-ii", "question__hide": false, - "total_acs": 17639, - "total_submitted": 34758, - "total_column_articles": 208, + "total_acs": 17743, + "total_submitted": 34919, + "total_column_articles": 209, "frontend_question_id": "1209", "is_new_question": false }, @@ -32856,9 +32940,9 @@ "question__title": "Unique Number of Occurrences", "question__title_slug": "unique-number-of-occurrences", "question__hide": false, - "total_acs": 72472, - "total_submitted": 99434, - "total_column_articles": 978, + "total_acs": 72763, + "total_submitted": 99819, + "total_column_articles": 980, "frontend_question_id": "1207", "is_new_question": false }, @@ -32877,8 +32961,8 @@ "question__title": "Tournament Winners", "question__title_slug": "tournament-winners", "question__hide": false, - "total_acs": 5986, - "total_submitted": 11708, + "total_acs": 6010, + "total_submitted": 11747, "total_column_articles": 96, "frontend_question_id": "1194", "is_new_question": false @@ -32898,8 +32982,8 @@ "question__title": "Monthly Transactions I", "question__title_slug": "monthly-transactions-i", "question__hide": false, - "total_acs": 11995, - "total_submitted": 19742, + "total_acs": 12089, + "total_submitted": 19899, "total_column_articles": 122, "frontend_question_id": "1193", "is_new_question": false @@ -32919,9 +33003,9 @@ "question__title": "Fizz Buzz Multithreaded", "question__title_slug": "fizz-buzz-multithreaded", "question__hide": false, - "total_acs": 19056, - "total_submitted": 29384, - "total_column_articles": 338, + "total_acs": 19113, + "total_submitted": 29489, + "total_column_articles": 340, "frontend_question_id": "1195", "is_new_question": false }, @@ -32940,8 +33024,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": 1700, - "total_submitted": 3063, + "total_acs": 1705, + "total_submitted": 3074, "total_column_articles": 25, "frontend_question_id": "1916", "is_new_question": false @@ -32961,8 +33045,8 @@ "question__title": "Count Artifacts That Can Be Extracted", "question__title_slug": "count-artifacts-that-can-be-extracted", "question__hide": false, - "total_acs": 8006, - "total_submitted": 16402, + "total_acs": 8023, + "total_submitted": 16435, "total_column_articles": 122, "frontend_question_id": "2201", "is_new_question": false @@ -32982,8 +33066,8 @@ "question__title": "Largest Magic Square", "question__title_slug": "largest-magic-square", "question__hide": false, - "total_acs": 2820, - "total_submitted": 5107, + "total_acs": 2835, + "total_submitted": 5132, "total_column_articles": 55, "frontend_question_id": "1895", "is_new_question": false @@ -33003,9 +33087,9 @@ "question__title": "Watering Plants", "question__title_slug": "watering-plants", "question__hide": false, - "total_acs": 7700, - "total_submitted": 9895, - "total_column_articles": 141, + "total_acs": 7736, + "total_submitted": 9946, + "total_column_articles": 142, "frontend_question_id": "2079", "is_new_question": false }, @@ -33024,8 +33108,8 @@ "question__title": "Sort Items by Groups Respecting Dependencies", "question__title_slug": "sort-items-by-groups-respecting-dependencies", "question__hide": false, - "total_acs": 13420, - "total_submitted": 21871, + "total_acs": 13446, + "total_submitted": 21927, "total_column_articles": 166, "frontend_question_id": "1203", "is_new_question": false @@ -33045,8 +33129,8 @@ "question__title": "Smallest String With Swaps", "question__title_slug": "smallest-string-with-swaps", "question__hide": false, - "total_acs": 30630, - "total_submitted": 60039, + "total_acs": 30673, + "total_submitted": 60113, "total_column_articles": 355, "frontend_question_id": "1202", "is_new_question": false @@ -33066,9 +33150,9 @@ "question__title": "Ugly Number III", "question__title_slug": "ugly-number-iii", "question__hide": false, - "total_acs": 9697, - "total_submitted": 35642, - "total_column_articles": 132, + "total_acs": 9767, + "total_submitted": 35858, + "total_column_articles": 133, "frontend_question_id": "1201", "is_new_question": false }, @@ -33087,9 +33171,9 @@ "question__title": "Minimum Absolute Difference", "question__title_slug": "minimum-absolute-difference", "question__hide": false, - "total_acs": 54595, - "total_submitted": 75156, - "total_column_articles": 597, + "total_acs": 54718, + "total_submitted": 75346, + "total_column_articles": 599, "frontend_question_id": "1200", "is_new_question": false }, @@ -33108,9 +33192,9 @@ "question__title": "Number of Visible People in a Queue", "question__title_slug": "number-of-visible-people-in-a-queue", "question__hide": false, - "total_acs": 4693, - "total_submitted": 7509, - "total_column_articles": 103, + "total_acs": 4732, + "total_submitted": 7585, + "total_column_articles": 104, "frontend_question_id": "1944", "is_new_question": false }, @@ -33129,9 +33213,9 @@ "question__title": "Longest Happy String", "question__title_slug": "longest-happy-string", "question__hide": false, - "total_acs": 28732, - "total_submitted": 45186, - "total_column_articles": 499, + "total_acs": 28761, + "total_submitted": 45247, + "total_column_articles": 501, "frontend_question_id": "1405", "is_new_question": false }, @@ -33150,8 +33234,8 @@ "question__title": "Minimum Moves to Reach Target Score", "question__title_slug": "minimum-moves-to-reach-target-score", "question__hide": false, - "total_acs": 8274, - "total_submitted": 16213, + "total_acs": 8314, + "total_submitted": 16283, "total_column_articles": 157, "frontend_question_id": "2139", "is_new_question": false @@ -33171,9 +33255,9 @@ "question__title": "Delete Characters to Make Fancy String", "question__title_slug": "delete-characters-to-make-fancy-string", "question__hide": false, - "total_acs": 8904, - "total_submitted": 14834, - "total_column_articles": 112, + "total_acs": 8994, + "total_submitted": 14965, + "total_column_articles": 113, "frontend_question_id": "1957", "is_new_question": false }, @@ -33192,8 +33276,8 @@ "question__title": "Reformat Department Table", "question__title_slug": "reformat-department-table", "question__hide": false, - "total_acs": 42591, - "total_submitted": 66160, + "total_acs": 42743, + "total_submitted": 66394, "total_column_articles": 249, "frontend_question_id": "1179", "is_new_question": false @@ -33213,8 +33297,8 @@ "question__title": "Critical Connections in a Network", "question__title_slug": "critical-connections-in-a-network", "question__hide": false, - "total_acs": 7214, - "total_submitted": 13499, + "total_acs": 7240, + "total_submitted": 13538, "total_column_articles": 91, "frontend_question_id": "1192", "is_new_question": false @@ -33234,9 +33318,9 @@ "question__title": "K-Concatenation Maximum Sum", "question__title_slug": "k-concatenation-maximum-sum", "question__hide": false, - "total_acs": 7604, - "total_submitted": 28344, - "total_column_articles": 125, + "total_acs": 7639, + "total_submitted": 28476, + "total_column_articles": 126, "frontend_question_id": "1191", "is_new_question": false }, @@ -33255,9 +33339,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": 56423, - "total_submitted": 87034, - "total_column_articles": 723, + "total_acs": 56553, + "total_submitted": 87229, + "total_column_articles": 727, "frontend_question_id": "1190", "is_new_question": false }, @@ -33276,9 +33360,9 @@ "question__title": "Maximum Number of Balloons", "question__title_slug": "maximum-number-of-balloons", "question__hide": false, - "total_acs": 55966, - "total_submitted": 81758, - "total_column_articles": 785, + "total_acs": 56091, + "total_submitted": 81964, + "total_column_articles": 787, "frontend_question_id": "1189", "is_new_question": false }, @@ -33297,8 +33381,8 @@ "question__title": "Kth Ancestor of a Tree Node", "question__title_slug": "kth-ancestor-of-a-tree-node", "question__hide": false, - "total_acs": 4888, - "total_submitted": 14773, + "total_acs": 4927, + "total_submitted": 14899, "total_column_articles": 96, "frontend_question_id": "1483", "is_new_question": false @@ -33318,8 +33402,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": 5553, - "total_submitted": 11318, + "total_acs": 5580, + "total_submitted": 11376, "total_column_articles": 90, "frontend_question_id": "1954", "is_new_question": false @@ -33339,9 +33423,9 @@ "question__title": "Range Frequency Queries", "question__title_slug": "range-frequency-queries", "question__hide": false, - "total_acs": 7716, - "total_submitted": 25367, - "total_column_articles": 167, + "total_acs": 7752, + "total_submitted": 25466, + "total_column_articles": 168, "frontend_question_id": "2080", "is_new_question": false }, @@ -33360,9 +33444,9 @@ "question__title": "Three Consecutive Odds", "question__title_slug": "three-consecutive-odds", "question__hide": false, - "total_acs": 26770, - "total_submitted": 40833, - "total_column_articles": 372, + "total_acs": 26856, + "total_submitted": 40956, + "total_column_articles": 373, "frontend_question_id": "1550", "is_new_question": false }, @@ -33381,8 +33465,8 @@ "question__title": "Immediate Food Delivery II", "question__title_slug": "immediate-food-delivery-ii", "question__hide": false, - "total_acs": 8329, - "total_submitted": 13155, + "total_acs": 8367, + "total_submitted": 13213, "total_column_articles": 91, "frontend_question_id": "1174", "is_new_question": false @@ -33402,8 +33486,8 @@ "question__title": "Immediate Food Delivery I", "question__title_slug": "immediate-food-delivery-i", "question__hide": false, - "total_acs": 15889, - "total_submitted": 20817, + "total_acs": 15985, + "total_submitted": 20945, "total_column_articles": 124, "frontend_question_id": "1173", "is_new_question": false @@ -33423,9 +33507,9 @@ "question__title": "Make Array Strictly Increasing", "question__title_slug": "make-array-strictly-increasing", "question__hide": false, - "total_acs": 2771, - "total_submitted": 5896, - "total_column_articles": 49, + "total_acs": 2799, + "total_submitted": 5944, + "total_column_articles": 51, "frontend_question_id": "1187", "is_new_question": false }, @@ -33444,8 +33528,8 @@ "question__title": "Day of the Week", "question__title_slug": "day-of-the-week", "question__hide": false, - "total_acs": 37681, - "total_submitted": 60411, + "total_acs": 37738, + "total_submitted": 60486, "total_column_articles": 513, "frontend_question_id": "1185", "is_new_question": false @@ -33465,9 +33549,9 @@ "question__title": "Maximum Subarray Sum with One Deletion", "question__title_slug": "maximum-subarray-sum-with-one-deletion", "question__hide": false, - "total_acs": 11117, - "total_submitted": 26582, - "total_column_articles": 162, + "total_acs": 11172, + "total_submitted": 26682, + "total_column_articles": 163, "frontend_question_id": "1186", "is_new_question": false }, @@ -33486,9 +33570,9 @@ "question__title": "Distance Between Bus Stops", "question__title_slug": "distance-between-bus-stops", "question__hide": false, - "total_acs": 39750, - "total_submitted": 64005, - "total_column_articles": 600, + "total_acs": 39831, + "total_submitted": 64143, + "total_column_articles": 603, "frontend_question_id": "1184", "is_new_question": false }, @@ -33507,9 +33591,9 @@ "question__title": "Constrained Subsequence Sum", "question__title_slug": "constrained-subsequence-sum", "question__hide": false, - "total_acs": 5380, - "total_submitted": 11485, - "total_column_articles": 104, + "total_acs": 5431, + "total_submitted": 11570, + "total_column_articles": 105, "frontend_question_id": "1425", "is_new_question": false }, @@ -33528,8 +33612,8 @@ "question__title": "Balance a Binary Search Tree", "question__title_slug": "balance-a-binary-search-tree", "question__hide": false, - "total_acs": 19359, - "total_submitted": 26684, + "total_acs": 19504, + "total_submitted": 26856, "total_column_articles": 273, "frontend_question_id": "1382", "is_new_question": false @@ -33549,9 +33633,9 @@ "question__title": "Four Divisors", "question__title_slug": "four-divisors", "question__hide": false, - "total_acs": 8408, - "total_submitted": 22211, - "total_column_articles": 141, + "total_acs": 8452, + "total_submitted": 22281, + "total_column_articles": 142, "frontend_question_id": "1390", "is_new_question": false }, @@ -33570,9 +33654,9 @@ "question__title": "Reformat Date", "question__title_slug": "reformat-date", "question__hide": false, - "total_acs": 13703, - "total_submitted": 23293, - "total_column_articles": 193, + "total_acs": 13788, + "total_submitted": 23433, + "total_column_articles": 194, "frontend_question_id": "1507", "is_new_question": false }, @@ -33591,8 +33675,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": 19711, - "total_submitted": 42320, + "total_acs": 19729, + "total_submitted": 42362, "total_column_articles": 198, "frontend_question_id": "1178", "is_new_question": false @@ -33612,9 +33696,9 @@ "question__title": "Can Make Palindrome from Substring", "question__title_slug": "can-make-palindrome-from-substring", "question__hide": false, - "total_acs": 7831, - "total_submitted": 27037, - "total_column_articles": 124, + "total_acs": 7876, + "total_submitted": 27132, + "total_column_articles": 125, "frontend_question_id": "1177", "is_new_question": false }, @@ -33633,8 +33717,8 @@ "question__title": "Diet Plan Performance", "question__title_slug": "diet-plan-performance", "question__hide": false, - "total_acs": 5554, - "total_submitted": 11611, + "total_acs": 5562, + "total_submitted": 11625, "total_column_articles": 89, "frontend_question_id": "1176", "is_new_question": false @@ -33654,8 +33738,8 @@ "question__title": "Prime Arrangements", "question__title_slug": "prime-arrangements", "question__hide": false, - "total_acs": 30967, - "total_submitted": 54921, + "total_acs": 31063, + "total_submitted": 55088, "total_column_articles": 364, "frontend_question_id": "1175", "is_new_question": false @@ -33675,9 +33759,9 @@ "question__title": "Product Price at a Given Date", "question__title_slug": "product-price-at-a-given-date", "question__hide": false, - "total_acs": 11383, - "total_submitted": 18871, - "total_column_articles": 143, + "total_acs": 11471, + "total_submitted": 19059, + "total_column_articles": 144, "frontend_question_id": "1164", "is_new_question": false }, @@ -33696,9 +33780,9 @@ "question__title": "Largest Multiple of Three", "question__title_slug": "largest-multiple-of-three", "question__hide": false, - "total_acs": 7073, - "total_submitted": 19384, - "total_column_articles": 125, + "total_acs": 7108, + "total_submitted": 19556, + "total_column_articles": 126, "frontend_question_id": "1363", "is_new_question": false }, @@ -33717,9 +33801,9 @@ "question__title": "Closest Divisors", "question__title_slug": "closest-divisors", "question__hide": false, - "total_acs": 7145, - "total_submitted": 13296, - "total_column_articles": 92, + "total_acs": 7176, + "total_submitted": 13350, + "total_column_articles": 95, "frontend_question_id": "1362", "is_new_question": false }, @@ -33738,9 +33822,9 @@ "question__title": "Validate Binary Tree Nodes", "question__title_slug": "validate-binary-tree-nodes", "question__hide": false, - "total_acs": 10789, - "total_submitted": 27101, - "total_column_articles": 280, + "total_acs": 10853, + "total_submitted": 27237, + "total_column_articles": 281, "frontend_question_id": "1361", "is_new_question": false }, @@ -33759,9 +33843,9 @@ "question__title": "Number of Days Between Two Dates", "question__title_slug": "number-of-days-between-two-dates", "question__hide": false, - "total_acs": 13553, - "total_submitted": 26570, - "total_column_articles": 208, + "total_acs": 13644, + "total_submitted": 26766, + "total_column_articles": 209, "frontend_question_id": "1360", "is_new_question": false }, @@ -33780,9 +33864,9 @@ "question__title": "Compare Strings by Frequency of the Smallest Character", "question__title_slug": "compare-strings-by-frequency-of-the-smallest-character", "question__hide": false, - "total_acs": 15933, - "total_submitted": 25819, - "total_column_articles": 275, + "total_acs": 15978, + "total_submitted": 25914, + "total_column_articles": 277, "frontend_question_id": "1170", "is_new_question": false }, @@ -33801,9 +33885,9 @@ "question__title": "Invalid Transactions", "question__title_slug": "invalid-transactions", "question__hide": false, - "total_acs": 8389, - "total_submitted": 25563, - "total_column_articles": 97, + "total_acs": 8476, + "total_submitted": 25779, + "total_column_articles": 99, "frontend_question_id": "1169", "is_new_question": false }, @@ -33822,8 +33906,8 @@ "question__title": "Web Crawler", "question__title_slug": "web-crawler", "question__hide": false, - "total_acs": 1583, - "total_submitted": 2779, + "total_acs": 1588, + "total_submitted": 2785, "total_column_articles": 39, "frontend_question_id": "1236", "is_new_question": false @@ -33843,8 +33927,8 @@ "question__title": "Dinner Plate Stacks", "question__title_slug": "dinner-plate-stacks", "question__hide": false, - "total_acs": 3364, - "total_submitted": 12218, + "total_acs": 3388, + "total_submitted": 12300, "total_column_articles": 85, "frontend_question_id": "1172", "is_new_question": false @@ -33864,9 +33948,9 @@ "question__title": "Market Analysis II", "question__title_slug": "market-analysis-ii", "question__hide": false, - "total_acs": 6413, - "total_submitted": 12695, - "total_column_articles": 113, + "total_acs": 6435, + "total_submitted": 12726, + "total_column_articles": 114, "frontend_question_id": "1159", "is_new_question": false }, @@ -33885,9 +33969,9 @@ "question__title": "Market Analysis I", "question__title_slug": "market-analysis-i", "question__hide": false, - "total_acs": 25452, - "total_submitted": 45954, - "total_column_articles": 211, + "total_acs": 25946, + "total_submitted": 46850, + "total_column_articles": 213, "frontend_question_id": "1158", "is_new_question": false }, @@ -33906,9 +33990,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": 18665, - "total_submitted": 38581, - "total_column_articles": 210, + "total_acs": 18768, + "total_submitted": 38759, + "total_column_articles": 213, "frontend_question_id": "1171", "is_new_question": false }, @@ -33927,9 +34011,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": 11626, - "total_submitted": 16297, - "total_column_articles": 199, + "total_acs": 11696, + "total_submitted": 16387, + "total_column_articles": 201, "frontend_question_id": "1935", "is_new_question": false }, @@ -33948,9 +34032,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": 17012, - "total_submitted": 33998, - "total_column_articles": 189, + "total_acs": 17085, + "total_submitted": 34149, + "total_column_articles": 191, "frontend_question_id": "1155", "is_new_question": false }, @@ -33969,9 +34053,9 @@ "question__title": "Online Majority Element In Subarray", "question__title_slug": "online-majority-element-in-subarray", "question__hide": false, - "total_acs": 4113, - "total_submitted": 11836, - "total_column_articles": 66, + "total_acs": 4178, + "total_submitted": 11929, + "total_column_articles": 68, "frontend_question_id": "1157", "is_new_question": false }, @@ -33990,9 +34074,9 @@ "question__title": "Swap For Longest Repeated Character Substring", "question__title_slug": "swap-for-longest-repeated-character-substring", "question__hide": false, - "total_acs": 7618, - "total_submitted": 17717, - "total_column_articles": 158, + "total_acs": 7639, + "total_submitted": 17774, + "total_column_articles": 159, "frontend_question_id": "1156", "is_new_question": false }, @@ -34011,9 +34095,9 @@ "question__title": "Day of the Year", "question__title_slug": "day-of-the-year", "question__hide": false, - "total_acs": 52808, - "total_submitted": 83475, - "total_column_articles": 606, + "total_acs": 52991, + "total_submitted": 83801, + "total_column_articles": 608, "frontend_question_id": "1154", "is_new_question": false }, @@ -34032,8 +34116,8 @@ "question__title": "Article Views II", "question__title_slug": "article-views-ii", "question__hide": false, - "total_acs": 9212, - "total_submitted": 20785, + "total_acs": 9253, + "total_submitted": 20868, "total_column_articles": 68, "frontend_question_id": "1149", "is_new_question": false @@ -34053,9 +34137,9 @@ "question__title": "Article Views I", "question__title_slug": "article-views-i", "question__hide": false, - "total_acs": 34629, - "total_submitted": 48226, - "total_column_articles": 125, + "total_acs": 35236, + "total_submitted": 49082, + "total_column_articles": 127, "frontend_question_id": "1148", "is_new_question": false }, @@ -34074,8 +34158,8 @@ "question__title": "Rank Transform of a Matrix", "question__title_slug": "rank-transform-of-a-matrix", "question__hide": false, - "total_acs": 2057, - "total_submitted": 5974, + "total_acs": 2074, + "total_submitted": 6007, "total_column_articles": 45, "frontend_question_id": "1632", "is_new_question": false @@ -34095,9 +34179,9 @@ "question__title": "Rank Transform of an Array", "question__title_slug": "rank-transform-of-an-array", "question__hide": false, - "total_acs": 43349, - "total_submitted": 71578, - "total_column_articles": 508, + "total_acs": 43510, + "total_submitted": 71825, + "total_column_articles": 510, "frontend_question_id": "1331", "is_new_question": false }, @@ -34116,9 +34200,9 @@ "question__title": "Reverse Subarray To Maximize Array Value", "question__title_slug": "reverse-subarray-to-maximize-array-value", "question__hide": false, - "total_acs": 1792, - "total_submitted": 4273, - "total_column_articles": 40, + "total_acs": 1802, + "total_submitted": 4300, + "total_column_articles": 41, "frontend_question_id": "1330", "is_new_question": false }, @@ -34137,9 +34221,9 @@ "question__title": "Deepest Leaves Sum", "question__title_slug": "deepest-leaves-sum", "question__hide": false, - "total_acs": 60198, - "total_submitted": 70280, - "total_column_articles": 750, + "total_acs": 60306, + "total_submitted": 70408, + "total_column_articles": 751, "frontend_question_id": "1302", "is_new_question": false }, @@ -34158,8 +34242,8 @@ "question__title": "Sort the Matrix Diagonally", "question__title_slug": "sort-the-matrix-diagonally", "question__hide": false, - "total_acs": 10657, - "total_submitted": 13685, + "total_acs": 10698, + "total_submitted": 13740, "total_column_articles": 224, "frontend_question_id": "1329", "is_new_question": false @@ -34179,9 +34263,9 @@ "question__title": "Break a Palindrome", "question__title_slug": "break-a-palindrome", "question__hide": false, - "total_acs": 8154, - "total_submitted": 17376, - "total_column_articles": 159, + "total_acs": 8292, + "total_submitted": 17651, + "total_column_articles": 160, "frontend_question_id": "1328", "is_new_question": false }, @@ -34200,8 +34284,8 @@ "question__title": "Longest Chunked Palindrome Decomposition", "question__title_slug": "longest-chunked-palindrome-decomposition", "question__hide": false, - "total_acs": 6254, - "total_submitted": 11022, + "total_acs": 6296, + "total_submitted": 11085, "total_column_articles": 120, "frontend_question_id": "1147", "is_new_question": false @@ -34221,9 +34305,9 @@ "question__title": "Longest Common Subsequence", "question__title_slug": "longest-common-subsequence", "question__hide": false, - "total_acs": 287684, - "total_submitted": 443491, - "total_column_articles": 1675, + "total_acs": 289082, + "total_submitted": 445698, + "total_column_articles": 1682, "frontend_question_id": "1143", "is_new_question": false }, @@ -34242,9 +34326,9 @@ "question__title": "Snapshot Array", "question__title_slug": "snapshot-array", "question__hide": false, - "total_acs": 7550, - "total_submitted": 23275, - "total_column_articles": 103, + "total_acs": 7607, + "total_submitted": 23467, + "total_column_articles": 105, "frontend_question_id": "1146", "is_new_question": false }, @@ -34263,9 +34347,9 @@ "question__title": "Binary Tree Coloring Game", "question__title_slug": "binary-tree-coloring-game", "question__hide": false, - "total_acs": 8413, - "total_submitted": 17690, - "total_column_articles": 144, + "total_acs": 8465, + "total_submitted": 17794, + "total_column_articles": 145, "frontend_question_id": "1145", "is_new_question": false }, @@ -34284,9 +34368,9 @@ "question__title": "Decrease Elements To Make Array Zigzag", "question__title_slug": "decrease-elements-to-make-array-zigzag", "question__hide": false, - "total_acs": 12079, - "total_submitted": 27007, - "total_column_articles": 171, + "total_acs": 12115, + "total_submitted": 27080, + "total_column_articles": 172, "frontend_question_id": "1144", "is_new_question": false }, @@ -34305,8 +34389,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": 11126, - "total_submitted": 29911, + "total_acs": 11170, + "total_submitted": 30046, "total_column_articles": 67, "frontend_question_id": "1142", "is_new_question": false @@ -34326,9 +34410,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": 36618, - "total_submitted": 80166, - "total_column_articles": 225, + "total_acs": 37173, + "total_submitted": 81464, + "total_column_articles": 227, "frontend_question_id": "1141", "is_new_question": false }, @@ -34347,8 +34431,8 @@ "question__title": "Distinct Echo Substrings", "question__title_slug": "distinct-echo-substrings", "question__hide": false, - "total_acs": 4268, - "total_submitted": 9076, + "total_acs": 4286, + "total_submitted": 9124, "total_column_articles": 83, "frontend_question_id": "1316", "is_new_question": false @@ -34368,9 +34452,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": 16615, - "total_submitted": 20360, - "total_column_articles": 356, + "total_acs": 16669, + "total_submitted": 20448, + "total_column_articles": 357, "frontend_question_id": "1315", "is_new_question": false }, @@ -34389,9 +34473,9 @@ "question__title": "Matrix Block Sum", "question__title_slug": "matrix-block-sum", "question__hide": false, - "total_acs": 20943, - "total_submitted": 27686, - "total_column_articles": 334, + "total_acs": 21070, + "total_submitted": 27845, + "total_column_articles": 340, "frontend_question_id": "1314", "is_new_question": false }, @@ -34410,8 +34494,8 @@ "question__title": "Decompress Run-Length Encoded List", "question__title_slug": "decompress-run-length-encoded-list", "question__hide": false, - "total_acs": 40574, - "total_submitted": 48718, + "total_acs": 40673, + "total_submitted": 48836, "total_column_articles": 625, "frontend_question_id": "1313", "is_new_question": false @@ -34431,9 +34515,9 @@ "question__title": "Stone Game II", "question__title_slug": "stone-game-ii", "question__hide": false, - "total_acs": 9369, - "total_submitted": 14217, - "total_column_articles": 121, + "total_acs": 9433, + "total_submitted": 14307, + "total_column_articles": 123, "frontend_question_id": "1140", "is_new_question": false }, @@ -34452,9 +34536,9 @@ "question__title": "Largest 1-Bordered Square", "question__title_slug": "largest-1-bordered-square", "question__hide": false, - "total_acs": 12376, - "total_submitted": 25258, - "total_column_articles": 199, + "total_acs": 12431, + "total_submitted": 25358, + "total_column_articles": 200, "frontend_question_id": "1139", "is_new_question": false }, @@ -34473,9 +34557,9 @@ "question__title": "Alphabet Board Path", "question__title_slug": "alphabet-board-path", "question__hide": false, - "total_acs": 7741, - "total_submitted": 17477, - "total_column_articles": 176, + "total_acs": 7762, + "total_submitted": 17530, + "total_column_articles": 178, "frontend_question_id": "1138", "is_new_question": false }, @@ -34494,8 +34578,8 @@ "question__title": "Reported Posts II", "question__title_slug": "reported-posts-ii", "question__hide": false, - "total_acs": 7942, - "total_submitted": 20464, + "total_acs": 7983, + "total_submitted": 20608, "total_column_articles": 72, "frontend_question_id": "1132", "is_new_question": false @@ -34515,9 +34599,9 @@ "question__title": "N-th Tribonacci Number", "question__title_slug": "n-th-tribonacci-number", "question__hide": false, - "total_acs": 137726, - "total_submitted": 226060, - "total_column_articles": 1304, + "total_acs": 138293, + "total_submitted": 227043, + "total_column_articles": 1306, "frontend_question_id": "1137", "is_new_question": false }, @@ -34536,9 +34620,9 @@ "question__title": "Number of Paths with Max Score", "question__title_slug": "number-of-paths-with-max-score", "question__hide": false, - "total_acs": 5874, - "total_submitted": 15611, - "total_column_articles": 131, + "total_acs": 5917, + "total_submitted": 15736, + "total_column_articles": 132, "frontend_question_id": "1301", "is_new_question": false }, @@ -34557,8 +34641,8 @@ "question__title": "Number of Ships in a Rectangle", "question__title_slug": "number-of-ships-in-a-rectangle", "question__hide": false, - "total_acs": 1415, - "total_submitted": 2214, + "total_acs": 1428, + "total_submitted": 2233, "total_column_articles": 33, "frontend_question_id": "1274", "is_new_question": false @@ -34578,9 +34662,9 @@ "question__title": "Sum of Mutated Array Closest to Target", "question__title_slug": "sum-of-mutated-array-closest-to-target", "question__hide": false, - "total_acs": 29041, - "total_submitted": 62467, - "total_column_articles": 434, + "total_acs": 29117, + "total_submitted": 62599, + "total_column_articles": 435, "frontend_question_id": "1300", "is_new_question": false }, @@ -34599,9 +34683,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": 37534, - "total_submitted": 47541, - "total_column_articles": 534, + "total_acs": 37651, + "total_submitted": 47690, + "total_column_articles": 535, "frontend_question_id": "1299", "is_new_question": false }, @@ -34620,9 +34704,9 @@ "question__title": "Maximum of Absolute Value Expression", "question__title_slug": "maximum-of-absolute-value-expression", "question__hide": false, - "total_acs": 4040, - "total_submitted": 8644, - "total_column_articles": 65, + "total_acs": 4060, + "total_submitted": 8678, + "total_column_articles": 66, "frontend_question_id": "1131", "is_new_question": false }, @@ -34641,8 +34725,8 @@ "question__title": "Shortest Path with Alternating Colors", "question__title_slug": "shortest-path-with-alternating-colors", "question__hide": false, - "total_acs": 9992, - "total_submitted": 24636, + "total_acs": 10040, + "total_submitted": 24728, "total_column_articles": 212, "frontend_question_id": "1129", "is_new_question": false @@ -34662,8 +34746,8 @@ "question__title": "Minimum Cost Tree From Leaf Values", "question__title_slug": "minimum-cost-tree-from-leaf-values", "question__hide": false, - "total_acs": 8161, - "total_submitted": 12681, + "total_acs": 8191, + "total_submitted": 12737, "total_column_articles": 139, "frontend_question_id": "1130", "is_new_question": false @@ -34683,9 +34767,9 @@ "question__title": "Number of Equivalent Domino Pairs", "question__title_slug": "number-of-equivalent-domino-pairs", "question__hide": false, - "total_acs": 41552, - "total_submitted": 76658, - "total_column_articles": 526, + "total_acs": 41618, + "total_submitted": 76776, + "total_column_articles": 528, "frontend_question_id": "1128", "is_new_question": false }, @@ -34704,8 +34788,8 @@ "question__title": "User Purchase Platform", "question__title_slug": "user-purchase-platform", "question__hide": false, - "total_acs": 6909, - "total_submitted": 16044, + "total_acs": 6952, + "total_submitted": 16138, "total_column_articles": 100, "frontend_question_id": "1127", "is_new_question": false @@ -34725,9 +34809,9 @@ "question__title": "Active Businesses", "question__title_slug": "active-businesses", "question__hide": false, - "total_acs": 11546, - "total_submitted": 16757, - "total_column_articles": 134, + "total_acs": 11633, + "total_submitted": 16868, + "total_column_articles": 135, "frontend_question_id": "1126", "is_new_question": false }, @@ -34746,8 +34830,8 @@ "question__title": "Minimum Falling Path Sum II", "question__title_slug": "minimum-falling-path-sum-ii", "question__hide": false, - "total_acs": 12552, - "total_submitted": 21057, + "total_acs": 12690, + "total_submitted": 21370, "total_column_articles": 161, "frontend_question_id": "1289", "is_new_question": false @@ -34767,8 +34851,8 @@ "question__title": "Graph Connectivity With Threshold", "question__title_slug": "graph-connectivity-with-threshold", "question__hide": false, - "total_acs": 3545, - "total_submitted": 8606, + "total_acs": 3561, + "total_submitted": 8626, "total_column_articles": 58, "frontend_question_id": "1627", "is_new_question": false @@ -34788,9 +34872,9 @@ "question__title": "Remove Covered Intervals", "question__title_slug": "remove-covered-intervals", "question__hide": false, - "total_acs": 23829, - "total_submitted": 42603, - "total_column_articles": 270, + "total_acs": 23974, + "total_submitted": 42844, + "total_column_articles": 271, "frontend_question_id": "1288", "is_new_question": false }, @@ -34809,8 +34893,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": 21570, - "total_submitted": 36339, + "total_acs": 21663, + "total_submitted": 36493, "total_column_articles": 310, "frontend_question_id": "1287", "is_new_question": false @@ -34830,9 +34914,9 @@ "question__title": "Smallest Sufficient Team", "question__title_slug": "smallest-sufficient-team", "question__hide": false, - "total_acs": 4353, - "total_submitted": 8705, - "total_column_articles": 71, + "total_acs": 4379, + "total_submitted": 8737, + "total_column_articles": 72, "frontend_question_id": "1125", "is_new_question": false }, @@ -34851,9 +34935,9 @@ "question__title": "Longest Well-Performing Interval", "question__title_slug": "longest-well-performing-interval", "question__hide": false, - "total_acs": 19610, - "total_submitted": 56697, - "total_column_articles": 196, + "total_acs": 19734, + "total_submitted": 57001, + "total_column_articles": 198, "frontend_question_id": "1124", "is_new_question": false }, @@ -34872,9 +34956,9 @@ "question__title": "Lowest Common Ancestor of Deepest Leaves", "question__title_slug": "lowest-common-ancestor-of-deepest-leaves", "question__hide": false, - "total_acs": 11703, - "total_submitted": 16404, - "total_column_articles": 152, + "total_acs": 11772, + "total_submitted": 16554, + "total_column_articles": 154, "frontend_question_id": "1123", "is_new_question": false }, @@ -34893,8 +34977,8 @@ "question__title": "Relative Sort Array", "question__title_slug": "relative-sort-array", "question__hide": false, - "total_acs": 80998, - "total_submitted": 114498, + "total_acs": 81198, + "total_submitted": 114763, "total_column_articles": 1063, "frontend_question_id": "1122", "is_new_question": false @@ -34914,8 +34998,8 @@ "question__title": "Print Zero Even Odd", "question__title_slug": "print-zero-even-odd", "question__hide": false, - "total_acs": 30557, - "total_submitted": 56899, + "total_acs": 30673, + "total_submitted": 57094, "total_column_articles": 437, "frontend_question_id": "1116", "is_new_question": false @@ -34935,8 +35019,8 @@ "question__title": "Reported Posts", "question__title_slug": "reported-posts", "question__hide": false, - "total_acs": 11241, - "total_submitted": 21060, + "total_acs": 11278, + "total_submitted": 21126, "total_column_articles": 69, "frontend_question_id": "1113", "is_new_question": false @@ -34956,8 +35040,8 @@ "question__title": "Highest Grade For Each Student", "question__title_slug": "highest-grade-for-each-student", "question__hide": false, - "total_acs": 14800, - "total_submitted": 22535, + "total_acs": 14901, + "total_submitted": 22677, "total_column_articles": 144, "frontend_question_id": "1112", "is_new_question": false @@ -34977,8 +35061,8 @@ "question__title": "Handshakes That Don't Cross", "question__title_slug": "handshakes-that-dont-cross", "question__hide": false, - "total_acs": 2995, - "total_submitted": 5690, + "total_acs": 3021, + "total_submitted": 5732, "total_column_articles": 62, "frontend_question_id": "1259", "is_new_question": false @@ -34998,9 +35082,9 @@ "question__title": "Sequential Digits", "question__title_slug": "sequential-digits", "question__hide": false, - "total_acs": 9660, - "total_submitted": 18163, - "total_column_articles": 213, + "total_acs": 9690, + "total_submitted": 18216, + "total_column_articles": 214, "frontend_question_id": "1291", "is_new_question": false }, @@ -35019,8 +35103,8 @@ "question__title": "Iterator for Combination", "question__title_slug": "iterator-for-combination", "question__hide": false, - "total_acs": 6372, - "total_submitted": 9830, + "total_acs": 6392, + "total_submitted": 9877, "total_column_articles": 134, "frontend_question_id": "1286", "is_new_question": false @@ -35040,8 +35124,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": 42629, - "total_submitted": 59256, + "total_acs": 42722, + "total_submitted": 59382, "total_column_articles": 432, "frontend_question_id": "1619", "is_new_question": false @@ -35061,8 +35145,8 @@ "question__title": "Design Bounded Blocking Queue", "question__title_slug": "design-bounded-blocking-queue", "question__hide": false, - "total_acs": 4735, - "total_submitted": 6737, + "total_acs": 4762, + "total_submitted": 6771, "total_column_articles": 84, "frontend_question_id": "1188", "is_new_question": false @@ -35082,9 +35166,9 @@ "question__title": "Maximum Nesting Depth of Two Valid Parentheses Strings", "question__title_slug": "maximum-nesting-depth-of-two-valid-parentheses-strings", "question__hide": false, - "total_acs": 26524, - "total_submitted": 34457, - "total_column_articles": 434, + "total_acs": 26558, + "total_submitted": 34500, + "total_column_articles": 437, "frontend_question_id": "1111", "is_new_question": false }, @@ -35103,9 +35187,9 @@ "question__title": "Delete Nodes And Return Forest", "question__title_slug": "delete-nodes-and-return-forest", "question__hide": false, - "total_acs": 17989, - "total_submitted": 27737, - "total_column_articles": 305, + "total_acs": 18067, + "total_submitted": 27845, + "total_column_articles": 306, "frontend_question_id": "1110", "is_new_question": false }, @@ -35124,9 +35208,9 @@ "question__title": "Corporate Flight Bookings", "question__title_slug": "corporate-flight-bookings", "question__hide": false, - "total_acs": 96858, - "total_submitted": 154926, - "total_column_articles": 1444, + "total_acs": 97411, + "total_submitted": 155695, + "total_column_articles": 1456, "frontend_question_id": "1109", "is_new_question": false }, @@ -35145,9 +35229,9 @@ "question__title": "Defanging an IP Address", "question__title_slug": "defanging-an-ip-address", "question__hide": false, - "total_acs": 107328, - "total_submitted": 125398, - "total_column_articles": 971, + "total_acs": 107553, + "total_submitted": 125656, + "total_column_articles": 974, "frontend_question_id": "1108", "is_new_question": false }, @@ -35166,8 +35250,8 @@ "question__title": "New Users Daily Count", "question__title_slug": "new-users-daily-count", "question__hide": false, - "total_acs": 11590, - "total_submitted": 28101, + "total_acs": 11637, + "total_submitted": 28201, "total_column_articles": 129, "frontend_question_id": "1107", "is_new_question": false @@ -35187,9 +35271,9 @@ "question__title": "Print in Order", "question__title_slug": "print-in-order", "question__hide": false, - "total_acs": 101491, - "total_submitted": 155685, - "total_column_articles": 700, + "total_acs": 101809, + "total_submitted": 156167, + "total_column_articles": 701, "frontend_question_id": "1114", "is_new_question": false }, @@ -35208,8 +35292,8 @@ "question__title": "Palindrome Removal", "question__title_slug": "palindrome-removal", "question__hide": false, - "total_acs": 3744, - "total_submitted": 7486, + "total_acs": 3758, + "total_submitted": 7516, "total_column_articles": 55, "frontend_question_id": "1246", "is_new_question": false @@ -35229,9 +35313,9 @@ "question__title": "Delete Tree Nodes", "question__title_slug": "delete-tree-nodes", "question__hide": false, - "total_acs": 2295, - "total_submitted": 4092, - "total_column_articles": 67, + "total_acs": 2309, + "total_submitted": 4109, + "total_column_articles": 68, "frontend_question_id": "1273", "is_new_question": false }, @@ -35250,8 +35334,8 @@ "question__title": "Remove Interval", "question__title_slug": "remove-interval", "question__hide": false, - "total_acs": 2406, - "total_submitted": 4340, + "total_acs": 2424, + "total_submitted": 4367, "total_column_articles": 43, "frontend_question_id": "1272", "is_new_question": false @@ -35271,9 +35355,9 @@ "question__title": "Hexspeak", "question__title_slug": "hexspeak", "question__hide": false, - "total_acs": 2974, - "total_submitted": 5755, - "total_column_articles": 58, + "total_acs": 2983, + "total_submitted": 5767, + "total_column_articles": 59, "frontend_question_id": "1271", "is_new_question": false }, @@ -35292,9 +35376,9 @@ "question__title": "Unpopular Books", "question__title_slug": "unpopular-books", "question__hide": false, - "total_acs": 12284, - "total_submitted": 25861, - "total_column_articles": 126, + "total_acs": 12328, + "total_submitted": 25937, + "total_column_articles": 127, "frontend_question_id": "1098", "is_new_question": false }, @@ -35313,9 +35397,9 @@ "question__title": "Parsing A Boolean Expression", "question__title_slug": "parsing-a-boolean-expression", "question__hide": false, - "total_acs": 5581, - "total_submitted": 9490, - "total_column_articles": 170, + "total_acs": 25426, + "total_submitted": 36881, + "total_column_articles": 551, "frontend_question_id": "1106", "is_new_question": false }, @@ -35334,9 +35418,9 @@ "question__title": "Filling Bookcase Shelves", "question__title_slug": "filling-bookcase-shelves", "question__hide": false, - "total_acs": 6870, - "total_submitted": 11932, - "total_column_articles": 91, + "total_acs": 6934, + "total_submitted": 12018, + "total_column_articles": 92, "frontend_question_id": "1105", "is_new_question": false }, @@ -35355,9 +35439,9 @@ "question__title": "Distribute Candies to People", "question__title_slug": "distribute-candies-to-people", "question__hide": false, - "total_acs": 41569, - "total_submitted": 65355, - "total_column_articles": 1197, + "total_acs": 41682, + "total_submitted": 65545, + "total_column_articles": 1201, "frontend_question_id": "1103", "is_new_question": false }, @@ -35376,9 +35460,9 @@ "question__title": "Path In Zigzag Labelled Binary Tree", "question__title_slug": "path-in-zigzag-labelled-binary-tree", "question__hide": false, - "total_acs": 31566, - "total_submitted": 41539, - "total_column_articles": 749, + "total_acs": 31653, + "total_submitted": 41655, + "total_column_articles": 756, "frontend_question_id": "1104", "is_new_question": false }, @@ -35397,8 +35481,8 @@ "question__title": "Game Play Analysis V", "question__title_slug": "game-play-analysis-v", "question__hide": false, - "total_acs": 10390, - "total_submitted": 19820, + "total_acs": 10424, + "total_submitted": 19883, "total_column_articles": 159, "frontend_question_id": "1097", "is_new_question": false @@ -35418,8 +35502,8 @@ "question__title": "Divide Chocolate", "question__title_slug": "divide-chocolate", "question__hide": false, - "total_acs": 6445, - "total_submitted": 11025, + "total_acs": 6484, + "total_submitted": 11090, "total_column_articles": 94, "frontend_question_id": "1231", "is_new_question": false @@ -35439,8 +35523,8 @@ "question__title": "Synonymous Sentences", "question__title_slug": "synonymous-sentences", "question__hide": false, - "total_acs": 1872, - "total_submitted": 3228, + "total_acs": 1885, + "total_submitted": 3248, "total_column_articles": 74, "frontend_question_id": "1258", "is_new_question": false @@ -35460,9 +35544,9 @@ "question__title": "Smallest Common Region", "question__title_slug": "smallest-common-region", "question__hide": false, - "total_acs": 2416, - "total_submitted": 4176, - "total_column_articles": 60, + "total_acs": 2424, + "total_submitted": 4187, + "total_column_articles": 61, "frontend_question_id": "1257", "is_new_question": false }, @@ -35481,8 +35565,8 @@ "question__title": "Encode Number", "question__title_slug": "encode-number", "question__hide": false, - "total_acs": 1914, - "total_submitted": 2808, + "total_acs": 1921, + "total_submitted": 2816, "total_column_articles": 49, "frontend_question_id": "1256", "is_new_question": false @@ -35502,9 +35586,9 @@ "question__title": "Brace Expansion II", "question__title_slug": "brace-expansion-ii", "question__hide": false, - "total_acs": 2437, - "total_submitted": 4290, - "total_column_articles": 65, + "total_acs": 2450, + "total_submitted": 4310, + "total_column_articles": 67, "frontend_question_id": "1096", "is_new_question": false }, @@ -35523,9 +35607,9 @@ "question__title": "Print FooBar Alternately", "question__title_slug": "print-foobar-alternately", "question__hide": false, - "total_acs": 58301, - "total_submitted": 102933, - "total_column_articles": 577, + "total_acs": 58522, + "total_submitted": 103326, + "total_column_articles": 578, "frontend_question_id": "1115", "is_new_question": false }, @@ -35544,8 +35628,8 @@ "question__title": "Building H2O", "question__title_slug": "building-h2o", "question__hide": false, - "total_acs": 23293, - "total_submitted": 43486, + "total_acs": 23389, + "total_submitted": 43652, "total_column_articles": 318, "frontend_question_id": "1117", "is_new_question": false @@ -35565,8 +35649,8 @@ "question__title": "Find in Mountain Array", "question__title_slug": "find-in-mountain-array", "question__hide": false, - "total_acs": 25257, - "total_submitted": 67076, + "total_acs": 25319, + "total_submitted": 67234, "total_column_articles": 459, "frontend_question_id": "1095", "is_new_question": false @@ -35586,9 +35670,9 @@ "question__title": "Car Pooling", "question__title_slug": "car-pooling", "question__hide": false, - "total_acs": 60585, - "total_submitted": 113981, - "total_column_articles": 1128, + "total_acs": 61185, + "total_submitted": 115312, + "total_column_articles": 1144, "frontend_question_id": "1094", "is_new_question": false }, @@ -35607,9 +35691,9 @@ "question__title": "Statistics from a Large Sample", "question__title_slug": "statistics-from-a-large-sample", "question__hide": false, - "total_acs": 4898, - "total_submitted": 13446, - "total_column_articles": 83, + "total_acs": 4918, + "total_submitted": 13509, + "total_column_articles": 84, "frontend_question_id": "1093", "is_new_question": false }, @@ -35628,9 +35712,9 @@ "question__title": "Game Play Analysis IV", "question__title_slug": "game-play-analysis-iv", "question__hide": false, - "total_acs": 23103, - "total_submitted": 52340, - "total_column_articles": 278, + "total_acs": 23242, + "total_submitted": 52630, + "total_column_articles": 282, "frontend_question_id": "550", "is_new_question": false }, @@ -35649,8 +35733,8 @@ "question__title": "Game Play Analysis III", "question__title_slug": "game-play-analysis-iii", "question__hide": false, - "total_acs": 25111, - "total_submitted": 36752, + "total_acs": 25239, + "total_submitted": 36943, "total_column_articles": 192, "frontend_question_id": "534", "is_new_question": false @@ -35670,9 +35754,9 @@ "question__title": "Game Play Analysis II", "question__title_slug": "game-play-analysis-ii", "question__hide": false, - "total_acs": 31228, - "total_submitted": 57810, - "total_column_articles": 216, + "total_acs": 31391, + "total_submitted": 58138, + "total_column_articles": 217, "frontend_question_id": "512", "is_new_question": false }, @@ -35691,9 +35775,9 @@ "question__title": "Game Play Analysis I", "question__title_slug": "game-play-analysis-i", "question__hide": false, - "total_acs": 62966, - "total_submitted": 87764, - "total_column_articles": 283, + "total_acs": 63841, + "total_submitted": 89129, + "total_column_articles": 285, "frontend_question_id": "511", "is_new_question": false }, @@ -35712,9 +35796,9 @@ "question__title": "Valid Palindrome III", "question__title_slug": "valid-palindrome-iii", "question__hide": false, - "total_acs": 2473, - "total_submitted": 4323, - "total_column_articles": 51, + "total_acs": 2520, + "total_submitted": 4418, + "total_column_articles": 52, "frontend_question_id": "1216", "is_new_question": false }, @@ -35733,8 +35817,8 @@ "question__title": "Tree Diameter", "question__title_slug": "tree-diameter", "question__hide": false, - "total_acs": 5193, - "total_submitted": 9925, + "total_acs": 5214, + "total_submitted": 9955, "total_column_articles": 101, "frontend_question_id": "1245", "is_new_question": false @@ -35754,8 +35838,8 @@ "question__title": "Design A Leaderboard", "question__title_slug": "design-a-leaderboard", "question__hide": false, - "total_acs": 3814, - "total_submitted": 6025, + "total_acs": 3854, + "total_submitted": 6093, "total_column_articles": 63, "frontend_question_id": "1244", "is_new_question": false @@ -35775,9 +35859,9 @@ "question__title": "Array Transformation", "question__title_slug": "array-transformation", "question__hide": false, - "total_acs": 3296, - "total_submitted": 6149, - "total_column_articles": 77, + "total_acs": 3311, + "total_submitted": 6179, + "total_column_articles": 79, "frontend_question_id": "1243", "is_new_question": false }, @@ -35796,9 +35880,9 @@ "question__title": "Sales Analysis III", "question__title_slug": "sales-analysis-iii", "question__hide": false, - "total_acs": 34708, - "total_submitted": 64274, - "total_column_articles": 264, + "total_acs": 35237, + "total_submitted": 65409, + "total_column_articles": 265, "frontend_question_id": "1084", "is_new_question": false }, @@ -35817,8 +35901,8 @@ "question__title": "Sales Analysis II", "question__title_slug": "sales-analysis-ii", "question__hide": false, - "total_acs": 16591, - "total_submitted": 31404, + "total_acs": 16652, + "total_submitted": 31496, "total_column_articles": 147, "frontend_question_id": "1083", "is_new_question": false @@ -35838,8 +35922,8 @@ "question__title": "Sales Analysis I", "question__title_slug": "sales-analysis-i", "question__hide": false, - "total_acs": 17748, - "total_submitted": 23168, + "total_acs": 17806, + "total_submitted": 23231, "total_column_articles": 129, "frontend_question_id": "1082", "is_new_question": false @@ -35859,9 +35943,9 @@ "question__title": "Shortest Path in Binary Matrix", "question__title_slug": "shortest-path-in-binary-matrix", "question__hide": false, - "total_acs": 54529, - "total_submitted": 141267, - "total_column_articles": 548, + "total_acs": 54773, + "total_submitted": 141934, + "total_column_articles": 552, "frontend_question_id": "1091", "is_new_question": false }, @@ -35880,9 +35964,9 @@ "question__title": "Shortest Common Supersequence ", "question__title_slug": "shortest-common-supersequence", "question__hide": false, - "total_acs": 4418, - "total_submitted": 8377, - "total_column_articles": 81, + "total_acs": 4469, + "total_submitted": 8456, + "total_column_articles": 82, "frontend_question_id": "1092", "is_new_question": false }, @@ -35901,9 +35985,9 @@ "question__title": "Largest Values From Labels", "question__title_slug": "largest-values-from-labels", "question__hide": false, - "total_acs": 5620, - "total_submitted": 9836, - "total_column_articles": 128, + "total_acs": 5673, + "total_submitted": 9927, + "total_column_articles": 132, "frontend_question_id": "1090", "is_new_question": false }, @@ -35922,9 +36006,9 @@ "question__title": "Duplicate Zeros", "question__title_slug": "duplicate-zeros", "question__hide": false, - "total_acs": 54755, - "total_submitted": 90442, - "total_column_articles": 731, + "total_acs": 54886, + "total_submitted": 90669, + "total_column_articles": 733, "frontend_question_id": "1089", "is_new_question": false }, @@ -35943,8 +36027,8 @@ "question__title": "Minimum Time to Build Blocks", "question__title_slug": "minimum-time-to-build-blocks", "question__hide": false, - "total_acs": 997, - "total_submitted": 2144, + "total_acs": 1001, + "total_submitted": 2151, "total_column_articles": 29, "frontend_question_id": "1199", "is_new_question": false @@ -35964,9 +36048,9 @@ "question__title": "Toss Strange Coins", "question__title_slug": "toss-strange-coins", "question__hide": false, - "total_acs": 5554, - "total_submitted": 10360, - "total_column_articles": 102, + "total_acs": 5592, + "total_submitted": 10418, + "total_column_articles": 103, "frontend_question_id": "1230", "is_new_question": false }, @@ -35985,8 +36069,8 @@ "question__title": "Meeting Scheduler", "question__title_slug": "meeting-scheduler", "question__hide": false, - "total_acs": 5577, - "total_submitted": 12136, + "total_acs": 5615, + "total_submitted": 12221, "total_column_articles": 113, "frontend_question_id": "1229", "is_new_question": false @@ -36006,9 +36090,9 @@ "question__title": "Missing Number In Arithmetic Progression", "question__title_slug": "missing-number-in-arithmetic-progression", "question__hide": false, - "total_acs": 3877, - "total_submitted": 7234, - "total_column_articles": 74, + "total_acs": 3893, + "total_submitted": 7264, + "total_column_articles": 75, "frontend_question_id": "1228", "is_new_question": false }, @@ -36027,9 +36111,9 @@ "question__title": "Project Employees III", "question__title_slug": "project-employees-iii", "question__hide": false, - "total_acs": 14128, - "total_submitted": 19528, - "total_column_articles": 132, + "total_acs": 14216, + "total_submitted": 19652, + "total_column_articles": 133, "frontend_question_id": "1077", "is_new_question": false }, @@ -36048,8 +36132,8 @@ "question__title": "Project Employees II", "question__title_slug": "project-employees-ii", "question__hide": false, - "total_acs": 16415, - "total_submitted": 33333, + "total_acs": 16469, + "total_submitted": 33454, "total_column_articles": 122, "frontend_question_id": "1076", "is_new_question": false @@ -36069,8 +36153,8 @@ "question__title": "Project Employees I", "question__title_slug": "project-employees-i", "question__hide": false, - "total_acs": 15210, - "total_submitted": 21732, + "total_acs": 15252, + "total_submitted": 21790, "total_column_articles": 100, "frontend_question_id": "1075", "is_new_question": false @@ -36090,9 +36174,9 @@ "question__title": "Letter Tile Possibilities", "question__title_slug": "letter-tile-possibilities", "question__hide": false, - "total_acs": 15808, - "total_submitted": 21414, - "total_column_articles": 264, + "total_acs": 15862, + "total_submitted": 21480, + "total_column_articles": 265, "frontend_question_id": "1079", "is_new_question": false }, @@ -36111,9 +36195,9 @@ "question__title": "Smallest Subsequence of Distinct Characters", "question__title_slug": "smallest-subsequence-of-distinct-characters", "question__hide": false, - "total_acs": 23355, - "total_submitted": 40126, - "total_column_articles": 224, + "total_acs": 23475, + "total_submitted": 40336, + "total_column_articles": 227, "frontend_question_id": "1081", "is_new_question": false }, @@ -36132,9 +36216,9 @@ "question__title": "Insufficient Nodes in Root to Leaf Paths", "question__title_slug": "insufficient-nodes-in-root-to-leaf-paths", "question__hide": false, - "total_acs": 6928, - "total_submitted": 13406, - "total_column_articles": 137, + "total_acs": 6977, + "total_submitted": 13495, + "total_column_articles": 140, "frontend_question_id": "1080", "is_new_question": false }, @@ -36153,9 +36237,9 @@ "question__title": "Occurrences After Bigram", "question__title_slug": "occurrences-after-bigram", "question__hide": false, - "total_acs": 35388, - "total_submitted": 54142, - "total_column_articles": 497, + "total_acs": 35458, + "total_submitted": 54256, + "total_column_articles": 498, "frontend_question_id": "1078", "is_new_question": false }, @@ -36174,8 +36258,8 @@ "question__title": "Product Sales Analysis III", "question__title_slug": "product-sales-analysis-iii", "question__hide": false, - "total_acs": 12697, - "total_submitted": 26500, + "total_acs": 12742, + "total_submitted": 26579, "total_column_articles": 93, "frontend_question_id": "1070", "is_new_question": false @@ -36195,8 +36279,8 @@ "question__title": "Product Sales Analysis II", "question__title_slug": "product-sales-analysis-ii", "question__hide": false, - "total_acs": 16706, - "total_submitted": 20514, + "total_acs": 16759, + "total_submitted": 20574, "total_column_articles": 79, "frontend_question_id": "1069", "is_new_question": false @@ -36216,8 +36300,8 @@ "question__title": "Product Sales Analysis I", "question__title_slug": "product-sales-analysis-i", "question__hide": false, - "total_acs": 19308, - "total_submitted": 22405, + "total_acs": 19369, + "total_submitted": 22472, "total_column_articles": 88, "frontend_question_id": "1068", "is_new_question": false @@ -36258,8 +36342,8 @@ "question__title": "Stepping Numbers", "question__title_slug": "stepping-numbers", "question__hide": false, - "total_acs": 2410, - "total_submitted": 5643, + "total_acs": 2419, + "total_submitted": 5660, "total_column_articles": 52, "frontend_question_id": "1215", "is_new_question": false @@ -36279,8 +36363,8 @@ "question__title": "Two Sum BSTs", "question__title_slug": "two-sum-bsts", "question__hide": false, - "total_acs": 4692, - "total_submitted": 7157, + "total_acs": 4696, + "total_submitted": 7167, "total_column_articles": 94, "frontend_question_id": "1214", "is_new_question": false @@ -36300,9 +36384,9 @@ "question__title": "Intersection of Three Sorted Arrays", "question__title_slug": "intersection-of-three-sorted-arrays", "question__hide": false, - "total_acs": 8162, - "total_submitted": 10442, - "total_column_articles": 174, + "total_acs": 8204, + "total_submitted": 10496, + "total_column_articles": 176, "frontend_question_id": "1213", "is_new_question": false }, @@ -36321,8 +36405,8 @@ "question__title": "Adding Two Negabinary Numbers", "question__title_slug": "adding-two-negabinary-numbers", "question__hide": false, - "total_acs": 3373, - "total_submitted": 9579, + "total_acs": 3390, + "total_submitted": 9623, "total_column_articles": 67, "frontend_question_id": "1073", "is_new_question": false @@ -36342,9 +36426,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": 4776, - "total_submitted": 7742, - "total_column_articles": 77, + "total_acs": 4799, + "total_submitted": 7789, + "total_column_articles": 78, "frontend_question_id": "1072", "is_new_question": false }, @@ -36363,9 +36447,9 @@ "question__title": "Greatest Common Divisor of Strings", "question__title_slug": "greatest-common-divisor-of-strings", "question__hide": false, - "total_acs": 40164, - "total_submitted": 68524, - "total_column_articles": 735, + "total_acs": 40243, + "total_submitted": 68673, + "total_column_articles": 737, "frontend_question_id": "1071", "is_new_question": false }, @@ -36384,9 +36468,9 @@ "question__title": "Number of Submatrices That Sum to Target", "question__title_slug": "number-of-submatrices-that-sum-to-target", "question__hide": false, - "total_acs": 21010, - "total_submitted": 31279, - "total_column_articles": 216, + "total_acs": 21052, + "total_submitted": 31332, + "total_column_articles": 217, "frontend_question_id": "1074", "is_new_question": false }, @@ -36405,8 +36489,8 @@ "question__title": "Optimize Water Distribution in a Village", "question__title_slug": "optimize-water-distribution-in-a-village", "question__hide": false, - "total_acs": 2488, - "total_submitted": 4060, + "total_acs": 2500, + "total_submitted": 4073, "total_column_articles": 49, "frontend_question_id": "1168", "is_new_question": false @@ -36426,8 +36510,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": 5114, - "total_submitted": 6942, + "total_acs": 5124, + "total_submitted": 6954, "total_column_articles": 80, "frontend_question_id": "1198", "is_new_question": false @@ -36447,9 +36531,9 @@ "question__title": "Minimum Knight Moves", "question__title_slug": "minimum-knight-moves", "question__hide": false, - "total_acs": 6706, - "total_submitted": 17308, - "total_column_articles": 79, + "total_acs": 6731, + "total_submitted": 17388, + "total_column_articles": 81, "frontend_question_id": "1197", "is_new_question": false }, @@ -36468,9 +36552,9 @@ "question__title": "How Many Apples Can You Put into the Basket", "question__title_slug": "how-many-apples-can-you-put-into-the-basket", "question__hide": false, - "total_acs": 4612, - "total_submitted": 6769, - "total_column_articles": 77, + "total_acs": 4625, + "total_submitted": 6785, + "total_column_articles": 78, "frontend_question_id": "1196", "is_new_question": false }, @@ -36489,9 +36573,9 @@ "question__title": "Distant Barcodes", "question__title_slug": "distant-barcodes", "question__hide": false, - "total_acs": 10777, - "total_submitted": 27251, - "total_column_articles": 155, + "total_acs": 10816, + "total_submitted": 27331, + "total_column_articles": 158, "frontend_question_id": "1054", "is_new_question": false }, @@ -36510,9 +36594,9 @@ "question__title": "Previous Permutation With One Swap", "question__title_slug": "previous-permutation-with-one-swap", "question__hide": false, - "total_acs": 7418, - "total_submitted": 16123, - "total_column_articles": 117, + "total_acs": 7448, + "total_submitted": 16192, + "total_column_articles": 118, "frontend_question_id": "1053", "is_new_question": false }, @@ -36531,9 +36615,9 @@ "question__title": "Grumpy Bookstore Owner", "question__title_slug": "grumpy-bookstore-owner", "question__hide": false, - "total_acs": 59557, - "total_submitted": 102674, - "total_column_articles": 887, + "total_acs": 59693, + "total_submitted": 102912, + "total_column_articles": 889, "frontend_question_id": "1052", "is_new_question": false }, @@ -36552,9 +36636,9 @@ "question__title": "Height Checker", "question__title_slug": "height-checker", "question__hide": false, - "total_acs": 65313, - "total_submitted": 81595, - "total_column_articles": 657, + "total_acs": 65434, + "total_submitted": 81753, + "total_column_articles": 660, "frontend_question_id": "1051", "is_new_question": false }, @@ -36573,9 +36657,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": 37068, - "total_submitted": 47720, - "total_column_articles": 165, + "total_acs": 37587, + "total_submitted": 48425, + "total_column_articles": 168, "frontend_question_id": "1050", "is_new_question": false }, @@ -36594,9 +36678,9 @@ "question__title": "Customers Who Bought All Products", "question__title_slug": "customers-who-bought-all-products", "question__hide": false, - "total_acs": 15327, - "total_submitted": 24133, - "total_column_articles": 166, + "total_acs": 15420, + "total_submitted": 24301, + "total_column_articles": 168, "frontend_question_id": "1045", "is_new_question": false }, @@ -36615,8 +36699,8 @@ "question__title": "Shortest Distance to Target Color", "question__title_slug": "shortest-distance-to-target-color", "question__hide": false, - "total_acs": 4914, - "total_submitted": 10564, + "total_acs": 4940, + "total_submitted": 10593, "total_column_articles": 92, "frontend_question_id": "1182", "is_new_question": false @@ -36636,9 +36720,9 @@ "question__title": "Last Substring in Lexicographical Order", "question__title_slug": "last-substring-in-lexicographical-order", "question__hide": false, - "total_acs": 7568, - "total_submitted": 27600, - "total_column_articles": 123, + "total_acs": 7595, + "total_submitted": 27702, + "total_column_articles": 124, "frontend_question_id": "1163", "is_new_question": false }, @@ -36657,8 +36741,8 @@ "question__title": "Before and After Puzzle", "question__title_slug": "before-and-after-puzzle", "question__hide": false, - "total_acs": 1801, - "total_submitted": 4654, + "total_acs": 1819, + "total_submitted": 4697, "total_column_articles": 36, "frontend_question_id": "1181", "is_new_question": false @@ -36678,8 +36762,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": 4016, - "total_submitted": 5188, + "total_acs": 4029, + "total_submitted": 5205, "total_column_articles": 97, "frontend_question_id": "1180", "is_new_question": false @@ -36699,9 +36783,9 @@ "question__title": "Last Stone Weight II", "question__title_slug": "last-stone-weight-ii", "question__hide": false, - "total_acs": 95124, - "total_submitted": 139052, - "total_column_articles": 685, + "total_acs": 95915, + "total_submitted": 140172, + "total_column_articles": 689, "frontend_question_id": "1049", "is_new_question": false }, @@ -36720,8 +36804,8 @@ "question__title": "Longest String Chain", "question__title_slug": "longest-string-chain", "question__hide": false, - "total_acs": 16107, - "total_submitted": 33193, + "total_acs": 16184, + "total_submitted": 33337, "total_column_articles": 233, "frontend_question_id": "1048", "is_new_question": false @@ -36741,9 +36825,9 @@ "question__title": "Remove All Adjacent Duplicates In String", "question__title_slug": "remove-all-adjacent-duplicates-in-string", "question__hide": false, - "total_acs": 191131, - "total_submitted": 263073, - "total_column_articles": 1415, + "total_acs": 192497, + "total_submitted": 265037, + "total_column_articles": 1425, "frontend_question_id": "1047", "is_new_question": false }, @@ -36762,9 +36846,9 @@ "question__title": "Last Stone Weight", "question__title_slug": "last-stone-weight", "question__hide": false, - "total_acs": 84590, - "total_submitted": 128489, - "total_column_articles": 1128, + "total_acs": 84872, + "total_submitted": 128943, + "total_column_articles": 1130, "frontend_question_id": "1046", "is_new_question": false }, @@ -36783,8 +36867,8 @@ "question__title": "Minimum Cost to Connect Sticks", "question__title_slug": "minimum-cost-to-connect-sticks", "question__hide": false, - "total_acs": 3496, - "total_submitted": 7051, + "total_acs": 3509, + "total_submitted": 7068, "total_column_articles": 49, "frontend_question_id": "1167", "is_new_question": false @@ -36804,8 +36888,8 @@ "question__title": "Design File System", "question__title_slug": "design-file-system", "question__hide": false, - "total_acs": 4416, - "total_submitted": 9005, + "total_acs": 4441, + "total_submitted": 9046, "total_column_articles": 79, "frontend_question_id": "1166", "is_new_question": false @@ -36825,8 +36909,8 @@ "question__title": "String Transforms Into Another String", "question__title_slug": "string-transforms-into-another-string", "question__hide": false, - "total_acs": 2142, - "total_submitted": 5716, + "total_acs": 2154, + "total_submitted": 5737, "total_column_articles": 28, "frontend_question_id": "1153", "is_new_question": false @@ -36846,8 +36930,8 @@ "question__title": "Single-Row Keyboard", "question__title_slug": "single-row-keyboard", "question__hide": false, - "total_acs": 8981, - "total_submitted": 10736, + "total_acs": 8999, + "total_submitted": 10755, "total_column_articles": 148, "frontend_question_id": "1165", "is_new_question": false @@ -36867,8 +36951,8 @@ "question__title": "Longest Duplicate Substring", "question__title_slug": "longest-duplicate-substring", "question__hide": false, - "total_acs": 26140, - "total_submitted": 73981, + "total_acs": 26201, + "total_submitted": 74123, "total_column_articles": 222, "frontend_question_id": "1044", "is_new_question": false @@ -36888,9 +36972,9 @@ "question__title": "Partition Array for Maximum Sum", "question__title_slug": "partition-array-for-maximum-sum", "question__hide": false, - "total_acs": 11215, - "total_submitted": 15993, - "total_column_articles": 140, + "total_acs": 11293, + "total_submitted": 16094, + "total_column_articles": 143, "frontend_question_id": "1043", "is_new_question": false }, @@ -36909,9 +36993,9 @@ "question__title": "Flower Planting With No Adjacent", "question__title_slug": "flower-planting-with-no-adjacent", "question__hide": false, - "total_acs": 15518, - "total_submitted": 28135, - "total_column_articles": 205, + "total_acs": 15606, + "total_submitted": 28316, + "total_column_articles": 206, "frontend_question_id": "1042", "is_new_question": false }, @@ -36930,9 +37014,9 @@ "question__title": "Robot Bounded In Circle", "question__title_slug": "robot-bounded-in-circle", "question__hide": false, - "total_acs": 10428, - "total_submitted": 20775, - "total_column_articles": 162, + "total_acs": 10486, + "total_submitted": 20869, + "total_column_articles": 163, "frontend_question_id": "1041", "is_new_question": false }, @@ -36951,8 +37035,8 @@ "question__title": "Divide Array Into Increasing Sequences", "question__title_slug": "divide-array-into-increasing-sequences", "question__hide": false, - "total_acs": 1395, - "total_submitted": 2354, + "total_acs": 1408, + "total_submitted": 2375, "total_column_articles": 24, "frontend_question_id": "1121", "is_new_question": false @@ -36972,9 +37056,9 @@ "question__title": "As Far from Land as Possible", "question__title_slug": "as-far-from-land-as-possible", "question__hide": false, - "total_acs": 49859, - "total_submitted": 106566, - "total_column_articles": 629, + "total_acs": 50042, + "total_submitted": 106989, + "total_column_articles": 631, "frontend_question_id": "1162", "is_new_question": false }, @@ -36993,8 +37077,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": 33911, - "total_submitted": 50854, + "total_acs": 33957, + "total_submitted": 50967, "total_column_articles": 474, "frontend_question_id": "1161", "is_new_question": false @@ -37014,9 +37098,9 @@ "question__title": "Valid Boomerang", "question__title_slug": "valid-boomerang", "question__hide": false, - "total_acs": 39096, - "total_submitted": 79838, - "total_column_articles": 407, + "total_acs": 39172, + "total_submitted": 80057, + "total_column_articles": 408, "frontend_question_id": "1037", "is_new_question": false }, @@ -37035,9 +37119,9 @@ "question__title": "Binary Search Tree to Greater Sum Tree", "question__title_slug": "binary-search-tree-to-greater-sum-tree", "question__hide": false, - "total_acs": 39351, - "total_submitted": 48684, - "total_column_articles": 480, + "total_acs": 39541, + "total_submitted": 48901, + "total_column_articles": 484, "frontend_question_id": "1038", "is_new_question": false }, @@ -37056,8 +37140,8 @@ "question__title": "Moving Stones Until Consecutive II", "question__title_slug": "moving-stones-until-consecutive-ii", "question__hide": false, - "total_acs": 3322, - "total_submitted": 6321, + "total_acs": 3329, + "total_submitted": 6328, "total_column_articles": 40, "frontend_question_id": "1040", "is_new_question": false @@ -37077,9 +37161,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": 70430, - "total_submitted": 103015, - "total_column_articles": 1020, + "total_acs": 70608, + "total_submitted": 103287, + "total_column_articles": 1023, "frontend_question_id": "1160", "is_new_question": false }, @@ -37098,8 +37182,8 @@ "question__title": "Minimum Score Triangulation of Polygon", "question__title_slug": "minimum-score-triangulation-of-polygon", "question__hide": false, - "total_acs": 6396, - "total_submitted": 11139, + "total_acs": 6424, + "total_submitted": 11187, "total_column_articles": 79, "frontend_question_id": "1039", "is_new_question": false @@ -37119,9 +37203,9 @@ "question__title": "Analyze User Website Visit Pattern", "question__title_slug": "analyze-user-website-visit-pattern", "question__hide": false, - "total_acs": 2529, - "total_submitted": 6235, - "total_column_articles": 52, + "total_acs": 2551, + "total_submitted": 6284, + "total_column_articles": 53, "frontend_question_id": "1152", "is_new_question": false }, @@ -37140,8 +37224,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": 8333, - "total_submitted": 16025, + "total_acs": 8384, + "total_submitted": 16101, "total_column_articles": 123, "frontend_question_id": "1151", "is_new_question": false @@ -37161,9 +37245,9 @@ "question__title": "Escape a Large Maze", "question__title_slug": "escape-a-large-maze", "question__hide": false, - "total_acs": 20167, - "total_submitted": 43036, - "total_column_articles": 215, + "total_acs": 20205, + "total_submitted": 43123, + "total_column_articles": 216, "frontend_question_id": "1036", "is_new_question": false }, @@ -37182,9 +37266,9 @@ "question__title": "Uncrossed Lines", "question__title_slug": "uncrossed-lines", "question__hide": false, - "total_acs": 64435, - "total_submitted": 94012, - "total_column_articles": 542, + "total_acs": 64814, + "total_submitted": 94504, + "total_column_articles": 543, "frontend_question_id": "1035", "is_new_question": false }, @@ -37203,9 +37287,9 @@ "question__title": "Coloring A Border", "question__title_slug": "coloring-a-border", "question__hide": false, - "total_acs": 32074, - "total_submitted": 58086, - "total_column_articles": 511, + "total_acs": 32211, + "total_submitted": 58357, + "total_column_articles": 514, "frontend_question_id": "1034", "is_new_question": false }, @@ -37224,9 +37308,9 @@ "question__title": "Moving Stones Until Consecutive", "question__title_slug": "moving-stones-until-consecutive", "question__hide": false, - "total_acs": 12852, - "total_submitted": 32069, - "total_column_articles": 193, + "total_acs": 12887, + "total_submitted": 32123, + "total_column_articles": 195, "frontend_question_id": "1033", "is_new_question": false }, @@ -37245,9 +37329,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": 6553, - "total_submitted": 11047, - "total_column_articles": 119, + "total_acs": 6579, + "total_submitted": 11096, + "total_column_articles": 120, "frontend_question_id": "1150", "is_new_question": false }, @@ -37266,8 +37350,8 @@ "question__title": "Parallel Courses", "question__title_slug": "parallel-courses", "question__hide": false, - "total_acs": 5410, - "total_submitted": 9009, + "total_acs": 5426, + "total_submitted": 9035, "total_column_articles": 94, "frontend_question_id": "1136", "is_new_question": false @@ -37287,8 +37371,8 @@ "question__title": "Connecting Cities With Minimum Cost", "question__title_slug": "connecting-cities-with-minimum-cost", "question__hide": false, - "total_acs": 11526, - "total_submitted": 20032, + "total_acs": 11571, + "total_submitted": 20116, "total_column_articles": 142, "frontend_question_id": "1135", "is_new_question": false @@ -37308,8 +37392,8 @@ "question__title": "Path With Maximum Minimum Value", "question__title_slug": "path-with-maximum-minimum-value", "question__hide": false, - "total_acs": 7812, - "total_submitted": 19757, + "total_acs": 7844, + "total_submitted": 19834, "total_column_articles": 102, "frontend_question_id": "1102", "is_new_question": false @@ -37329,9 +37413,9 @@ "question__title": "Largest Unique Number", "question__title_slug": "largest-unique-number", "question__hide": false, - "total_acs": 4061, - "total_submitted": 6248, - "total_column_articles": 87, + "total_acs": 4081, + "total_submitted": 6280, + "total_column_articles": 88, "frontend_question_id": "1133", "is_new_question": false }, @@ -37350,9 +37434,9 @@ "question__title": "Stream of Characters", "question__title_slug": "stream-of-characters", "question__hide": false, - "total_acs": 4702, - "total_submitted": 10136, - "total_column_articles": 81, + "total_acs": 4737, + "total_submitted": 10188, + "total_column_articles": 83, "frontend_question_id": "1032", "is_new_question": false }, @@ -37371,9 +37455,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": 8422, - "total_submitted": 14197, - "total_column_articles": 125, + "total_acs": 8468, + "total_submitted": 14323, + "total_column_articles": 127, "frontend_question_id": "1031", "is_new_question": false }, @@ -37392,8 +37476,8 @@ "question__title": "Two City Scheduling", "question__title_slug": "two-city-scheduling", "question__hide": false, - "total_acs": 22310, - "total_submitted": 32917, + "total_acs": 22419, + "total_submitted": 33055, "total_column_articles": 255, "frontend_question_id": "1029", "is_new_question": false @@ -37413,9 +37497,9 @@ "question__title": "Matrix Cells in Distance Order", "question__title_slug": "matrix-cells-in-distance-order", "question__hide": false, - "total_acs": 45611, - "total_submitted": 64475, - "total_column_articles": 501, + "total_acs": 45699, + "total_submitted": 64598, + "total_column_articles": 503, "frontend_question_id": "1030", "is_new_question": false }, @@ -37434,9 +37518,9 @@ "question__title": "Recover a Tree From Preorder Traversal", "question__title_slug": "recover-a-tree-from-preorder-traversal", "question__hide": false, - "total_acs": 24009, - "total_submitted": 32912, - "total_column_articles": 513, + "total_acs": 24059, + "total_submitted": 32974, + "total_column_articles": 517, "frontend_question_id": "1028", "is_new_question": false }, @@ -37455,9 +37539,9 @@ "question__title": "Maximum Difference Between Node and Ancestor", "question__title_slug": "maximum-difference-between-node-and-ancestor", "question__hide": false, - "total_acs": 13733, - "total_submitted": 19963, - "total_column_articles": 247, + "total_acs": 13798, + "total_submitted": 20055, + "total_column_articles": 248, "frontend_question_id": "1026", "is_new_question": false }, @@ -37476,8 +37560,8 @@ "question__title": "Maximum Average Subtree", "question__title_slug": "maximum-average-subtree", "question__hide": false, - "total_acs": 3633, - "total_submitted": 5787, + "total_acs": 3650, + "total_submitted": 5823, "total_column_articles": 70, "frontend_question_id": "1120", "is_new_question": false @@ -37497,9 +37581,9 @@ "question__title": "Armstrong Number", "question__title_slug": "armstrong-number", "question__hide": false, - "total_acs": 4095, - "total_submitted": 5308, - "total_column_articles": 71, + "total_acs": 4110, + "total_submitted": 5326, + "total_column_articles": 72, "frontend_question_id": "1134", "is_new_question": false }, @@ -37518,9 +37602,9 @@ "question__title": "Remove Vowels from a String", "question__title_slug": "remove-vowels-from-a-string", "question__hide": false, - "total_acs": 9867, - "total_submitted": 11346, - "total_column_articles": 177, + "total_acs": 9910, + "total_submitted": 11389, + "total_column_articles": 178, "frontend_question_id": "1119", "is_new_question": false }, @@ -37539,9 +37623,9 @@ "question__title": "Number of Days in a Month", "question__title_slug": "number-of-days-in-a-month", "question__hide": false, - "total_acs": 3407, - "total_submitted": 5284, - "total_column_articles": 63, + "total_acs": 3420, + "total_submitted": 5300, + "total_column_articles": 64, "frontend_question_id": "1118", "is_new_question": false }, @@ -37560,9 +37644,9 @@ "question__title": "Longest Arithmetic Subsequence", "question__title_slug": "longest-arithmetic-subsequence", "question__hide": false, - "total_acs": 20102, - "total_submitted": 45625, - "total_column_articles": 181, + "total_acs": 20186, + "total_submitted": 45793, + "total_column_articles": 182, "frontend_question_id": "1027", "is_new_question": false }, @@ -37581,9 +37665,9 @@ "question__title": "Divisor Game", "question__title_slug": "divisor-game", "question__hide": false, - "total_acs": 90926, - "total_submitted": 128579, - "total_column_articles": 756, + "total_acs": 91219, + "total_submitted": 128988, + "total_column_articles": 760, "frontend_question_id": "1025", "is_new_question": false }, @@ -37602,9 +37686,9 @@ "question__title": "The Earliest Moment When Everyone Become Friends", "question__title_slug": "the-earliest-moment-when-everyone-become-friends", "question__hide": false, - "total_acs": 3703, - "total_submitted": 5411, - "total_column_articles": 99, + "total_acs": 3722, + "total_submitted": 5440, + "total_column_articles": 100, "frontend_question_id": "1101", "is_new_question": false }, @@ -37623,8 +37707,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": 8069, - "total_submitted": 11542, + "total_acs": 8107, + "total_submitted": 11589, "total_column_articles": 159, "frontend_question_id": "1100", "is_new_question": false @@ -37644,9 +37728,9 @@ "question__title": "Two Sum Less Than K", "question__title_slug": "two-sum-less-than-k", "question__hide": false, - "total_acs": 7980, - "total_submitted": 13404, - "total_column_articles": 131, + "total_acs": 8034, + "total_submitted": 13481, + "total_column_articles": 132, "frontend_question_id": "1099", "is_new_question": false }, @@ -37665,8 +37749,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": 4524, - "total_submitted": 5817, + "total_acs": 4543, + "total_submitted": 5842, "total_column_articles": 103, "frontend_question_id": "1085", "is_new_question": false @@ -37686,9 +37770,9 @@ "question__title": "Video Stitching", "question__title_slug": "video-stitching", "question__hide": false, - "total_acs": 42189, - "total_submitted": 78639, - "total_column_articles": 491, + "total_acs": 42357, + "total_submitted": 78991, + "total_column_articles": 508, "frontend_question_id": "1024", "is_new_question": false }, @@ -37707,9 +37791,9 @@ "question__title": "Camelcase Matching", "question__title_slug": "camelcase-matching", "question__hide": false, - "total_acs": 9906, - "total_submitted": 17355, - "total_column_articles": 212, + "total_acs": 9957, + "total_submitted": 17434, + "total_column_articles": 213, "frontend_question_id": "1023", "is_new_question": false }, @@ -37728,8 +37812,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": 52868, - "total_submitted": 70414, + "total_acs": 52982, + "total_submitted": 70553, "total_column_articles": 630, "frontend_question_id": "1022", "is_new_question": false @@ -37749,9 +37833,9 @@ "question__title": "Remove Outermost Parentheses", "question__title_slug": "remove-outermost-parentheses", "question__hide": false, - "total_acs": 93156, - "total_submitted": 114400, - "total_column_articles": 1044, + "total_acs": 93338, + "total_submitted": 114627, + "total_column_articles": 1046, "frontend_question_id": "1021", "is_new_question": false }, @@ -37770,8 +37854,8 @@ "question__title": "Confusing Number II", "question__title_slug": "confusing-number-ii", "question__hide": false, - "total_acs": 1482, - "total_submitted": 3079, + "total_acs": 1488, + "total_submitted": 3087, "total_column_articles": 45, "frontend_question_id": "1088", "is_new_question": false @@ -37791,9 +37875,9 @@ "question__title": "Brace Expansion", "question__title_slug": "brace-expansion", "question__hide": false, - "total_acs": 2940, - "total_submitted": 5259, - "total_column_articles": 77, + "total_acs": 2951, + "total_submitted": 5279, + "total_column_articles": 78, "frontend_question_id": "1087", "is_new_question": false }, @@ -37812,8 +37896,8 @@ "question__title": "Index Pairs of a String", "question__title_slug": "index-pairs-of-a-string", "question__hide": false, - "total_acs": 3300, - "total_submitted": 5923, + "total_acs": 3310, + "total_submitted": 5938, "total_column_articles": 97, "frontend_question_id": "1065", "is_new_question": false @@ -37833,8 +37917,8 @@ "question__title": "High Five", "question__title_slug": "high-five", "question__hide": false, - "total_acs": 6327, - "total_submitted": 9358, + "total_acs": 6357, + "total_submitted": 9404, "total_column_articles": 110, "frontend_question_id": "1086", "is_new_question": false @@ -37854,9 +37938,9 @@ "question__title": "Number of Enclaves", "question__title_slug": "number-of-enclaves", "question__hide": false, - "total_acs": 51998, - "total_submitted": 83730, - "total_column_articles": 740, + "total_acs": 52277, + "total_submitted": 84155, + "total_column_articles": 744, "frontend_question_id": "1020", "is_new_question": false }, @@ -37875,9 +37959,9 @@ "question__title": "Next Greater Node In Linked List", "question__title_slug": "next-greater-node-in-linked-list", "question__hide": false, - "total_acs": 28418, - "total_submitted": 46730, - "total_column_articles": 406, + "total_acs": 28523, + "total_submitted": 46897, + "total_column_articles": 407, "frontend_question_id": "1019", "is_new_question": false }, @@ -37896,9 +37980,9 @@ "question__title": "Binary Prefix Divisible By 5", "question__title_slug": "binary-prefix-divisible-by-5", "question__hide": false, - "total_acs": 48859, - "total_submitted": 95886, - "total_column_articles": 440, + "total_acs": 48930, + "total_submitted": 96064, + "total_column_articles": 441, "frontend_question_id": "1018", "is_new_question": false }, @@ -37917,8 +38001,8 @@ "question__title": "Convert to Base -2", "question__title_slug": "convert-to-base-2", "question__hide": false, - "total_acs": 4751, - "total_submitted": 8376, + "total_acs": 4772, + "total_submitted": 8420, "total_column_articles": 75, "frontend_question_id": "1017", "is_new_question": false @@ -37938,9 +38022,9 @@ "question__title": "Confusing Number", "question__title_slug": "confusing-number", "question__hide": false, - "total_acs": 4601, - "total_submitted": 10659, - "total_column_articles": 95, + "total_acs": 4615, + "total_submitted": 10690, + "total_column_articles": 96, "frontend_question_id": "1056", "is_new_question": false }, @@ -37959,9 +38043,9 @@ "question__title": "Digit Count in Range", "question__title_slug": "digit-count-in-range", "question__hide": false, - "total_acs": 1511, - "total_submitted": 3207, - "total_column_articles": 42, + "total_acs": 1522, + "total_submitted": 3227, + "total_column_articles": 43, "frontend_question_id": "1067", "is_new_question": false }, @@ -37980,8 +38064,8 @@ "question__title": "Campus Bikes II", "question__title_slug": "campus-bikes-ii", "question__hide": false, - "total_acs": 2958, - "total_submitted": 5895, + "total_acs": 2966, + "total_submitted": 5911, "total_column_articles": 63, "frontend_question_id": "1066", "is_new_question": false @@ -38001,9 +38085,9 @@ "question__title": "Fixed Point", "question__title_slug": "fixed-point", "question__hide": false, - "total_acs": 6011, - "total_submitted": 9305, - "total_column_articles": 94, + "total_acs": 6025, + "total_submitted": 9328, + "total_column_articles": 95, "frontend_question_id": "1064", "is_new_question": false }, @@ -38022,8 +38106,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": 6992, - "total_submitted": 12029, + "total_acs": 7019, + "total_submitted": 12078, "total_column_articles": 111, "frontend_question_id": "1016", "is_new_question": false @@ -38043,8 +38127,8 @@ "question__title": "Smallest Integer Divisible by K", "question__title_slug": "smallest-integer-divisible-by-k", "question__hide": false, - "total_acs": 6475, - "total_submitted": 17681, + "total_acs": 6508, + "total_submitted": 17740, "total_column_articles": 56, "frontend_question_id": "1015", "is_new_question": false @@ -38064,9 +38148,9 @@ "question__title": "Best Sightseeing Pair", "question__title_slug": "best-sightseeing-pair", "question__hide": false, - "total_acs": 57663, - "total_submitted": 101369, - "total_column_articles": 670, + "total_acs": 57837, + "total_submitted": 101639, + "total_column_articles": 671, "frontend_question_id": "1014", "is_new_question": false }, @@ -38085,9 +38169,9 @@ "question__title": "Partition Array Into Three Parts With Equal Sum", "question__title_slug": "partition-array-into-three-parts-with-equal-sum", "question__hide": false, - "total_acs": 56390, - "total_submitted": 145232, - "total_column_articles": 1018, + "total_acs": 56542, + "total_submitted": 145634, + "total_column_articles": 1020, "frontend_question_id": "1013", "is_new_question": false }, @@ -38106,8 +38190,8 @@ "question__title": "Number of Valid Subarrays", "question__title_slug": "number-of-valid-subarrays", "question__hide": false, - "total_acs": 2758, - "total_submitted": 3761, + "total_acs": 2785, + "total_submitted": 3790, "total_column_articles": 58, "frontend_question_id": "1063", "is_new_question": false @@ -38127,8 +38211,8 @@ "question__title": "Longest Repeating Substring", "question__title_slug": "longest-repeating-substring", "question__hide": false, - "total_acs": 5684, - "total_submitted": 10095, + "total_acs": 5721, + "total_submitted": 10146, "total_column_articles": 81, "frontend_question_id": "1062", "is_new_question": false @@ -38148,8 +38232,8 @@ "question__title": "Missing Element in Sorted Array", "question__title_slug": "missing-element-in-sorted-array", "question__hide": false, - "total_acs": 10095, - "total_submitted": 18702, + "total_acs": 10148, + "total_submitted": 18798, "total_column_articles": 141, "frontend_question_id": "1060", "is_new_question": false @@ -38169,9 +38253,9 @@ "question__title": "Lexicographically Smallest Equivalent String", "question__title_slug": "lexicographically-smallest-equivalent-string", "question__hide": false, - "total_acs": 3898, - "total_submitted": 6207, - "total_column_articles": 91, + "total_acs": 3929, + "total_submitted": 6240, + "total_column_articles": 92, "frontend_question_id": "1061", "is_new_question": false }, @@ -38190,9 +38274,9 @@ "question__title": "Numbers With Repeated Digits", "question__title_slug": "numbers-with-repeated-digits", "question__hide": false, - "total_acs": 5807, - "total_submitted": 13864, - "total_column_articles": 98, + "total_acs": 5839, + "total_submitted": 13911, + "total_column_articles": 99, "frontend_question_id": "1012", "is_new_question": false }, @@ -38211,9 +38295,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": 86417, - "total_submitted": 139258, - "total_column_articles": 805, + "total_acs": 86771, + "total_submitted": 139846, + "total_column_articles": 812, "frontend_question_id": "1011", "is_new_question": false }, @@ -38232,9 +38316,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": 22350, - "total_submitted": 48390, - "total_column_articles": 285, + "total_acs": 22419, + "total_submitted": 48555, + "total_column_articles": 287, "frontend_question_id": "1010", "is_new_question": false }, @@ -38253,9 +38337,9 @@ "question__title": "Complement of Base 10 Integer", "question__title_slug": "complement-of-base-10-integer", "question__hide": false, - "total_acs": 21652, - "total_submitted": 36899, - "total_column_articles": 312, + "total_acs": 21777, + "total_submitted": 37116, + "total_column_articles": 315, "frontend_question_id": "1009", "is_new_question": false }, @@ -38274,8 +38358,8 @@ "question__title": "Minimize Rounding Error to Meet Target", "question__title_slug": "minimize-rounding-error-to-meet-target", "question__hide": false, - "total_acs": 1781, - "total_submitted": 4875, + "total_acs": 1796, + "total_submitted": 4895, "total_column_articles": 47, "frontend_question_id": "1058", "is_new_question": false @@ -38295,8 +38379,8 @@ "question__title": "Campus Bikes", "question__title_slug": "campus-bikes", "question__hide": false, - "total_acs": 4052, - "total_submitted": 8064, + "total_acs": 4071, + "total_submitted": 8119, "total_column_articles": 54, "frontend_question_id": "1057", "is_new_question": false @@ -38316,8 +38400,8 @@ "question__title": "Shortest Way to Form String", "question__title_slug": "shortest-way-to-form-string", "question__hide": false, - "total_acs": 8038, - "total_submitted": 13236, + "total_acs": 8066, + "total_submitted": 13276, "total_column_articles": 131, "frontend_question_id": "1055", "is_new_question": false @@ -38337,9 +38421,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": 26207, - "total_submitted": 36386, - "total_column_articles": 359, + "total_acs": 26352, + "total_submitted": 36581, + "total_column_articles": 361, "frontend_question_id": "1008", "is_new_question": false }, @@ -38358,9 +38442,9 @@ "question__title": "Minimum Domino Rotations For Equal Row", "question__title_slug": "minimum-domino-rotations-for-equal-row", "question__hide": false, - "total_acs": 8187, - "total_submitted": 17275, - "total_column_articles": 113, + "total_acs": 8235, + "total_submitted": 17358, + "total_column_articles": 114, "frontend_question_id": "1007", "is_new_question": false }, @@ -38379,8 +38463,8 @@ "question__title": "Clumsy Factorial", "question__title_slug": "clumsy-factorial", "question__hide": false, - "total_acs": 46923, - "total_submitted": 74786, + "total_acs": 46961, + "total_submitted": 74841, "total_column_articles": 654, "frontend_question_id": "1006", "is_new_question": false @@ -38400,9 +38484,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": 104346, - "total_submitted": 203196, - "total_column_articles": 1313, + "total_acs": 105030, + "total_submitted": 204593, + "total_column_articles": 1318, "frontend_question_id": "1005", "is_new_question": false }, @@ -38421,8 +38505,8 @@ "question__title": "Max Consecutive Ones III", "question__title_slug": "max-consecutive-ones-iii", "question__hide": false, - "total_acs": 107407, - "total_submitted": 179409, + "total_acs": 107959, + "total_submitted": 180312, "total_column_articles": 976, "frontend_question_id": "1004", "is_new_question": false @@ -38442,9 +38526,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": 15135, - "total_submitted": 26022, - "total_column_articles": 242, + "total_acs": 15171, + "total_submitted": 26091, + "total_column_articles": 243, "frontend_question_id": "1003", "is_new_question": false }, @@ -38463,9 +38547,9 @@ "question__title": "Find Common Characters", "question__title_slug": "find-common-characters", "question__hide": false, - "total_acs": 75129, - "total_submitted": 105194, - "total_column_articles": 770, + "total_acs": 75459, + "total_submitted": 105659, + "total_column_articles": 773, "frontend_question_id": "1002", "is_new_question": false }, @@ -38484,8 +38568,8 @@ "question__title": "Grid Illumination", "question__title_slug": "grid-illumination", "question__hide": false, - "total_acs": 18867, - "total_submitted": 41902, + "total_acs": 18884, + "total_submitted": 41951, "total_column_articles": 277, "frontend_question_id": "1001", "is_new_question": false @@ -38505,8 +38589,8 @@ "question__title": "Minimum Cost to Merge Stones", "question__title_slug": "minimum-cost-to-merge-stones", "question__hide": false, - "total_acs": 5784, - "total_submitted": 13061, + "total_acs": 5832, + "total_submitted": 13164, "total_column_articles": 63, "frontend_question_id": "1000", "is_new_question": false @@ -38526,9 +38610,9 @@ "question__title": "Available Captures for Rook", "question__title_slug": "available-captures-for-rook", "question__hide": false, - "total_acs": 33646, - "total_submitted": 48623, - "total_column_articles": 623, + "total_acs": 33700, + "total_submitted": 48697, + "total_column_articles": 625, "frontend_question_id": "999", "is_new_question": false }, @@ -38547,8 +38631,8 @@ "question__title": "Maximum Binary Tree II", "question__title_slug": "maximum-binary-tree-ii", "question__hide": false, - "total_acs": 31598, - "total_submitted": 46026, + "total_acs": 31651, + "total_submitted": 46107, "total_column_articles": 433, "frontend_question_id": "998", "is_new_question": false @@ -38568,8 +38652,8 @@ "question__title": "Find the Town Judge", "question__title_slug": "find-the-town-judge", "question__hide": false, - "total_acs": 80199, - "total_submitted": 153109, + "total_acs": 80456, + "total_submitted": 153684, "total_column_articles": 816, "frontend_question_id": "997", "is_new_question": false @@ -38589,9 +38673,9 @@ "question__title": "Number of Squareful Arrays", "question__title_slug": "number-of-squareful-arrays", "question__hide": false, - "total_acs": 6099, - "total_submitted": 12250, - "total_column_articles": 119, + "total_acs": 6119, + "total_submitted": 12309, + "total_column_articles": 120, "frontend_question_id": "996", "is_new_question": false }, @@ -38610,8 +38694,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": 24726, - "total_submitted": 46034, + "total_acs": 24773, + "total_submitted": 46120, "total_column_articles": 276, "frontend_question_id": "995", "is_new_question": false @@ -38631,9 +38715,9 @@ "question__title": "Rotting Oranges", "question__title_slug": "rotting-oranges", "question__hide": false, - "total_acs": 98307, - "total_submitted": 192630, - "total_column_articles": 1949, + "total_acs": 98742, + "total_submitted": 193477, + "total_column_articles": 1950, "frontend_question_id": "994", "is_new_question": false }, @@ -38652,9 +38736,9 @@ "question__title": "Cousins in Binary Tree", "question__title_slug": "cousins-in-binary-tree", "question__hide": false, - "total_acs": 60971, - "total_submitted": 109598, - "total_column_articles": 963, + "total_acs": 61086, + "total_submitted": 109818, + "total_column_articles": 964, "frontend_question_id": "993", "is_new_question": false }, @@ -38673,9 +38757,9 @@ "question__title": "Subarrays with K Different Integers", "question__title_slug": "subarrays-with-k-different-integers", "question__hide": false, - "total_acs": 29020, - "total_submitted": 61903, - "total_column_articles": 319, + "total_acs": 29088, + "total_submitted": 62068, + "total_column_articles": 321, "frontend_question_id": "992", "is_new_question": false }, @@ -38694,9 +38778,9 @@ "question__title": "Broken Calculator", "question__title_slug": "broken-calculator", "question__hide": false, - "total_acs": 11329, - "total_submitted": 21679, - "total_column_articles": 138, + "total_acs": 11379, + "total_submitted": 21770, + "total_column_articles": 139, "frontend_question_id": "991", "is_new_question": false }, @@ -38715,9 +38799,9 @@ "question__title": "Satisfiability of Equality Equations", "question__title_slug": "satisfiability-of-equality-equations", "question__hide": false, - "total_acs": 47886, - "total_submitted": 90454, - "total_column_articles": 802, + "total_acs": 48064, + "total_submitted": 90738, + "total_column_articles": 807, "frontend_question_id": "990", "is_new_question": false }, @@ -38736,9 +38820,9 @@ "question__title": "Add to Array-Form of Integer", "question__title_slug": "add-to-array-form-of-integer", "question__hide": false, - "total_acs": 66311, - "total_submitted": 142232, - "total_column_articles": 745, + "total_acs": 66585, + "total_submitted": 142863, + "total_column_articles": 747, "frontend_question_id": "989", "is_new_question": false }, @@ -38757,9 +38841,9 @@ "question__title": "Smallest String Starting From Leaf", "question__title_slug": "smallest-string-starting-from-leaf", "question__hide": false, - "total_acs": 14096, - "total_submitted": 27635, - "total_column_articles": 176, + "total_acs": 14175, + "total_submitted": 27770, + "total_column_articles": 177, "frontend_question_id": "988", "is_new_question": false }, @@ -38778,8 +38862,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": 29982, - "total_submitted": 56027, + "total_acs": 30043, + "total_submitted": 56128, "total_column_articles": 493, "frontend_question_id": "987", "is_new_question": false @@ -38799,9 +38883,9 @@ "question__title": "Interval List Intersections", "question__title_slug": "interval-list-intersections", "question__hide": false, - "total_acs": 54877, - "total_submitted": 80140, - "total_column_articles": 528, + "total_acs": 55148, + "total_submitted": 80540, + "total_column_articles": 531, "frontend_question_id": "986", "is_new_question": false }, @@ -38820,8 +38904,8 @@ "question__title": "Sum of Even Numbers After Queries", "question__title_slug": "sum-of-even-numbers-after-queries", "question__hide": false, - "total_acs": 18532, - "total_submitted": 30484, + "total_acs": 18570, + "total_submitted": 30548, "total_column_articles": 217, "frontend_question_id": "985", "is_new_question": false @@ -38841,8 +38925,8 @@ "question__title": "String Without AAA or BBB", "question__title_slug": "string-without-aaa-or-bbb", "question__hide": false, - "total_acs": 11909, - "total_submitted": 27806, + "total_acs": 11952, + "total_submitted": 27904, "total_column_articles": 196, "frontend_question_id": "984", "is_new_question": false @@ -38862,9 +38946,9 @@ "question__title": "Minimum Cost For Tickets", "question__title_slug": "minimum-cost-for-tickets", "question__hide": false, - "total_acs": 39356, - "total_submitted": 62050, - "total_column_articles": 516, + "total_acs": 39448, + "total_submitted": 62197, + "total_column_articles": 517, "frontend_question_id": "983", "is_new_question": false }, @@ -38883,8 +38967,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": 3578, - "total_submitted": 6248, + "total_acs": 3588, + "total_submitted": 6263, "total_column_articles": 46, "frontend_question_id": "982", "is_new_question": false @@ -38904,9 +38988,9 @@ "question__title": "Time Based Key-Value Store", "question__title_slug": "time-based-key-value-store", "question__hide": false, - "total_acs": 27624, - "total_submitted": 51727, - "total_column_articles": 372, + "total_acs": 27917, + "total_submitted": 52463, + "total_column_articles": 373, "frontend_question_id": "981", "is_new_question": false }, @@ -38925,9 +39009,9 @@ "question__title": "Unique Paths III", "question__title_slug": "unique-paths-iii", "question__hide": false, - "total_acs": 19100, - "total_submitted": 25859, - "total_column_articles": 282, + "total_acs": 19192, + "total_submitted": 25997, + "total_column_articles": 286, "frontend_question_id": "980", "is_new_question": false }, @@ -38946,8 +39030,8 @@ "question__title": "Distribute Coins in Binary Tree", "question__title_slug": "distribute-coins-in-binary-tree", "question__hide": false, - "total_acs": 11929, - "total_submitted": 16512, + "total_acs": 12018, + "total_submitted": 16643, "total_column_articles": 182, "frontend_question_id": "979", "is_new_question": false @@ -38967,8 +39051,8 @@ "question__title": "Longest Turbulent Subarray", "question__title_slug": "longest-turbulent-subarray", "question__hide": false, - "total_acs": 49384, - "total_submitted": 104047, + "total_acs": 49474, + "total_submitted": 104233, "total_column_articles": 671, "frontend_question_id": "978", "is_new_question": false @@ -38988,9 +39072,9 @@ "question__title": "Squares of a Sorted Array", "question__title_slug": "squares-of-a-sorted-array", "question__hide": false, - "total_acs": 426502, - "total_submitted": 620596, - "total_column_articles": 2775, + "total_acs": 429580, + "total_submitted": 625129, + "total_column_articles": 2791, "frontend_question_id": "977", "is_new_question": false }, @@ -39009,9 +39093,9 @@ "question__title": "Largest Perimeter Triangle", "question__title_slug": "largest-perimeter-triangle", "question__hide": false, - "total_acs": 75771, - "total_submitted": 130885, - "total_column_articles": 753, + "total_acs": 76162, + "total_submitted": 131659, + "total_column_articles": 757, "frontend_question_id": "976", "is_new_question": false }, @@ -39030,9 +39114,9 @@ "question__title": "Odd Even Jump", "question__title_slug": "odd-even-jump", "question__hide": false, - "total_acs": 4626, - "total_submitted": 9930, - "total_column_articles": 76, + "total_acs": 4671, + "total_submitted": 10001, + "total_column_articles": 78, "frontend_question_id": "975", "is_new_question": false }, @@ -39051,9 +39135,9 @@ "question__title": "Subarray Sums Divisible by K", "question__title_slug": "subarray-sums-divisible-by-k", "question__hide": false, - "total_acs": 52704, - "total_submitted": 110608, - "total_column_articles": 500, + "total_acs": 52920, + "total_submitted": 111063, + "total_column_articles": 501, "frontend_question_id": "974", "is_new_question": false }, @@ -39072,9 +39156,9 @@ "question__title": "K Closest Points to Origin", "question__title_slug": "k-closest-points-to-origin", "question__hide": false, - "total_acs": 88801, - "total_submitted": 136489, - "total_column_articles": 783, + "total_acs": 89084, + "total_submitted": 136925, + "total_column_articles": 784, "frontend_question_id": "973", "is_new_question": false }, @@ -39093,9 +39177,9 @@ "question__title": "Fibonacci Number", "question__title_slug": "fibonacci-number", "question__hide": false, - "total_acs": 471081, - "total_submitted": 708283, - "total_column_articles": 2770, + "total_acs": 474050, + "total_submitted": 712831, + "total_column_articles": 2783, "frontend_question_id": "509", "is_new_question": false }, @@ -39114,9 +39198,9 @@ "question__title": "Equal Rational Numbers", "question__title_slug": "equal-rational-numbers", "question__hide": false, - "total_acs": 1842, - "total_submitted": 4545, - "total_column_articles": 45, + "total_acs": 1854, + "total_submitted": 4565, + "total_column_articles": 46, "frontend_question_id": "972", "is_new_question": false }, @@ -39135,8 +39219,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": 9507, - "total_submitted": 21094, + "total_acs": 9561, + "total_submitted": 21210, "total_column_articles": 149, "frontend_question_id": "971", "is_new_question": false @@ -39156,8 +39240,8 @@ "question__title": "Powerful Integers", "question__title_slug": "powerful-integers", "question__hide": false, - "total_acs": 13170, - "total_submitted": 31897, + "total_acs": 13250, + "total_submitted": 32277, "total_column_articles": 153, "frontend_question_id": "970", "is_new_question": false @@ -39177,9 +39261,9 @@ "question__title": "Pancake Sorting", "question__title_slug": "pancake-sorting", "question__hide": false, - "total_acs": 44713, - "total_submitted": 66095, - "total_column_articles": 659, + "total_acs": 44865, + "total_submitted": 66338, + "total_column_articles": 658, "frontend_question_id": "969", "is_new_question": false }, @@ -39198,8 +39282,8 @@ "question__title": "Binary Tree Cameras", "question__title_slug": "binary-tree-cameras", "question__hide": false, - "total_acs": 48091, - "total_submitted": 92410, + "total_acs": 48432, + "total_submitted": 93071, "total_column_articles": 526, "frontend_question_id": "968", "is_new_question": false @@ -39219,9 +39303,9 @@ "question__title": "Numbers With Same Consecutive Differences", "question__title_slug": "numbers-with-same-consecutive-differences", "question__hide": false, - "total_acs": 11001, - "total_submitted": 22095, - "total_column_articles": 218, + "total_acs": 11062, + "total_submitted": 22228, + "total_column_articles": 219, "frontend_question_id": "967", "is_new_question": false }, @@ -39240,8 +39324,8 @@ "question__title": "Vowel Spellchecker", "question__title_slug": "vowel-spellchecker", "question__hide": false, - "total_acs": 4095, - "total_submitted": 9678, + "total_acs": 4117, + "total_submitted": 9708, "total_column_articles": 66, "frontend_question_id": "966", "is_new_question": false @@ -39261,8 +39345,8 @@ "question__title": "Univalued Binary Tree", "question__title_slug": "univalued-binary-tree", "question__hide": false, - "total_acs": 74468, - "total_submitted": 104015, + "total_acs": 74675, + "total_submitted": 104303, "total_column_articles": 833, "frontend_question_id": "965", "is_new_question": false @@ -39282,8 +39366,8 @@ "question__title": "Least Operators to Express Number", "question__title_slug": "least-operators-to-express-number", "question__hide": false, - "total_acs": 1957, - "total_submitted": 4333, + "total_acs": 1960, + "total_submitted": 4337, "total_column_articles": 37, "frontend_question_id": "964", "is_new_question": false @@ -39303,9 +39387,9 @@ "question__title": "Minimum Area Rectangle II", "question__title_slug": "minimum-area-rectangle-ii", "question__hide": false, - "total_acs": 3357, - "total_submitted": 6575, - "total_column_articles": 48, + "total_acs": 3388, + "total_submitted": 6631, + "total_column_articles": 49, "frontend_question_id": "963", "is_new_question": false }, @@ -39324,9 +39408,9 @@ "question__title": "Maximum Width Ramp", "question__title_slug": "maximum-width-ramp", "question__hide": false, - "total_acs": 20830, - "total_submitted": 44977, - "total_column_articles": 191, + "total_acs": 21007, + "total_submitted": 45349, + "total_column_articles": 192, "frontend_question_id": "962", "is_new_question": false }, @@ -39345,9 +39429,9 @@ "question__title": "N-Repeated Element in Size 2N Array", "question__title_slug": "n-repeated-element-in-size-2n-array", "question__hide": false, - "total_acs": 76094, - "total_submitted": 108249, - "total_column_articles": 698, + "total_acs": 76281, + "total_submitted": 108523, + "total_column_articles": 700, "frontend_question_id": "961", "is_new_question": false }, @@ -39366,8 +39450,8 @@ "question__title": "Delete Columns to Make Sorted III", "question__title_slug": "delete-columns-to-make-sorted-iii", "question__hide": false, - "total_acs": 3090, - "total_submitted": 5289, + "total_acs": 3115, + "total_submitted": 5318, "total_column_articles": 54, "frontend_question_id": "960", "is_new_question": false @@ -39387,8 +39471,8 @@ "question__title": "Regions Cut By Slashes", "question__title_slug": "regions-cut-by-slashes", "question__hide": false, - "total_acs": 22136, - "total_submitted": 29799, + "total_acs": 22175, + "total_submitted": 29839, "total_column_articles": 342, "frontend_question_id": "959", "is_new_question": false @@ -39408,9 +39492,9 @@ "question__title": "Check Completeness of a Binary Tree", "question__title_slug": "check-completeness-of-a-binary-tree", "question__hide": false, - "total_acs": 43959, - "total_submitted": 80560, - "total_column_articles": 424, + "total_acs": 44200, + "total_submitted": 81028, + "total_column_articles": 426, "frontend_question_id": "958", "is_new_question": false }, @@ -39429,8 +39513,8 @@ "question__title": "Prison Cells After N Days", "question__title_slug": "prison-cells-after-n-days", "question__hide": false, - "total_acs": 18232, - "total_submitted": 49683, + "total_acs": 18287, + "total_submitted": 49818, "total_column_articles": 179, "frontend_question_id": "957", "is_new_question": false @@ -39450,8 +39534,8 @@ "question__title": "Tallest Billboard", "question__title_slug": "tallest-billboard", "question__hide": false, - "total_acs": 5656, - "total_submitted": 12489, + "total_acs": 5678, + "total_submitted": 12526, "total_column_articles": 69, "frontend_question_id": "956", "is_new_question": false @@ -39471,9 +39555,9 @@ "question__title": "Delete Columns to Make Sorted II", "question__title_slug": "delete-columns-to-make-sorted-ii", "question__hide": false, - "total_acs": 4821, - "total_submitted": 13839, - "total_column_articles": 86, + "total_acs": 4848, + "total_submitted": 13905, + "total_column_articles": 87, "frontend_question_id": "955", "is_new_question": false }, @@ -39492,8 +39576,8 @@ "question__title": "Array of Doubled Pairs", "question__title_slug": "array-of-doubled-pairs", "question__hide": false, - "total_acs": 41659, - "total_submitted": 106857, + "total_acs": 41695, + "total_submitted": 106931, "total_column_articles": 475, "frontend_question_id": "954", "is_new_question": false @@ -39513,9 +39597,9 @@ "question__title": "Verifying an Alien Dictionary", "question__title_slug": "verifying-an-alien-dictionary", "question__hide": false, - "total_acs": 50968, - "total_submitted": 88242, - "total_column_articles": 660, + "total_acs": 51133, + "total_submitted": 88538, + "total_column_articles": 662, "frontend_question_id": "953", "is_new_question": false }, @@ -39534,9 +39618,9 @@ "question__title": "Largest Component Size by Common Factor", "question__title_slug": "largest-component-size-by-common-factor", "question__hide": false, - "total_acs": 18073, - "total_submitted": 35495, - "total_column_articles": 177, + "total_acs": 18128, + "total_submitted": 35610, + "total_column_articles": 178, "frontend_question_id": "952", "is_new_question": false }, @@ -39555,9 +39639,9 @@ "question__title": "Flip Equivalent Binary Trees", "question__title_slug": "flip-equivalent-binary-trees", "question__hide": false, - "total_acs": 15720, - "total_submitted": 23615, - "total_column_articles": 230, + "total_acs": 15783, + "total_submitted": 23700, + "total_column_articles": 232, "frontend_question_id": "951", "is_new_question": false }, @@ -39576,9 +39660,9 @@ "question__title": "Reveal Cards In Increasing Order", "question__title_slug": "reveal-cards-in-increasing-order", "question__hide": false, - "total_acs": 13042, - "total_submitted": 16594, - "total_column_articles": 214, + "total_acs": 13117, + "total_submitted": 16714, + "total_column_articles": 216, "frontend_question_id": "950", "is_new_question": false }, @@ -39597,8 +39681,8 @@ "question__title": "Largest Time for Given Digits", "question__title_slug": "largest-time-for-given-digits", "question__hide": false, - "total_acs": 10694, - "total_submitted": 28351, + "total_acs": 10736, + "total_submitted": 28438, "total_column_articles": 174, "frontend_question_id": "949", "is_new_question": false @@ -39618,8 +39702,8 @@ "question__title": "Bag of Tokens", "question__title_slug": "bag-of-tokens", "question__hide": false, - "total_acs": 9022, - "total_submitted": 22515, + "total_acs": 9070, + "total_submitted": 22605, "total_column_articles": 137, "frontend_question_id": "948", "is_new_question": false @@ -39639,9 +39723,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": 31697, - "total_submitted": 51623, - "total_column_articles": 412, + "total_acs": 31810, + "total_submitted": 51799, + "total_column_articles": 413, "frontend_question_id": "947", "is_new_question": false }, @@ -39660,9 +39744,9 @@ "question__title": "Validate Stack Sequences", "question__title_slug": "validate-stack-sequences", "question__hide": false, - "total_acs": 72721, - "total_submitted": 108959, - "total_column_articles": 805, + "total_acs": 72936, + "total_submitted": 109337, + "total_column_articles": 808, "frontend_question_id": "946", "is_new_question": false }, @@ -39681,9 +39765,9 @@ "question__title": "Minimum Increment to Make Array Unique", "question__title_slug": "minimum-increment-to-make-array-unique", "question__hide": false, - "total_acs": 40768, - "total_submitted": 84754, - "total_column_articles": 601, + "total_acs": 40902, + "total_submitted": 85102, + "total_column_articles": 604, "frontend_question_id": "945", "is_new_question": false }, @@ -39702,9 +39786,9 @@ "question__title": "Delete Columns to Make Sorted", "question__title_slug": "delete-columns-to-make-sorted", "question__hide": false, - "total_acs": 54670, - "total_submitted": 79102, - "total_column_articles": 490, + "total_acs": 54749, + "total_submitted": 79215, + "total_column_articles": 491, "frontend_question_id": "944", "is_new_question": false }, @@ -39723,9 +39807,9 @@ "question__title": "Find the Shortest Superstring", "question__title_slug": "find-the-shortest-superstring", "question__hide": false, - "total_acs": 2925, - "total_submitted": 6233, - "total_column_articles": 65, + "total_acs": 2941, + "total_submitted": 6274, + "total_column_articles": 67, "frontend_question_id": "943", "is_new_question": false }, @@ -39744,9 +39828,9 @@ "question__title": "DI String Match", "question__title_slug": "di-string-match", "question__hide": false, - "total_acs": 62566, - "total_submitted": 80874, - "total_column_articles": 750, + "total_acs": 62696, + "total_submitted": 81049, + "total_column_articles": 752, "frontend_question_id": "942", "is_new_question": false }, @@ -39765,9 +39849,9 @@ "question__title": "Valid Mountain Array", "question__title_slug": "valid-mountain-array", "question__hide": false, - "total_acs": 75852, - "total_submitted": 192209, - "total_column_articles": 752, + "total_acs": 76122, + "total_submitted": 192942, + "total_column_articles": 756, "frontend_question_id": "941", "is_new_question": false }, @@ -39786,8 +39870,8 @@ "question__title": "Distinct Subsequences II", "question__title_slug": "distinct-subsequences-ii", "question__hide": false, - "total_acs": 28963, - "total_submitted": 53666, + "total_acs": 29045, + "total_submitted": 53849, "total_column_articles": 270, "frontend_question_id": "940", "is_new_question": false @@ -39807,9 +39891,9 @@ "question__title": "Minimum Area Rectangle", "question__title_slug": "minimum-area-rectangle", "question__hide": false, - "total_acs": 7930, - "total_submitted": 16668, - "total_column_articles": 89, + "total_acs": 7962, + "total_submitted": 16740, + "total_column_articles": 92, "frontend_question_id": "939", "is_new_question": false }, @@ -39828,9 +39912,9 @@ "question__title": "Range Sum of BST", "question__title_slug": "range-sum-of-bst", "question__hide": false, - "total_acs": 115238, - "total_submitted": 140419, - "total_column_articles": 955, + "total_acs": 115497, + "total_submitted": 140738, + "total_column_articles": 956, "frontend_question_id": "938", "is_new_question": false }, @@ -39849,8 +39933,8 @@ "question__title": "Reorder Data in Log Files", "question__title_slug": "reorder-data-in-log-files", "question__hide": false, - "total_acs": 40551, - "total_submitted": 63666, + "total_acs": 40594, + "total_submitted": 63757, "total_column_articles": 482, "frontend_question_id": "937", "is_new_question": false @@ -39870,8 +39954,8 @@ "question__title": "Stamping The Sequence", "question__title_slug": "stamping-the-sequence", "question__hide": false, - "total_acs": 2369, - "total_submitted": 5754, + "total_acs": 2379, + "total_submitted": 5777, "total_column_articles": 39, "frontend_question_id": "936", "is_new_question": false @@ -39891,9 +39975,9 @@ "question__title": "Knight Dialer", "question__title_slug": "knight-dialer", "question__hide": false, - "total_acs": 8707, - "total_submitted": 17395, - "total_column_articles": 126, + "total_acs": 8744, + "total_submitted": 17453, + "total_column_articles": 127, "frontend_question_id": "935", "is_new_question": false }, @@ -39912,9 +39996,9 @@ "question__title": "Shortest Bridge", "question__title_slug": "shortest-bridge", "question__hide": false, - "total_acs": 60738, - "total_submitted": 115422, - "total_column_articles": 678, + "total_acs": 61108, + "total_submitted": 116172, + "total_column_articles": 681, "frontend_question_id": "934", "is_new_question": false }, @@ -39933,9 +40017,9 @@ "question__title": "Number of Recent Calls", "question__title_slug": "number-of-recent-calls", "question__hide": false, - "total_acs": 89959, - "total_submitted": 116808, - "total_column_articles": 779, + "total_acs": 90194, + "total_submitted": 117151, + "total_column_articles": 780, "frontend_question_id": "933", "is_new_question": false }, @@ -39954,8 +40038,8 @@ "question__title": "Beautiful Array", "question__title_slug": "beautiful-array", "question__hide": false, - "total_acs": 12252, - "total_submitted": 18831, + "total_acs": 12327, + "total_submitted": 18929, "total_column_articles": 124, "frontend_question_id": "932", "is_new_question": false @@ -39975,9 +40059,9 @@ "question__title": "Minimum Falling Path Sum", "question__title_slug": "minimum-falling-path-sum", "question__hide": false, - "total_acs": 48570, - "total_submitted": 72262, - "total_column_articles": 822, + "total_acs": 48951, + "total_submitted": 72845, + "total_column_articles": 841, "frontend_question_id": "931", "is_new_question": false }, @@ -39996,9 +40080,9 @@ "question__title": "Binary Subarrays With Sum", "question__title_slug": "binary-subarrays-with-sum", "question__hide": false, - "total_acs": 41544, - "total_submitted": 75743, - "total_column_articles": 408, + "total_acs": 41713, + "total_submitted": 76077, + "total_column_articles": 409, "frontend_question_id": "930", "is_new_question": false }, @@ -40017,9 +40101,9 @@ "question__title": "Unique Email Addresses", "question__title_slug": "unique-email-addresses", "question__hide": false, - "total_acs": 53256, - "total_submitted": 77387, - "total_column_articles": 511, + "total_acs": 53349, + "total_submitted": 77532, + "total_column_articles": 516, "frontend_question_id": "929", "is_new_question": false }, @@ -40038,8 +40122,8 @@ "question__title": "Minimize Malware Spread II", "question__title_slug": "minimize-malware-spread-ii", "question__hide": false, - "total_acs": 3381, - "total_submitted": 7779, + "total_acs": 3404, + "total_submitted": 7838, "total_column_articles": 68, "frontend_question_id": "928", "is_new_question": false @@ -40059,8 +40143,8 @@ "question__title": "Three Equal Parts", "question__title_slug": "three-equal-parts", "question__hide": false, - "total_acs": 23132, - "total_submitted": 52622, + "total_acs": 23179, + "total_submitted": 52731, "total_column_articles": 357, "frontend_question_id": "927", "is_new_question": false @@ -40080,9 +40164,9 @@ "question__title": "Flip String to Monotone Increasing", "question__title_slug": "flip-string-to-monotone-increasing", "question__hide": false, - "total_acs": 34042, - "total_submitted": 53527, - "total_column_articles": 485, + "total_acs": 34127, + "total_submitted": 53649, + "total_column_articles": 486, "frontend_question_id": "926", "is_new_question": false }, @@ -40101,9 +40185,9 @@ "question__title": "Long Pressed Name", "question__title_slug": "long-pressed-name", "question__hide": false, - "total_acs": 60261, - "total_submitted": 158734, - "total_column_articles": 788, + "total_acs": 60459, + "total_submitted": 159297, + "total_column_articles": 789, "frontend_question_id": "925", "is_new_question": false }, @@ -40122,8 +40206,8 @@ "question__title": "Minimize Malware Spread", "question__title_slug": "minimize-malware-spread", "question__hide": false, - "total_acs": 9073, - "total_submitted": 25396, + "total_acs": 9137, + "total_submitted": 25566, "total_column_articles": 133, "frontend_question_id": "924", "is_new_question": false @@ -40143,8 +40227,8 @@ "question__title": "3Sum With Multiplicity", "question__title_slug": "3sum-with-multiplicity", "question__hide": false, - "total_acs": 8698, - "total_submitted": 24074, + "total_acs": 8751, + "total_submitted": 24176, "total_column_articles": 103, "frontend_question_id": "923", "is_new_question": false @@ -40164,9 +40248,9 @@ "question__title": "Sort Array By Parity II", "question__title_slug": "sort-array-by-parity-ii", "question__hide": false, - "total_acs": 106406, - "total_submitted": 149162, - "total_column_articles": 1006, + "total_acs": 106767, + "total_submitted": 149719, + "total_column_articles": 1009, "frontend_question_id": "922", "is_new_question": false }, @@ -40185,9 +40269,9 @@ "question__title": "Minimum Add to Make Parentheses Valid", "question__title_slug": "minimum-add-to-make-parentheses-valid", "question__hide": false, - "total_acs": 61763, - "total_submitted": 84627, - "total_column_articles": 859, + "total_acs": 61978, + "total_submitted": 84898, + "total_column_articles": 860, "frontend_question_id": "921", "is_new_question": false }, @@ -40206,8 +40290,8 @@ "question__title": "Number of Music Playlists", "question__title_slug": "number-of-music-playlists", "question__hide": false, - "total_acs": 2766, - "total_submitted": 5477, + "total_acs": 2779, + "total_submitted": 5506, "total_column_articles": 36, "frontend_question_id": "920", "is_new_question": false @@ -40227,9 +40311,9 @@ "question__title": "Complete Binary Tree Inserter", "question__title_slug": "complete-binary-tree-inserter", "question__hide": false, - "total_acs": 30442, - "total_submitted": 45260, - "total_column_articles": 396, + "total_acs": 30490, + "total_submitted": 45329, + "total_column_articles": 397, "frontend_question_id": "919", "is_new_question": false }, @@ -40248,9 +40332,9 @@ "question__title": "Maximum Sum Circular Subarray", "question__title_slug": "maximum-sum-circular-subarray", "question__hide": false, - "total_acs": 47417, - "total_submitted": 126725, - "total_column_articles": 448, + "total_acs": 47642, + "total_submitted": 127276, + "total_column_articles": 450, "frontend_question_id": "918", "is_new_question": false }, @@ -40269,9 +40353,9 @@ "question__title": "Reverse Only Letters", "question__title_slug": "reverse-only-letters", "question__hide": false, - "total_acs": 72915, - "total_submitted": 121953, - "total_column_articles": 1007, + "total_acs": 73162, + "total_submitted": 122436, + "total_column_articles": 1013, "frontend_question_id": "917", "is_new_question": false }, @@ -40290,9 +40374,9 @@ "question__title": "Word Subsets", "question__title_slug": "word-subsets", "question__hide": false, - "total_acs": 8548, - "total_submitted": 18651, - "total_column_articles": 110, + "total_acs": 8573, + "total_submitted": 18700, + "total_column_articles": 111, "frontend_question_id": "916", "is_new_question": false }, @@ -40311,9 +40395,9 @@ "question__title": "Partition Array into Disjoint Intervals", "question__title_slug": "partition-array-into-disjoint-intervals", "question__hide": false, - "total_acs": 46153, - "total_submitted": 92125, - "total_column_articles": 539, + "total_acs": 46277, + "total_submitted": 92386, + "total_column_articles": 542, "frontend_question_id": "915", "is_new_question": false }, @@ -40332,9 +40416,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": 56425, - "total_submitted": 148563, - "total_column_articles": 719, + "total_acs": 56550, + "total_submitted": 148956, + "total_column_articles": 721, "frontend_question_id": "914", "is_new_question": false }, @@ -40353,9 +40437,9 @@ "question__title": "Cat and Mouse", "question__title_slug": "cat-and-mouse", "question__hide": false, - "total_acs": 17589, - "total_submitted": 31719, - "total_column_articles": 133, + "total_acs": 17602, + "total_submitted": 31786, + "total_column_articles": 134, "frontend_question_id": "913", "is_new_question": false }, @@ -40374,9 +40458,9 @@ "question__title": "Sort an Array", "question__title_slug": "sort-an-array", "question__hide": false, - "total_acs": 468483, - "total_submitted": 856897, - "total_column_articles": 1844, + "total_acs": 470981, + "total_submitted": 863203, + "total_column_articles": 1854, "frontend_question_id": "912", "is_new_question": false }, @@ -40395,9 +40479,9 @@ "question__title": "Online Election", "question__title_slug": "online-election", "question__hide": false, - "total_acs": 30420, - "total_submitted": 56424, - "total_column_articles": 353, + "total_acs": 30522, + "total_submitted": 56650, + "total_column_articles": 355, "frontend_question_id": "911", "is_new_question": false }, @@ -40416,8 +40500,8 @@ "question__title": "Smallest Range II", "question__title_slug": "smallest-range-ii", "question__hide": false, - "total_acs": 10446, - "total_submitted": 29959, + "total_acs": 10519, + "total_submitted": 30114, "total_column_articles": 114, "frontend_question_id": "910", "is_new_question": false @@ -40437,8 +40521,8 @@ "question__title": "Snakes and Ladders", "question__title_slug": "snakes-and-ladders", "question__hide": false, - "total_acs": 18727, - "total_submitted": 40731, + "total_acs": 18749, + "total_submitted": 40798, "total_column_articles": 217, "frontend_question_id": "909", "is_new_question": false @@ -40458,9 +40542,9 @@ "question__title": "Smallest Range I", "question__title_slug": "smallest-range-i", "question__hide": false, - "total_acs": 52652, - "total_submitted": 70820, - "total_column_articles": 552, + "total_acs": 52736, + "total_submitted": 70942, + "total_column_articles": 554, "frontend_question_id": "908", "is_new_question": false }, @@ -40479,9 +40563,9 @@ "question__title": "Sum of Subarray Minimums", "question__title_slug": "sum-of-subarray-minimums", "question__hide": false, - "total_acs": 42384, - "total_submitted": 110728, - "total_column_articles": 414, + "total_acs": 42796, + "total_submitted": 111816, + "total_column_articles": 419, "frontend_question_id": "907", "is_new_question": false }, @@ -40500,9 +40584,9 @@ "question__title": "Super Palindromes", "question__title_slug": "super-palindromes", "question__hide": false, - "total_acs": 3372, - "total_submitted": 10786, - "total_column_articles": 63, + "total_acs": 3388, + "total_submitted": 10839, + "total_column_articles": 64, "frontend_question_id": "906", "is_new_question": false }, @@ -40521,9 +40605,9 @@ "question__title": "Sort Array By Parity", "question__title_slug": "sort-array-by-parity", "question__hide": false, - "total_acs": 113630, - "total_submitted": 159670, - "total_column_articles": 1374, + "total_acs": 113890, + "total_submitted": 160008, + "total_column_articles": 1375, "frontend_question_id": "905", "is_new_question": false }, @@ -40542,9 +40626,9 @@ "question__title": "Fruit Into Baskets", "question__title_slug": "fruit-into-baskets", "question__hide": false, - "total_acs": 103312, - "total_submitted": 227261, - "total_column_articles": 1245, + "total_acs": 104155, + "total_submitted": 229301, + "total_column_articles": 1256, "frontend_question_id": "904", "is_new_question": false }, @@ -40563,8 +40647,8 @@ "question__title": "Valid Permutations for DI Sequence", "question__title_slug": "valid-permutations-for-di-sequence", "question__hide": false, - "total_acs": 3795, - "total_submitted": 6774, + "total_acs": 3807, + "total_submitted": 6788, "total_column_articles": 57, "frontend_question_id": "903", "is_new_question": false @@ -40584,9 +40668,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": 24850, - "total_submitted": 54270, - "total_column_articles": 380, + "total_acs": 24917, + "total_submitted": 54419, + "total_column_articles": 382, "frontend_question_id": "902", "is_new_question": false }, @@ -40605,9 +40689,9 @@ "question__title": "Online Stock Span", "question__title_slug": "online-stock-span", "question__hide": false, - "total_acs": 55226, - "total_submitted": 88454, - "total_column_articles": 633, + "total_acs": 55484, + "total_submitted": 88858, + "total_column_articles": 637, "frontend_question_id": "901", "is_new_question": false }, @@ -40626,8 +40710,8 @@ "question__title": "RLE Iterator", "question__title_slug": "rle-iterator", "question__hide": false, - "total_acs": 4947, - "total_submitted": 9705, + "total_acs": 4967, + "total_submitted": 9736, "total_column_articles": 81, "frontend_question_id": "900", "is_new_question": false @@ -40647,8 +40731,8 @@ "question__title": "Orderly Queue", "question__title_slug": "orderly-queue", "question__hide": false, - "total_acs": 26641, - "total_submitted": 41131, + "total_acs": 26760, + "total_submitted": 41313, "total_column_articles": 267, "frontend_question_id": "899", "is_new_question": false @@ -40668,9 +40752,9 @@ "question__title": "Bitwise ORs of Subarrays", "question__title_slug": "bitwise-ors-of-subarrays", "question__hide": false, - "total_acs": 7793, - "total_submitted": 20693, - "total_column_articles": 58, + "total_acs": 7860, + "total_submitted": 20790, + "total_column_articles": 59, "frontend_question_id": "898", "is_new_question": false }, @@ -40689,8 +40773,8 @@ "question__title": "Increasing Order Search Tree", "question__title_slug": "increasing-order-search-tree", "question__hide": false, - "total_acs": 73924, - "total_submitted": 99751, + "total_acs": 74101, + "total_submitted": 99981, "total_column_articles": 853, "frontend_question_id": "897", "is_new_question": false @@ -40710,8 +40794,8 @@ "question__title": "Monotonic Array", "question__title_slug": "monotonic-array", "question__hide": false, - "total_acs": 75640, - "total_submitted": 131705, + "total_acs": 75982, + "total_submitted": 132375, "total_column_articles": 906, "frontend_question_id": "896", "is_new_question": false @@ -40731,8 +40815,8 @@ "question__title": "Maximum Frequency Stack", "question__title_slug": "maximum-frequency-stack", "question__hide": false, - "total_acs": 13851, - "total_submitted": 23263, + "total_acs": 13910, + "total_submitted": 23359, "total_column_articles": 165, "frontend_question_id": "895", "is_new_question": false @@ -40752,9 +40836,9 @@ "question__title": "All Possible Full Binary Trees", "question__title_slug": "all-possible-full-binary-trees", "question__hide": false, - "total_acs": 17495, - "total_submitted": 22539, - "total_column_articles": 181, + "total_acs": 17587, + "total_submitted": 22653, + "total_column_articles": 182, "frontend_question_id": "894", "is_new_question": false }, @@ -40773,8 +40857,8 @@ "question__title": "Groups of Special-Equivalent Strings", "question__title_slug": "groups-of-special-equivalent-strings", "question__hide": false, - "total_acs": 12272, - "total_submitted": 16891, + "total_acs": 12294, + "total_submitted": 16918, "total_column_articles": 133, "frontend_question_id": "893", "is_new_question": false @@ -40794,8 +40878,8 @@ "question__title": "Surface Area of 3D Shapes", "question__title_slug": "surface-area-of-3d-shapes", "question__hide": false, - "total_acs": 36808, - "total_submitted": 57378, + "total_acs": 36868, + "total_submitted": 57459, "total_column_articles": 751, "frontend_question_id": "892", "is_new_question": false @@ -40815,8 +40899,8 @@ "question__title": "Sum of Subsequence Widths", "question__title_slug": "sum-of-subsequence-widths", "question__hide": false, - "total_acs": 3919, - "total_submitted": 11037, + "total_acs": 3938, + "total_submitted": 11075, "total_column_articles": 53, "frontend_question_id": "891", "is_new_question": false @@ -40836,9 +40920,9 @@ "question__title": "Find and Replace Pattern", "question__title_slug": "find-and-replace-pattern", "question__hide": false, - "total_acs": 30407, - "total_submitted": 38582, - "total_column_articles": 456, + "total_acs": 30466, + "total_submitted": 38660, + "total_column_articles": 457, "frontend_question_id": "890", "is_new_question": false }, @@ -40857,9 +40941,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": 32206, - "total_submitted": 47440, - "total_column_articles": 326, + "total_acs": 32466, + "total_submitted": 47804, + "total_column_articles": 328, "frontend_question_id": "889", "is_new_question": false }, @@ -40878,9 +40962,9 @@ "question__title": "Fair Candy Swap", "question__title_slug": "fair-candy-swap", "question__hide": false, - "total_acs": 64137, - "total_submitted": 100483, - "total_column_articles": 560, + "total_acs": 64281, + "total_submitted": 100730, + "total_column_articles": 562, "frontend_question_id": "888", "is_new_question": false }, @@ -40899,9 +40983,9 @@ "question__title": "Super Egg Drop", "question__title_slug": "super-egg-drop", "question__hide": false, - "total_acs": 71496, - "total_submitted": 236170, - "total_column_articles": 439, + "total_acs": 71917, + "total_submitted": 237063, + "total_column_articles": 440, "frontend_question_id": "887", "is_new_question": false }, @@ -40920,9 +41004,9 @@ "question__title": "Possible Bipartition", "question__title_slug": "possible-bipartition", "question__hide": false, - "total_acs": 42539, - "total_submitted": 82758, - "total_column_articles": 557, + "total_acs": 42788, + "total_submitted": 83240, + "total_column_articles": 560, "frontend_question_id": "886", "is_new_question": false }, @@ -40941,9 +41025,9 @@ "question__title": "Spiral Matrix III", "question__title_slug": "spiral-matrix-iii", "question__hide": false, - "total_acs": 7045, - "total_submitted": 9977, - "total_column_articles": 110, + "total_acs": 7091, + "total_submitted": 10035, + "total_column_articles": 112, "frontend_question_id": "885", "is_new_question": false }, @@ -40962,9 +41046,9 @@ "question__title": "Uncommon Words from Two Sentences", "question__title_slug": "uncommon-words-from-two-sentences", "question__hide": false, - "total_acs": 46607, - "total_submitted": 65044, - "total_column_articles": 593, + "total_acs": 46743, + "total_submitted": 65268, + "total_column_articles": 597, "frontend_question_id": "884", "is_new_question": false }, @@ -40983,9 +41067,9 @@ "question__title": "Projection Area of 3D Shapes", "question__title_slug": "projection-area-of-3d-shapes", "question__hide": false, - "total_acs": 43657, - "total_submitted": 57098, - "total_column_articles": 549, + "total_acs": 43722, + "total_submitted": 57184, + "total_column_articles": 550, "frontend_question_id": "883", "is_new_question": false }, @@ -41004,9 +41088,9 @@ "question__title": "Reachable Nodes In Subdivided Graph", "question__title_slug": "reachable-nodes-in-subdivided-graph", "question__hide": false, - "total_acs": 3242, - "total_submitted": 6495, - "total_column_articles": 54, + "total_acs": 3252, + "total_submitted": 6514, + "total_column_articles": 55, "frontend_question_id": "882", "is_new_question": false }, @@ -41025,9 +41109,9 @@ "question__title": "Boats to Save People", "question__title_slug": "boats-to-save-people", "question__hide": false, - "total_acs": 62332, - "total_submitted": 115994, - "total_column_articles": 717, + "total_acs": 62475, + "total_submitted": 116264, + "total_column_articles": 719, "frontend_question_id": "881", "is_new_question": false }, @@ -41046,8 +41130,8 @@ "question__title": "Decoded String at Index", "question__title_slug": "decoded-string-at-index", "question__hide": false, - "total_acs": 7828, - "total_submitted": 29553, + "total_acs": 7851, + "total_submitted": 29658, "total_column_articles": 100, "frontend_question_id": "880", "is_new_question": false @@ -41067,9 +41151,9 @@ "question__title": "Generate Random Point in a Circle", "question__title_slug": "generate-random-point-in-a-circle", "question__hide": false, - "total_acs": 27892, - "total_submitted": 57963, - "total_column_articles": 183, + "total_acs": 28195, + "total_submitted": 58451, + "total_column_articles": 184, "frontend_question_id": "478", "is_new_question": false }, @@ -41088,8 +41172,8 @@ "question__title": "Random Point in Non-overlapping Rectangles", "question__title_slug": "random-point-in-non-overlapping-rectangles", "question__hide": false, - "total_acs": 22959, - "total_submitted": 54855, + "total_acs": 23002, + "total_submitted": 54958, "total_column_articles": 207, "frontend_question_id": "497", "is_new_question": false @@ -41109,8 +41193,8 @@ "question__title": "Random Flip Matrix", "question__title_slug": "random-flip-matrix", "question__hide": false, - "total_acs": 21021, - "total_submitted": 45220, + "total_acs": 21043, + "total_submitted": 45275, "total_column_articles": 204, "frontend_question_id": "519", "is_new_question": false @@ -41130,9 +41214,9 @@ "question__title": "Random Pick with Weight", "question__title_slug": "random-pick-with-weight", "question__hide": false, - "total_acs": 50345, - "total_submitted": 104396, - "total_column_articles": 431, + "total_acs": 50627, + "total_submitted": 104991, + "total_column_articles": 434, "frontend_question_id": "528", "is_new_question": false }, @@ -41151,9 +41235,9 @@ "question__title": "Profitable Schemes", "question__title_slug": "profitable-schemes", "question__hide": false, - "total_acs": 25785, - "total_submitted": 46873, - "total_column_articles": 219, + "total_acs": 25840, + "total_submitted": 46969, + "total_column_articles": 220, "frontend_question_id": "879", "is_new_question": false }, @@ -41172,8 +41256,8 @@ "question__title": "Nth Magical Number", "question__title_slug": "nth-magical-number", "question__hide": false, - "total_acs": 6184, - "total_submitted": 20410, + "total_acs": 6207, + "total_submitted": 20491, "total_column_articles": 85, "frontend_question_id": "878", "is_new_question": false @@ -41193,9 +41277,9 @@ "question__title": "Stone Game", "question__title_slug": "stone-game", "question__hide": false, - "total_acs": 86927, - "total_submitted": 113920, - "total_column_articles": 619, + "total_acs": 87419, + "total_submitted": 114534, + "total_column_articles": 622, "frontend_question_id": "877", "is_new_question": false }, @@ -41214,9 +41298,9 @@ "question__title": "Middle of the Linked List", "question__title_slug": "middle-of-the-linked-list", "question__hide": false, - "total_acs": 324463, - "total_submitted": 461388, - "total_column_articles": 3061, + "total_acs": 327293, + "total_submitted": 465609, + "total_column_articles": 3082, "frontend_question_id": "876", "is_new_question": false }, @@ -41235,9 +41319,9 @@ "question__title": "Koko Eating Bananas", "question__title_slug": "koko-eating-bananas", "question__hide": false, - "total_acs": 114984, - "total_submitted": 229449, - "total_column_articles": 883, + "total_acs": 115579, + "total_submitted": 230747, + "total_column_articles": 889, "frontend_question_id": "875", "is_new_question": false }, @@ -41256,9 +41340,9 @@ "question__title": "Walking Robot Simulation", "question__title_slug": "walking-robot-simulation", "question__hide": false, - "total_acs": 25622, - "total_submitted": 60069, - "total_column_articles": 313, + "total_acs": 25673, + "total_submitted": 60149, + "total_column_articles": 315, "frontend_question_id": "874", "is_new_question": false }, @@ -41277,9 +41361,9 @@ "question__title": "Length of Longest Fibonacci Subsequence", "question__title_slug": "length-of-longest-fibonacci-subsequence", "question__hide": false, - "total_acs": 46195, - "total_submitted": 82147, - "total_column_articles": 366, + "total_acs": 46316, + "total_submitted": 82366, + "total_column_articles": 367, "frontend_question_id": "873", "is_new_question": false }, @@ -41298,8 +41382,8 @@ "question__title": "Leaf-Similar Trees", "question__title_slug": "leaf-similar-trees", "question__hide": false, - "total_acs": 68579, - "total_submitted": 105424, + "total_acs": 68718, + "total_submitted": 105680, "total_column_articles": 837, "frontend_question_id": "872", "is_new_question": false @@ -41319,9 +41403,9 @@ "question__title": "Implement Rand10() Using Rand7()", "question__title_slug": "implement-rand10-using-rand7", "question__hide": false, - "total_acs": 93436, - "total_submitted": 169018, - "total_column_articles": 438, + "total_acs": 94115, + "total_submitted": 170226, + "total_column_articles": 439, "frontend_question_id": "470", "is_new_question": false }, @@ -41340,8 +41424,8 @@ "question__title": "Minimum Number of Refueling Stops", "question__title_slug": "minimum-number-of-refueling-stops", "question__hide": false, - "total_acs": 31836, - "total_submitted": 73781, + "total_acs": 31918, + "total_submitted": 74000, "total_column_articles": 351, "frontend_question_id": "871", "is_new_question": false @@ -41361,9 +41445,9 @@ "question__title": "Advantage Shuffle", "question__title_slug": "advantage-shuffle", "question__hide": false, - "total_acs": 57779, - "total_submitted": 116136, - "total_column_articles": 677, + "total_acs": 58026, + "total_submitted": 116554, + "total_column_articles": 678, "frontend_question_id": "870", "is_new_question": false }, @@ -41382,8 +41466,8 @@ "question__title": "Reordered Power of 2", "question__title_slug": "reordered-power-of-2", "question__hide": false, - "total_acs": 35728, - "total_submitted": 55925, + "total_acs": 35761, + "total_submitted": 55991, "total_column_articles": 524, "frontend_question_id": "869", "is_new_question": false @@ -41403,9 +41487,9 @@ "question__title": "Binary Gap", "question__title_slug": "binary-gap", "question__hide": false, - "total_acs": 49787, - "total_submitted": 71666, - "total_column_articles": 667, + "total_acs": 49852, + "total_submitted": 71766, + "total_column_articles": 668, "frontend_question_id": "868", "is_new_question": false }, @@ -41424,9 +41508,9 @@ "question__title": "Transpose Matrix", "question__title_slug": "transpose-matrix", "question__hide": false, - "total_acs": 93691, - "total_submitted": 140536, - "total_column_articles": 837, + "total_acs": 93827, + "total_submitted": 140716, + "total_column_articles": 838, "frontend_question_id": "867", "is_new_question": false }, @@ -41445,9 +41529,9 @@ "question__title": "Prime Palindrome", "question__title_slug": "prime-palindrome", "question__hide": false, - "total_acs": 10129, - "total_submitted": 42779, - "total_column_articles": 117, + "total_acs": 10178, + "total_submitted": 42961, + "total_column_articles": 118, "frontend_question_id": "866", "is_new_question": false }, @@ -41466,8 +41550,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": 13566, - "total_submitted": 19907, + "total_acs": 13655, + "total_submitted": 20031, "total_column_articles": 201, "frontend_question_id": "865", "is_new_question": false @@ -41487,8 +41571,8 @@ "question__title": "Shortest Path to Get All Keys", "question__title_slug": "shortest-path-to-get-all-keys", "question__hide": false, - "total_acs": 4630, - "total_submitted": 9595, + "total_acs": 4668, + "total_submitted": 9664, "total_column_articles": 69, "frontend_question_id": "864", "is_new_question": false @@ -41508,9 +41592,9 @@ "question__title": "Random Pick with Blacklist", "question__title_slug": "random-pick-with-blacklist", "question__hide": false, - "total_acs": 26788, - "total_submitted": 60815, - "total_column_articles": 384, + "total_acs": 26893, + "total_submitted": 61073, + "total_column_articles": 385, "frontend_question_id": "710", "is_new_question": false }, @@ -41529,9 +41613,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": 48816, - "total_submitted": 79344, - "total_column_articles": 705, + "total_acs": 49012, + "total_submitted": 79669, + "total_column_articles": 706, "frontend_question_id": "863", "is_new_question": false }, @@ -41550,9 +41634,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": 44179, - "total_submitted": 169205, - "total_column_articles": 362, + "total_acs": 44407, + "total_submitted": 170000, + "total_column_articles": 367, "frontend_question_id": "862", "is_new_question": false }, @@ -41571,8 +41655,8 @@ "question__title": "Score After Flipping Matrix", "question__title_slug": "score-after-flipping-matrix", "question__hide": false, - "total_acs": 34668, - "total_submitted": 42920, + "total_acs": 34706, + "total_submitted": 42965, "total_column_articles": 508, "frontend_question_id": "861", "is_new_question": false @@ -41592,9 +41676,9 @@ "question__title": "Lemonade Change", "question__title_slug": "lemonade-change", "question__hide": false, - "total_acs": 144136, - "total_submitted": 246485, - "total_column_articles": 1149, + "total_acs": 144948, + "total_submitted": 247875, + "total_column_articles": 1155, "frontend_question_id": "860", "is_new_question": false }, @@ -41613,9 +41697,9 @@ "question__title": "Buddy Strings", "question__title_slug": "buddy-strings", "question__hide": false, - "total_acs": 65986, - "total_submitted": 191339, - "total_column_articles": 844, + "total_acs": 66117, + "total_submitted": 191738, + "total_column_articles": 845, "frontend_question_id": "859", "is_new_question": false }, @@ -41634,9 +41718,9 @@ "question__title": "Mirror Reflection", "question__title_slug": "mirror-reflection", "question__hide": false, - "total_acs": 4218, - "total_submitted": 7453, - "total_column_articles": 68, + "total_acs": 4236, + "total_submitted": 7486, + "total_column_articles": 69, "frontend_question_id": "858", "is_new_question": false }, @@ -41655,8 +41739,8 @@ "question__title": "Minimum Cost to Hire K Workers", "question__title_slug": "minimum-cost-to-hire-k-workers", "question__hide": false, - "total_acs": 19398, - "total_submitted": 30382, + "total_acs": 19416, + "total_submitted": 30407, "total_column_articles": 212, "frontend_question_id": "857", "is_new_question": false @@ -41676,9 +41760,9 @@ "question__title": "Score of Parentheses", "question__title_slug": "score-of-parentheses", "question__hide": false, - "total_acs": 51370, - "total_submitted": 75065, - "total_column_articles": 687, + "total_acs": 51565, + "total_submitted": 75384, + "total_column_articles": 688, "frontend_question_id": "856", "is_new_question": false }, @@ -41697,8 +41781,8 @@ "question__title": "Exam Room", "question__title_slug": "exam-room", "question__hide": false, - "total_acs": 9524, - "total_submitted": 22839, + "total_acs": 9595, + "total_submitted": 23019, "total_column_articles": 101, "frontend_question_id": "855", "is_new_question": false @@ -41718,9 +41802,9 @@ "question__title": "K-Similar Strings", "question__title_slug": "k-similar-strings", "question__hide": false, - "total_acs": 24756, - "total_submitted": 52756, - "total_column_articles": 239, + "total_acs": 24808, + "total_submitted": 52884, + "total_column_articles": 240, "frontend_question_id": "854", "is_new_question": false }, @@ -41739,8 +41823,8 @@ "question__title": "Car Fleet", "question__title_slug": "car-fleet", "question__hide": false, - "total_acs": 15820, - "total_submitted": 38864, + "total_acs": 15940, + "total_submitted": 39156, "total_column_articles": 187, "frontend_question_id": "853", "is_new_question": false @@ -41760,9 +41844,9 @@ "question__title": "Peak Index in a Mountain Array", "question__title_slug": "peak-index-in-a-mountain-array", "question__hide": false, - "total_acs": 127210, - "total_submitted": 184592, - "total_column_articles": 1071, + "total_acs": 127740, + "total_submitted": 185409, + "total_column_articles": 1073, "frontend_question_id": "852", "is_new_question": false }, @@ -41781,8 +41865,8 @@ "question__title": "Loud and Rich", "question__title_slug": "loud-and-rich", "question__hide": false, - "total_acs": 28833, - "total_submitted": 45745, + "total_acs": 28884, + "total_submitted": 45822, "total_column_articles": 319, "frontend_question_id": "851", "is_new_question": false @@ -41802,8 +41886,8 @@ "question__title": "Rectangle Area II", "question__title_slug": "rectangle-area-ii", "question__hide": false, - "total_acs": 17948, - "total_submitted": 28365, + "total_acs": 17979, + "total_submitted": 28416, "total_column_articles": 172, "frontend_question_id": "850", "is_new_question": false @@ -41823,9 +41907,9 @@ "question__title": "Maximize Distance to Closest Person", "question__title_slug": "maximize-distance-to-closest-person", "question__hide": false, - "total_acs": 19709, - "total_submitted": 45225, - "total_column_articles": 245, + "total_acs": 19841, + "total_submitted": 45501, + "total_column_articles": 246, "frontend_question_id": "849", "is_new_question": false }, @@ -41844,9 +41928,9 @@ "question__title": "Shifting Letters", "question__title_slug": "shifting-letters", "question__hide": false, - "total_acs": 12780, - "total_submitted": 27772, - "total_column_articles": 140, + "total_acs": 12834, + "total_submitted": 27882, + "total_column_articles": 141, "frontend_question_id": "848", "is_new_question": false }, @@ -41865,9 +41949,9 @@ "question__title": "Shortest Path Visiting All Nodes", "question__title_slug": "shortest-path-visiting-all-nodes", "question__hide": false, - "total_acs": 23976, - "total_submitted": 35372, - "total_column_articles": 213, + "total_acs": 24043, + "total_submitted": 35479, + "total_column_articles": 214, "frontend_question_id": "847", "is_new_question": false }, @@ -41886,8 +41970,8 @@ "question__title": "Hand of Straights", "question__title_slug": "hand-of-straights", "question__hide": false, - "total_acs": 38395, - "total_submitted": 66970, + "total_acs": 38480, + "total_submitted": 67133, "total_column_articles": 524, "frontend_question_id": "846", "is_new_question": false @@ -41907,9 +41991,9 @@ "question__title": "Longest Mountain in Array", "question__title_slug": "longest-mountain-in-array", "question__hide": false, - "total_acs": 45715, - "total_submitted": 107923, - "total_column_articles": 670, + "total_acs": 45829, + "total_submitted": 108199, + "total_column_articles": 671, "frontend_question_id": "845", "is_new_question": false }, @@ -41928,9 +42012,9 @@ "question__title": "Backspace String Compare", "question__title_slug": "backspace-string-compare", "question__hide": false, - "total_acs": 169805, - "total_submitted": 349723, - "total_column_articles": 1655, + "total_acs": 170965, + "total_submitted": 352203, + "total_column_articles": 1661, "frontend_question_id": "844", "is_new_question": false }, @@ -41949,8 +42033,8 @@ "question__title": "Guess the Word", "question__title_slug": "guess-the-word", "question__hide": false, - "total_acs": 4185, - "total_submitted": 11237, + "total_acs": 4212, + "total_submitted": 11307, "total_column_articles": 59, "frontend_question_id": "843", "is_new_question": false @@ -41970,8 +42054,8 @@ "question__title": "Split Array into Fibonacci Sequence", "question__title_slug": "split-array-into-fibonacci-sequence", "question__hide": false, - "total_acs": 32492, - "total_submitted": 67188, + "total_acs": 32534, + "total_submitted": 67265, "total_column_articles": 367, "frontend_question_id": "842", "is_new_question": false @@ -41991,9 +42075,9 @@ "question__title": "Keys and Rooms", "question__title_slug": "keys-and-rooms", "question__hide": false, - "total_acs": 76940, - "total_submitted": 114521, - "total_column_articles": 745, + "total_acs": 77249, + "total_submitted": 114925, + "total_column_articles": 750, "frontend_question_id": "841", "is_new_question": false }, @@ -42012,9 +42096,9 @@ "question__title": "Magic Squares In Grid", "question__title_slug": "magic-squares-in-grid", "question__hide": false, - "total_acs": 10644, - "total_submitted": 29211, - "total_column_articles": 138, + "total_acs": 10683, + "total_submitted": 29353, + "total_column_articles": 139, "frontend_question_id": "840", "is_new_question": false }, @@ -42033,8 +42117,8 @@ "question__title": "Similar String Groups", "question__title_slug": "similar-string-groups", "question__hide": false, - "total_acs": 22765, - "total_submitted": 38847, + "total_acs": 22827, + "total_submitted": 38953, "total_column_articles": 317, "frontend_question_id": "839", "is_new_question": false @@ -42054,9 +42138,9 @@ "question__title": "Push Dominoes", "question__title_slug": "push-dominoes", "question__hide": false, - "total_acs": 38109, - "total_submitted": 68456, - "total_column_articles": 549, + "total_acs": 38158, + "total_submitted": 68595, + "total_column_articles": 550, "frontend_question_id": "838", "is_new_question": false }, @@ -42075,8 +42159,8 @@ "question__title": "New 21 Game", "question__title_slug": "new-21-game", "question__hide": false, - "total_acs": 21371, - "total_submitted": 53972, + "total_acs": 21396, + "total_submitted": 54038, "total_column_articles": 265, "frontend_question_id": "837", "is_new_question": false @@ -42096,9 +42180,9 @@ "question__title": "Rectangle Overlap", "question__title_slug": "rectangle-overlap", "question__hide": false, - "total_acs": 46495, - "total_submitted": 95296, - "total_column_articles": 758, + "total_acs": 46627, + "total_submitted": 95541, + "total_column_articles": 759, "frontend_question_id": "836", "is_new_question": false }, @@ -42117,8 +42201,8 @@ "question__title": "Robot Room Cleaner", "question__title_slug": "robot-room-cleaner", "question__hide": false, - "total_acs": 3119, - "total_submitted": 4170, + "total_acs": 3141, + "total_submitted": 4195, "total_column_articles": 36, "frontend_question_id": "489", "is_new_question": false @@ -42138,8 +42222,8 @@ "question__title": "Image Overlap", "question__title_slug": "image-overlap", "question__hide": false, - "total_acs": 5734, - "total_submitted": 9846, + "total_acs": 5763, + "total_submitted": 9891, "total_column_articles": 64, "frontend_question_id": "835", "is_new_question": false @@ -42159,9 +42243,9 @@ "question__title": "Sum of Distances in Tree", "question__title_slug": "sum-of-distances-in-tree", "question__hide": false, - "total_acs": 15816, - "total_submitted": 29442, - "total_column_articles": 162, + "total_acs": 15896, + "total_submitted": 29583, + "total_column_articles": 163, "frontend_question_id": "834", "is_new_question": false }, @@ -42180,8 +42264,8 @@ "question__title": "Find And Replace in String", "question__title_slug": "find-and-replace-in-string", "question__hide": false, - "total_acs": 7271, - "total_submitted": 16450, + "total_acs": 7326, + "total_submitted": 16559, "total_column_articles": 113, "frontend_question_id": "833", "is_new_question": false @@ -42201,9 +42285,9 @@ "question__title": "Flipping an Image", "question__title_slug": "flipping-an-image", "question__hide": false, - "total_acs": 96220, - "total_submitted": 121058, - "total_column_articles": 1084, + "total_acs": 96442, + "total_submitted": 121329, + "total_column_articles": 1088, "frontend_question_id": "832", "is_new_question": false }, @@ -42222,9 +42306,9 @@ "question__title": "Design Circular Queue", "question__title_slug": "design-circular-queue", "question__hide": false, - "total_acs": 119530, - "total_submitted": 250637, - "total_column_articles": 931, + "total_acs": 119924, + "total_submitted": 251448, + "total_column_articles": 932, "frontend_question_id": "622", "is_new_question": false }, @@ -42243,8 +42327,8 @@ "question__title": "Design Circular Deque", "question__title_slug": "design-circular-deque", "question__hide": false, - "total_acs": 54993, - "total_submitted": 95904, + "total_acs": 55151, + "total_submitted": 96210, "total_column_articles": 602, "frontend_question_id": "641", "is_new_question": false @@ -42264,9 +42348,9 @@ "question__title": "Masking Personal Information", "question__title_slug": "masking-personal-information", "question__hide": false, - "total_acs": 9627, - "total_submitted": 22755, - "total_column_articles": 104, + "total_acs": 9671, + "total_submitted": 22859, + "total_column_articles": 105, "frontend_question_id": "831", "is_new_question": false }, @@ -42285,9 +42369,9 @@ "question__title": "Positions of Large Groups", "question__title_slug": "positions-of-large-groups", "question__hide": false, - "total_acs": 57402, - "total_submitted": 105850, - "total_column_articles": 670, + "total_acs": 57525, + "total_submitted": 106057, + "total_column_articles": 672, "frontend_question_id": "830", "is_new_question": false }, @@ -42306,8 +42390,8 @@ "question__title": "Consecutive Numbers Sum", "question__title_slug": "consecutive-numbers-sum", "question__hide": false, - "total_acs": 29996, - "total_submitted": 64255, + "total_acs": 30071, + "total_submitted": 64407, "total_column_articles": 362, "frontend_question_id": "829", "is_new_question": false @@ -42327,9 +42411,9 @@ "question__title": "Count Unique Characters of All Substrings of a Given String", "question__title_slug": "count-unique-characters-of-all-substrings-of-a-given-string", "question__hide": false, - "total_acs": 27083, - "total_submitted": 41342, - "total_column_articles": 304, + "total_acs": 27134, + "total_submitted": 41416, + "total_column_articles": 305, "frontend_question_id": "828", "is_new_question": false }, @@ -42348,9 +42432,9 @@ "question__title": "Making A Large Island", "question__title_slug": "making-a-large-island", "question__hide": false, - "total_acs": 35250, - "total_submitted": 73907, - "total_column_articles": 502, + "total_acs": 35431, + "total_submitted": 74291, + "total_column_articles": 503, "frontend_question_id": "827", "is_new_question": false }, @@ -42369,9 +42453,9 @@ "question__title": "Most Profit Assigning Work", "question__title_slug": "most-profit-assigning-work", "question__hide": false, - "total_acs": 13920, - "total_submitted": 33531, - "total_column_articles": 206, + "total_acs": 14063, + "total_submitted": 33837, + "total_column_articles": 207, "frontend_question_id": "826", "is_new_question": false }, @@ -42390,9 +42474,9 @@ "question__title": "Friends Of Appropriate Ages", "question__title_slug": "friends-of-appropriate-ages", "question__hide": false, - "total_acs": 35438, - "total_submitted": 77698, - "total_column_articles": 349, + "total_acs": 35502, + "total_submitted": 77879, + "total_column_articles": 350, "frontend_question_id": "825", "is_new_question": false }, @@ -42411,9 +42495,9 @@ "question__title": "Goat Latin", "question__title_slug": "goat-latin", "question__hide": false, - "total_acs": 52491, - "total_submitted": 80485, - "total_column_articles": 709, + "total_acs": 52610, + "total_submitted": 80685, + "total_column_articles": 710, "frontend_question_id": "824", "is_new_question": false }, @@ -42432,9 +42516,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": 4501, - "total_submitted": 11944, - "total_column_articles": 88, + "total_acs": 4525, + "total_submitted": 12031, + "total_column_articles": 89, "frontend_question_id": "708", "is_new_question": false }, @@ -42453,8 +42537,8 @@ "question__title": "Binary Trees With Factors", "question__title_slug": "binary-trees-with-factors", "question__hide": false, - "total_acs": 4828, - "total_submitted": 11108, + "total_acs": 4870, + "total_submitted": 11201, "total_column_articles": 71, "frontend_question_id": "823", "is_new_question": false @@ -42474,9 +42558,9 @@ "question__title": "Card Flipping Game", "question__title_slug": "card-flipping-game", "question__hide": false, - "total_acs": 4233, - "total_submitted": 8269, - "total_column_articles": 59, + "total_acs": 4282, + "total_submitted": 8369, + "total_column_articles": 62, "frontend_question_id": "822", "is_new_question": false }, @@ -42495,9 +42579,9 @@ "question__title": "Shortest Distance to a Character", "question__title_slug": "shortest-distance-to-a-character", "question__hide": false, - "total_acs": 69979, - "total_submitted": 95711, - "total_column_articles": 952, + "total_acs": 70234, + "total_submitted": 96132, + "total_column_articles": 955, "frontend_question_id": "821", "is_new_question": false }, @@ -42516,9 +42600,9 @@ "question__title": "Short Encoding of Words", "question__title_slug": "short-encoding-of-words", "question__hide": false, - "total_acs": 66502, - "total_submitted": 128331, - "total_column_articles": 711, + "total_acs": 66693, + "total_submitted": 128720, + "total_column_articles": 712, "frontend_question_id": "820", "is_new_question": false }, @@ -42537,9 +42621,9 @@ "question__title": "Design Linked List", "question__title_slug": "design-linked-list", "question__hide": false, - "total_acs": 182502, - "total_submitted": 524578, - "total_column_articles": 1195, + "total_acs": 184098, + "total_submitted": 529064, + "total_column_articles": 1208, "frontend_question_id": "707", "is_new_question": false }, @@ -42558,9 +42642,9 @@ "question__title": "Most Common Word", "question__title_slug": "most-common-word", "question__hide": false, - "total_acs": 56466, - "total_submitted": 122728, - "total_column_articles": 676, + "total_acs": 56645, + "total_submitted": 123204, + "total_column_articles": 678, "frontend_question_id": "819", "is_new_question": false }, @@ -42579,8 +42663,8 @@ "question__title": "Race Car", "question__title_slug": "race-car", "question__hide": false, - "total_acs": 5125, - "total_submitted": 11516, + "total_acs": 5157, + "total_submitted": 11582, "total_column_articles": 56, "frontend_question_id": "818", "is_new_question": false @@ -42600,9 +42684,9 @@ "question__title": "Linked List Components", "question__title_slug": "linked-list-components", "question__hide": false, - "total_acs": 47549, - "total_submitted": 77369, - "total_column_articles": 572, + "total_acs": 47677, + "total_submitted": 77580, + "total_column_articles": 573, "frontend_question_id": "817", "is_new_question": false }, @@ -42621,9 +42705,9 @@ "question__title": "Ambiguous Coordinates", "question__title_slug": "ambiguous-coordinates", "question__hide": false, - "total_acs": 5268, - "total_submitted": 10386, - "total_column_articles": 93, + "total_acs": 26094, + "total_submitted": 41611, + "total_column_articles": 380, "frontend_question_id": "816", "is_new_question": false }, @@ -42642,9 +42726,9 @@ "question__title": "Bus Routes", "question__title_slug": "bus-routes", "question__hide": false, - "total_acs": 34398, - "total_submitted": 78084, - "total_column_articles": 386, + "total_acs": 34539, + "total_submitted": 78466, + "total_column_articles": 387, "frontend_question_id": "815", "is_new_question": false }, @@ -42663,8 +42747,8 @@ "question__title": "Binary Tree Pruning", "question__title_slug": "binary-tree-pruning", "question__hide": false, - "total_acs": 56000, - "total_submitted": 77198, + "total_acs": 56119, + "total_submitted": 77354, "total_column_articles": 772, "frontend_question_id": "814", "is_new_question": false @@ -42684,8 +42768,8 @@ "question__title": "Largest Sum of Averages", "question__title_slug": "largest-sum-of-averages", "question__hide": false, - "total_acs": 10690, - "total_submitted": 18989, + "total_acs": 10745, + "total_submitted": 19084, "total_column_articles": 124, "frontend_question_id": "813", "is_new_question": false @@ -42705,9 +42789,9 @@ "question__title": "Largest Triangle Area", "question__title_slug": "largest-triangle-area", "question__hide": false, - "total_acs": 34440, - "total_submitted": 50093, - "total_column_articles": 304, + "total_acs": 34544, + "total_submitted": 50324, + "total_column_articles": 305, "frontend_question_id": "812", "is_new_question": false }, @@ -42726,8 +42810,8 @@ "question__title": "Subdomain Visit Count", "question__title_slug": "subdomain-visit-count", "question__hide": false, - "total_acs": 42541, - "total_submitted": 55448, + "total_acs": 42620, + "total_submitted": 55560, "total_column_articles": 552, "frontend_question_id": "811", "is_new_question": false @@ -42747,8 +42831,8 @@ "question__title": "Chalkboard XOR Game", "question__title_slug": "chalkboard-xor-game", "question__hide": false, - "total_acs": 18363, - "total_submitted": 25267, + "total_acs": 18394, + "total_submitted": 25325, "total_column_articles": 151, "frontend_question_id": "810", "is_new_question": false @@ -42768,9 +42852,9 @@ "question__title": "Expressive Words", "question__title_slug": "expressive-words", "question__hide": false, - "total_acs": 6759, - "total_submitted": 16241, - "total_column_articles": 116, + "total_acs": 6796, + "total_submitted": 16317, + "total_column_articles": 117, "frontend_question_id": "809", "is_new_question": false }, @@ -42789,9 +42873,9 @@ "question__title": "Soup Servings", "question__title_slug": "soup-servings", "question__hide": false, - "total_acs": 5827, - "total_submitted": 12023, - "total_column_articles": 53, + "total_acs": 5867, + "total_submitted": 12089, + "total_column_articles": 54, "frontend_question_id": "808", "is_new_question": false }, @@ -42810,9 +42894,9 @@ "question__title": "Max Increase to Keep City Skyline", "question__title_slug": "max-increase-to-keep-city-skyline", "question__hide": false, - "total_acs": 51383, - "total_submitted": 58197, - "total_column_articles": 727, + "total_acs": 51500, + "total_submitted": 58328, + "total_column_articles": 731, "frontend_question_id": "807", "is_new_question": false }, @@ -42831,8 +42915,8 @@ "question__title": "Number of Lines To Write String", "question__title_slug": "number-of-lines-to-write-string", "question__hide": false, - "total_acs": 49907, - "total_submitted": 72594, + "total_acs": 50007, + "total_submitted": 72739, "total_column_articles": 616, "frontend_question_id": "806", "is_new_question": false @@ -42852,9 +42936,9 @@ "question__title": "Split Array With Same Average", "question__title_slug": "split-array-with-same-average", "question__hide": false, - "total_acs": 4476, - "total_submitted": 14843, - "total_column_articles": 74, + "total_acs": 4502, + "total_submitted": 14919, + "total_column_articles": 76, "frontend_question_id": "805", "is_new_question": false }, @@ -42873,9 +42957,9 @@ "question__title": "Unique Morse Code Words", "question__title_slug": "unique-morse-code-words", "question__hide": false, - "total_acs": 75403, - "total_submitted": 91668, - "total_column_articles": 797, + "total_acs": 75579, + "total_submitted": 91887, + "total_column_articles": 798, "frontend_question_id": "804", "is_new_question": false }, @@ -42894,8 +42978,8 @@ "question__title": "Bricks Falling When Hit", "question__title_slug": "bricks-falling-when-hit", "question__hide": false, - "total_acs": 13890, - "total_submitted": 29373, + "total_acs": 13931, + "total_submitted": 29459, "total_column_articles": 147, "frontend_question_id": "803", "is_new_question": false @@ -42915,9 +42999,9 @@ "question__title": "Find Eventual Safe States", "question__title_slug": "find-eventual-safe-states", "question__hide": false, - "total_acs": 40669, - "total_submitted": 68907, - "total_column_articles": 429, + "total_acs": 40780, + "total_submitted": 69087, + "total_column_articles": 433, "frontend_question_id": "802", "is_new_question": false }, @@ -42936,8 +43020,8 @@ "question__title": "Minimum Swaps To Make Sequences Increasing", "question__title_slug": "minimum-swaps-to-make-sequences-increasing", "question__hide": false, - "total_acs": 29819, - "total_submitted": 58965, + "total_acs": 29944, + "total_submitted": 59213, "total_column_articles": 305, "frontend_question_id": "801", "is_new_question": false @@ -42957,8 +43041,8 @@ "question__title": "Similar RGB Color", "question__title_slug": "similar-rgb-color", "question__hide": false, - "total_acs": 2084, - "total_submitted": 2953, + "total_acs": 2096, + "total_submitted": 2974, "total_column_articles": 52, "frontend_question_id": "800", "is_new_question": false @@ -42978,8 +43062,8 @@ "question__title": "Design HashMap", "question__title_slug": "design-hashmap", "question__hide": false, - "total_acs": 87787, - "total_submitted": 137704, + "total_acs": 88314, + "total_submitted": 138552, "total_column_articles": 561, "frontend_question_id": "706", "is_new_question": false @@ -42999,9 +43083,9 @@ "question__title": "Design HashSet", "question__title_slug": "design-hashset", "question__hide": false, - "total_acs": 95341, - "total_submitted": 150063, - "total_column_articles": 584, + "total_acs": 95735, + "total_submitted": 150716, + "total_column_articles": 585, "frontend_question_id": "705", "is_new_question": false }, @@ -43020,8 +43104,8 @@ "question__title": "Champagne Tower", "question__title_slug": "champagne-tower", "question__hide": false, - "total_acs": 9344, - "total_submitted": 21578, + "total_acs": 9377, + "total_submitted": 21649, "total_column_articles": 105, "frontend_question_id": "799", "is_new_question": false @@ -43041,9 +43125,9 @@ "question__title": "Smallest Rotation with Highest Score", "question__title_slug": "smallest-rotation-with-highest-score", "question__hide": false, - "total_acs": 20617, - "total_submitted": 33430, - "total_column_articles": 215, + "total_acs": 20630, + "total_submitted": 33453, + "total_column_articles": 216, "frontend_question_id": "798", "is_new_question": false }, @@ -43062,9 +43146,9 @@ "question__title": "All Paths From Source to Target", "question__title_slug": "all-paths-from-source-to-target", "question__hide": false, - "total_acs": 86572, - "total_submitted": 109616, - "total_column_articles": 1618, + "total_acs": 87102, + "total_submitted": 110314, + "total_column_articles": 1629, "frontend_question_id": "797", "is_new_question": false }, @@ -43083,9 +43167,9 @@ "question__title": "Rotate String", "question__title_slug": "rotate-string", "question__hide": false, - "total_acs": 74533, - "total_submitted": 117769, - "total_column_articles": 834, + "total_acs": 74744, + "total_submitted": 118110, + "total_column_articles": 839, "frontend_question_id": "796", "is_new_question": false }, @@ -43104,9 +43188,9 @@ "question__title": "Number of Subarrays with Bounded Maximum", "question__title_slug": "number-of-subarrays-with-bounded-maximum", "question__hide": false, - "total_acs": 12602, - "total_submitted": 23761, - "total_column_articles": 136, + "total_acs": 12659, + "total_submitted": 23868, + "total_column_articles": 137, "frontend_question_id": "795", "is_new_question": false }, @@ -43125,8 +43209,8 @@ "question__title": "Valid Tic-Tac-Toe State", "question__title_slug": "valid-tic-tac-toe-state", "question__hide": false, - "total_acs": 30265, - "total_submitted": 78200, + "total_acs": 30295, + "total_submitted": 78278, "total_column_articles": 488, "frontend_question_id": "794", "is_new_question": false @@ -43146,8 +43230,8 @@ "question__title": "Preimage Size of Factorial Zeroes Function", "question__title_slug": "preimage-size-of-factorial-zeroes-function", "question__hide": false, - "total_acs": 25313, - "total_submitted": 51928, + "total_acs": 25408, + "total_submitted": 52118, "total_column_articles": 271, "frontend_question_id": "793", "is_new_question": false @@ -43167,9 +43251,9 @@ "question__title": "Number of Matching Subsequences", "question__title_slug": "number-of-matching-subsequences", "question__hide": false, - "total_acs": 13422, - "total_submitted": 28078, - "total_column_articles": 155, + "total_acs": 13517, + "total_submitted": 28280, + "total_column_articles": 156, "frontend_question_id": "792", "is_new_question": false }, @@ -43188,9 +43272,9 @@ "question__title": "Custom Sort String", "question__title_slug": "custom-sort-string", "question__hide": false, - "total_acs": 15722, - "total_submitted": 22400, - "total_column_articles": 283, + "total_acs": 15811, + "total_submitted": 22530, + "total_column_articles": 284, "frontend_question_id": "791", "is_new_question": false }, @@ -43209,8 +43293,8 @@ "question__title": "Domino and Tromino Tiling", "question__title_slug": "domino-and-tromino-tiling", "question__hide": false, - "total_acs": 6014, - "total_submitted": 12929, + "total_acs": 6052, + "total_submitted": 12995, "total_column_articles": 96, "frontend_question_id": "790", "is_new_question": false @@ -43230,8 +43314,8 @@ "question__title": "Escape The Ghosts", "question__title_slug": "escape-the-ghosts", "question__hide": false, - "total_acs": 22562, - "total_submitted": 32867, + "total_acs": 22592, + "total_submitted": 32914, "total_column_articles": 317, "frontend_question_id": "789", "is_new_question": false @@ -43251,8 +43335,8 @@ "question__title": "Rotated Digits", "question__title_slug": "rotated-digits", "question__hide": false, - "total_acs": 43999, - "total_submitted": 66403, + "total_acs": 44047, + "total_submitted": 66481, "total_column_articles": 506, "frontend_question_id": "788", "is_new_question": false @@ -43272,9 +43356,9 @@ "question__title": "Cheapest Flights Within K Stops", "question__title_slug": "cheapest-flights-within-k-stops", "question__hide": false, - "total_acs": 59838, - "total_submitted": 152282, - "total_column_articles": 573, + "total_acs": 60046, + "total_submitted": 152848, + "total_column_articles": 576, "frontend_question_id": "787", "is_new_question": false }, @@ -43293,9 +43377,9 @@ "question__title": "K-th Smallest Prime Fraction", "question__title_slug": "k-th-smallest-prime-fraction", "question__hide": false, - "total_acs": 30244, - "total_submitted": 44648, - "total_column_articles": 305, + "total_acs": 30333, + "total_submitted": 44805, + "total_column_articles": 306, "frontend_question_id": "786", "is_new_question": false }, @@ -43314,9 +43398,9 @@ "question__title": "Is Graph Bipartite?", "question__title_slug": "is-graph-bipartite", "question__hide": false, - "total_acs": 67962, - "total_submitted": 126161, - "total_column_articles": 1285, + "total_acs": 68311, + "total_submitted": 126697, + "total_column_articles": 1291, "frontend_question_id": "785", "is_new_question": false }, @@ -43335,9 +43419,9 @@ "question__title": "Letter Case Permutation", "question__title_slug": "letter-case-permutation", "question__hide": false, - "total_acs": 96552, - "total_submitted": 133392, - "total_column_articles": 1099, + "total_acs": 97212, + "total_submitted": 134270, + "total_column_articles": 1109, "frontend_question_id": "784", "is_new_question": false }, @@ -43356,8 +43440,8 @@ "question__title": "Minimum Distance Between BST Nodes", "question__title_slug": "minimum-distance-between-bst-nodes", "question__hide": false, - "total_acs": 81223, - "total_submitted": 135415, + "total_acs": 81409, + "total_submitted": 135728, "total_column_articles": 797, "frontend_question_id": "783", "is_new_question": false @@ -43377,8 +43461,8 @@ "question__title": "Transform to Chessboard", "question__title_slug": "transform-to-chessboard", "question__hide": false, - "total_acs": 13956, - "total_submitted": 23266, + "total_acs": 13966, + "total_submitted": 23288, "total_column_articles": 149, "frontend_question_id": "782", "is_new_question": false @@ -43398,9 +43482,9 @@ "question__title": "Rabbits in Forest", "question__title_slug": "rabbits-in-forest", "question__hide": false, - "total_acs": 52545, - "total_submitted": 88450, - "total_column_articles": 770, + "total_acs": 52644, + "total_submitted": 88667, + "total_column_articles": 772, "frontend_question_id": "781", "is_new_question": false }, @@ -43419,8 +43503,8 @@ "question__title": "Reaching Points", "question__title_slug": "reaching-points", "question__hide": false, - "total_acs": 25759, - "total_submitted": 68168, + "total_acs": 25799, + "total_submitted": 68290, "total_column_articles": 259, "frontend_question_id": "780", "is_new_question": false @@ -43440,8 +43524,8 @@ "question__title": "K-th Symbol in Grammar", "question__title_slug": "k-th-symbol-in-grammar", "question__hide": false, - "total_acs": 49603, - "total_submitted": 99531, + "total_acs": 49688, + "total_submitted": 99678, "total_column_articles": 738, "frontend_question_id": "779", "is_new_question": false @@ -43461,9 +43545,9 @@ "question__title": "Swim in Rising Water", "question__title_slug": "swim-in-rising-water", "question__hide": false, - "total_acs": 30413, - "total_submitted": 51464, - "total_column_articles": 409, + "total_acs": 30481, + "total_submitted": 51588, + "total_column_articles": 410, "frontend_question_id": "778", "is_new_question": false }, @@ -43482,8 +43566,8 @@ "question__title": "Swap Adjacent in LR String", "question__title_slug": "swap-adjacent-in-lr-string", "question__hide": false, - "total_acs": 27254, - "total_submitted": 70487, + "total_acs": 27325, + "total_submitted": 70700, "total_column_articles": 301, "frontend_question_id": "777", "is_new_question": false @@ -43503,9 +43587,9 @@ "question__title": "Binary Search", "question__title_slug": "binary-search", "question__hide": false, - "total_acs": 791663, - "total_submitted": 1451584, - "total_column_articles": 3996, + "total_acs": 797676, + "total_submitted": 1461794, + "total_column_articles": 4038, "frontend_question_id": "704", "is_new_question": false }, @@ -43524,8 +43608,8 @@ "question__title": "Split BST", "question__title_slug": "split-bst", "question__hide": false, - "total_acs": 2466, - "total_submitted": 4155, + "total_acs": 2477, + "total_submitted": 4173, "total_column_articles": 47, "frontend_question_id": "776", "is_new_question": false @@ -43545,9 +43629,9 @@ "question__title": "Global and Local Inversions", "question__title_slug": "global-and-local-inversions", "question__hide": false, - "total_acs": 6928, - "total_submitted": 15135, - "total_column_articles": 113, + "total_acs": 6956, + "total_submitted": 15186, + "total_column_articles": 114, "frontend_question_id": "775", "is_new_question": false }, @@ -43566,9 +43650,9 @@ "question__title": "Kth Largest Element in a Stream", "question__title_slug": "kth-largest-element-in-a-stream", "question__hide": false, - "total_acs": 80501, - "total_submitted": 153817, - "total_column_articles": 737, + "total_acs": 80771, + "total_submitted": 154317, + "total_column_articles": 740, "frontend_question_id": "703", "is_new_question": false }, @@ -43587,8 +43671,8 @@ "question__title": "Minimize Max Distance to Gas Station", "question__title_slug": "minimize-max-distance-to-gas-station", "question__hide": false, - "total_acs": 2024, - "total_submitted": 3208, + "total_acs": 2030, + "total_submitted": 3217, "total_column_articles": 34, "frontend_question_id": "774", "is_new_question": false @@ -43608,9 +43692,9 @@ "question__title": "Sliding Puzzle", "question__title_slug": "sliding-puzzle", "question__hide": false, - "total_acs": 31656, - "total_submitted": 45054, - "total_column_articles": 474, + "total_acs": 31790, + "total_submitted": 45229, + "total_column_articles": 476, "frontend_question_id": "773", "is_new_question": false }, @@ -43629,8 +43713,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": 7230, - "total_submitted": 9706, + "total_acs": 7295, + "total_submitted": 9792, "total_column_articles": 115, "frontend_question_id": "702", "is_new_question": false @@ -43650,9 +43734,9 @@ "question__title": "Basic Calculator III", "question__title_slug": "basic-calculator-iii", "question__hide": false, - "total_acs": 11455, - "total_submitted": 21746, - "total_column_articles": 186, + "total_acs": 11535, + "total_submitted": 21879, + "total_column_articles": 188, "frontend_question_id": "772", "is_new_question": false }, @@ -43671,9 +43755,9 @@ "question__title": "Insert into a Binary Search Tree", "question__title_slug": "insert-into-a-binary-search-tree", "question__hide": false, - "total_acs": 156574, - "total_submitted": 218843, - "total_column_articles": 1145, + "total_acs": 157839, + "total_submitted": 220743, + "total_column_articles": 1157, "frontend_question_id": "701", "is_new_question": false }, @@ -43692,9 +43776,9 @@ "question__title": "Search in a Binary Search Tree", "question__title_slug": "search-in-a-binary-search-tree", "question__hide": false, - "total_acs": 209688, - "total_submitted": 270519, - "total_column_articles": 1546, + "total_acs": 211193, + "total_submitted": 272421, + "total_column_articles": 1568, "frontend_question_id": "700", "is_new_question": false }, @@ -43713,9 +43797,9 @@ "question__title": "Jewels and Stones", "question__title_slug": "jewels-and-stones", "question__hide": false, - "total_acs": 174441, - "total_submitted": 204683, - "total_column_articles": 1358, + "total_acs": 174840, + "total_submitted": 205163, + "total_column_articles": 1364, "frontend_question_id": "771", "is_new_question": false }, @@ -43734,8 +43818,8 @@ "question__title": "Basic Calculator IV", "question__title_slug": "basic-calculator-iv", "question__hide": false, - "total_acs": 1679, - "total_submitted": 2989, + "total_acs": 1685, + "total_submitted": 3002, "total_column_articles": 37, "frontend_question_id": "770", "is_new_question": false @@ -43755,9 +43839,9 @@ "question__title": "Max Chunks To Make Sorted", "question__title_slug": "max-chunks-to-make-sorted", "question__hide": false, - "total_acs": 51349, - "total_submitted": 86553, - "total_column_articles": 725, + "total_acs": 51495, + "total_submitted": 86805, + "total_column_articles": 727, "frontend_question_id": "769", "is_new_question": false }, @@ -43776,9 +43860,9 @@ "question__title": "Max Chunks To Make Sorted II", "question__title_slug": "max-chunks-to-make-sorted-ii", "question__hide": false, - "total_acs": 30239, - "total_submitted": 51392, - "total_column_articles": 367, + "total_acs": 30349, + "total_submitted": 51571, + "total_column_articles": 368, "frontend_question_id": "768", "is_new_question": false }, @@ -43797,9 +43881,9 @@ "question__title": "Reorganize String", "question__title_slug": "reorganize-string", "question__hide": false, - "total_acs": 48925, - "total_submitted": 101384, - "total_column_articles": 576, + "total_acs": 49074, + "total_submitted": 101637, + "total_column_articles": 581, "frontend_question_id": "767", "is_new_question": false }, @@ -43818,9 +43902,9 @@ "question__title": "Toeplitz Matrix", "question__title_slug": "toeplitz-matrix", "question__hide": false, - "total_acs": 64103, - "total_submitted": 91160, - "total_column_articles": 738, + "total_acs": 64387, + "total_submitted": 91497, + "total_column_articles": 740, "frontend_question_id": "766", "is_new_question": false }, @@ -43839,9 +43923,9 @@ "question__title": "N-ary Tree Postorder Traversal", "question__title_slug": "n-ary-tree-postorder-traversal", "question__hide": false, - "total_acs": 117874, - "total_submitted": 150415, - "total_column_articles": 873, + "total_acs": 118286, + "total_submitted": 150919, + "total_column_articles": 875, "frontend_question_id": "590", "is_new_question": false }, @@ -43860,9 +43944,9 @@ "question__title": "N-ary Tree Preorder Traversal", "question__title_slug": "n-ary-tree-preorder-traversal", "question__hide": false, - "total_acs": 169023, - "total_submitted": 221159, - "total_column_articles": 1062, + "total_acs": 169790, + "total_submitted": 222121, + "total_column_articles": 1064, "frontend_question_id": "589", "is_new_question": false }, @@ -43881,9 +43965,9 @@ "question__title": "Maximum Depth of N-ary Tree", "question__title_slug": "maximum-depth-of-n-ary-tree", "question__hide": false, - "total_acs": 126440, - "total_submitted": 169257, - "total_column_articles": 988, + "total_acs": 127041, + "total_submitted": 170071, + "total_column_articles": 991, "frontend_question_id": "559", "is_new_question": false }, @@ -43902,9 +43986,9 @@ "question__title": "Logical OR of Two Binary Grids Represented as Quad-Trees", "question__title_slug": "logical-or-of-two-binary-grids-represented-as-quad-trees", "question__hide": false, - "total_acs": 17621, - "total_submitted": 28000, - "total_column_articles": 156, + "total_acs": 17650, + "total_submitted": 28039, + "total_column_articles": 157, "frontend_question_id": "558", "is_new_question": false }, @@ -43923,8 +44007,8 @@ "question__title": "Construct Quad Tree", "question__title_slug": "construct-quad-tree", "question__hide": false, - "total_acs": 24409, - "total_submitted": 34224, + "total_acs": 24450, + "total_submitted": 34279, "total_column_articles": 321, "frontend_question_id": "427", "is_new_question": false @@ -43944,8 +44028,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": 1681, - "total_submitted": 2223, + "total_acs": 1690, + "total_submitted": 2232, "total_column_articles": 43, "frontend_question_id": "431", "is_new_question": false @@ -43965,9 +44049,9 @@ "question__title": "Couples Holding Hands", "question__title_slug": "couples-holding-hands", "question__hide": false, - "total_acs": 35257, - "total_submitted": 53387, - "total_column_articles": 527, + "total_acs": 35423, + "total_submitted": 53623, + "total_column_articles": 528, "frontend_question_id": "765", "is_new_question": false }, @@ -43986,9 +44070,9 @@ "question__title": "Largest Plus Sign", "question__title_slug": "largest-plus-sign", "question__hide": false, - "total_acs": 5953, - "total_submitted": 11964, - "total_column_articles": 82, + "total_acs": 16004, + "total_submitted": 30063, + "total_column_articles": 212, "frontend_question_id": "764", "is_new_question": false }, @@ -44007,9 +44091,9 @@ "question__title": "Partition Labels", "question__title_slug": "partition-labels", "question__hide": false, - "total_acs": 139852, - "total_submitted": 181992, - "total_column_articles": 1419, + "total_acs": 140668, + "total_submitted": 183017, + "total_column_articles": 1423, "frontend_question_id": "763", "is_new_question": false }, @@ -44028,8 +44112,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": 53898, - "total_submitted": 71368, + "total_acs": 53981, + "total_submitted": 71482, "total_column_articles": 480, "frontend_question_id": "762", "is_new_question": false @@ -44049,9 +44133,9 @@ "question__title": "Flatten a Multilevel Doubly Linked List", "question__title_slug": "flatten-a-multilevel-doubly-linked-list", "question__hide": false, - "total_acs": 57352, - "total_submitted": 96797, - "total_column_articles": 834, + "total_acs": 57695, + "total_submitted": 97348, + "total_column_articles": 843, "frontend_question_id": "430", "is_new_question": false }, @@ -44070,8 +44154,8 @@ "question__title": "Serialize and Deserialize N-ary Tree", "question__title_slug": "serialize-and-deserialize-n-ary-tree", "question__hide": false, - "total_acs": 4860, - "total_submitted": 7111, + "total_acs": 4889, + "total_submitted": 7152, "total_column_articles": 80, "frontend_question_id": "428", "is_new_question": false @@ -44091,9 +44175,9 @@ "question__title": "N-ary Tree Level Order Traversal", "question__title_slug": "n-ary-tree-level-order-traversal", "question__hide": false, - "total_acs": 134833, - "total_submitted": 186028, - "total_column_articles": 1061, + "total_acs": 135569, + "total_submitted": 187025, + "total_column_articles": 1067, "frontend_question_id": "429", "is_new_question": false }, @@ -44112,9 +44196,9 @@ "question__title": "Special Binary String", "question__title_slug": "special-binary-string", "question__hide": false, - "total_acs": 16529, - "total_submitted": 21868, - "total_column_articles": 146, + "total_acs": 16545, + "total_submitted": 21898, + "total_column_articles": 147, "frontend_question_id": "761", "is_new_question": false }, @@ -44133,8 +44217,8 @@ "question__title": "Find Anagram Mappings", "question__title_slug": "find-anagram-mappings", "question__hide": false, - "total_acs": 5106, - "total_submitted": 6091, + "total_acs": 5126, + "total_submitted": 6113, "total_column_articles": 118, "frontend_question_id": "760", "is_new_question": false @@ -44154,8 +44238,8 @@ "question__title": "Employee Free Time", "question__title_slug": "employee-free-time", "question__hide": false, - "total_acs": 3826, - "total_submitted": 5465, + "total_acs": 3843, + "total_submitted": 5487, "total_column_articles": 71, "frontend_question_id": "759", "is_new_question": false @@ -44175,8 +44259,8 @@ "question__title": "Bold Words in String", "question__title_slug": "bold-words-in-string", "question__hide": false, - "total_acs": 4192, - "total_submitted": 8748, + "total_acs": 4194, + "total_submitted": 8750, "total_column_articles": 78, "frontend_question_id": "758", "is_new_question": false @@ -44196,8 +44280,8 @@ "question__title": "Set Intersection Size At Least Two", "question__title_slug": "set-intersection-size-at-least-two", "question__hide": false, - "total_acs": 17557, - "total_submitted": 31313, + "total_acs": 17579, + "total_submitted": 31362, "total_column_articles": 189, "frontend_question_id": "757", "is_new_question": false @@ -44217,9 +44301,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": 12409, - "total_submitted": 18232, - "total_column_articles": 176, + "total_acs": 12464, + "total_submitted": 18318, + "total_column_articles": 178, "frontend_question_id": "426", "is_new_question": false }, @@ -44238,8 +44322,8 @@ "question__title": "Pyramid Transition Matrix", "question__title_slug": "pyramid-transition-matrix", "question__hide": false, - "total_acs": 6086, - "total_submitted": 11548, + "total_acs": 6141, + "total_submitted": 11653, "total_column_articles": 94, "frontend_question_id": "756", "is_new_question": false @@ -44259,8 +44343,8 @@ "question__title": "Pour Water", "question__title_slug": "pour-water", "question__hide": false, - "total_acs": 1793, - "total_submitted": 3694, + "total_acs": 1801, + "total_submitted": 3711, "total_column_articles": 40, "frontend_question_id": "755", "is_new_question": false @@ -44280,9 +44364,9 @@ "question__title": "Reach a Number", "question__title_slug": "reach-a-number", "question__hide": false, - "total_acs": 11508, - "total_submitted": 25838, - "total_column_articles": 133, + "total_acs": 34957, + "total_submitted": 68084, + "total_column_articles": 388, "frontend_question_id": "754", "is_new_question": false }, @@ -44301,8 +44385,8 @@ "question__title": "Cracking the Safe", "question__title_slug": "cracking-the-safe", "question__hide": false, - "total_acs": 4991, - "total_submitted": 8134, + "total_acs": 5025, + "total_submitted": 8187, "total_column_articles": 63, "frontend_question_id": "753", "is_new_question": false @@ -44322,9 +44406,9 @@ "question__title": "Open the Lock", "question__title_slug": "open-the-lock", "question__hide": false, - "total_acs": 107190, - "total_submitted": 203216, - "total_column_articles": 1105, + "total_acs": 107695, + "total_submitted": 204215, + "total_column_articles": 1114, "frontend_question_id": "752", "is_new_question": false }, @@ -44343,8 +44427,8 @@ "question__title": "IP to CIDR", "question__title_slug": "ip-to-cidr", "question__hide": false, - "total_acs": 1758, - "total_submitted": 3689, + "total_acs": 1782, + "total_submitted": 3732, "total_column_articles": 33, "frontend_question_id": "751", "is_new_question": false @@ -44364,9 +44448,9 @@ "question__title": "Number Of Corner Rectangles", "question__title_slug": "number-of-corner-rectangles", "question__hide": false, - "total_acs": 3004, - "total_submitted": 4149, - "total_column_articles": 56, + "total_acs": 3013, + "total_submitted": 4161, + "total_column_articles": 57, "frontend_question_id": "750", "is_new_question": false }, @@ -44385,9 +44469,9 @@ "question__title": "Contain Virus", "question__title_slug": "contain-virus", "question__hide": false, - "total_acs": 13328, - "total_submitted": 19173, - "total_column_articles": 137, + "total_acs": 13350, + "total_submitted": 19203, + "total_column_articles": 138, "frontend_question_id": "749", "is_new_question": false }, @@ -44406,8 +44490,8 @@ "question__title": "Shortest Completing Word", "question__title_slug": "shortest-completing-word", "question__hide": false, - "total_acs": 44137, - "total_submitted": 65623, + "total_acs": 44236, + "total_submitted": 65795, "total_column_articles": 550, "frontend_question_id": "748", "is_new_question": false @@ -44427,9 +44511,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": 87900, - "total_submitted": 190916, - "total_column_articles": 890, + "total_acs": 88073, + "total_submitted": 191258, + "total_column_articles": 895, "frontend_question_id": "747", "is_new_question": false }, @@ -44448,9 +44532,9 @@ "question__title": "Min Cost Climbing Stairs", "question__title_slug": "min-cost-climbing-stairs", "question__hide": false, - "total_acs": 259749, - "total_submitted": 409623, - "total_column_articles": 2103, + "total_acs": 261408, + "total_submitted": 411861, + "total_column_articles": 2117, "frontend_question_id": "746", "is_new_question": false }, @@ -44469,8 +44553,8 @@ "question__title": "Prefix and Suffix Search", "question__title_slug": "prefix-and-suffix-search", "question__hide": false, - "total_acs": 23968, - "total_submitted": 54582, + "total_acs": 24005, + "total_submitted": 54676, "total_column_articles": 252, "frontend_question_id": "745", "is_new_question": false @@ -44490,9 +44574,9 @@ "question__title": "Find Smallest Letter Greater Than Target", "question__title_slug": "find-smallest-letter-greater-than-target", "question__hide": false, - "total_acs": 101803, - "total_submitted": 211077, - "total_column_articles": 888, + "total_acs": 102284, + "total_submitted": 212086, + "total_column_articles": 891, "frontend_question_id": "744", "is_new_question": false }, @@ -44511,9 +44595,9 @@ "question__title": "Network Delay Time", "question__title_slug": "network-delay-time", "question__hide": false, - "total_acs": 93460, - "total_submitted": 170057, - "total_column_articles": 770, + "total_acs": 93973, + "total_submitted": 170918, + "total_column_articles": 772, "frontend_question_id": "743", "is_new_question": false }, @@ -44532,8 +44616,8 @@ "question__title": "Closest Leaf in a Binary Tree", "question__title_slug": "closest-leaf-in-a-binary-tree", "question__hide": false, - "total_acs": 2381, - "total_submitted": 4896, + "total_acs": 2384, + "total_submitted": 4899, "total_column_articles": 76, "frontend_question_id": "742", "is_new_question": false @@ -44553,9 +44637,9 @@ "question__title": "To Lower Case", "question__title_slug": "to-lower-case", "question__hide": false, - "total_acs": 114938, - "total_submitted": 148960, - "total_column_articles": 849, + "total_acs": 115248, + "total_submitted": 149362, + "total_column_articles": 851, "frontend_question_id": "709", "is_new_question": false }, @@ -44574,9 +44658,9 @@ "question__title": "Cherry Pickup", "question__title_slug": "cherry-pickup", "question__hide": false, - "total_acs": 18151, - "total_submitted": 36021, - "total_column_articles": 134, + "total_acs": 18402, + "total_submitted": 36398, + "total_column_articles": 136, "frontend_question_id": "741", "is_new_question": false }, @@ -44595,9 +44679,9 @@ "question__title": "Delete and Earn", "question__title_slug": "delete-and-earn", "question__hide": false, - "total_acs": 86861, - "total_submitted": 138969, - "total_column_articles": 883, + "total_acs": 87168, + "total_submitted": 139449, + "total_column_articles": 888, "frontend_question_id": "740", "is_new_question": false }, @@ -44616,9 +44700,9 @@ "question__title": "Daily Temperatures", "question__title_slug": "daily-temperatures", "question__hide": false, - "total_acs": 372582, - "total_submitted": 535547, - "total_column_articles": 2393, + "total_acs": 374718, + "total_submitted": 538789, + "total_column_articles": 2402, "frontend_question_id": "739", "is_new_question": false }, @@ -44637,9 +44721,9 @@ "question__title": "Monotone Increasing Digits", "question__title_slug": "monotone-increasing-digits", "question__hide": false, - "total_acs": 74039, - "total_submitted": 147286, - "total_column_articles": 838, + "total_acs": 74480, + "total_submitted": 148203, + "total_column_articles": 840, "frontend_question_id": "738", "is_new_question": false }, @@ -44658,9 +44742,9 @@ "question__title": "Sentence Similarity II", "question__title_slug": "sentence-similarity-ii", "question__hide": false, - "total_acs": 5614, - "total_submitted": 11757, - "total_column_articles": 103, + "total_acs": 5645, + "total_submitted": 11807, + "total_column_articles": 104, "frontend_question_id": "737", "is_new_question": false }, @@ -44679,8 +44763,8 @@ "question__title": "Parse Lisp Expression", "question__title_slug": "parse-lisp-expression", "question__hide": false, - "total_acs": 13174, - "total_submitted": 19613, + "total_acs": 13192, + "total_submitted": 19648, "total_column_articles": 149, "frontend_question_id": "736", "is_new_question": false @@ -44700,9 +44784,9 @@ "question__title": "Asteroid Collision", "question__title_slug": "asteroid-collision", "question__hide": false, - "total_acs": 66637, - "total_submitted": 153851, - "total_column_articles": 767, + "total_acs": 66849, + "total_submitted": 154327, + "total_column_articles": 771, "frontend_question_id": "735", "is_new_question": false }, @@ -44721,9 +44805,9 @@ "question__title": "Sentence Similarity", "question__title_slug": "sentence-similarity", "question__hide": false, - "total_acs": 3052, - "total_submitted": 6411, - "total_column_articles": 61, + "total_acs": 3065, + "total_submitted": 6439, + "total_column_articles": 62, "frontend_question_id": "734", "is_new_question": false }, @@ -44742,9 +44826,9 @@ "question__title": "Flood Fill", "question__title_slug": "flood-fill", "question__hide": false, - "total_acs": 137930, - "total_submitted": 236363, - "total_column_articles": 1148, + "total_acs": 138715, + "total_submitted": 237664, + "total_column_articles": 1155, "frontend_question_id": "733", "is_new_question": false }, @@ -44763,8 +44847,8 @@ "question__title": "My Calendar III", "question__title_slug": "my-calendar-iii", "question__hide": false, - "total_acs": 22939, - "total_submitted": 31576, + "total_acs": 22996, + "total_submitted": 31685, "total_column_articles": 228, "frontend_question_id": "732", "is_new_question": false @@ -44784,8 +44868,8 @@ "question__title": "My Calendar II", "question__title_slug": "my-calendar-ii", "question__hide": false, - "total_acs": 26883, - "total_submitted": 42639, + "total_acs": 26946, + "total_submitted": 42783, "total_column_articles": 236, "frontend_question_id": "731", "is_new_question": false @@ -44805,8 +44889,8 @@ "question__title": "Count Different Palindromic Subsequences", "question__title_slug": "count-different-palindromic-subsequences", "question__hide": false, - "total_acs": 17110, - "total_submitted": 26582, + "total_acs": 17125, + "total_submitted": 26600, "total_column_articles": 120, "frontend_question_id": "730", "is_new_question": false @@ -44826,9 +44910,9 @@ "question__title": "My Calendar I", "question__title_slug": "my-calendar-i", "question__hide": false, - "total_acs": 47403, - "total_submitted": 80910, - "total_column_articles": 410, + "total_acs": 47612, + "total_submitted": 81289, + "total_column_articles": 411, "frontend_question_id": "729", "is_new_question": false }, @@ -44847,9 +44931,9 @@ "question__title": "Self Dividing Numbers", "question__title_slug": "self-dividing-numbers", "question__hide": false, - "total_acs": 74936, - "total_submitted": 96123, - "total_column_articles": 713, + "total_acs": 75074, + "total_submitted": 96304, + "total_column_articles": 714, "frontend_question_id": "728", "is_new_question": false }, @@ -44868,8 +44952,8 @@ "question__title": "Minimum Window Subsequence", "question__title_slug": "minimum-window-subsequence", "question__hide": false, - "total_acs": 5335, - "total_submitted": 12759, + "total_acs": 5363, + "total_submitted": 12807, "total_column_articles": 78, "frontend_question_id": "727", "is_new_question": false @@ -44889,9 +44973,9 @@ "question__title": "Number of Atoms", "question__title_slug": "number-of-atoms", "question__hide": false, - "total_acs": 26026, - "total_submitted": 47158, - "total_column_articles": 468, + "total_acs": 26074, + "total_submitted": 47237, + "total_column_articles": 470, "frontend_question_id": "726", "is_new_question": false }, @@ -44910,8 +44994,8 @@ "question__title": "Split Linked List in Parts", "question__title_slug": "split-linked-list-in-parts", "question__hide": false, - "total_acs": 57705, - "total_submitted": 95407, + "total_acs": 57814, + "total_submitted": 95603, "total_column_articles": 724, "frontend_question_id": "725", "is_new_question": false @@ -44931,9 +45015,9 @@ "question__title": "Find Pivot Index", "question__title_slug": "find-pivot-index", "question__hide": false, - "total_acs": 241012, - "total_submitted": 476362, - "total_column_articles": 1350, + "total_acs": 243028, + "total_submitted": 479975, + "total_column_articles": 1356, "frontend_question_id": "724", "is_new_question": false }, @@ -44952,8 +45036,8 @@ "question__title": "Candy Crush", "question__title_slug": "candy-crush", "question__hide": false, - "total_acs": 2086, - "total_submitted": 2860, + "total_acs": 2109, + "total_submitted": 2888, "total_column_articles": 53, "frontend_question_id": "723", "is_new_question": false @@ -44973,8 +45057,8 @@ "question__title": "Remove Comments", "question__title_slug": "remove-comments", "question__hide": false, - "total_acs": 7106, - "total_submitted": 21282, + "total_acs": 7135, + "total_submitted": 21357, "total_column_articles": 94, "frontend_question_id": "722", "is_new_question": false @@ -44994,9 +45078,9 @@ "question__title": "Accounts Merge", "question__title_slug": "accounts-merge", "question__hide": false, - "total_acs": 36510, - "total_submitted": 76303, - "total_column_articles": 406, + "total_acs": 36830, + "total_submitted": 76885, + "total_column_articles": 411, "frontend_question_id": "721", "is_new_question": false }, @@ -45015,9 +45099,9 @@ "question__title": "Longest Word in Dictionary", "question__title_slug": "longest-word-in-dictionary", "question__hide": false, - "total_acs": 63347, - "total_submitted": 122058, - "total_column_articles": 687, + "total_acs": 63454, + "total_submitted": 122302, + "total_column_articles": 689, "frontend_question_id": "720", "is_new_question": false }, @@ -45036,9 +45120,9 @@ "question__title": "Find K-th Smallest Pair Distance", "question__title_slug": "find-k-th-smallest-pair-distance", "question__hide": false, - "total_acs": 31983, - "total_submitted": 68658, - "total_column_articles": 264, + "total_acs": 32062, + "total_submitted": 68817, + "total_column_articles": 265, "frontend_question_id": "719", "is_new_question": false }, @@ -45057,9 +45141,9 @@ "question__title": "Maximum Length of Repeated Subarray", "question__title_slug": "maximum-length-of-repeated-subarray", "question__hide": false, - "total_acs": 159447, - "total_submitted": 279003, - "total_column_articles": 922, + "total_acs": 160328, + "total_submitted": 280613, + "total_column_articles": 925, "frontend_question_id": "718", "is_new_question": false }, @@ -45078,9 +45162,9 @@ "question__title": "1-bit and 2-bit Characters", "question__title_slug": "1-bit-and-2-bit-characters", "question__hide": false, - "total_acs": 65292, - "total_submitted": 117800, - "total_column_articles": 788, + "total_acs": 65405, + "total_submitted": 118048, + "total_column_articles": 790, "frontend_question_id": "717", "is_new_question": false }, @@ -45099,9 +45183,9 @@ "question__title": "Max Stack", "question__title_slug": "max-stack", "question__hide": false, - "total_acs": 6658, - "total_submitted": 14463, - "total_column_articles": 104, + "total_acs": 6689, + "total_submitted": 14537, + "total_column_articles": 105, "frontend_question_id": "716", "is_new_question": false }, @@ -45120,9 +45204,9 @@ "question__title": "Range Module", "question__title_slug": "range-module", "question__hide": false, - "total_acs": 18376, - "total_submitted": 34251, - "total_column_articles": 195, + "total_acs": 18416, + "total_submitted": 34344, + "total_column_articles": 196, "frontend_question_id": "715", "is_new_question": false }, @@ -45141,9 +45225,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": 183956, - "total_submitted": 246502, - "total_column_articles": 1139, + "total_acs": 184989, + "total_submitted": 247913, + "total_column_articles": 1140, "frontend_question_id": "714", "is_new_question": false }, @@ -45162,9 +45246,9 @@ "question__title": "Subarray Product Less Than K", "question__title_slug": "subarray-product-less-than-k", "question__hide": false, - "total_acs": 88324, - "total_submitted": 180462, - "total_column_articles": 802, + "total_acs": 88738, + "total_submitted": 181279, + "total_column_articles": 805, "frontend_question_id": "713", "is_new_question": false }, @@ -45183,8 +45267,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": 26715, - "total_submitted": 39101, + "total_acs": 26834, + "total_submitted": 39272, "total_column_articles": 291, "frontend_question_id": "712", "is_new_question": false @@ -45204,8 +45288,8 @@ "question__title": "Number of Distinct Islands II", "question__title_slug": "number-of-distinct-islands-ii", "question__hide": false, - "total_acs": 1262, - "total_submitted": 2179, + "total_acs": 1270, + "total_submitted": 2193, "total_column_articles": 40, "frontend_question_id": "711", "is_new_question": false @@ -45225,8 +45309,8 @@ "question__title": "Falling Squares", "question__title_slug": "falling-squares", "question__hide": false, - "total_acs": 21470, - "total_submitted": 39122, + "total_acs": 21526, + "total_submitted": 39233, "total_column_articles": 219, "frontend_question_id": "699", "is_new_question": false @@ -45246,9 +45330,9 @@ "question__title": "Partition to K Equal Sum Subsets", "question__title_slug": "partition-to-k-equal-sum-subsets", "question__hide": false, - "total_acs": 90245, - "total_submitted": 211822, - "total_column_articles": 1224, + "total_acs": 90689, + "total_submitted": 212890, + "total_column_articles": 1234, "frontend_question_id": "698", "is_new_question": false }, @@ -45267,9 +45351,9 @@ "question__title": "Degree of an Array", "question__title_slug": "degree-of-an-array", "question__hide": false, - "total_acs": 83199, - "total_submitted": 139439, - "total_column_articles": 1039, + "total_acs": 83496, + "total_submitted": 140013, + "total_column_articles": 1042, "frontend_question_id": "697", "is_new_question": false }, @@ -45288,9 +45372,9 @@ "question__title": "Count Binary Substrings", "question__title_slug": "count-binary-substrings", "question__hide": false, - "total_acs": 65513, - "total_submitted": 102566, - "total_column_articles": 590, + "total_acs": 65694, + "total_submitted": 102865, + "total_column_articles": 592, "frontend_question_id": "696", "is_new_question": false }, @@ -45309,9 +45393,9 @@ "question__title": "Max Area of Island", "question__title_slug": "max-area-of-island", "question__hide": false, - "total_acs": 247981, - "total_submitted": 365194, - "total_column_articles": 2298, + "total_acs": 249121, + "total_submitted": 366829, + "total_column_articles": 2305, "frontend_question_id": "695", "is_new_question": false }, @@ -45330,9 +45414,9 @@ "question__title": "Number of Distinct Islands", "question__title_slug": "number-of-distinct-islands", "question__hide": false, - "total_acs": 9313, - "total_submitted": 16344, - "total_column_articles": 158, + "total_acs": 9385, + "total_submitted": 16448, + "total_column_articles": 160, "frontend_question_id": "694", "is_new_question": false }, @@ -45351,9 +45435,9 @@ "question__title": "Binary Number with Alternating Bits", "question__title_slug": "binary-number-with-alternating-bits", "question__hide": false, - "total_acs": 73288, - "total_submitted": 112327, - "total_column_articles": 791, + "total_acs": 73438, + "total_submitted": 112611, + "total_column_articles": 792, "frontend_question_id": "693", "is_new_question": false }, @@ -45372,9 +45456,9 @@ "question__title": "Top K Frequent Words", "question__title_slug": "top-k-frequent-words", "question__hide": false, - "total_acs": 95095, - "total_submitted": 167627, - "total_column_articles": 996, + "total_acs": 95635, + "total_submitted": 168623, + "total_column_articles": 1000, "frontend_question_id": "692", "is_new_question": false }, @@ -45393,8 +45477,8 @@ "question__title": "Stickers to Spell Word", "question__title_slug": "stickers-to-spell-word", "question__hide": false, - "total_acs": 22123, - "total_submitted": 36653, + "total_acs": 22181, + "total_submitted": 36776, "total_column_articles": 192, "frontend_question_id": "691", "is_new_question": false @@ -45414,9 +45498,9 @@ "question__title": "Employee Importance", "question__title_slug": "employee-importance", "question__hide": false, - "total_acs": 62903, - "total_submitted": 96144, - "total_column_articles": 654, + "total_acs": 63013, + "total_submitted": 96286, + "total_column_articles": 655, "frontend_question_id": "690", "is_new_question": false }, @@ -45435,8 +45519,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": 21889, - "total_submitted": 38892, + "total_acs": 21917, + "total_submitted": 38947, "total_column_articles": 285, "frontend_question_id": "689", "is_new_question": false @@ -45456,9 +45540,9 @@ "question__title": "Knight Probability in Chessboard", "question__title_slug": "knight-probability-in-chessboard", "question__hide": false, - "total_acs": 34119, - "total_submitted": 58604, - "total_column_articles": 379, + "total_acs": 34158, + "total_submitted": 58677, + "total_column_articles": 378, "frontend_question_id": "688", "is_new_question": false }, @@ -45477,8 +45561,8 @@ "question__title": "Longest Univalue Path", "question__title_slug": "longest-univalue-path", "question__hide": false, - "total_acs": 77667, - "total_submitted": 163440, + "total_acs": 77815, + "total_submitted": 163737, "total_column_articles": 639, "frontend_question_id": "687", "is_new_question": false @@ -45498,8 +45582,8 @@ "question__title": "Repeated String Match", "question__title_slug": "repeated-string-match", "question__hide": false, - "total_acs": 47763, - "total_submitted": 119625, + "total_acs": 47848, + "total_submitted": 119885, "total_column_articles": 619, "frontend_question_id": "686", "is_new_question": false @@ -45519,8 +45603,8 @@ "question__title": "Redundant Connection II", "question__title_slug": "redundant-connection-ii", "question__hide": false, - "total_acs": 26094, - "total_submitted": 61745, + "total_acs": 26218, + "total_submitted": 62009, "total_column_articles": 328, "frontend_question_id": "685", "is_new_question": false @@ -45540,9 +45624,9 @@ "question__title": "Redundant Connection", "question__title_slug": "redundant-connection", "question__hide": false, - "total_acs": 86915, - "total_submitted": 128845, - "total_column_articles": 857, + "total_acs": 87377, + "total_submitted": 129509, + "total_column_articles": 862, "frontend_question_id": "684", "is_new_question": false }, @@ -45561,8 +45645,8 @@ "question__title": "K Empty Slots", "question__title_slug": "k-empty-slots", "question__hide": false, - "total_acs": 3674, - "total_submitted": 8073, + "total_acs": 3700, + "total_submitted": 8166, "total_column_articles": 77, "frontend_question_id": "683", "is_new_question": false @@ -45582,8 +45666,8 @@ "question__title": "Baseball Game", "question__title_slug": "baseball-game", "question__hide": false, - "total_acs": 87111, - "total_submitted": 121395, + "total_acs": 87322, + "total_submitted": 121696, "total_column_articles": 937, "frontend_question_id": "682", "is_new_question": false @@ -45603,8 +45687,8 @@ "question__title": "Next Closest Time", "question__title_slug": "next-closest-time", "question__hide": false, - "total_acs": 4105, - "total_submitted": 8283, + "total_acs": 4129, + "total_submitted": 8327, "total_column_articles": 87, "frontend_question_id": "681", "is_new_question": false @@ -45624,9 +45708,9 @@ "question__title": "Valid Palindrome II", "question__title_slug": "valid-palindrome-ii", "question__hide": false, - "total_acs": 122358, - "total_submitted": 305558, - "total_column_articles": 1103, + "total_acs": 122834, + "total_submitted": 306846, + "total_column_articles": 1109, "frontend_question_id": "680", "is_new_question": false }, @@ -45645,9 +45729,9 @@ "question__title": "24 Game", "question__title_slug": "24-game", "question__hide": false, - "total_acs": 37504, - "total_submitted": 69581, - "total_column_articles": 347, + "total_acs": 37607, + "total_submitted": 69782, + "total_column_articles": 349, "frontend_question_id": "679", "is_new_question": false }, @@ -45666,9 +45750,9 @@ "question__title": "Valid Parenthesis String", "question__title_slug": "valid-parenthesis-string", "question__hide": false, - "total_acs": 62198, - "total_submitted": 158983, - "total_column_articles": 634, + "total_acs": 62395, + "total_submitted": 159517, + "total_column_articles": 637, "frontend_question_id": "678", "is_new_question": false }, @@ -45687,9 +45771,9 @@ "question__title": "Map Sum Pairs", "question__title_slug": "map-sum-pairs", "question__hide": false, - "total_acs": 45015, - "total_submitted": 68263, - "total_column_articles": 671, + "total_acs": 45197, + "total_submitted": 68555, + "total_column_articles": 674, "frontend_question_id": "677", "is_new_question": false }, @@ -45708,9 +45792,9 @@ "question__title": "Implement Magic Dictionary", "question__title_slug": "implement-magic-dictionary", "question__hide": false, - "total_acs": 36764, - "total_submitted": 56251, - "total_column_articles": 455, + "total_acs": 36865, + "total_submitted": 56426, + "total_column_articles": 456, "frontend_question_id": "676", "is_new_question": false }, @@ -45729,9 +45813,9 @@ "question__title": "Cut Off Trees for Golf Event", "question__title_slug": "cut-off-trees-for-golf-event", "question__hide": false, - "total_acs": 20643, - "total_submitted": 39023, - "total_column_articles": 212, + "total_acs": 20678, + "total_submitted": 39108, + "total_column_articles": 213, "frontend_question_id": "675", "is_new_question": false }, @@ -45750,9 +45834,9 @@ "question__title": "Longest Continuous Increasing Subsequence", "question__title_slug": "longest-continuous-increasing-subsequence", "question__hide": false, - "total_acs": 160372, - "total_submitted": 295094, - "total_column_articles": 1159, + "total_acs": 161270, + "total_submitted": 296572, + "total_column_articles": 1161, "frontend_question_id": "674", "is_new_question": false }, @@ -45771,9 +45855,9 @@ "question__title": "Number of Longest Increasing Subsequence", "question__title_slug": "number-of-longest-increasing-subsequence", "question__hide": false, - "total_acs": 75906, - "total_submitted": 170895, - "total_column_articles": 589, + "total_acs": 76280, + "total_submitted": 171677, + "total_column_articles": 591, "frontend_question_id": "673", "is_new_question": false }, @@ -45792,9 +45876,9 @@ "question__title": "Bulb Switcher II", "question__title_slug": "bulb-switcher-ii", "question__hide": false, - "total_acs": 25817, - "total_submitted": 42316, - "total_column_articles": 255, + "total_acs": 25841, + "total_submitted": 42349, + "total_column_articles": 256, "frontend_question_id": "672", "is_new_question": false }, @@ -45813,9 +45897,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": 65381, - "total_submitted": 135993, - "total_column_articles": 825, + "total_acs": 65537, + "total_submitted": 136361, + "total_column_articles": 828, "frontend_question_id": "671", "is_new_question": false }, @@ -45834,8 +45918,8 @@ "question__title": "Maximum Swap", "question__title_slug": "maximum-swap", "question__hide": false, - "total_acs": 63288, - "total_submitted": 132193, + "total_acs": 63463, + "total_submitted": 132601, "total_column_articles": 907, "frontend_question_id": "670", "is_new_question": false @@ -45855,9 +45939,9 @@ "question__title": "Trim a Binary Search Tree", "question__title_slug": "trim-a-binary-search-tree", "question__hide": false, - "total_acs": 101599, - "total_submitted": 149322, - "total_column_articles": 819, + "total_acs": 102392, + "total_submitted": 150580, + "total_column_articles": 820, "frontend_question_id": "669", "is_new_question": false }, @@ -45876,9 +45960,9 @@ "question__title": "Kth Smallest Number in Multiplication Table", "question__title_slug": "kth-smallest-number-in-multiplication-table", "question__hide": false, - "total_acs": 29138, - "total_submitted": 49746, - "total_column_articles": 266, + "total_acs": 29184, + "total_submitted": 49841, + "total_column_articles": 267, "frontend_question_id": "668", "is_new_question": false }, @@ -45897,8 +45981,8 @@ "question__title": "Beautiful Arrangement II", "question__title_slug": "beautiful-arrangement-ii", "question__hide": false, - "total_acs": 34422, - "total_submitted": 51716, + "total_acs": 34488, + "total_submitted": 51810, "total_column_articles": 513, "frontend_question_id": "667", "is_new_question": false @@ -45918,8 +46002,8 @@ "question__title": "Path Sum IV", "question__title_slug": "path-sum-iv", "question__hide": false, - "total_acs": 3171, - "total_submitted": 5069, + "total_acs": 3193, + "total_submitted": 5101, "total_column_articles": 103, "frontend_question_id": "666", "is_new_question": false @@ -45939,9 +46023,9 @@ "question__title": "Non-decreasing Array", "question__title_slug": "non-decreasing-array", "question__hide": false, - "total_acs": 92221, - "total_submitted": 334238, - "total_column_articles": 1120, + "total_acs": 92454, + "total_submitted": 335044, + "total_column_articles": 1123, "frontend_question_id": "665", "is_new_question": false }, @@ -45960,9 +46044,9 @@ "question__title": "Strange Printer", "question__title_slug": "strange-printer", "question__hide": false, - "total_acs": 25519, - "total_submitted": 39125, - "total_column_articles": 213, + "total_acs": 25577, + "total_submitted": 39209, + "total_column_articles": 216, "frontend_question_id": "664", "is_new_question": false }, @@ -45981,8 +46065,8 @@ "question__title": "Equal Tree Partition", "question__title_slug": "equal-tree-partition", "question__hide": false, - "total_acs": 2594, - "total_submitted": 5679, + "total_acs": 2600, + "total_submitted": 5688, "total_column_articles": 54, "frontend_question_id": "663", "is_new_question": false @@ -46002,9 +46086,9 @@ "question__title": "Maximum Width of Binary Tree", "question__title_slug": "maximum-width-of-binary-tree", "question__hide": false, - "total_acs": 79534, - "total_submitted": 182037, - "total_column_articles": 756, + "total_acs": 79900, + "total_submitted": 183066, + "total_column_articles": 760, "frontend_question_id": "662", "is_new_question": false }, @@ -46023,8 +46107,8 @@ "question__title": "Image Smoother", "question__title_slug": "image-smoother", "question__hide": false, - "total_acs": 50028, - "total_submitted": 77633, + "total_acs": 50132, + "total_submitted": 77829, "total_column_articles": 544, "frontend_question_id": "661", "is_new_question": false @@ -46044,9 +46128,9 @@ "question__title": "Remove 9", "question__title_slug": "remove-9", "question__hide": false, - "total_acs": 1201, - "total_submitted": 1839, - "total_column_articles": 35, + "total_acs": 1219, + "total_submitted": 1865, + "total_column_articles": 36, "frontend_question_id": "660", "is_new_question": false }, @@ -46065,9 +46149,9 @@ "question__title": "Split Array into Consecutive Subsequences", "question__title_slug": "split-array-into-consecutive-subsequences", "question__hide": false, - "total_acs": 34309, - "total_submitted": 62969, - "total_column_articles": 328, + "total_acs": 34382, + "total_submitted": 63107, + "total_column_articles": 329, "frontend_question_id": "659", "is_new_question": false }, @@ -46086,9 +46170,9 @@ "question__title": "Find K Closest Elements", "question__title_slug": "find-k-closest-elements", "question__hide": false, - "total_acs": 81073, - "total_submitted": 168347, - "total_column_articles": 770, + "total_acs": 81510, + "total_submitted": 169379, + "total_column_articles": 774, "frontend_question_id": "658", "is_new_question": false }, @@ -46107,9 +46191,9 @@ "question__title": "Robot Return to Origin", "question__title_slug": "robot-return-to-origin", "question__hide": false, - "total_acs": 97114, - "total_submitted": 123358, - "total_column_articles": 773, + "total_acs": 97377, + "total_submitted": 123692, + "total_column_articles": 775, "frontend_question_id": "657", "is_new_question": false }, @@ -46128,8 +46212,8 @@ "question__title": "Coin Path", "question__title_slug": "coin-path", "question__hide": false, - "total_acs": 1321, - "total_submitted": 3972, + "total_acs": 1328, + "total_submitted": 3988, "total_column_articles": 35, "frontend_question_id": "656", "is_new_question": false @@ -46149,9 +46233,9 @@ "question__title": "Print Binary Tree", "question__title_slug": "print-binary-tree", "question__hide": false, - "total_acs": 34365, - "total_submitted": 49488, - "total_column_articles": 503, + "total_acs": 34417, + "total_submitted": 49578, + "total_column_articles": 506, "frontend_question_id": "655", "is_new_question": false }, @@ -46170,9 +46254,9 @@ "question__title": "Maximum Binary Tree", "question__title_slug": "maximum-binary-tree", "question__hide": false, - "total_acs": 162052, - "total_submitted": 195542, - "total_column_articles": 1427, + "total_acs": 163405, + "total_submitted": 197230, + "total_column_articles": 1434, "frontend_question_id": "654", "is_new_question": false }, @@ -46191,9 +46275,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": 102670, - "total_submitted": 161925, - "total_column_articles": 913, + "total_acs": 103039, + "total_submitted": 162532, + "total_column_articles": 914, "frontend_question_id": "653", "is_new_question": false }, @@ -46212,9 +46296,9 @@ "question__title": "Find Duplicate Subtrees", "question__title_slug": "find-duplicate-subtrees", "question__hide": false, - "total_acs": 87946, - "total_submitted": 143603, - "total_column_articles": 594, + "total_acs": 88359, + "total_submitted": 144249, + "total_column_articles": 597, "frontend_question_id": "652", "is_new_question": false }, @@ -46233,8 +46317,8 @@ "question__title": "4 Keys Keyboard", "question__title_slug": "4-keys-keyboard", "question__hide": false, - "total_acs": 5778, - "total_submitted": 9740, + "total_acs": 5798, + "total_submitted": 9765, "total_column_articles": 89, "frontend_question_id": "651", "is_new_question": false @@ -46254,9 +46338,9 @@ "question__title": "2 Keys Keyboard", "question__title_slug": "2-keys-keyboard", "question__hide": false, - "total_acs": 61783, - "total_submitted": 107689, - "total_column_articles": 758, + "total_acs": 62146, + "total_submitted": 108210, + "total_column_articles": 761, "frontend_question_id": "650", "is_new_question": false }, @@ -46275,8 +46359,8 @@ "question__title": "Dota2 Senate", "question__title_slug": "dota2-senate", "question__hide": false, - "total_acs": 35340, - "total_submitted": 73538, + "total_acs": 35510, + "total_submitted": 73905, "total_column_articles": 374, "frontend_question_id": "649", "is_new_question": false @@ -46296,9 +46380,9 @@ "question__title": "Replace Words", "question__title_slug": "replace-words", "question__hide": false, - "total_acs": 62760, - "total_submitted": 97331, - "total_column_articles": 762, + "total_acs": 62985, + "total_submitted": 97733, + "total_column_articles": 764, "frontend_question_id": "648", "is_new_question": false }, @@ -46317,9 +46401,9 @@ "question__title": "Palindromic Substrings", "question__title_slug": "palindromic-substrings", "question__hide": false, - "total_acs": 233390, - "total_submitted": 349811, - "total_column_articles": 1499, + "total_acs": 234605, + "total_submitted": 351608, + "total_column_articles": 1504, "frontend_question_id": "647", "is_new_question": false }, @@ -46338,9 +46422,9 @@ "question__title": "Maximum Length of Pair Chain", "question__title_slug": "maximum-length-of-pair-chain", "question__hide": false, - "total_acs": 61384, - "total_submitted": 99185, - "total_column_articles": 618, + "total_acs": 61560, + "total_submitted": 99459, + "total_column_articles": 620, "frontend_question_id": "646", "is_new_question": false }, @@ -46359,9 +46443,9 @@ "question__title": "Set Mismatch", "question__title_slug": "set-mismatch", "question__hide": false, - "total_acs": 94097, - "total_submitted": 231100, - "total_column_articles": 937, + "total_acs": 94557, + "total_submitted": 232407, + "total_column_articles": 942, "frontend_question_id": "645", "is_new_question": false }, @@ -46380,9 +46464,9 @@ "question__title": "Maximum Average Subarray II", "question__title_slug": "maximum-average-subarray-ii", "question__hide": false, - "total_acs": 2000, - "total_submitted": 4515, - "total_column_articles": 38, + "total_acs": 2010, + "total_submitted": 4539, + "total_column_articles": 39, "frontend_question_id": "644", "is_new_question": false }, @@ -46401,9 +46485,9 @@ "question__title": "Maximum Average Subarray I", "question__title_slug": "maximum-average-subarray-i", "question__hide": false, - "total_acs": 91900, - "total_submitted": 208317, - "total_column_articles": 815, + "total_acs": 92228, + "total_submitted": 209209, + "total_column_articles": 818, "frontend_question_id": "643", "is_new_question": false }, @@ -46422,9 +46506,9 @@ "question__title": "Design Search Autocomplete System", "question__title_slug": "design-search-autocomplete-system", "question__hide": false, - "total_acs": 4841, - "total_submitted": 8682, - "total_column_articles": 82, + "total_acs": 4858, + "total_submitted": 8715, + "total_column_articles": 84, "frontend_question_id": "642", "is_new_question": false }, @@ -46443,8 +46527,8 @@ "question__title": "Solve the Equation", "question__title_slug": "solve-the-equation", "question__hide": false, - "total_acs": 35550, - "total_submitted": 79315, + "total_acs": 35611, + "total_submitted": 79463, "total_column_articles": 693, "frontend_question_id": "640", "is_new_question": false @@ -46464,9 +46548,9 @@ "question__title": "Decode Ways II", "question__title_slug": "decode-ways-ii", "question__hide": false, - "total_acs": 22268, - "total_submitted": 59634, - "total_column_articles": 302, + "total_acs": 22562, + "total_submitted": 60217, + "total_column_articles": 305, "frontend_question_id": "639", "is_new_question": false }, @@ -46485,8 +46569,8 @@ "question__title": "Shopping Offers", "question__title_slug": "shopping-offers", "question__hide": false, - "total_acs": 33530, - "total_submitted": 52596, + "total_acs": 33585, + "total_submitted": 52698, "total_column_articles": 318, "frontend_question_id": "638", "is_new_question": false @@ -46506,9 +46590,9 @@ "question__title": "Average of Levels in Binary Tree", "question__title_slug": "average-of-levels-in-binary-tree", "question__hide": false, - "total_acs": 120935, - "total_submitted": 173479, - "total_column_articles": 951, + "total_acs": 121609, + "total_submitted": 174450, + "total_column_articles": 954, "frontend_question_id": "637", "is_new_question": false }, @@ -46527,8 +46611,8 @@ "question__title": "Exclusive Time of Functions", "question__title_slug": "exclusive-time-of-functions", "question__hide": false, - "total_acs": 33632, - "total_submitted": 51026, + "total_acs": 33699, + "total_submitted": 51133, "total_column_articles": 342, "frontend_question_id": "636", "is_new_question": false @@ -46548,8 +46632,8 @@ "question__title": "Design Log Storage System", "question__title_slug": "design-log-storage-system", "question__hide": false, - "total_acs": 5898, - "total_submitted": 10418, + "total_acs": 5925, + "total_submitted": 10458, "total_column_articles": 100, "frontend_question_id": "635", "is_new_question": false @@ -46569,8 +46653,8 @@ "question__title": "Find the Derangement of An Array", "question__title_slug": "find-the-derangement-of-an-array", "question__hide": false, - "total_acs": 2084, - "total_submitted": 4444, + "total_acs": 2094, + "total_submitted": 4460, "total_column_articles": 28, "frontend_question_id": "634", "is_new_question": false @@ -46590,9 +46674,9 @@ "question__title": "Sum of Square Numbers", "question__title_slug": "sum-of-square-numbers", "question__hide": false, - "total_acs": 122468, - "total_submitted": 317248, - "total_column_articles": 986, + "total_acs": 122804, + "total_submitted": 318313, + "total_column_articles": 989, "frontend_question_id": "633", "is_new_question": false }, @@ -46611,9 +46695,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": 23609, - "total_submitted": 38919, - "total_column_articles": 294, + "total_acs": 23688, + "total_submitted": 39036, + "total_column_articles": 296, "frontend_question_id": "632", "is_new_question": false }, @@ -46632,8 +46716,8 @@ "question__title": "Design Excel Sum Formula", "question__title_slug": "design-excel-sum-formula", "question__hide": false, - "total_acs": 1601, - "total_submitted": 4889, + "total_acs": 1607, + "total_submitted": 4907, "total_column_articles": 47, "frontend_question_id": "631", "is_new_question": false @@ -46653,8 +46737,8 @@ "question__title": "Course Schedule III", "question__title_slug": "course-schedule-iii", "question__hide": false, - "total_acs": 27904, - "total_submitted": 60192, + "total_acs": 27969, + "total_submitted": 60324, "total_column_articles": 252, "frontend_question_id": "630", "is_new_question": false @@ -46674,9 +46758,9 @@ "question__title": "K Inverse Pairs Array", "question__title_slug": "k-inverse-pairs-array", "question__hide": false, - "total_acs": 21156, - "total_submitted": 41218, - "total_column_articles": 196, + "total_acs": 21200, + "total_submitted": 41326, + "total_column_articles": 197, "frontend_question_id": "629", "is_new_question": false }, @@ -46695,9 +46779,9 @@ "question__title": "Maximum Product of Three Numbers", "question__title_slug": "maximum-product-of-three-numbers", "question__hide": false, - "total_acs": 106913, - "total_submitted": 204248, - "total_column_articles": 1000, + "total_acs": 107380, + "total_submitted": 205173, + "total_column_articles": 1004, "frontend_question_id": "628", "is_new_question": false }, @@ -46716,8 +46800,8 @@ "question__title": "Swap Salary", "question__title_slug": "swap-salary", "question__hide": false, - "total_acs": 147481, - "total_submitted": 180242, + "total_acs": 148638, + "total_submitted": 181613, "total_column_articles": 568, "frontend_question_id": "627", "is_new_question": false @@ -46737,9 +46821,9 @@ "question__title": "Exchange Seats", "question__title_slug": "exchange-seats", "question__hide": false, - "total_acs": 64469, - "total_submitted": 94013, - "total_column_articles": 529, + "total_acs": 64795, + "total_submitted": 94499, + "total_column_articles": 533, "frontend_question_id": "626", "is_new_question": false }, @@ -46758,8 +46842,8 @@ "question__title": "Minimum Factorization", "question__title_slug": "minimum-factorization", "question__hide": false, - "total_acs": 3194, - "total_submitted": 9194, + "total_acs": 3204, + "total_submitted": 9211, "total_column_articles": 64, "frontend_question_id": "625", "is_new_question": false @@ -46779,8 +46863,8 @@ "question__title": "Maximum Distance in Arrays", "question__title_slug": "maximum-distance-in-arrays", "question__hide": false, - "total_acs": 2970, - "total_submitted": 6791, + "total_acs": 2978, + "total_submitted": 6805, "total_column_articles": 64, "frontend_question_id": "624", "is_new_question": false @@ -46800,9 +46884,9 @@ "question__title": "Add One Row to Tree", "question__title_slug": "add-one-row-to-tree", "question__hide": false, - "total_acs": 42714, - "total_submitted": 70841, - "total_column_articles": 634, + "total_acs": 42796, + "total_submitted": 70993, + "total_column_articles": 635, "frontend_question_id": "623", "is_new_question": false }, @@ -46821,9 +46905,9 @@ "question__title": "Task Scheduler", "question__title_slug": "task-scheduler", "question__hide": false, - "total_acs": 122230, - "total_submitted": 206544, - "total_column_articles": 765, + "total_acs": 122807, + "total_submitted": 207428, + "total_column_articles": 768, "frontend_question_id": "621", "is_new_question": false }, @@ -46842,8 +46926,8 @@ "question__title": "Not Boring Movies", "question__title_slug": "not-boring-movies", "question__hide": false, - "total_acs": 120158, - "total_submitted": 155440, + "total_acs": 120515, + "total_submitted": 156000, "total_column_articles": 418, "frontend_question_id": "620", "is_new_question": false @@ -46863,8 +46947,8 @@ "question__title": "Biggest Single Number", "question__title_slug": "biggest-single-number", "question__hide": false, - "total_acs": 20824, - "total_submitted": 44916, + "total_acs": 20946, + "total_submitted": 45142, "total_column_articles": 141, "frontend_question_id": "619", "is_new_question": false @@ -46884,9 +46968,9 @@ "question__title": "Students Report By Geography", "question__title_slug": "students-report-by-geography", "question__hide": false, - "total_acs": 8361, - "total_submitted": 13352, - "total_column_articles": 78, + "total_acs": 8423, + "total_submitted": 13437, + "total_column_articles": 80, "frontend_question_id": "618", "is_new_question": false }, @@ -46905,9 +46989,9 @@ "question__title": "Merge Two Binary Trees", "question__title_slug": "merge-two-binary-trees", "question__hide": false, - "total_acs": 343348, - "total_submitted": 434225, - "total_column_articles": 2093, + "total_acs": 345248, + "total_submitted": 436575, + "total_column_articles": 2103, "frontend_question_id": "617", "is_new_question": false }, @@ -46926,8 +47010,8 @@ "question__title": "Add Bold Tag in String", "question__title_slug": "add-bold-tag-in-string", "question__hide": false, - "total_acs": 5125, - "total_submitted": 10488, + "total_acs": 5151, + "total_submitted": 10532, "total_column_articles": 81, "frontend_question_id": "616", "is_new_question": false @@ -46947,9 +47031,9 @@ "question__title": "Average Salary: Departments VS Company", "question__title_slug": "average-salary-departments-vs-company", "question__hide": false, - "total_acs": 9168, - "total_submitted": 21835, - "total_column_articles": 135, + "total_acs": 9208, + "total_submitted": 21922, + "total_column_articles": 136, "frontend_question_id": "615", "is_new_question": false }, @@ -46968,8 +47052,8 @@ "question__title": "Second Degree Follower", "question__title_slug": "second-degree-follower", "question__hide": false, - "total_acs": 13868, - "total_submitted": 37715, + "total_acs": 13916, + "total_submitted": 37823, "total_column_articles": 98, "frontend_question_id": "614", "is_new_question": false @@ -46989,8 +47073,8 @@ "question__title": "Shortest Distance in a Line", "question__title_slug": "shortest-distance-in-a-line", "question__hide": false, - "total_acs": 17741, - "total_submitted": 22215, + "total_acs": 17811, + "total_submitted": 22295, "total_column_articles": 113, "frontend_question_id": "613", "is_new_question": false @@ -47010,8 +47094,8 @@ "question__title": "Shortest Distance in a Plane", "question__title_slug": "shortest-distance-in-a-plane", "question__hide": false, - "total_acs": 12340, - "total_submitted": 18875, + "total_acs": 12401, + "total_submitted": 18970, "total_column_articles": 98, "frontend_question_id": "612", "is_new_question": false @@ -47031,9 +47115,9 @@ "question__title": "Valid Triangle Number", "question__title_slug": "valid-triangle-number", "question__hide": false, - "total_acs": 79154, - "total_submitted": 147275, - "total_column_articles": 590, + "total_acs": 79577, + "total_submitted": 148053, + "total_column_articles": 592, "frontend_question_id": "611", "is_new_question": false }, @@ -47052,9 +47136,9 @@ "question__title": "Triangle Judgement", "question__title_slug": "triangle-judgement", "question__hide": false, - "total_acs": 16607, - "total_submitted": 26235, - "total_column_articles": 104, + "total_acs": 16678, + "total_submitted": 26328, + "total_column_articles": 105, "frontend_question_id": "610", "is_new_question": false }, @@ -47073,8 +47157,8 @@ "question__title": "Find Duplicate File in System", "question__title_slug": "find-duplicate-file-in-system", "question__hide": false, - "total_acs": 9215, - "total_submitted": 17883, + "total_acs": 9249, + "total_submitted": 17931, "total_column_articles": 148, "frontend_question_id": "609", "is_new_question": false @@ -47094,9 +47178,9 @@ "question__title": "Tree Node", "question__title_slug": "tree-node", "question__hide": false, - "total_acs": 38921, - "total_submitted": 62166, - "total_column_articles": 308, + "total_acs": 39553, + "total_submitted": 63598, + "total_column_articles": 310, "frontend_question_id": "608", "is_new_question": false }, @@ -47115,9 +47199,9 @@ "question__title": "Sales Person", "question__title_slug": "sales-person", "question__hide": false, - "total_acs": 47339, - "total_submitted": 69054, - "total_column_articles": 294, + "total_acs": 48036, + "total_submitted": 70094, + "total_column_articles": 299, "frontend_question_id": "607", "is_new_question": false }, @@ -47136,9 +47220,9 @@ "question__title": "Construct String from Binary Tree", "question__title_slug": "construct-string-from-binary-tree", "question__hide": false, - "total_acs": 67429, - "total_submitted": 107385, - "total_column_articles": 704, + "total_acs": 67660, + "total_submitted": 107836, + "total_column_articles": 705, "frontend_question_id": "606", "is_new_question": false }, @@ -47157,9 +47241,9 @@ "question__title": "Can Place Flowers", "question__title_slug": "can-place-flowers", "question__hide": false, - "total_acs": 148372, - "total_submitted": 453648, - "total_column_articles": 1663, + "total_acs": 148924, + "total_submitted": 455476, + "total_column_articles": 1669, "frontend_question_id": "605", "is_new_question": false }, @@ -47178,9 +47262,9 @@ "question__title": "Design Compressed String Iterator", "question__title_slug": "design-compressed-string-iterator", "question__hide": false, - "total_acs": 3500, - "total_submitted": 9105, - "total_column_articles": 84, + "total_acs": 3523, + "total_submitted": 9159, + "total_column_articles": 86, "frontend_question_id": "604", "is_new_question": false }, @@ -47199,9 +47283,9 @@ "question__title": "Consecutive Available Seats", "question__title_slug": "consecutive-available-seats", "question__hide": false, - "total_acs": 22851, - "total_submitted": 35334, - "total_column_articles": 209, + "total_acs": 22992, + "total_submitted": 35548, + "total_column_articles": 211, "frontend_question_id": "603", "is_new_question": false }, @@ -47220,8 +47304,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": 14216, - "total_submitted": 23514, + "total_acs": 14275, + "total_submitted": 23609, "total_column_articles": 134, "frontend_question_id": "602", "is_new_question": false @@ -47241,9 +47325,9 @@ "question__title": "Human Traffic of Stadium", "question__title_slug": "human-traffic-of-stadium", "question__hide": false, - "total_acs": 44117, - "total_submitted": 92406, - "total_column_articles": 517, + "total_acs": 44315, + "total_submitted": 92774, + "total_column_articles": 521, "frontend_question_id": "601", "is_new_question": false }, @@ -47262,9 +47346,9 @@ "question__title": "Non-negative Integers without Consecutive Ones", "question__title_slug": "non-negative-integers-without-consecutive-ones", "question__hide": false, - "total_acs": 22940, - "total_submitted": 46893, - "total_column_articles": 280, + "total_acs": 22982, + "total_submitted": 46974, + "total_column_articles": 282, "frontend_question_id": "600", "is_new_question": false }, @@ -47283,9 +47367,9 @@ "question__title": "Minimum Index Sum of Two Lists", "question__title_slug": "minimum-index-sum-of-two-lists", "question__hide": false, - "total_acs": 81751, - "total_submitted": 143848, - "total_column_articles": 702, + "total_acs": 82088, + "total_submitted": 144458, + "total_column_articles": 704, "frontend_question_id": "599", "is_new_question": false }, @@ -47304,8 +47388,8 @@ "question__title": "Range Addition II", "question__title_slug": "range-addition-ii", "question__hide": false, - "total_acs": 49418, - "total_submitted": 85841, + "total_acs": 49571, + "total_submitted": 86091, "total_column_articles": 582, "frontend_question_id": "598", "is_new_question": false @@ -47325,8 +47409,8 @@ "question__title": "Friend Requests I: Overall Acceptance Rate", "question__title_slug": "friend-requests-i-overall-acceptance-rate", "question__hide": false, - "total_acs": 16966, - "total_submitted": 38868, + "total_acs": 17043, + "total_submitted": 39052, "total_column_articles": 118, "frontend_question_id": "597", "is_new_question": false @@ -47346,9 +47430,9 @@ "question__title": "Classes More Than 5 Students", "question__title_slug": "classes-more-than-5-students", "question__hide": false, - "total_acs": 130161, - "total_submitted": 267217, - "total_column_articles": 428, + "total_acs": 130853, + "total_submitted": 268237, + "total_column_articles": 429, "frontend_question_id": "596", "is_new_question": false }, @@ -47367,9 +47451,9 @@ "question__title": "Big Countries", "question__title_slug": "big-countries", "question__hide": false, - "total_acs": 215506, - "total_submitted": 314985, - "total_column_articles": 486, + "total_acs": 217652, + "total_submitted": 318546, + "total_column_articles": 491, "frontend_question_id": "595", "is_new_question": false }, @@ -47388,9 +47472,9 @@ "question__title": "Longest Harmonious Subsequence", "question__title_slug": "longest-harmonious-subsequence", "question__hide": false, - "total_acs": 74615, - "total_submitted": 132654, - "total_column_articles": 649, + "total_acs": 74851, + "total_submitted": 133075, + "total_column_articles": 651, "frontend_question_id": "594", "is_new_question": false }, @@ -47409,9 +47493,9 @@ "question__title": "Valid Square", "question__title_slug": "valid-square", "question__hide": false, - "total_acs": 34144, - "total_submitted": 72584, - "total_column_articles": 574, + "total_acs": 34209, + "total_submitted": 72734, + "total_column_articles": 575, "frontend_question_id": "593", "is_new_question": false }, @@ -47430,8 +47514,8 @@ "question__title": "Fraction Addition and Subtraction", "question__title_slug": "fraction-addition-and-subtraction", "question__hide": false, - "total_acs": 25070, - "total_submitted": 41819, + "total_acs": 25129, + "total_submitted": 41915, "total_column_articles": 472, "frontend_question_id": "592", "is_new_question": false @@ -47451,8 +47535,8 @@ "question__title": "Tag Validator", "question__title_slug": "tag-validator", "question__hide": false, - "total_acs": 17265, - "total_submitted": 32964, + "total_acs": 17276, + "total_submitted": 32985, "total_column_articles": 194, "frontend_question_id": "591", "is_new_question": false @@ -47472,8 +47556,8 @@ "question__title": "Design In-Memory File System", "question__title_slug": "design-in-memory-file-system", "question__hide": false, - "total_acs": 2848, - "total_submitted": 6569, + "total_acs": 2861, + "total_submitted": 6607, "total_column_articles": 50, "frontend_question_id": "588", "is_new_question": false @@ -47493,8 +47577,8 @@ "question__title": "Erect the Fence", "question__title_slug": "erect-the-fence", "question__hide": false, - "total_acs": 16840, - "total_submitted": 27498, + "total_acs": 16860, + "total_submitted": 27563, "total_column_articles": 132, "frontend_question_id": "587", "is_new_question": false @@ -47514,9 +47598,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": 53365, - "total_submitted": 74739, - "total_column_articles": 263, + "total_acs": 54168, + "total_submitted": 75955, + "total_column_articles": 266, "frontend_question_id": "586", "is_new_question": false }, @@ -47535,9 +47619,9 @@ "question__title": "Investments in 2016", "question__title_slug": "investments-in-2016", "question__hide": false, - "total_acs": 13893, - "total_submitted": 28083, - "total_column_articles": 155, + "total_acs": 13973, + "total_submitted": 28241, + "total_column_articles": 156, "frontend_question_id": "585", "is_new_question": false }, @@ -47556,9 +47640,9 @@ "question__title": "Find Customer Referee", "question__title_slug": "find-customer-referee", "question__hide": false, - "total_acs": 97877, - "total_submitted": 144105, - "total_column_articles": 293, + "total_acs": 99742, + "total_submitted": 148001, + "total_column_articles": 300, "frontend_question_id": "584", "is_new_question": false }, @@ -47577,9 +47661,9 @@ "question__title": "Delete Operation for Two Strings", "question__title_slug": "delete-operation-for-two-strings", "question__hide": false, - "total_acs": 101619, - "total_submitted": 154273, - "total_column_articles": 808, + "total_acs": 102206, + "total_submitted": 155147, + "total_column_articles": 810, "frontend_question_id": "583", "is_new_question": false }, @@ -47598,9 +47682,9 @@ "question__title": "Kill Process", "question__title_slug": "kill-process", "question__hide": false, - "total_acs": 11737, - "total_submitted": 26136, - "total_column_articles": 178, + "total_acs": 11764, + "total_submitted": 26179, + "total_column_articles": 179, "frontend_question_id": "582", "is_new_question": false }, @@ -47619,9 +47703,9 @@ "question__title": "Shortest Unsorted Continuous Subarray", "question__title_slug": "shortest-unsorted-continuous-subarray", "question__hide": false, - "total_acs": 157741, - "total_submitted": 380428, - "total_column_articles": 1246, + "total_acs": 158407, + "total_submitted": 381901, + "total_column_articles": 1250, "frontend_question_id": "581", "is_new_question": false }, @@ -47640,9 +47724,9 @@ "question__title": "Count Student Number in Departments", "question__title_slug": "count-student-number-in-departments", "question__hide": false, - "total_acs": 19594, - "total_submitted": 36966, - "total_column_articles": 142, + "total_acs": 19695, + "total_submitted": 37123, + "total_column_articles": 143, "frontend_question_id": "580", "is_new_question": false }, @@ -47661,8 +47745,8 @@ "question__title": "Find Cumulative Salary of an Employee", "question__title_slug": "find-cumulative-salary-of-an-employee", "question__hide": false, - "total_acs": 12692, - "total_submitted": 29277, + "total_acs": 12759, + "total_submitted": 29401, "total_column_articles": 178, "frontend_question_id": "579", "is_new_question": false @@ -47682,9 +47766,9 @@ "question__title": "Get Highest Answer Rate Question", "question__title_slug": "get-highest-answer-rate-question", "question__hide": false, - "total_acs": 17156, - "total_submitted": 39249, - "total_column_articles": 174, + "total_acs": 17233, + "total_submitted": 39496, + "total_column_articles": 175, "frontend_question_id": "578", "is_new_question": false }, @@ -47703,8 +47787,8 @@ "question__title": "Employee Bonus", "question__title_slug": "employee-bonus", "question__hide": false, - "total_acs": 25666, - "total_submitted": 37081, + "total_acs": 25775, + "total_submitted": 37229, "total_column_articles": 132, "frontend_question_id": "577", "is_new_question": false @@ -47724,9 +47808,9 @@ "question__title": "Out of Boundary Paths", "question__title_slug": "out-of-boundary-paths", "question__hide": false, - "total_acs": 33352, - "total_submitted": 70808, - "total_column_articles": 362, + "total_acs": 33472, + "total_submitted": 71039, + "total_column_articles": 363, "frontend_question_id": "576", "is_new_question": false }, @@ -47745,9 +47829,9 @@ "question__title": "Distribute Candies", "question__title_slug": "distribute-candies", "question__hide": false, - "total_acs": 103935, - "total_submitted": 147123, - "total_column_articles": 991, + "total_acs": 104268, + "total_submitted": 147630, + "total_column_articles": 994, "frontend_question_id": "575", "is_new_question": false }, @@ -47766,8 +47850,8 @@ "question__title": "Winning Candidate", "question__title_slug": "winning-candidate", "question__hide": false, - "total_acs": 20988, - "total_submitted": 31591, + "total_acs": 21085, + "total_submitted": 31736, "total_column_articles": 155, "frontend_question_id": "574", "is_new_question": false @@ -47787,8 +47871,8 @@ "question__title": "Squirrel Simulation", "question__title_slug": "squirrel-simulation", "question__hide": false, - "total_acs": 1569, - "total_submitted": 2432, + "total_acs": 1574, + "total_submitted": 2439, "total_column_articles": 46, "frontend_question_id": "573", "is_new_question": false @@ -47808,9 +47892,9 @@ "question__title": "Subtree of Another Tree", "question__title_slug": "subtree-of-another-tree", "question__hide": false, - "total_acs": 150640, - "total_submitted": 316550, - "total_column_articles": 1180, + "total_acs": 151420, + "total_submitted": 318257, + "total_column_articles": 1183, "frontend_question_id": "572", "is_new_question": false }, @@ -47829,8 +47913,8 @@ "question__title": "Find Median Given Frequency of Numbers", "question__title_slug": "find-median-given-frequency-of-numbers", "question__hide": false, - "total_acs": 11726, - "total_submitted": 25013, + "total_acs": 11812, + "total_submitted": 25209, "total_column_articles": 133, "frontend_question_id": "571", "is_new_question": false @@ -47850,9 +47934,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": 24401, - "total_submitted": 37251, - "total_column_articles": 182, + "total_acs": 24564, + "total_submitted": 37487, + "total_column_articles": 183, "frontend_question_id": "570", "is_new_question": false }, @@ -47871,9 +47955,9 @@ "question__title": "Median Employee Salary", "question__title_slug": "median-employee-salary", "question__hide": false, - "total_acs": 17422, - "total_submitted": 30449, - "total_column_articles": 235, + "total_acs": 17521, + "total_submitted": 30609, + "total_column_articles": 236, "frontend_question_id": "569", "is_new_question": false }, @@ -47892,8 +47976,8 @@ "question__title": "Maximum Vacation Days", "question__title_slug": "maximum-vacation-days", "question__hide": false, - "total_acs": 1872, - "total_submitted": 3535, + "total_acs": 1889, + "total_submitted": 3556, "total_column_articles": 38, "frontend_question_id": "568", "is_new_question": false @@ -47913,9 +47997,9 @@ "question__title": "Permutation in String", "question__title_slug": "permutation-in-string", "question__hide": false, - "total_acs": 229098, - "total_submitted": 517407, - "total_column_articles": 2079, + "total_acs": 230468, + "total_submitted": 520224, + "total_column_articles": 2087, "frontend_question_id": "567", "is_new_question": false }, @@ -47934,9 +48018,9 @@ "question__title": "Reshape the Matrix", "question__title_slug": "reshape-the-matrix", "question__hide": false, - "total_acs": 124771, - "total_submitted": 189945, - "total_column_articles": 1168, + "total_acs": 125415, + "total_submitted": 190953, + "total_column_articles": 1174, "frontend_question_id": "566", "is_new_question": false }, @@ -47955,9 +48039,9 @@ "question__title": "Array Nesting", "question__title_slug": "array-nesting", "question__hide": false, - "total_acs": 45785, - "total_submitted": 73388, - "total_column_articles": 436, + "total_acs": 45876, + "total_submitted": 73529, + "total_column_articles": 438, "frontend_question_id": "565", "is_new_question": false }, @@ -47976,9 +48060,9 @@ "question__title": "Find the Closest Palindrome", "question__title_slug": "find-the-closest-palindrome", "question__hide": false, - "total_acs": 24031, - "total_submitted": 78996, - "total_column_articles": 251, + "total_acs": 24058, + "total_submitted": 79062, + "total_column_articles": 252, "frontend_question_id": "564", "is_new_question": false }, @@ -47997,9 +48081,9 @@ "question__title": "Binary Tree Tilt", "question__title_slug": "binary-tree-tilt", "question__hide": false, - "total_acs": 70570, - "total_submitted": 107340, - "total_column_articles": 724, + "total_acs": 70777, + "total_submitted": 107646, + "total_column_articles": 727, "frontend_question_id": "563", "is_new_question": false }, @@ -48018,9 +48102,9 @@ "question__title": "Longest Line of Consecutive One in Matrix", "question__title_slug": "longest-line-of-consecutive-one-in-matrix", "question__hide": false, - "total_acs": 5584, - "total_submitted": 11309, - "total_column_articles": 93, + "total_acs": 5610, + "total_submitted": 11348, + "total_column_articles": 94, "frontend_question_id": "562", "is_new_question": false }, @@ -48039,9 +48123,9 @@ "question__title": "Array Partition", "question__title_slug": "array-partition", "question__hide": false, - "total_acs": 122435, - "total_submitted": 156109, - "total_column_articles": 1017, + "total_acs": 123065, + "total_submitted": 156885, + "total_column_articles": 1022, "frontend_question_id": "561", "is_new_question": false }, @@ -48060,9 +48144,9 @@ "question__title": "Subarray Sum Equals K", "question__title_slug": "subarray-sum-equals-k", "question__hide": false, - "total_acs": 277814, - "total_submitted": 611696, - "total_column_articles": 1665, + "total_acs": 279241, + "total_submitted": 614898, + "total_column_articles": 1671, "frontend_question_id": "560", "is_new_question": false }, @@ -48081,9 +48165,9 @@ "question__title": "Reverse Words in a String III", "question__title_slug": "reverse-words-in-a-string-iii", "question__hide": false, - "total_acs": 273750, - "total_submitted": 369419, - "total_column_articles": 2287, + "total_acs": 274763, + "total_submitted": 370791, + "total_column_articles": 2294, "frontend_question_id": "557", "is_new_question": false }, @@ -48102,9 +48186,9 @@ "question__title": "Next Greater Element III", "question__title_slug": "next-greater-element-iii", "question__hide": false, - "total_acs": 42601, - "total_submitted": 115447, - "total_column_articles": 542, + "total_acs": 42800, + "total_submitted": 115982, + "total_column_articles": 543, "frontend_question_id": "556", "is_new_question": false }, @@ -48123,8 +48207,8 @@ "question__title": "Split Concatenated Strings", "question__title_slug": "split-concatenated-strings", "question__hide": false, - "total_acs": 1593, - "total_submitted": 4289, + "total_acs": 1596, + "total_submitted": 4292, "total_column_articles": 31, "frontend_question_id": "555", "is_new_question": false @@ -48144,9 +48228,9 @@ "question__title": "Brick Wall", "question__title_slug": "brick-wall", "question__hide": false, - "total_acs": 58220, - "total_submitted": 113294, - "total_column_articles": 571, + "total_acs": 58434, + "total_submitted": 113693, + "total_column_articles": 572, "frontend_question_id": "554", "is_new_question": false }, @@ -48165,9 +48249,9 @@ "question__title": "Optimal Division", "question__title_slug": "optimal-division", "question__hide": false, - "total_acs": 30101, - "total_submitted": 46392, - "total_column_articles": 367, + "total_acs": 30170, + "total_submitted": 46503, + "total_column_articles": 369, "frontend_question_id": "553", "is_new_question": false }, @@ -48186,9 +48270,9 @@ "question__title": "Student Attendance Record II", "question__title_slug": "student-attendance-record-ii", "question__hide": false, - "total_acs": 27158, - "total_submitted": 47204, - "total_column_articles": 326, + "total_acs": 27219, + "total_submitted": 47323, + "total_column_articles": 327, "frontend_question_id": "552", "is_new_question": false }, @@ -48207,9 +48291,9 @@ "question__title": "Student Attendance Record I", "question__title_slug": "student-attendance-record-i", "question__hide": false, - "total_acs": 72695, - "total_submitted": 128188, - "total_column_articles": 929, + "total_acs": 72949, + "total_submitted": 128611, + "total_column_articles": 933, "frontend_question_id": "551", "is_new_question": false }, @@ -48228,8 +48312,8 @@ "question__title": "Shortest Path to Get Food", "question__title_slug": "shortest-path-to-get-food", "question__hide": false, - "total_acs": 1481, - "total_submitted": 2851, + "total_acs": 1491, + "total_submitted": 2870, "total_column_articles": 39, "frontend_question_id": "1730", "is_new_question": false @@ -48249,8 +48333,8 @@ "question__title": "Binary Tree Longest Consecutive Sequence II", "question__title_slug": "binary-tree-longest-consecutive-sequence-ii", "question__hide": false, - "total_acs": 3696, - "total_submitted": 7277, + "total_acs": 3713, + "total_submitted": 7303, "total_column_articles": 71, "frontend_question_id": "549", "is_new_question": false @@ -48270,8 +48354,8 @@ "question__title": "Split Array with Equal Sum", "question__title_slug": "split-array-with-equal-sum", "question__hide": false, - "total_acs": 2233, - "total_submitted": 5869, + "total_acs": 2243, + "total_submitted": 5884, "total_column_articles": 53, "frontend_question_id": "548", "is_new_question": false @@ -48291,9 +48375,9 @@ "question__title": "Number of Provinces", "question__title_slug": "number-of-provinces", "question__hide": false, - "total_acs": 244612, - "total_submitted": 392772, - "total_column_articles": 1688, + "total_acs": 245704, + "total_submitted": 394539, + "total_column_articles": 1693, "frontend_question_id": "547", "is_new_question": false }, @@ -48312,9 +48396,9 @@ "question__title": "Remove Boxes", "question__title_slug": "remove-boxes", "question__hide": false, - "total_acs": 17333, - "total_submitted": 28136, - "total_column_articles": 133, + "total_acs": 17389, + "total_submitted": 28252, + "total_column_articles": 134, "frontend_question_id": "546", "is_new_question": false }, @@ -48333,8 +48417,8 @@ "question__title": "Boundary of Binary Tree", "question__title_slug": "boundary-of-binary-tree", "question__hide": false, - "total_acs": 5112, - "total_submitted": 11604, + "total_acs": 5135, + "total_submitted": 11655, "total_column_articles": 94, "frontend_question_id": "545", "is_new_question": false @@ -48354,8 +48438,8 @@ "question__title": "Output Contest Matches", "question__title_slug": "output-contest-matches", "question__hide": false, - "total_acs": 3171, - "total_submitted": 4395, + "total_acs": 3181, + "total_submitted": 4410, "total_column_articles": 68, "frontend_question_id": "544", "is_new_question": false @@ -48375,9 +48459,9 @@ "question__title": "Diameter of Binary Tree", "question__title_slug": "diameter-of-binary-tree", "question__hide": false, - "total_acs": 273522, - "total_submitted": 472731, - "total_column_articles": 1973, + "total_acs": 275068, + "total_submitted": 475153, + "total_column_articles": 1986, "frontend_question_id": "543", "is_new_question": false }, @@ -48396,9 +48480,9 @@ "question__title": "01 Matrix", "question__title_slug": "01-matrix", "question__hide": false, - "total_acs": 119461, - "total_submitted": 257446, - "total_column_articles": 1025, + "total_acs": 119876, + "total_submitted": 258332, + "total_column_articles": 1028, "frontend_question_id": "542", "is_new_question": false }, @@ -48417,9 +48501,9 @@ "question__title": "Reverse String II", "question__title_slug": "reverse-string-ii", "question__hide": false, - "total_acs": 154788, - "total_submitted": 262810, - "total_column_articles": 1295, + "total_acs": 156392, + "total_submitted": 265724, + "total_column_articles": 1303, "frontend_question_id": "541", "is_new_question": false }, @@ -48438,9 +48522,9 @@ "question__title": "Single Element in a Sorted Array", "question__title_slug": "single-element-in-a-sorted-array", "question__hide": false, - "total_acs": 107028, - "total_submitted": 176494, - "total_column_articles": 1019, + "total_acs": 107349, + "total_submitted": 177102, + "total_column_articles": 1020, "frontend_question_id": "540", "is_new_question": false }, @@ -48459,9 +48543,9 @@ "question__title": "Minimum Time Difference", "question__title_slug": "minimum-time-difference", "question__hide": false, - "total_acs": 58587, - "total_submitted": 88486, - "total_column_articles": 650, + "total_acs": 58800, + "total_submitted": 88851, + "total_column_articles": 653, "frontend_question_id": "539", "is_new_question": false }, @@ -48480,9 +48564,9 @@ "question__title": "Convert BST to Greater Tree", "question__title_slug": "convert-bst-to-greater-tree", "question__hide": false, - "total_acs": 196217, - "total_submitted": 260307, - "total_column_articles": 1348, + "total_acs": 197408, + "total_submitted": 261742, + "total_column_articles": 1353, "frontend_question_id": "538", "is_new_question": false }, @@ -48501,8 +48585,8 @@ "question__title": "Complex Number Multiplication", "question__title_slug": "complex-number-multiplication", "question__hide": false, - "total_acs": 42360, - "total_submitted": 56648, + "total_acs": 42468, + "total_submitted": 56786, "total_column_articles": 650, "frontend_question_id": "537", "is_new_question": false @@ -48522,9 +48606,9 @@ "question__title": "Construct Binary Tree from String", "question__title_slug": "construct-binary-tree-from-string", "question__hide": false, - "total_acs": 5331, - "total_submitted": 9716, - "total_column_articles": 88, + "total_acs": 5340, + "total_submitted": 9730, + "total_column_articles": 89, "frontend_question_id": "536", "is_new_question": false }, @@ -48543,8 +48627,8 @@ "question__title": "Encode and Decode TinyURL", "question__title_slug": "encode-and-decode-tinyurl", "question__hide": false, - "total_acs": 41683, - "total_submitted": 47554, + "total_acs": 41788, + "total_submitted": 47679, "total_column_articles": 269, "frontend_question_id": "535", "is_new_question": false @@ -48564,8 +48648,8 @@ "question__title": "Lonely Pixel II", "question__title_slug": "lonely-pixel-ii", "question__hide": false, - "total_acs": 2425, - "total_submitted": 4570, + "total_acs": 2443, + "total_submitted": 4598, "total_column_articles": 44, "frontend_question_id": "533", "is_new_question": false @@ -48585,9 +48669,9 @@ "question__title": "K-diff Pairs in an Array", "question__title_slug": "k-diff-pairs-in-an-array", "question__hide": false, - "total_acs": 59571, - "total_submitted": 131654, - "total_column_articles": 682, + "total_acs": 59703, + "total_submitted": 131937, + "total_column_articles": 684, "frontend_question_id": "532", "is_new_question": false }, @@ -48606,8 +48690,8 @@ "question__title": "Lonely Pixel I", "question__title_slug": "lonely-pixel-i", "question__hide": false, - "total_acs": 5495, - "total_submitted": 8550, + "total_acs": 5518, + "total_submitted": 8599, "total_column_articles": 106, "frontend_question_id": "531", "is_new_question": false @@ -48627,9 +48711,9 @@ "question__title": "Minimum Absolute Difference in BST", "question__title_slug": "minimum-absolute-difference-in-bst", "question__hide": false, - "total_acs": 143604, - "total_submitted": 226485, - "total_column_articles": 992, + "total_acs": 144776, + "total_submitted": 228342, + "total_column_articles": 998, "frontend_question_id": "530", "is_new_question": false }, @@ -48648,8 +48732,8 @@ "question__title": "Minesweeper", "question__title_slug": "minesweeper", "question__hide": false, - "total_acs": 48261, - "total_submitted": 75172, + "total_acs": 48500, + "total_submitted": 75567, "total_column_articles": 574, "frontend_question_id": "529", "is_new_question": false @@ -48669,8 +48753,8 @@ "question__title": "Swapping Nodes in a Linked List", "question__title_slug": "swapping-nodes-in-a-linked-list", "question__hide": false, - "total_acs": 17289, - "total_submitted": 27075, + "total_acs": 17399, + "total_submitted": 27276, "total_column_articles": 264, "frontend_question_id": "1721", "is_new_question": false @@ -48690,8 +48774,8 @@ "question__title": "Word Abbreviation", "question__title_slug": "word-abbreviation", "question__hide": false, - "total_acs": 2577, - "total_submitted": 4310, + "total_acs": 2598, + "total_submitted": 4334, "total_column_articles": 37, "frontend_question_id": "527", "is_new_question": false @@ -48711,9 +48795,9 @@ "question__title": "Beautiful Arrangement", "question__title_slug": "beautiful-arrangement", "question__hide": false, - "total_acs": 43695, - "total_submitted": 59536, - "total_column_articles": 484, + "total_acs": 43824, + "total_submitted": 59708, + "total_column_articles": 485, "frontend_question_id": "526", "is_new_question": false }, @@ -48732,9 +48816,9 @@ "question__title": "Contiguous Array", "question__title_slug": "contiguous-array", "question__hide": false, - "total_acs": 62277, - "total_submitted": 114257, - "total_column_articles": 659, + "total_acs": 62519, + "total_submitted": 114706, + "total_column_articles": 662, "frontend_question_id": "525", "is_new_question": false }, @@ -48753,9 +48837,9 @@ "question__title": "Longest Word in Dictionary through Deleting", "question__title_slug": "longest-word-in-dictionary-through-deleting", "question__hide": false, - "total_acs": 94204, - "total_submitted": 188366, - "total_column_articles": 931, + "total_acs": 94431, + "total_submitted": 188837, + "total_column_articles": 932, "frontend_question_id": "524", "is_new_question": false }, @@ -48774,9 +48858,9 @@ "question__title": "Continuous Subarray Sum", "question__title_slug": "continuous-subarray-sum", "question__hide": false, - "total_acs": 89154, - "total_submitted": 314661, - "total_column_articles": 749, + "total_acs": 89488, + "total_submitted": 315800, + "total_column_articles": 750, "frontend_question_id": "523", "is_new_question": false }, @@ -48795,8 +48879,8 @@ "question__title": "Longest Uncommon Subsequence II", "question__title_slug": "longest-uncommon-subsequence-ii", "question__hide": false, - "total_acs": 30074, - "total_submitted": 61693, + "total_acs": 30161, + "total_submitted": 61889, "total_column_articles": 350, "frontend_question_id": "522", "is_new_question": false @@ -48816,9 +48900,9 @@ "question__title": "Longest Uncommon Subsequence I", "question__title_slug": "longest-uncommon-subsequence-i", "question__hide": false, - "total_acs": 59930, - "total_submitted": 81306, - "total_column_articles": 546, + "total_acs": 60049, + "total_submitted": 81469, + "total_column_articles": 547, "frontend_question_id": "521", "is_new_question": false }, @@ -48837,9 +48921,9 @@ "question__title": "Detect Capital", "question__title_slug": "detect-capital", "question__hide": false, - "total_acs": 80982, - "total_submitted": 142010, - "total_column_articles": 1234, + "total_acs": 81262, + "total_submitted": 142505, + "total_column_articles": 1236, "frontend_question_id": "520", "is_new_question": false }, @@ -48858,8 +48942,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": 231, - "total_submitted": 469, + "total_acs": 237, + "total_submitted": 477, "total_column_articles": 10, "frontend_question_id": "1983", "is_new_question": false @@ -48879,9 +48963,9 @@ "question__title": "Coin Change II", "question__title_slug": "coin-change-ii", "question__hide": false, - "total_acs": 203488, - "total_submitted": 292020, - "total_column_articles": 1089, + "total_acs": 204504, + "total_submitted": 293388, + "total_column_articles": 1094, "frontend_question_id": "518", "is_new_question": false }, @@ -48900,9 +48984,9 @@ "question__title": "Super Washing Machines", "question__title_slug": "super-washing-machines", "question__hide": false, - "total_acs": 22605, - "total_submitted": 44362, - "total_column_articles": 173, + "total_acs": 22661, + "total_submitted": 44517, + "total_column_articles": 176, "frontend_question_id": "517", "is_new_question": false }, @@ -48921,9 +49005,9 @@ "question__title": "Longest Palindromic Subsequence", "question__title_slug": "longest-palindromic-subsequence", "question__hide": false, - "total_acs": 153045, - "total_submitted": 228569, - "total_column_articles": 990, + "total_acs": 153787, + "total_submitted": 229639, + "total_column_articles": 995, "frontend_question_id": "516", "is_new_question": false }, @@ -48942,9 +49026,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": 103874, - "total_submitted": 156564, - "total_column_articles": 1017, + "total_acs": 104435, + "total_submitted": 157440, + "total_column_articles": 1021, "frontend_question_id": "515", "is_new_question": false }, @@ -48963,9 +49047,9 @@ "question__title": "Freedom Trail", "question__title_slug": "freedom-trail", "question__hide": false, - "total_acs": 25377, - "total_submitted": 49742, - "total_column_articles": 313, + "total_acs": 25464, + "total_submitted": 49885, + "total_column_articles": 315, "frontend_question_id": "514", "is_new_question": false }, @@ -48984,9 +49068,9 @@ "question__title": "Find Bottom Left Tree Value", "question__title_slug": "find-bottom-left-tree-value", "question__hide": false, - "total_acs": 149367, - "total_submitted": 201281, - "total_column_articles": 1367, + "total_acs": 150601, + "total_submitted": 203040, + "total_column_articles": 1372, "frontend_question_id": "513", "is_new_question": false }, @@ -49005,8 +49089,8 @@ "question__title": "Maximum Alternating Subarray Sum", "question__title_slug": "maximum-alternating-subarray-sum", "question__hide": false, - "total_acs": 333, - "total_submitted": 808, + "total_acs": 335, + "total_submitted": 812, "total_column_articles": 18, "frontend_question_id": "2036", "is_new_question": false @@ -49026,8 +49110,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": 3259, - "total_submitted": 8957, + "total_acs": 3275, + "total_submitted": 9036, "total_column_articles": 48, "frontend_question_id": "1059", "is_new_question": false @@ -49048,7 +49132,7 @@ "question__title_slug": "count-subarrays-with-more-ones-than-zeros", "question__hide": false, "total_acs": 563, - "total_submitted": 1050, + "total_submitted": 1053, "total_column_articles": 19, "frontend_question_id": "2031", "is_new_question": false @@ -49068,8 +49152,8 @@ "question__title": "Inorder Successor in BST II", "question__title_slug": "inorder-successor-in-bst-ii", "question__hide": false, - "total_acs": 5267, - "total_submitted": 8619, + "total_acs": 5290, + "total_submitted": 8672, "total_column_articles": 69, "frontend_question_id": "510", "is_new_question": false @@ -49089,9 +49173,9 @@ "question__title": "Most Frequent Subtree Sum", "question__title_slug": "most-frequent-subtree-sum", "question__hide": false, - "total_acs": 41539, - "total_submitted": 55141, - "total_column_articles": 550, + "total_acs": 41642, + "total_submitted": 55281, + "total_column_articles": 552, "frontend_question_id": "508", "is_new_question": false }, @@ -49110,9 +49194,9 @@ "question__title": "Perfect Number", "question__title_slug": "perfect-number", "question__hide": false, - "total_acs": 70695, - "total_submitted": 143725, - "total_column_articles": 524, + "total_acs": 71016, + "total_submitted": 144636, + "total_column_articles": 526, "frontend_question_id": "507", "is_new_question": false }, @@ -49131,9 +49215,9 @@ "question__title": "Relative Ranks", "question__title_slug": "relative-ranks", "question__hide": false, - "total_acs": 70960, - "total_submitted": 109065, - "total_column_articles": 903, + "total_acs": 71263, + "total_submitted": 109520, + "total_column_articles": 906, "frontend_question_id": "506", "is_new_question": false }, @@ -49152,8 +49236,8 @@ "question__title": "The Maze II", "question__title_slug": "the-maze-ii", "question__hide": false, - "total_acs": 8661, - "total_submitted": 17089, + "total_acs": 8714, + "total_submitted": 17170, "total_column_articles": 107, "frontend_question_id": "505", "is_new_question": false @@ -49173,9 +49257,9 @@ "question__title": "Base 7", "question__title_slug": "base-7", "question__hide": false, - "total_acs": 80566, - "total_submitted": 155372, - "total_column_articles": 799, + "total_acs": 80797, + "total_submitted": 155808, + "total_column_articles": 801, "frontend_question_id": "504", "is_new_question": false }, @@ -49194,9 +49278,9 @@ "question__title": "Next Greater Element II", "question__title_slug": "next-greater-element-ii", "question__hide": false, - "total_acs": 172308, - "total_submitted": 260249, - "total_column_articles": 1456, + "total_acs": 173333, + "total_submitted": 261714, + "total_column_articles": 1466, "frontend_question_id": "503", "is_new_question": false }, @@ -49215,8 +49299,8 @@ "question__title": "IPO", "question__title_slug": "ipo", "question__hide": false, - "total_acs": 33649, - "total_submitted": 75211, + "total_acs": 33697, + "total_submitted": 75363, "total_column_articles": 409, "frontend_question_id": "502", "is_new_question": false @@ -49236,9 +49320,9 @@ "question__title": "Find Mode in Binary Search Tree", "question__title_slug": "find-mode-in-binary-search-tree", "question__hide": false, - "total_acs": 127165, - "total_submitted": 235155, - "total_column_articles": 910, + "total_acs": 128353, + "total_submitted": 237188, + "total_column_articles": 918, "frontend_question_id": "501", "is_new_question": false }, @@ -49257,9 +49341,9 @@ "question__title": "Keyboard Row", "question__title_slug": "keyboard-row", "question__hide": false, - "total_acs": 64377, - "total_submitted": 86615, - "total_column_articles": 940, + "total_acs": 64649, + "total_submitted": 86976, + "total_column_articles": 949, "frontend_question_id": "500", "is_new_question": false }, @@ -49278,8 +49362,8 @@ "question__title": "The Maze III", "question__title_slug": "the-maze-iii", "question__hide": false, - "total_acs": 4004, - "total_submitted": 9646, + "total_acs": 4027, + "total_submitted": 9700, "total_column_articles": 79, "frontend_question_id": "499", "is_new_question": false @@ -49299,9 +49383,9 @@ "question__title": "Diagonal Traverse", "question__title_slug": "diagonal-traverse", "question__hide": false, - "total_acs": 96997, - "total_submitted": 174647, - "total_column_articles": 1031, + "total_acs": 97572, + "total_submitted": 175640, + "total_column_articles": 1039, "frontend_question_id": "498", "is_new_question": false }, @@ -49320,9 +49404,9 @@ "question__title": "Next Greater Element I", "question__title_slug": "next-greater-element-i", "question__hide": false, - "total_acs": 226160, - "total_submitted": 315305, - "total_column_articles": 2107, + "total_acs": 227477, + "total_submitted": 317144, + "total_column_articles": 2117, "frontend_question_id": "496", "is_new_question": false }, @@ -49341,9 +49425,9 @@ "question__title": "Teemo Attacking", "question__title_slug": "teemo-attacking", "question__hide": false, - "total_acs": 84169, - "total_submitted": 140573, - "total_column_articles": 1171, + "total_acs": 84568, + "total_submitted": 141242, + "total_column_articles": 1177, "frontend_question_id": "495", "is_new_question": false }, @@ -49362,9 +49446,9 @@ "question__title": "Target Sum", "question__title_slug": "target-sum", "question__hide": false, - "total_acs": 290637, - "total_submitted": 591621, - "total_column_articles": 1686, + "total_acs": 292361, + "total_submitted": 595307, + "total_column_articles": 1697, "frontend_question_id": "494", "is_new_question": false }, @@ -49383,9 +49467,9 @@ "question__title": "Reverse Pairs", "question__title_slug": "reverse-pairs", "question__hide": false, - "total_acs": 35848, - "total_submitted": 99632, - "total_column_articles": 363, + "total_acs": 36068, + "total_submitted": 100140, + "total_column_articles": 367, "frontend_question_id": "493", "is_new_question": false }, @@ -49404,9 +49488,9 @@ "question__title": "Construct the Rectangle", "question__title_slug": "construct-the-rectangle", "question__hide": false, - "total_acs": 53067, - "total_submitted": 87054, - "total_column_articles": 506, + "total_acs": 53224, + "total_submitted": 87296, + "total_column_articles": 509, "frontend_question_id": "492", "is_new_question": false }, @@ -49425,9 +49509,9 @@ "question__title": "Increasing Subsequences", "question__title_slug": "increasing-subsequences", "question__hide": false, - "total_acs": 106088, - "total_submitted": 201549, - "total_column_articles": 753, + "total_acs": 107062, + "total_submitted": 203411, + "total_column_articles": 760, "frontend_question_id": "491", "is_new_question": false }, @@ -49446,8 +49530,8 @@ "question__title": "The Maze", "question__title_slug": "the-maze", "question__hide": false, - "total_acs": 10550, - "total_submitted": 21221, + "total_acs": 10584, + "total_submitted": 21273, "total_column_articles": 126, "frontend_question_id": "490", "is_new_question": false @@ -49467,8 +49551,8 @@ "question__title": "Kth Smallest Instructions", "question__title_slug": "kth-smallest-instructions", "question__hide": false, - "total_acs": 2902, - "total_submitted": 6243, + "total_acs": 2917, + "total_submitted": 6275, "total_column_articles": 66, "frontend_question_id": "1643", "is_new_question": false @@ -49488,8 +49572,8 @@ "question__title": "Zuma Game", "question__title_slug": "zuma-game", "question__hide": false, - "total_acs": 19522, - "total_submitted": 39366, + "total_acs": 19548, + "total_submitted": 39462, "total_column_articles": 182, "frontend_question_id": "488", "is_new_question": false @@ -49509,8 +49593,8 @@ "question__title": "Max Consecutive Ones II", "question__title_slug": "max-consecutive-ones-ii", "question__hide": false, - "total_acs": 11860, - "total_submitted": 20424, + "total_acs": 11933, + "total_submitted": 20550, "total_column_articles": 209, "frontend_question_id": "487", "is_new_question": false @@ -49530,9 +49614,9 @@ "question__title": "Predict the Winner", "question__title_slug": "predict-the-winner", "question__hide": false, - "total_acs": 61804, - "total_submitted": 104323, - "total_column_articles": 507, + "total_acs": 62072, + "total_submitted": 104750, + "total_column_articles": 511, "frontend_question_id": "486", "is_new_question": false }, @@ -49551,9 +49635,9 @@ "question__title": "Max Consecutive Ones", "question__title_slug": "max-consecutive-ones", "question__hide": false, - "total_acs": 179777, - "total_submitted": 294449, - "total_column_articles": 1443, + "total_acs": 180702, + "total_submitted": 296116, + "total_column_articles": 1454, "frontend_question_id": "485", "is_new_question": false }, @@ -49572,8 +49656,8 @@ "question__title": "Find Permutation", "question__title_slug": "find-permutation", "question__hide": false, - "total_acs": 2341, - "total_submitted": 3866, + "total_acs": 2352, + "total_submitted": 3880, "total_column_articles": 49, "frontend_question_id": "484", "is_new_question": false @@ -49593,9 +49677,9 @@ "question__title": "Smallest Good Base", "question__title_slug": "smallest-good-base", "question__hide": false, - "total_acs": 18434, - "total_submitted": 31156, - "total_column_articles": 140, + "total_acs": 18462, + "total_submitted": 31229, + "total_column_articles": 141, "frontend_question_id": "483", "is_new_question": false }, @@ -49614,9 +49698,9 @@ "question__title": "License Key Formatting", "question__title_slug": "license-key-formatting", "question__hide": false, - "total_acs": 51800, - "total_submitted": 110628, - "total_column_articles": 552, + "total_acs": 51982, + "total_submitted": 111098, + "total_column_articles": 555, "frontend_question_id": "482", "is_new_question": false }, @@ -49635,9 +49719,9 @@ "question__title": "Magical String", "question__title_slug": "magical-string", "question__hide": false, - "total_acs": 32920, - "total_submitted": 51352, - "total_column_articles": 446, + "total_acs": 33544, + "total_submitted": 52417, + "total_column_articles": 460, "frontend_question_id": "481", "is_new_question": false }, @@ -49656,9 +49740,9 @@ "question__title": "Sliding Window Median", "question__title_slug": "sliding-window-median", "question__hide": false, - "total_acs": 37177, - "total_submitted": 83389, - "total_column_articles": 491, + "total_acs": 37324, + "total_submitted": 83745, + "total_column_articles": 492, "frontend_question_id": "480", "is_new_question": false }, @@ -49677,9 +49761,9 @@ "question__title": "Largest Palindrome Product", "question__title_slug": "largest-palindrome-product", "question__hide": false, - "total_acs": 22254, - "total_submitted": 35596, - "total_column_articles": 168, + "total_acs": 22295, + "total_submitted": 35681, + "total_column_articles": 169, "frontend_question_id": "479", "is_new_question": false }, @@ -49698,8 +49782,8 @@ "question__title": "Total Hamming Distance", "question__title_slug": "total-hamming-distance", "question__hide": false, - "total_acs": 43963, - "total_submitted": 72586, + "total_acs": 44040, + "total_submitted": 72716, "total_column_articles": 375, "frontend_question_id": "477", "is_new_question": false @@ -49719,9 +49803,9 @@ "question__title": "Number Complement", "question__title_slug": "number-complement", "question__hide": false, - "total_acs": 76274, - "total_submitted": 108812, - "total_column_articles": 1020, + "total_acs": 76484, + "total_submitted": 109167, + "total_column_articles": 1023, "frontend_question_id": "476", "is_new_question": false }, @@ -49740,9 +49824,9 @@ "question__title": "Heaters", "question__title_slug": "heaters", "question__hide": false, - "total_acs": 65528, - "total_submitted": 160207, - "total_column_articles": 681, + "total_acs": 65728, + "total_submitted": 160677, + "total_column_articles": 682, "frontend_question_id": "475", "is_new_question": false }, @@ -49761,9 +49845,9 @@ "question__title": "Ones and Zeroes", "question__title_slug": "ones-and-zeroes", "question__hide": false, - "total_acs": 132076, - "total_submitted": 205421, - "total_column_articles": 931, + "total_acs": 132855, + "total_submitted": 206574, + "total_column_articles": 934, "frontend_question_id": "474", "is_new_question": false }, @@ -49782,9 +49866,9 @@ "question__title": "Matchsticks to Square", "question__title_slug": "matchsticks-to-square", "question__hide": false, - "total_acs": 65555, - "total_submitted": 140483, - "total_column_articles": 493, + "total_acs": 65826, + "total_submitted": 141046, + "total_column_articles": 494, "frontend_question_id": "473", "is_new_question": false }, @@ -49803,9 +49887,9 @@ "question__title": "Concatenated Words", "question__title_slug": "concatenated-words", "question__hide": false, - "total_acs": 25495, - "total_submitted": 49563, - "total_column_articles": 252, + "total_acs": 25596, + "total_submitted": 49716, + "total_column_articles": 253, "frontend_question_id": "472", "is_new_question": false }, @@ -49824,8 +49908,8 @@ "question__title": "Encode String with Shortest Length", "question__title_slug": "encode-string-with-shortest-length", "question__hide": false, - "total_acs": 2348, - "total_submitted": 3882, + "total_acs": 2354, + "total_submitted": 3889, "total_column_articles": 40, "frontend_question_id": "471", "is_new_question": false @@ -49845,8 +49929,8 @@ "question__title": "Convex Polygon", "question__title_slug": "convex-polygon", "question__hide": false, - "total_acs": 2379, - "total_submitted": 5560, + "total_acs": 2386, + "total_submitted": 5578, "total_column_articles": 32, "frontend_question_id": "469", "is_new_question": false @@ -49866,9 +49950,9 @@ "question__title": "Validate IP Address", "question__title_slug": "validate-ip-address", "question__hide": false, - "total_acs": 58683, - "total_submitted": 208489, - "total_column_articles": 683, + "total_acs": 58874, + "total_submitted": 209197, + "total_column_articles": 685, "frontend_question_id": "468", "is_new_question": false }, @@ -49887,9 +49971,9 @@ "question__title": "Unique Substrings in Wraparound String", "question__title_slug": "unique-substrings-in-wraparound-string", "question__hide": false, - "total_acs": 34697, - "total_submitted": 67065, - "total_column_articles": 355, + "total_acs": 34807, + "total_submitted": 67292, + "total_column_articles": 358, "frontend_question_id": "467", "is_new_question": false }, @@ -49908,8 +49992,8 @@ "question__title": "Count The Repetitions", "question__title_slug": "count-the-repetitions", "question__hide": false, - "total_acs": 13078, - "total_submitted": 35009, + "total_acs": 13104, + "total_submitted": 35096, "total_column_articles": 198, "frontend_question_id": "466", "is_new_question": false @@ -49929,8 +50013,8 @@ "question__title": "Optimal Account Balancing", "question__title_slug": "optimal-account-balancing", "question__hide": false, - "total_acs": 2443, - "total_submitted": 4443, + "total_acs": 2449, + "total_submitted": 4457, "total_column_articles": 36, "frontend_question_id": "465", "is_new_question": false @@ -49950,9 +50034,9 @@ "question__title": "Can I Win", "question__title_slug": "can-i-win", "question__hide": false, - "total_acs": 34997, - "total_submitted": 84397, - "total_column_articles": 269, + "total_acs": 35108, + "total_submitted": 84704, + "total_column_articles": 271, "frontend_question_id": "464", "is_new_question": false }, @@ -49971,9 +50055,9 @@ "question__title": "Island Perimeter", "question__title_slug": "island-perimeter", "question__hide": false, - "total_acs": 114549, - "total_submitted": 163122, - "total_column_articles": 1291, + "total_acs": 115211, + "total_submitted": 164094, + "total_column_articles": 1294, "frontend_question_id": "463", "is_new_question": false }, @@ -49992,9 +50076,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": 49374, - "total_submitted": 79118, - "total_column_articles": 509, + "total_acs": 49527, + "total_submitted": 79339, + "total_column_articles": 510, "frontend_question_id": "462", "is_new_question": false }, @@ -50013,9 +50097,9 @@ "question__title": "Hamming Distance", "question__title_slug": "hamming-distance", "question__hide": false, - "total_acs": 248719, - "total_submitted": 304063, - "total_column_articles": 1894, + "total_acs": 249771, + "total_submitted": 305351, + "total_column_articles": 1901, "frontend_question_id": "461", "is_new_question": false }, @@ -50034,9 +50118,9 @@ "question__title": "LFU Cache", "question__title_slug": "lfu-cache", "question__hide": false, - "total_acs": 57572, - "total_submitted": 129727, - "total_column_articles": 596, + "total_acs": 57811, + "total_submitted": 130342, + "total_column_articles": 599, "frontend_question_id": "460", "is_new_question": false }, @@ -50055,9 +50139,9 @@ "question__title": "Repeated Substring Pattern", "question__title_slug": "repeated-substring-pattern", "question__hide": false, - "total_acs": 149685, - "total_submitted": 293256, - "total_column_articles": 1100, + "total_acs": 151027, + "total_submitted": 295894, + "total_column_articles": 1115, "frontend_question_id": "459", "is_new_question": false }, @@ -50076,8 +50160,8 @@ "question__title": "Poor Pigs", "question__title_slug": "poor-pigs", "question__hide": false, - "total_acs": 25922, - "total_submitted": 37650, + "total_acs": 25980, + "total_submitted": 37792, "total_column_articles": 231, "frontend_question_id": "458", "is_new_question": false @@ -50097,9 +50181,9 @@ "question__title": "Circular Array Loop", "question__title_slug": "circular-array-loop", "question__hide": false, - "total_acs": 33765, - "total_submitted": 77833, - "total_column_articles": 358, + "total_acs": 33839, + "total_submitted": 78027, + "total_column_articles": 359, "frontend_question_id": "457", "is_new_question": false }, @@ -50118,9 +50202,9 @@ "question__title": "132 Pattern", "question__title_slug": "132-pattern", "question__hide": false, - "total_acs": 71781, - "total_submitted": 197076, - "total_column_articles": 580, + "total_acs": 71949, + "total_submitted": 197540, + "total_column_articles": 581, "frontend_question_id": "456", "is_new_question": false }, @@ -50139,9 +50223,9 @@ "question__title": "Assign Cookies", "question__title_slug": "assign-cookies", "question__hide": false, - "total_acs": 266010, - "total_submitted": 467369, - "total_column_articles": 1983, + "total_acs": 267659, + "total_submitted": 470477, + "total_column_articles": 2000, "frontend_question_id": "455", "is_new_question": false }, @@ -50160,9 +50244,9 @@ "question__title": "4Sum II", "question__title_slug": "4sum-ii", "question__hide": false, - "total_acs": 158435, - "total_submitted": 248804, - "total_column_articles": 951, + "total_acs": 159917, + "total_submitted": 251055, + "total_column_articles": 961, "frontend_question_id": "454", "is_new_question": false }, @@ -50181,8 +50265,8 @@ "question__title": "Minimum Moves to Equal Array Elements", "question__title_slug": "minimum-moves-to-equal-array-elements", "question__hide": false, - "total_acs": 70003, - "total_submitted": 113636, + "total_acs": 70160, + "total_submitted": 113904, "total_column_articles": 813, "frontend_question_id": "453", "is_new_question": false @@ -50202,9 +50286,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": 171059, - "total_submitted": 336892, - "total_column_articles": 1344, + "total_acs": 172041, + "total_submitted": 338800, + "total_column_articles": 1348, "frontend_question_id": "452", "is_new_question": false }, @@ -50223,9 +50307,9 @@ "question__title": "Sort Characters By Frequency", "question__title_slug": "sort-characters-by-frequency", "question__hide": false, - "total_acs": 114658, - "total_submitted": 159373, - "total_column_articles": 1252, + "total_acs": 115128, + "total_submitted": 160016, + "total_column_articles": 1254, "frontend_question_id": "451", "is_new_question": false }, @@ -50244,9 +50328,9 @@ "question__title": "Delete Node in a BST", "question__title_slug": "delete-node-in-a-bst", "question__hide": false, - "total_acs": 169230, - "total_submitted": 323291, - "total_column_articles": 1700, + "total_acs": 170510, + "total_submitted": 325759, + "total_column_articles": 1713, "frontend_question_id": "450", "is_new_question": false }, @@ -50265,9 +50349,9 @@ "question__title": "Serialize and Deserialize BST", "question__title_slug": "serialize-and-deserialize-bst", "question__hide": false, - "total_acs": 45936, - "total_submitted": 75831, - "total_column_articles": 419, + "total_acs": 46081, + "total_submitted": 76049, + "total_column_articles": 421, "frontend_question_id": "449", "is_new_question": false }, @@ -50286,9 +50370,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": 241574, - "total_submitted": 366875, - "total_column_articles": 1722, + "total_acs": 242969, + "total_submitted": 368950, + "total_column_articles": 1740, "frontend_question_id": "448", "is_new_question": false }, @@ -50307,8 +50391,8 @@ "question__title": "Number of Boomerangs", "question__title_slug": "number-of-boomerangs", "question__hide": false, - "total_acs": 53752, - "total_submitted": 80701, + "total_acs": 53819, + "total_submitted": 80805, "total_column_articles": 425, "frontend_question_id": "447", "is_new_question": false @@ -50328,8 +50412,8 @@ "question__title": "Arithmetic Slices II - Subsequence", "question__title_slug": "arithmetic-slices-ii-subsequence", "question__hide": false, - "total_acs": 22497, - "total_submitted": 40980, + "total_acs": 22541, + "total_submitted": 41066, "total_column_articles": 197, "frontend_question_id": "446", "is_new_question": false @@ -50349,9 +50433,9 @@ "question__title": "Add Two Numbers II", "question__title_slug": "add-two-numbers-ii", "question__hide": false, - "total_acs": 113264, - "total_submitted": 188446, - "total_column_articles": 1235, + "total_acs": 113602, + "total_submitted": 188986, + "total_column_articles": 1237, "frontend_question_id": "445", "is_new_question": false }, @@ -50370,8 +50454,8 @@ "question__title": "Sequence Reconstruction", "question__title_slug": "sequence-reconstruction", "question__hide": false, - "total_acs": 5343, - "total_submitted": 17708, + "total_acs": 5370, + "total_submitted": 17754, "total_column_articles": 83, "frontend_question_id": "444", "is_new_question": false @@ -50391,8 +50475,8 @@ "question__title": "String Compression", "question__title_slug": "string-compression", "question__hide": false, - "total_acs": 72656, - "total_submitted": 152210, + "total_acs": 72958, + "total_submitted": 152786, "total_column_articles": 839, "frontend_question_id": "443", "is_new_question": false @@ -50412,9 +50496,9 @@ "question__title": "Find All Duplicates in an Array", "question__title_slug": "find-all-duplicates-in-an-array", "question__hide": false, - "total_acs": 100738, - "total_submitted": 134370, - "total_column_articles": 968, + "total_acs": 101055, + "total_submitted": 134773, + "total_column_articles": 970, "frontend_question_id": "442", "is_new_question": false }, @@ -50433,9 +50517,9 @@ "question__title": "Arranging Coins", "question__title_slug": "arranging-coins", "question__hide": false, - "total_acs": 108314, - "total_submitted": 237887, - "total_column_articles": 1025, + "total_acs": 108903, + "total_submitted": 239161, + "total_column_articles": 1031, "frontend_question_id": "441", "is_new_question": false }, @@ -50454,9 +50538,9 @@ "question__title": "K-th Smallest in Lexicographical Order", "question__title_slug": "k-th-smallest-in-lexicographical-order", "question__hide": false, - "total_acs": 45628, - "total_submitted": 106892, - "total_column_articles": 288, + "total_acs": 45772, + "total_submitted": 107257, + "total_column_articles": 289, "frontend_question_id": "440", "is_new_question": false }, @@ -50475,9 +50559,9 @@ "question__title": "Ternary Expression Parser", "question__title_slug": "ternary-expression-parser", "question__hide": false, - "total_acs": 3783, - "total_submitted": 6315, - "total_column_articles": 93, + "total_acs": 3790, + "total_submitted": 6324, + "total_column_articles": 94, "frontend_question_id": "439", "is_new_question": false }, @@ -50496,9 +50580,9 @@ "question__title": "Find All Anagrams in a String", "question__title_slug": "find-all-anagrams-in-a-string", "question__hide": false, - "total_acs": 240399, - "total_submitted": 438373, - "total_column_articles": 1887, + "total_acs": 242151, + "total_submitted": 441526, + "total_column_articles": 1902, "frontend_question_id": "438", "is_new_question": false }, @@ -50517,9 +50601,9 @@ "question__title": "Path Sum III", "question__title_slug": "path-sum-iii", "question__hide": false, - "total_acs": 199974, - "total_submitted": 378964, - "total_column_articles": 1382, + "total_acs": 200821, + "total_submitted": 381274, + "total_column_articles": 1386, "frontend_question_id": "437", "is_new_question": false }, @@ -50538,9 +50622,9 @@ "question__title": "Find Right Interval", "question__title_slug": "find-right-interval", "question__hide": false, - "total_acs": 40833, - "total_submitted": 71864, - "total_column_articles": 540, + "total_acs": 40949, + "total_submitted": 72063, + "total_column_articles": 541, "frontend_question_id": "436", "is_new_question": false }, @@ -50559,9 +50643,9 @@ "question__title": "Non-overlapping Intervals", "question__title_slug": "non-overlapping-intervals", "question__hide": false, - "total_acs": 184017, - "total_submitted": 360256, - "total_column_articles": 1422, + "total_acs": 185194, + "total_submitted": 362461, + "total_column_articles": 1431, "frontend_question_id": "435", "is_new_question": false }, @@ -50580,9 +50664,9 @@ "question__title": "Number of Segments in a String", "question__title_slug": "number-of-segments-in-a-string", "question__hide": false, - "total_acs": 81865, - "total_submitted": 209192, - "total_column_articles": 1063, + "total_acs": 82347, + "total_submitted": 210534, + "total_column_articles": 1068, "frontend_question_id": "434", "is_new_question": false }, @@ -50601,9 +50685,9 @@ "question__title": "Minimum Genetic Mutation", "question__title_slug": "minimum-genetic-mutation", "question__hide": false, - "total_acs": 47988, - "total_submitted": 87098, - "total_column_articles": 701, + "total_acs": 48181, + "total_submitted": 87418, + "total_column_articles": 703, "frontend_question_id": "433", "is_new_question": false }, @@ -50622,8 +50706,8 @@ "question__title": "All O`one Data Structure", "question__title_slug": "all-oone-data-structure", "question__hide": false, - "total_acs": 27454, - "total_submitted": 58290, + "total_acs": 27498, + "total_submitted": 58380, "total_column_articles": 292, "frontend_question_id": "432", "is_new_question": false @@ -50643,8 +50727,8 @@ "question__title": "Word Squares", "question__title_slug": "word-squares", "question__hide": false, - "total_acs": 2249, - "total_submitted": 3603, + "total_acs": 2265, + "total_submitted": 3623, "total_column_articles": 45, "frontend_question_id": "425", "is_new_question": false @@ -50664,9 +50748,9 @@ "question__title": "Longest Repeating Character Replacement", "question__title_slug": "longest-repeating-character-replacement", "question__hide": false, - "total_acs": 79356, - "total_submitted": 145748, - "total_column_articles": 686, + "total_acs": 79779, + "total_submitted": 146488, + "total_column_articles": 690, "frontend_question_id": "424", "is_new_question": false }, @@ -50685,8 +50769,8 @@ "question__title": "Reconstruct Original Digits from English", "question__title_slug": "reconstruct-original-digits-from-english", "question__hide": false, - "total_acs": 37320, - "total_submitted": 61277, + "total_acs": 37386, + "total_submitted": 61398, "total_column_articles": 436, "frontend_question_id": "423", "is_new_question": false @@ -50706,9 +50790,9 @@ "question__title": "Valid Word Square", "question__title_slug": "valid-word-square", "question__hide": false, - "total_acs": 3172, - "total_submitted": 7244, - "total_column_articles": 78, + "total_acs": 3204, + "total_submitted": 7327, + "total_column_articles": 80, "frontend_question_id": "422", "is_new_question": false }, @@ -50727,8 +50811,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": 41339, - "total_submitted": 66913, + "total_acs": 41433, + "total_submitted": 67072, "total_column_articles": 390, "frontend_question_id": "421", "is_new_question": false @@ -50748,8 +50832,8 @@ "question__title": "Strong Password Checker", "question__title_slug": "strong-password-checker", "question__hide": false, - "total_acs": 17810, - "total_submitted": 45283, + "total_acs": 17825, + "total_submitted": 45313, "total_column_articles": 156, "frontend_question_id": "420", "is_new_question": false @@ -50769,9 +50853,9 @@ "question__title": "Battleships in a Board", "question__title_slug": "battleships-in-a-board", "question__hide": false, - "total_acs": 40855, - "total_submitted": 52054, - "total_column_articles": 528, + "total_acs": 40985, + "total_submitted": 52222, + "total_column_articles": 529, "frontend_question_id": "419", "is_new_question": false }, @@ -50790,8 +50874,8 @@ "question__title": "Sentence Screen Fitting", "question__title_slug": "sentence-screen-fitting", "question__hide": false, - "total_acs": 3501, - "total_submitted": 9059, + "total_acs": 3521, + "total_submitted": 9118, "total_column_articles": 54, "frontend_question_id": "418", "is_new_question": false @@ -50811,8 +50895,8 @@ "question__title": "Pacific Atlantic Water Flow", "question__title_slug": "pacific-atlantic-water-flow", "question__hide": false, - "total_acs": 74626, - "total_submitted": 133453, + "total_acs": 74930, + "total_submitted": 134018, "total_column_articles": 783, "frontend_question_id": "417", "is_new_question": false @@ -50832,9 +50916,9 @@ "question__title": "Partition Equal Subset Sum", "question__title_slug": "partition-equal-subset-sum", "question__hide": false, - "total_acs": 344630, - "total_submitted": 660478, - "total_column_articles": 1785, + "total_acs": 346735, + "total_submitted": 664587, + "total_column_articles": 1791, "frontend_question_id": "416", "is_new_question": false }, @@ -50853,9 +50937,9 @@ "question__title": "Add Strings", "question__title_slug": "add-strings", "question__hide": false, - "total_acs": 237961, - "total_submitted": 432782, - "total_column_articles": 1559, + "total_acs": 239085, + "total_submitted": 434849, + "total_column_articles": 1564, "frontend_question_id": "415", "is_new_question": false }, @@ -50874,9 +50958,9 @@ "question__title": "Third Maximum Number", "question__title_slug": "third-maximum-number", "question__hide": false, - "total_acs": 125393, - "total_submitted": 316865, - "total_column_articles": 1535, + "total_acs": 126154, + "total_submitted": 318598, + "total_column_articles": 1544, "frontend_question_id": "414", "is_new_question": false }, @@ -50895,9 +50979,9 @@ "question__title": "Arithmetic Slices", "question__title_slug": "arithmetic-slices", "question__hide": false, - "total_acs": 109602, - "total_submitted": 157657, - "total_column_articles": 1371, + "total_acs": 110005, + "total_submitted": 158256, + "total_column_articles": 1374, "frontend_question_id": "413", "is_new_question": false }, @@ -50916,9 +51000,9 @@ "question__title": "Fizz Buzz", "question__title_slug": "fizz-buzz", "question__hide": false, - "total_acs": 162120, - "total_submitted": 232789, - "total_column_articles": 1010, + "total_acs": 163743, + "total_submitted": 235196, + "total_column_articles": 1027, "frontend_question_id": "412", "is_new_question": false }, @@ -50937,8 +51021,8 @@ "question__title": "Minimum Unique Word Abbreviation", "question__title_slug": "minimum-unique-word-abbreviation", "question__hide": false, - "total_acs": 1397, - "total_submitted": 2857, + "total_acs": 1414, + "total_submitted": 2879, "total_column_articles": 33, "frontend_question_id": "411", "is_new_question": false @@ -50958,9 +51042,9 @@ "question__title": "Split Array Largest Sum", "question__title_slug": "split-array-largest-sum", "question__hide": false, - "total_acs": 59969, - "total_submitted": 101663, - "total_column_articles": 496, + "total_acs": 60257, + "total_submitted": 102204, + "total_column_articles": 498, "frontend_question_id": "410", "is_new_question": false }, @@ -50979,9 +51063,9 @@ "question__title": "Longest Palindrome", "question__title_slug": "longest-palindrome", "question__hide": false, - "total_acs": 151917, - "total_submitted": 272664, - "total_column_articles": 1878, + "total_acs": 152846, + "total_submitted": 274405, + "total_column_articles": 1887, "frontend_question_id": "409", "is_new_question": false }, @@ -51000,9 +51084,9 @@ "question__title": "Valid Word Abbreviation", "question__title_slug": "valid-word-abbreviation", "question__hide": false, - "total_acs": 5769, - "total_submitted": 16490, - "total_column_articles": 111, + "total_acs": 5790, + "total_submitted": 16544, + "total_column_articles": 113, "frontend_question_id": "408", "is_new_question": false }, @@ -51021,8 +51105,8 @@ "question__title": "Trapping Rain Water II", "question__title_slug": "trapping-rain-water-ii", "question__hide": false, - "total_acs": 31713, - "total_submitted": 54806, + "total_acs": 31798, + "total_submitted": 54981, "total_column_articles": 289, "frontend_question_id": "407", "is_new_question": false @@ -51042,9 +51126,9 @@ "question__title": "Queue Reconstruction by Height", "question__title_slug": "queue-reconstruction-by-height", "question__hide": false, - "total_acs": 208955, - "total_submitted": 275297, - "total_column_articles": 1260, + "total_acs": 210054, + "total_submitted": 276662, + "total_column_articles": 1268, "frontend_question_id": "406", "is_new_question": false }, @@ -51063,9 +51147,9 @@ "question__title": "Convert a Number to Hexadecimal", "question__title_slug": "convert-a-number-to-hexadecimal", "question__hide": false, - "total_acs": 59358, - "total_submitted": 107215, - "total_column_articles": 581, + "total_acs": 59545, + "total_submitted": 107600, + "total_column_articles": 584, "frontend_question_id": "405", "is_new_question": false }, @@ -51084,9 +51168,9 @@ "question__title": "Sum of Left Leaves", "question__title_slug": "sum-of-left-leaves", "question__hide": false, - "total_acs": 192739, - "total_submitted": 312579, - "total_column_articles": 1790, + "total_acs": 194285, + "total_submitted": 314980, + "total_column_articles": 1800, "frontend_question_id": "404", "is_new_question": false }, @@ -51105,9 +51189,9 @@ "question__title": "Frog Jump", "question__title_slug": "frog-jump", "question__hide": false, - "total_acs": 57261, - "total_submitted": 124861, - "total_column_articles": 548, + "total_acs": 57410, + "total_submitted": 125165, + "total_column_articles": 550, "frontend_question_id": "403", "is_new_question": false }, @@ -51126,9 +51210,9 @@ "question__title": "Remove K Digits", "question__title_slug": "remove-k-digits", "question__hide": false, - "total_acs": 123700, - "total_submitted": 386761, - "total_column_articles": 885, + "total_acs": 124175, + "total_submitted": 388261, + "total_column_articles": 886, "frontend_question_id": "402", "is_new_question": false }, @@ -51147,9 +51231,9 @@ "question__title": "Binary Watch", "question__title_slug": "binary-watch", "question__hide": false, - "total_acs": 66947, - "total_submitted": 107500, - "total_column_articles": 831, + "total_acs": 67107, + "total_submitted": 107759, + "total_column_articles": 835, "frontend_question_id": "401", "is_new_question": false }, @@ -51168,9 +51252,9 @@ "question__title": "Nth Digit", "question__title_slug": "nth-digit", "question__hide": false, - "total_acs": 53815, - "total_submitted": 118080, - "total_column_articles": 593, + "total_acs": 53945, + "total_submitted": 118375, + "total_column_articles": 594, "frontend_question_id": "400", "is_new_question": false }, @@ -51189,9 +51273,9 @@ "question__title": "Evaluate Division", "question__title_slug": "evaluate-division", "question__hide": false, - "total_acs": 67161, - "total_submitted": 113057, - "total_column_articles": 780, + "total_acs": 67491, + "total_submitted": 113660, + "total_column_articles": 783, "frontend_question_id": "399", "is_new_question": false }, @@ -51210,9 +51294,9 @@ "question__title": "Random Pick Index", "question__title_slug": "random-pick-index", "question__hide": false, - "total_acs": 55000, - "total_submitted": 77436, - "total_column_articles": 452, + "total_acs": 55095, + "total_submitted": 77612, + "total_column_articles": 453, "frontend_question_id": "398", "is_new_question": false }, @@ -51231,9 +51315,9 @@ "question__title": "Integer Replacement", "question__title_slug": "integer-replacement", "question__hide": false, - "total_acs": 61129, - "total_submitted": 143353, - "total_column_articles": 662, + "total_acs": 61329, + "total_submitted": 143836, + "total_column_articles": 663, "frontend_question_id": "397", "is_new_question": false }, @@ -51252,9 +51336,9 @@ "question__title": "Rotate Function", "question__title_slug": "rotate-function", "question__hide": false, - "total_acs": 45644, - "total_submitted": 84959, - "total_column_articles": 575, + "total_acs": 45767, + "total_submitted": 85204, + "total_column_articles": 577, "frontend_question_id": "396", "is_new_question": false }, @@ -51273,9 +51357,9 @@ "question__title": "Longest Substring with At Least K Repeating Characters", "question__title_slug": "longest-substring-with-at-least-k-repeating-characters", "question__hide": false, - "total_acs": 76097, - "total_submitted": 144454, - "total_column_articles": 610, + "total_acs": 76471, + "total_submitted": 145265, + "total_column_articles": 612, "frontend_question_id": "395", "is_new_question": false }, @@ -51294,9 +51378,9 @@ "question__title": "Decode String", "question__title_slug": "decode-string", "question__hide": false, - "total_acs": 210511, - "total_submitted": 370892, - "total_column_articles": 2000, + "total_acs": 211711, + "total_submitted": 372953, + "total_column_articles": 2007, "frontend_question_id": "394", "is_new_question": false }, @@ -51315,9 +51399,9 @@ "question__title": "UTF-8 Validation", "question__title_slug": "utf-8-validation", "question__hide": false, - "total_acs": 36810, - "total_submitted": 84160, - "total_column_articles": 472, + "total_acs": 36927, + "total_submitted": 84414, + "total_column_articles": 474, "frontend_question_id": "393", "is_new_question": false }, @@ -51336,9 +51420,9 @@ "question__title": "Is Subsequence", "question__title_slug": "is-subsequence", "question__hide": false, - "total_acs": 251306, - "total_submitted": 480559, - "total_column_articles": 2401, + "total_acs": 252978, + "total_submitted": 483905, + "total_column_articles": 2410, "frontend_question_id": "392", "is_new_question": false }, @@ -51357,8 +51441,8 @@ "question__title": "Perfect Rectangle", "question__title_slug": "perfect-rectangle", "question__hide": false, - "total_acs": 25290, - "total_submitted": 54816, + "total_acs": 25385, + "total_submitted": 55031, "total_column_articles": 292, "frontend_question_id": "391", "is_new_question": false @@ -51378,9 +51462,9 @@ "question__title": "Elimination Game", "question__title_slug": "elimination-game", "question__hide": false, - "total_acs": 34717, - "total_submitted": 57288, - "total_column_articles": 440, + "total_acs": 34843, + "total_submitted": 57506, + "total_column_articles": 441, "frontend_question_id": "390", "is_new_question": false }, @@ -51399,9 +51483,9 @@ "question__title": "Find the Difference", "question__title_slug": "find-the-difference", "question__hide": false, - "total_acs": 145732, - "total_submitted": 215819, - "total_column_articles": 1476, + "total_acs": 146608, + "total_submitted": 217198, + "total_column_articles": 1483, "frontend_question_id": "389", "is_new_question": false }, @@ -51420,8 +51504,8 @@ "question__title": "Longest Absolute File Path", "question__title_slug": "longest-absolute-file-path", "question__hide": false, - "total_acs": 32221, - "total_submitted": 50473, + "total_acs": 32310, + "total_submitted": 50651, "total_column_articles": 503, "frontend_question_id": "388", "is_new_question": false @@ -51441,9 +51525,9 @@ "question__title": "First Unique Character in a String", "question__title_slug": "first-unique-character-in-a-string", "question__hide": false, - "total_acs": 345241, - "total_submitted": 622232, - "total_column_articles": 1890, + "total_acs": 346737, + "total_submitted": 624668, + "total_column_articles": 1907, "frontend_question_id": "387", "is_new_question": false }, @@ -51462,9 +51546,9 @@ "question__title": "Lexicographical Numbers", "question__title_slug": "lexicographical-numbers", "question__hide": false, - "total_acs": 67375, - "total_submitted": 89940, - "total_column_articles": 641, + "total_acs": 67544, + "total_submitted": 90179, + "total_column_articles": 643, "frontend_question_id": "386", "is_new_question": false }, @@ -51483,8 +51567,8 @@ "question__title": "Mini Parser", "question__title_slug": "mini-parser", "question__hide": false, - "total_acs": 30078, - "total_submitted": 54800, + "total_acs": 30150, + "total_submitted": 54956, "total_column_articles": 290, "frontend_question_id": "385", "is_new_question": false @@ -51504,8 +51588,8 @@ "question__title": "Shuffle an Array", "question__title_slug": "shuffle-an-array", "question__hide": false, - "total_acs": 113118, - "total_submitted": 184287, + "total_acs": 113518, + "total_submitted": 185003, "total_column_articles": 542, "frontend_question_id": "384", "is_new_question": false @@ -51525,9 +51609,9 @@ "question__title": "Ransom Note", "question__title_slug": "ransom-note", "question__hide": false, - "total_acs": 258175, - "total_submitted": 427648, - "total_column_articles": 2369, + "total_acs": 261321, + "total_submitted": 433411, + "total_column_articles": 2399, "frontend_question_id": "383", "is_new_question": false }, @@ -51546,9 +51630,9 @@ "question__title": "Linked List Random Node", "question__title_slug": "linked-list-random-node", "question__hide": false, - "total_acs": 56195, - "total_submitted": 77290, - "total_column_articles": 420, + "total_acs": 56434, + "total_submitted": 77618, + "total_column_articles": 421, "frontend_question_id": "382", "is_new_question": false }, @@ -51567,9 +51651,9 @@ "question__title": "Insert Delete GetRandom O(1) - Duplicates allowed", "question__title_slug": "insert-delete-getrandom-o1-duplicates-allowed", "question__hide": false, - "total_acs": 24977, - "total_submitted": 58502, - "total_column_articles": 227, + "total_acs": 25044, + "total_submitted": 58683, + "total_column_articles": 228, "frontend_question_id": "381", "is_new_question": false }, @@ -51588,9 +51672,9 @@ "question__title": "Insert Delete GetRandom O(1)", "question__title_slug": "insert-delete-getrandom-o1", "question__hide": false, - "total_acs": 94129, - "total_submitted": 178337, - "total_column_articles": 1416, + "total_acs": 94622, + "total_submitted": 179340, + "total_column_articles": 1429, "frontend_question_id": "380", "is_new_question": false }, @@ -51609,8 +51693,8 @@ "question__title": "Design Phone Directory", "question__title_slug": "design-phone-directory", "question__hide": false, - "total_acs": 5204, - "total_submitted": 8486, + "total_acs": 5225, + "total_submitted": 8521, "total_column_articles": 102, "frontend_question_id": "379", "is_new_question": false @@ -51630,9 +51714,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": 113185, - "total_submitted": 178204, - "total_column_articles": 789, + "total_acs": 113611, + "total_submitted": 178887, + "total_column_articles": 791, "frontend_question_id": "378", "is_new_question": false }, @@ -51651,9 +51735,9 @@ "question__title": "Combination Sum IV", "question__title_slug": "combination-sum-iv", "question__hide": false, - "total_acs": 118519, - "total_submitted": 223471, - "total_column_articles": 840, + "total_acs": 119206, + "total_submitted": 224724, + "total_column_articles": 844, "frontend_question_id": "377", "is_new_question": false }, @@ -51672,9 +51756,9 @@ "question__title": "Wiggle Subsequence", "question__title_slug": "wiggle-subsequence", "question__hide": false, - "total_acs": 148520, - "total_submitted": 314600, - "total_column_articles": 1357, + "total_acs": 149495, + "total_submitted": 316796, + "total_column_articles": 1359, "frontend_question_id": "376", "is_new_question": false }, @@ -51693,9 +51777,9 @@ "question__title": "Guess Number Higher or Lower II", "question__title_slug": "guess-number-higher-or-lower-ii", "question__hide": false, - "total_acs": 41384, - "total_submitted": 67256, - "total_column_articles": 322, + "total_acs": 41770, + "total_submitted": 67713, + "total_column_articles": 323, "frontend_question_id": "375", "is_new_question": false }, @@ -51714,9 +51798,9 @@ "question__title": "Guess Number Higher or Lower", "question__title_slug": "guess-number-higher-or-lower", "question__hide": false, - "total_acs": 140693, - "total_submitted": 270484, - "total_column_articles": 905, + "total_acs": 141558, + "total_submitted": 272130, + "total_column_articles": 915, "frontend_question_id": "374", "is_new_question": false }, @@ -51735,9 +51819,9 @@ "question__title": "Find K Pairs with Smallest Sums", "question__title_slug": "find-k-pairs-with-smallest-sums", "question__hide": false, - "total_acs": 54341, - "total_submitted": 132583, - "total_column_articles": 518, + "total_acs": 54496, + "total_submitted": 133095, + "total_column_articles": 519, "frontend_question_id": "373", "is_new_question": false }, @@ -51756,9 +51840,9 @@ "question__title": "Super Pow", "question__title_slug": "super-pow", "question__hide": false, - "total_acs": 42820, - "total_submitted": 74837, - "total_column_articles": 451, + "total_acs": 42931, + "total_submitted": 75039, + "total_column_articles": 455, "frontend_question_id": "372", "is_new_question": false }, @@ -51777,9 +51861,9 @@ "question__title": "Sum of Two Integers", "question__title_slug": "sum-of-two-integers", "question__hide": false, - "total_acs": 100736, - "total_submitted": 163890, - "total_column_articles": 651, + "total_acs": 101005, + "total_submitted": 164325, + "total_column_articles": 652, "frontend_question_id": "371", "is_new_question": false }, @@ -51798,9 +51882,9 @@ "question__title": "Range Addition", "question__title_slug": "range-addition", "question__hide": false, - "total_acs": 10409, - "total_submitted": 13630, - "total_column_articles": 248, + "total_acs": 10517, + "total_submitted": 13768, + "total_column_articles": 252, "frontend_question_id": "370", "is_new_question": false }, @@ -51819,8 +51903,8 @@ "question__title": "Plus One Linked List", "question__title_slug": "plus-one-linked-list", "question__hide": false, - "total_acs": 7303, - "total_submitted": 11583, + "total_acs": 7332, + "total_submitted": 11628, "total_column_articles": 206, "frontend_question_id": "369", "is_new_question": false @@ -51840,9 +51924,9 @@ "question__title": "Largest Divisible Subset", "question__title_slug": "largest-divisible-subset", "question__hide": false, - "total_acs": 52570, - "total_submitted": 114399, - "total_column_articles": 562, + "total_acs": 52758, + "total_submitted": 114746, + "total_column_articles": 563, "frontend_question_id": "368", "is_new_question": false }, @@ -51861,9 +51945,9 @@ "question__title": "Valid Perfect Square", "question__title_slug": "valid-perfect-square", "question__hide": false, - "total_acs": 193938, - "total_submitted": 432587, - "total_column_articles": 1457, + "total_acs": 195145, + "total_submitted": 435307, + "total_column_articles": 1464, "frontend_question_id": "367", "is_new_question": false }, @@ -51882,9 +51966,9 @@ "question__title": "Find Leaves of Binary Tree", "question__title_slug": "find-leaves-of-binary-tree", "question__hide": false, - "total_acs": 8180, - "total_submitted": 10296, - "total_column_articles": 202, + "total_acs": 8214, + "total_submitted": 10333, + "total_column_articles": 204, "frontend_question_id": "366", "is_new_question": false }, @@ -51903,9 +51987,9 @@ "question__title": "Water and Jug Problem", "question__title_slug": "water-and-jug-problem", "question__hide": false, - "total_acs": 44172, - "total_submitted": 113072, - "total_column_articles": 581, + "total_acs": 44313, + "total_submitted": 113328, + "total_column_articles": 582, "frontend_question_id": "365", "is_new_question": false }, @@ -51924,8 +52008,8 @@ "question__title": "Nested List Weight Sum II", "question__title_slug": "nested-list-weight-sum-ii", "question__hide": false, - "total_acs": 3008, - "total_submitted": 4351, + "total_acs": 3016, + "total_submitted": 4363, "total_column_articles": 72, "frontend_question_id": "364", "is_new_question": false @@ -51945,9 +52029,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": 39326, - "total_submitted": 81417, - "total_column_articles": 252, + "total_acs": 39412, + "total_submitted": 81622, + "total_column_articles": 253, "frontend_question_id": "363", "is_new_question": false }, @@ -51966,9 +52050,9 @@ "question__title": "Design Hit Counter", "question__title_slug": "design-hit-counter", "question__hide": false, - "total_acs": 6087, - "total_submitted": 8871, - "total_column_articles": 109, + "total_acs": 6113, + "total_submitted": 8910, + "total_column_articles": 110, "frontend_question_id": "362", "is_new_question": false }, @@ -51987,8 +52071,8 @@ "question__title": "Bomb Enemy", "question__title_slug": "bomb-enemy", "question__hide": false, - "total_acs": 5341, - "total_submitted": 9041, + "total_acs": 5375, + "total_submitted": 9094, "total_column_articles": 100, "frontend_question_id": "361", "is_new_question": false @@ -52008,8 +52092,8 @@ "question__title": "Sort Transformed Array", "question__title_slug": "sort-transformed-array", "question__hide": false, - "total_acs": 4560, - "total_submitted": 7430, + "total_acs": 4579, + "total_submitted": 7454, "total_column_articles": 86, "frontend_question_id": "360", "is_new_question": false @@ -52029,9 +52113,9 @@ "question__title": "Logger Rate Limiter", "question__title_slug": "logger-rate-limiter", "question__hide": false, - "total_acs": 7735, - "total_submitted": 10399, - "total_column_articles": 92, + "total_acs": 7767, + "total_submitted": 10443, + "total_column_articles": 93, "frontend_question_id": "359", "is_new_question": false }, @@ -52050,8 +52134,8 @@ "question__title": "Rearrange String k Distance Apart", "question__title_slug": "rearrange-string-k-distance-apart", "question__hide": false, - "total_acs": 6264, - "total_submitted": 17293, + "total_acs": 6278, + "total_submitted": 17335, "total_column_articles": 84, "frontend_question_id": "358", "is_new_question": false @@ -52071,9 +52155,9 @@ "question__title": "Count Numbers with Unique Digits", "question__title_slug": "count-numbers-with-unique-digits", "question__hide": false, - "total_acs": 64642, - "total_submitted": 107334, - "total_column_articles": 904, + "total_acs": 64763, + "total_submitted": 107516, + "total_column_articles": 905, "frontend_question_id": "357", "is_new_question": false }, @@ -52092,8 +52176,8 @@ "question__title": "Line Reflection", "question__title_slug": "line-reflection", "question__hide": false, - "total_acs": 2390, - "total_submitted": 6563, + "total_acs": 2400, + "total_submitted": 6592, "total_column_articles": 58, "frontend_question_id": "356", "is_new_question": false @@ -52113,9 +52197,9 @@ "question__title": "Design Twitter", "question__title_slug": "design-twitter", "question__hide": false, - "total_acs": 38749, - "total_submitted": 94604, - "total_column_articles": 625, + "total_acs": 38937, + "total_submitted": 95183, + "total_column_articles": 628, "frontend_question_id": "355", "is_new_question": false }, @@ -52134,9 +52218,9 @@ "question__title": "Russian Doll Envelopes", "question__title_slug": "russian-doll-envelopes", "question__hide": false, - "total_acs": 94612, - "total_submitted": 239629, - "total_column_articles": 760, + "total_acs": 94902, + "total_submitted": 240774, + "total_column_articles": 766, "frontend_question_id": "354", "is_new_question": false }, @@ -52155,8 +52239,8 @@ "question__title": "Design Snake Game", "question__title_slug": "design-snake-game", "question__hide": false, - "total_acs": 3845, - "total_submitted": 8759, + "total_acs": 3865, + "total_submitted": 8794, "total_column_articles": 79, "frontend_question_id": "353", "is_new_question": false @@ -52176,8 +52260,8 @@ "question__title": "Data Stream as Disjoint Intervals", "question__title_slug": "data-stream-as-disjoint-intervals", "question__hide": false, - "total_acs": 24087, - "total_submitted": 35742, + "total_acs": 24129, + "total_submitted": 35807, "total_column_articles": 395, "frontend_question_id": "352", "is_new_question": false @@ -52197,8 +52281,8 @@ "question__title": "Android Unlock Patterns", "question__title_slug": "android-unlock-patterns", "question__hide": false, - "total_acs": 6967, - "total_submitted": 11465, + "total_acs": 6989, + "total_submitted": 11494, "total_column_articles": 127, "frontend_question_id": "351", "is_new_question": false @@ -52218,9 +52302,9 @@ "question__title": "Intersection of Two Arrays II", "question__title_slug": "intersection-of-two-arrays-ii", "question__hide": false, - "total_acs": 418137, - "total_submitted": 738268, - "total_column_articles": 2448, + "total_acs": 420186, + "total_submitted": 741668, + "total_column_articles": 2461, "frontend_question_id": "350", "is_new_question": false }, @@ -52239,9 +52323,9 @@ "question__title": "Intersection of Two Arrays", "question__title_slug": "intersection-of-two-arrays", "question__hide": false, - "total_acs": 368116, - "total_submitted": 495494, - "total_column_articles": 2474, + "total_acs": 370924, + "total_submitted": 499182, + "total_column_articles": 2492, "frontend_question_id": "349", "is_new_question": false }, @@ -52260,8 +52344,8 @@ "question__title": "Design Tic-Tac-Toe", "question__title_slug": "design-tic-tac-toe", "question__hide": false, - "total_acs": 8579, - "total_submitted": 14347, + "total_acs": 8619, + "total_submitted": 14417, "total_column_articles": 124, "frontend_question_id": "348", "is_new_question": false @@ -52281,9 +52365,9 @@ "question__title": "Top K Frequent Elements", "question__title_slug": "top-k-frequent-elements", "question__hide": false, - "total_acs": 364708, - "total_submitted": 575702, - "total_column_articles": 2531, + "total_acs": 367185, + "total_submitted": 579607, + "total_column_articles": 2541, "frontend_question_id": "347", "is_new_question": false }, @@ -52302,9 +52386,9 @@ "question__title": "Moving Average from Data Stream", "question__title_slug": "moving-average-from-data-stream", "question__hide": false, - "total_acs": 18255, - "total_submitted": 25357, - "total_column_articles": 194, + "total_acs": 18314, + "total_submitted": 25435, + "total_column_articles": 195, "frontend_question_id": "346", "is_new_question": false }, @@ -52323,9 +52407,9 @@ "question__title": "Reverse Vowels of a String", "question__title_slug": "reverse-vowels-of-a-string", "question__hide": false, - "total_acs": 143295, - "total_submitted": 263483, - "total_column_articles": 1310, + "total_acs": 143954, + "total_submitted": 264637, + "total_column_articles": 1313, "frontend_question_id": "345", "is_new_question": false }, @@ -52344,9 +52428,9 @@ "question__title": "Reverse String", "question__title_slug": "reverse-string", "question__hide": false, - "total_acs": 641906, - "total_submitted": 810321, - "total_column_articles": 3271, + "total_acs": 645450, + "total_submitted": 814592, + "total_column_articles": 3282, "frontend_question_id": "344", "is_new_question": false }, @@ -52365,9 +52449,9 @@ "question__title": "Integer Break", "question__title_slug": "integer-break", "question__hide": false, - "total_acs": 212272, - "total_submitted": 341706, - "total_column_articles": 1682, + "total_acs": 213624, + "total_submitted": 343738, + "total_column_articles": 1689, "frontend_question_id": "343", "is_new_question": false }, @@ -52386,9 +52470,9 @@ "question__title": "Power of Four", "question__title_slug": "power-of-four", "question__hide": false, - "total_acs": 117696, - "total_submitted": 223899, - "total_column_articles": 1000, + "total_acs": 118200, + "total_submitted": 224867, + "total_column_articles": 1004, "frontend_question_id": "342", "is_new_question": false }, @@ -52407,9 +52491,9 @@ "question__title": "Flatten Nested List Iterator", "question__title_slug": "flatten-nested-list-iterator", "question__hide": false, - "total_acs": 68890, - "total_submitted": 94702, - "total_column_articles": 634, + "total_acs": 69132, + "total_submitted": 95043, + "total_column_articles": 635, "frontend_question_id": "341", "is_new_question": false }, @@ -52428,9 +52512,9 @@ "question__title": "Longest Substring with At Most K Distinct Characters", "question__title_slug": "longest-substring-with-at-most-k-distinct-characters", "question__hide": false, - "total_acs": 22410, - "total_submitted": 44131, - "total_column_articles": 279, + "total_acs": 22545, + "total_submitted": 44407, + "total_column_articles": 280, "frontend_question_id": "340", "is_new_question": false }, @@ -52449,8 +52533,8 @@ "question__title": "Nested List Weight Sum", "question__title_slug": "nested-list-weight-sum", "question__hide": false, - "total_acs": 5726, - "total_submitted": 6880, + "total_acs": 5746, + "total_submitted": 6901, "total_column_articles": 77, "frontend_question_id": "339", "is_new_question": false @@ -52470,9 +52554,9 @@ "question__title": "Counting Bits", "question__title_slug": "counting-bits", "question__hide": false, - "total_acs": 256430, - "total_submitted": 325798, - "total_column_articles": 1991, + "total_acs": 257780, + "total_submitted": 327509, + "total_column_articles": 2002, "frontend_question_id": "338", "is_new_question": false }, @@ -52491,9 +52575,9 @@ "question__title": "House Robber III", "question__title_slug": "house-robber-iii", "question__hide": false, - "total_acs": 231893, - "total_submitted": 380379, - "total_column_articles": 1527, + "total_acs": 233058, + "total_submitted": 382307, + "total_column_articles": 1532, "frontend_question_id": "337", "is_new_question": false }, @@ -52512,9 +52596,9 @@ "question__title": "Palindrome Pairs", "question__title_slug": "palindrome-pairs", "question__hide": false, - "total_acs": 26065, - "total_submitted": 67472, - "total_column_articles": 227, + "total_acs": 26107, + "total_submitted": 67632, + "total_column_articles": 229, "frontend_question_id": "336", "is_new_question": false }, @@ -52533,9 +52617,9 @@ "question__title": "Self Crossing", "question__title_slug": "self-crossing", "question__hide": false, - "total_acs": 17803, - "total_submitted": 41820, - "total_column_articles": 158, + "total_acs": 17827, + "total_submitted": 41885, + "total_column_articles": 160, "frontend_question_id": "335", "is_new_question": false }, @@ -52554,9 +52638,9 @@ "question__title": "Increasing Triplet Subsequence", "question__title_slug": "increasing-triplet-subsequence", "question__hide": false, - "total_acs": 108997, - "total_submitted": 251633, - "total_column_articles": 733, + "total_acs": 109519, + "total_submitted": 252766, + "total_column_articles": 734, "frontend_question_id": "334", "is_new_question": false }, @@ -52575,8 +52659,8 @@ "question__title": "Largest BST Subtree", "question__title_slug": "largest-bst-subtree", "question__hide": false, - "total_acs": 7862, - "total_submitted": 16305, + "total_acs": 7898, + "total_submitted": 16362, "total_column_articles": 137, "frontend_question_id": "333", "is_new_question": false @@ -52596,9 +52680,9 @@ "question__title": "Reconstruct Itinerary", "question__title_slug": "reconstruct-itinerary", "question__hide": false, - "total_acs": 70763, - "total_submitted": 150013, - "total_column_articles": 519, + "total_acs": 71255, + "total_submitted": 150968, + "total_column_articles": 520, "frontend_question_id": "332", "is_new_question": false }, @@ -52617,9 +52701,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": 56250, - "total_submitted": 117086, - "total_column_articles": 622, + "total_acs": 56403, + "total_submitted": 117384, + "total_column_articles": 623, "frontend_question_id": "331", "is_new_question": false }, @@ -52638,9 +52722,9 @@ "question__title": "Patching Array", "question__title_slug": "patching-array", "question__hide": false, - "total_acs": 21735, - "total_submitted": 41034, - "total_column_articles": 175, + "total_acs": 21780, + "total_submitted": 41126, + "total_column_articles": 177, "frontend_question_id": "330", "is_new_question": false }, @@ -52659,9 +52743,9 @@ "question__title": "Longest Increasing Path in a Matrix", "question__title_slug": "longest-increasing-path-in-a-matrix", "question__hide": false, - "total_acs": 88008, - "total_submitted": 171530, - "total_column_articles": 782, + "total_acs": 88350, + "total_submitted": 172149, + "total_column_articles": 785, "frontend_question_id": "329", "is_new_question": false }, @@ -52680,9 +52764,9 @@ "question__title": "Odd Even Linked List", "question__title_slug": "odd-even-linked-list", "question__hide": false, - "total_acs": 187320, - "total_submitted": 287030, - "total_column_articles": 1485, + "total_acs": 188096, + "total_submitted": 288271, + "total_column_articles": 1490, "frontend_question_id": "328", "is_new_question": false }, @@ -52701,9 +52785,9 @@ "question__title": "Count of Range Sum", "question__title_slug": "count-of-range-sum", "question__hide": false, - "total_acs": 35978, - "total_submitted": 87234, - "total_column_articles": 315, + "total_acs": 36191, + "total_submitted": 87793, + "total_column_articles": 316, "frontend_question_id": "327", "is_new_question": false }, @@ -52722,9 +52806,9 @@ "question__title": "Power of Three", "question__title_slug": "power-of-three", "question__hide": false, - "total_acs": 187706, - "total_submitted": 369223, - "total_column_articles": 827, + "total_acs": 188490, + "total_submitted": 370751, + "total_column_articles": 832, "frontend_question_id": "326", "is_new_question": false }, @@ -52743,8 +52827,8 @@ "question__title": "Maximum Size Subarray Sum Equals k", "question__title_slug": "maximum-size-subarray-sum-equals-k", "question__hide": false, - "total_acs": 15144, - "total_submitted": 28909, + "total_acs": 15293, + "total_submitted": 29195, "total_column_articles": 174, "frontend_question_id": "325", "is_new_question": false @@ -52764,9 +52848,9 @@ "question__title": "Wiggle Sort II", "question__title_slug": "wiggle-sort-ii", "question__hide": false, - "total_acs": 57866, - "total_submitted": 141679, - "total_column_articles": 378, + "total_acs": 58028, + "total_submitted": 142086, + "total_column_articles": 380, "frontend_question_id": "324", "is_new_question": false }, @@ -52785,9 +52869,9 @@ "question__title": "Number of Connected Components in an Undirected Graph", "question__title_slug": "number-of-connected-components-in-an-undirected-graph", "question__hide": false, - "total_acs": 20652, - "total_submitted": 31607, - "total_column_articles": 292, + "total_acs": 20807, + "total_submitted": 31839, + "total_column_articles": 293, "frontend_question_id": "323", "is_new_question": false }, @@ -52806,9 +52890,9 @@ "question__title": "Coin Change", "question__title_slug": "coin-change", "question__hide": false, - "total_acs": 544608, - "total_submitted": 1181569, - "total_column_articles": 3194, + "total_acs": 547396, + "total_submitted": 1187270, + "total_column_articles": 3207, "frontend_question_id": "322", "is_new_question": false }, @@ -52827,9 +52911,9 @@ "question__title": "Create Maximum Number", "question__title_slug": "create-maximum-number", "question__hide": false, - "total_acs": 33483, - "total_submitted": 79918, - "total_column_articles": 284, + "total_acs": 33621, + "total_submitted": 80276, + "total_column_articles": 285, "frontend_question_id": "321", "is_new_question": false }, @@ -52848,8 +52932,8 @@ "question__title": "Generalized Abbreviation", "question__title_slug": "generalized-abbreviation", "question__hide": false, - "total_acs": 4301, - "total_submitted": 6178, + "total_acs": 4311, + "total_submitted": 6193, "total_column_articles": 77, "frontend_question_id": "320", "is_new_question": false @@ -52869,9 +52953,9 @@ "question__title": "Bulb Switcher", "question__title_slug": "bulb-switcher", "question__hide": false, - "total_acs": 57334, - "total_submitted": 99627, - "total_column_articles": 518, + "total_acs": 57472, + "total_submitted": 99884, + "total_column_articles": 520, "frontend_question_id": "319", "is_new_question": false }, @@ -52890,9 +52974,9 @@ "question__title": "Maximum Product of Word Lengths", "question__title_slug": "maximum-product-of-word-lengths", "question__hide": false, - "total_acs": 62627, - "total_submitted": 85426, - "total_column_articles": 591, + "total_acs": 62827, + "total_submitted": 85741, + "total_column_articles": 592, "frontend_question_id": "318", "is_new_question": false }, @@ -52911,8 +52995,8 @@ "question__title": "Shortest Distance from All Buildings", "question__title_slug": "shortest-distance-from-all-buildings", "question__hide": false, - "total_acs": 6763, - "total_submitted": 14209, + "total_acs": 6790, + "total_submitted": 14265, "total_column_articles": 90, "frontend_question_id": "317", "is_new_question": false @@ -52932,9 +53016,9 @@ "question__title": "Remove Duplicate Letters", "question__title_slug": "remove-duplicate-letters", "question__hide": false, - "total_acs": 105086, - "total_submitted": 218648, - "total_column_articles": 819, + "total_acs": 105623, + "total_submitted": 219672, + "total_column_articles": 825, "frontend_question_id": "316", "is_new_question": false }, @@ -52953,9 +53037,9 @@ "question__title": "Count of Smaller Numbers After Self", "question__title_slug": "count-of-smaller-numbers-after-self", "question__hide": false, - "total_acs": 74279, - "total_submitted": 172304, - "total_column_articles": 731, + "total_acs": 74779, + "total_submitted": 173322, + "total_column_articles": 733, "frontend_question_id": "315", "is_new_question": false }, @@ -52974,8 +53058,8 @@ "question__title": "Binary Tree Vertical Order Traversal", "question__title_slug": "binary-tree-vertical-order-traversal", "question__hide": false, - "total_acs": 8861, - "total_submitted": 15959, + "total_acs": 8917, + "total_submitted": 16056, "total_column_articles": 149, "frontend_question_id": "314", "is_new_question": false @@ -52995,9 +53079,9 @@ "question__title": "Super Ugly Number", "question__title_slug": "super-ugly-number", "question__hide": false, - "total_acs": 53668, - "total_submitted": 92340, - "total_column_articles": 472, + "total_acs": 53823, + "total_submitted": 92704, + "total_column_articles": 473, "frontend_question_id": "313", "is_new_question": false }, @@ -53016,9 +53100,9 @@ "question__title": "Burst Balloons", "question__title_slug": "burst-balloons", "question__hide": false, - "total_acs": 91557, - "total_submitted": 131251, - "total_column_articles": 589, + "total_acs": 91976, + "total_submitted": 131840, + "total_column_articles": 591, "frontend_question_id": "312", "is_new_question": false }, @@ -53037,8 +53121,8 @@ "question__title": "Sparse Matrix Multiplication", "question__title_slug": "sparse-matrix-multiplication", "question__hide": false, - "total_acs": 6018, - "total_submitted": 7888, + "total_acs": 6055, + "total_submitted": 7934, "total_column_articles": 77, "frontend_question_id": "311", "is_new_question": false @@ -53058,9 +53142,9 @@ "question__title": "Minimum Height Trees", "question__title_slug": "minimum-height-trees", "question__hide": false, - "total_acs": 54578, - "total_submitted": 126908, - "total_column_articles": 442, + "total_acs": 54720, + "total_submitted": 127283, + "total_column_articles": 446, "frontend_question_id": "310", "is_new_question": false }, @@ -53079,9 +53163,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": 217365, - "total_submitted": 340642, - "total_column_articles": 1674, + "total_acs": 218538, + "total_submitted": 342415, + "total_column_articles": 1681, "frontend_question_id": "309", "is_new_question": false }, @@ -53100,8 +53184,8 @@ "question__title": "Range Sum Query 2D - Mutable", "question__title_slug": "range-sum-query-2d-mutable", "question__hide": false, - "total_acs": 3665, - "total_submitted": 5717, + "total_acs": 3678, + "total_submitted": 5743, "total_column_articles": 76, "frontend_question_id": "308", "is_new_question": false @@ -53121,9 +53205,9 @@ "question__title": "Range Sum Query - Mutable", "question__title_slug": "range-sum-query-mutable", "question__hide": false, - "total_acs": 61104, - "total_submitted": 118109, - "total_column_articles": 562, + "total_acs": 61299, + "total_submitted": 118491, + "total_column_articles": 564, "frontend_question_id": "307", "is_new_question": false }, @@ -53142,9 +53226,9 @@ "question__title": "Additive Number", "question__title_slug": "additive-number", "question__hide": false, - "total_acs": 45572, - "total_submitted": 119908, - "total_column_articles": 656, + "total_acs": 45700, + "total_submitted": 120217, + "total_column_articles": 662, "frontend_question_id": "306", "is_new_question": false }, @@ -53163,9 +53247,9 @@ "question__title": "Number of Islands II", "question__title_slug": "number-of-islands-ii", "question__hide": false, - "total_acs": 8231, - "total_submitted": 19510, - "total_column_articles": 117, + "total_acs": 8277, + "total_submitted": 19628, + "total_column_articles": 118, "frontend_question_id": "305", "is_new_question": false }, @@ -53184,9 +53268,9 @@ "question__title": "Range Sum Query 2D - Immutable", "question__title_slug": "range-sum-query-2d-immutable", "question__hide": false, - "total_acs": 109664, - "total_submitted": 181414, - "total_column_articles": 1187, + "total_acs": 110250, + "total_submitted": 182219, + "total_column_articles": 1192, "frontend_question_id": "304", "is_new_question": false }, @@ -53205,9 +53289,9 @@ "question__title": "Range Sum Query - Immutable", "question__title_slug": "range-sum-query-immutable", "question__hide": false, - "total_acs": 193523, - "total_submitted": 254954, - "total_column_articles": 1852, + "total_acs": 194526, + "total_submitted": 256179, + "total_column_articles": 1864, "frontend_question_id": "303", "is_new_question": false }, @@ -53226,9 +53310,9 @@ "question__title": "Smallest Rectangle Enclosing Black Pixels", "question__title_slug": "smallest-rectangle-enclosing-black-pixels", "question__hide": false, - "total_acs": 3450, - "total_submitted": 5115, - "total_column_articles": 60, + "total_acs": 3469, + "total_submitted": 5144, + "total_column_articles": 61, "frontend_question_id": "302", "is_new_question": false }, @@ -53247,9 +53331,9 @@ "question__title": "Remove Invalid Parentheses", "question__title_slug": "remove-invalid-parentheses", "question__hide": false, - "total_acs": 85368, - "total_submitted": 154880, - "total_column_articles": 533, + "total_acs": 85751, + "total_submitted": 155584, + "total_column_articles": 535, "frontend_question_id": "301", "is_new_question": false }, @@ -53268,9 +53352,9 @@ "question__title": "Longest Increasing Subsequence", "question__title_slug": "longest-increasing-subsequence", "question__hide": false, - "total_acs": 637685, - "total_submitted": 1175604, - "total_column_articles": 3848, + "total_acs": 640817, + "total_submitted": 1180962, + "total_column_articles": 3868, "frontend_question_id": "300", "is_new_question": false }, @@ -53289,9 +53373,9 @@ "question__title": "Bulls and Cows", "question__title_slug": "bulls-and-cows", "question__hide": false, - "total_acs": 76739, - "total_submitted": 134232, - "total_column_articles": 854, + "total_acs": 76983, + "total_submitted": 134638, + "total_column_articles": 857, "frontend_question_id": "299", "is_new_question": false }, @@ -53310,9 +53394,9 @@ "question__title": "Binary Tree Longest Consecutive Sequence", "question__title_slug": "binary-tree-longest-consecutive-sequence", "question__hide": false, - "total_acs": 8519, - "total_submitted": 14181, - "total_column_articles": 130, + "total_acs": 8553, + "total_submitted": 14260, + "total_column_articles": 132, "frontend_question_id": "298", "is_new_question": false }, @@ -53331,9 +53415,9 @@ "question__title": "Serialize and Deserialize Binary Tree", "question__title_slug": "serialize-and-deserialize-binary-tree", "question__hide": false, - "total_acs": 190576, - "total_submitted": 325768, - "total_column_articles": 1230, + "total_acs": 191512, + "total_submitted": 327348, + "total_column_articles": 1234, "frontend_question_id": "297", "is_new_question": false }, @@ -53352,8 +53436,8 @@ "question__title": "Best Meeting Point", "question__title_slug": "best-meeting-point", "question__hide": false, - "total_acs": 3925, - "total_submitted": 6406, + "total_acs": 3966, + "total_submitted": 6468, "total_column_articles": 64, "frontend_question_id": "296", "is_new_question": false @@ -53373,9 +53457,9 @@ "question__title": "Find Median from Data Stream", "question__title_slug": "find-median-from-data-stream", "question__hide": false, - "total_acs": 96867, - "total_submitted": 182358, - "total_column_articles": 717, + "total_acs": 97239, + "total_submitted": 183123, + "total_column_articles": 720, "frontend_question_id": "295", "is_new_question": false }, @@ -53394,8 +53478,8 @@ "question__title": "Flip Game II", "question__title_slug": "flip-game-ii", "question__hide": false, - "total_acs": 5804, - "total_submitted": 9739, + "total_acs": 5819, + "total_submitted": 9773, "total_column_articles": 80, "frontend_question_id": "294", "is_new_question": false @@ -53415,8 +53499,8 @@ "question__title": "Flip Game", "question__title_slug": "flip-game", "question__hide": false, - "total_acs": 7334, - "total_submitted": 10110, + "total_acs": 7355, + "total_submitted": 10139, "total_column_articles": 115, "frontend_question_id": "293", "is_new_question": false @@ -53436,9 +53520,9 @@ "question__title": "Nim Game", "question__title_slug": "nim-game", "question__hide": false, - "total_acs": 146217, - "total_submitted": 207448, - "total_column_articles": 1004, + "total_acs": 146746, + "total_submitted": 208269, + "total_column_articles": 1011, "frontend_question_id": "292", "is_new_question": false }, @@ -53457,9 +53541,9 @@ "question__title": "Word Pattern II", "question__title_slug": "word-pattern-ii", "question__hide": false, - "total_acs": 4317, - "total_submitted": 8286, - "total_column_articles": 95, + "total_acs": 4353, + "total_submitted": 8357, + "total_column_articles": 96, "frontend_question_id": "291", "is_new_question": false }, @@ -53478,9 +53562,9 @@ "question__title": "Word Pattern", "question__title_slug": "word-pattern", "question__hide": false, - "total_acs": 117877, - "total_submitted": 262549, - "total_column_articles": 1535, + "total_acs": 118415, + "total_submitted": 263778, + "total_column_articles": 1538, "frontend_question_id": "290", "is_new_question": false }, @@ -53499,9 +53583,9 @@ "question__title": "Game of Life", "question__title_slug": "game-of-life", "question__hide": false, - "total_acs": 70233, - "total_submitted": 92830, - "total_column_articles": 1054, + "total_acs": 70473, + "total_submitted": 93154, + "total_column_articles": 1059, "frontend_question_id": "289", "is_new_question": false }, @@ -53520,8 +53604,8 @@ "question__title": "Unique Word Abbreviation", "question__title_slug": "unique-word-abbreviation", "question__hide": false, - "total_acs": 5780, - "total_submitted": 11914, + "total_acs": 5806, + "total_submitted": 11969, "total_column_articles": 82, "frontend_question_id": "288", "is_new_question": false @@ -53541,9 +53625,9 @@ "question__title": "Find the Duplicate Number", "question__title_slug": "find-the-duplicate-number", "question__hide": false, - "total_acs": 282763, - "total_submitted": 438106, - "total_column_articles": 1814, + "total_acs": 284028, + "total_submitted": 440078, + "total_column_articles": 1818, "frontend_question_id": "287", "is_new_question": false }, @@ -53562,9 +53646,9 @@ "question__title": "Walls and Gates", "question__title_slug": "walls-and-gates", "question__hide": false, - "total_acs": 17874, - "total_submitted": 32824, - "total_column_articles": 231, + "total_acs": 17968, + "total_submitted": 33000, + "total_column_articles": 232, "frontend_question_id": "286", "is_new_question": false }, @@ -53583,8 +53667,8 @@ "question__title": "Inorder Successor in BST", "question__title_slug": "inorder-successor-in-bst", "question__hide": false, - "total_acs": 14241, - "total_submitted": 22071, + "total_acs": 14287, + "total_submitted": 22150, "total_column_articles": 169, "frontend_question_id": "285", "is_new_question": false @@ -53604,8 +53688,8 @@ "question__title": "Peeking Iterator", "question__title_slug": "peeking-iterator", "question__hide": false, - "total_acs": 30099, - "total_submitted": 39300, + "total_acs": 30167, + "total_submitted": 39398, "total_column_articles": 246, "frontend_question_id": "284", "is_new_question": false @@ -53625,9 +53709,9 @@ "question__title": "Move Zeroes", "question__title_slug": "move-zeroes", "question__hide": false, - "total_acs": 905999, - "total_submitted": 1415914, - "total_column_articles": 5577, + "total_acs": 911195, + "total_submitted": 1424281, + "total_column_articles": 5607, "frontend_question_id": "283", "is_new_question": false }, @@ -53646,9 +53730,9 @@ "question__title": "Expression Add Operators", "question__title_slug": "expression-add-operators", "question__hide": false, - "total_acs": 24700, - "total_submitted": 52351, - "total_column_articles": 203, + "total_acs": 24753, + "total_submitted": 52464, + "total_column_articles": 205, "frontend_question_id": "282", "is_new_question": false }, @@ -53667,8 +53751,8 @@ "question__title": "Zigzag Iterator", "question__title_slug": "zigzag-iterator", "question__hide": false, - "total_acs": 4936, - "total_submitted": 6449, + "total_acs": 4962, + "total_submitted": 6485, "total_column_articles": 118, "frontend_question_id": "281", "is_new_question": false @@ -53688,8 +53772,8 @@ "question__title": "Wiggle Sort", "question__title_slug": "wiggle-sort", "question__hide": false, - "total_acs": 9018, - "total_submitted": 13023, + "total_acs": 9053, + "total_submitted": 13074, "total_column_articles": 101, "frontend_question_id": "280", "is_new_question": false @@ -53709,9 +53793,9 @@ "question__title": "Perfect Squares", "question__title_slug": "perfect-squares", "question__hide": false, - "total_acs": 349149, - "total_submitted": 531201, - "total_column_articles": 1834, + "total_acs": 350746, + "total_submitted": 533557, + "total_column_articles": 1840, "frontend_question_id": "279", "is_new_question": false }, @@ -53730,9 +53814,9 @@ "question__title": "First Bad Version", "question__title_slug": "first-bad-version", "question__hide": false, - "total_acs": 402727, - "total_submitted": 881441, - "total_column_articles": 2204, + "total_acs": 404637, + "total_submitted": 885335, + "total_column_articles": 2212, "frontend_question_id": "278", "is_new_question": false }, @@ -53751,8 +53835,8 @@ "question__title": "Find the Celebrity", "question__title_slug": "find-the-celebrity", "question__hide": false, - "total_acs": 13057, - "total_submitted": 22424, + "total_acs": 13095, + "total_submitted": 22499, "total_column_articles": 130, "frontend_question_id": "277", "is_new_question": false @@ -53772,8 +53856,8 @@ "question__title": "Paint Fence", "question__title_slug": "paint-fence", "question__hide": false, - "total_acs": 9901, - "total_submitted": 18805, + "total_acs": 9939, + "total_submitted": 18865, "total_column_articles": 179, "frontend_question_id": "276", "is_new_question": false @@ -53793,9 +53877,9 @@ "question__title": "H-Index II", "question__title_slug": "h-index-ii", "question__hide": false, - "total_acs": 64234, - "total_submitted": 141680, - "total_column_articles": 528, + "total_acs": 64403, + "total_submitted": 142082, + "total_column_articles": 529, "frontend_question_id": "275", "is_new_question": false }, @@ -53814,8 +53898,8 @@ "question__title": "H-Index", "question__title_slug": "h-index", "question__hide": false, - "total_acs": 69802, - "total_submitted": 157140, + "total_acs": 70065, + "total_submitted": 157772, "total_column_articles": 713, "frontend_question_id": "274", "is_new_question": false @@ -53835,9 +53919,9 @@ "question__title": "Integer to English Words", "question__title_slug": "integer-to-english-words", "question__hide": false, - "total_acs": 35635, - "total_submitted": 97831, - "total_column_articles": 426, + "total_acs": 35830, + "total_submitted": 98320, + "total_column_articles": 428, "frontend_question_id": "273", "is_new_question": false }, @@ -53856,9 +53940,9 @@ "question__title": "Closest Binary Search Tree Value II", "question__title_slug": "closest-binary-search-tree-value-ii", "question__hide": false, - "total_acs": 5683, - "total_submitted": 8588, - "total_column_articles": 113, + "total_acs": 5712, + "total_submitted": 8621, + "total_column_articles": 115, "frontend_question_id": "272", "is_new_question": false }, @@ -53877,8 +53961,8 @@ "question__title": "Encode and Decode Strings", "question__title_slug": "encode-and-decode-strings", "question__hide": false, - "total_acs": 4502, - "total_submitted": 7880, + "total_acs": 4536, + "total_submitted": 7943, "total_column_articles": 68, "frontend_question_id": "271", "is_new_question": false @@ -53898,9 +53982,9 @@ "question__title": "Closest Binary Search Tree Value", "question__title_slug": "closest-binary-search-tree-value", "question__hide": false, - "total_acs": 16174, - "total_submitted": 27839, - "total_column_articles": 189, + "total_acs": 16248, + "total_submitted": 27945, + "total_column_articles": 190, "frontend_question_id": "270", "is_new_question": false }, @@ -53919,8 +54003,8 @@ "question__title": "Alien Dictionary", "question__title_slug": "alien-dictionary", "question__hide": false, - "total_acs": 11188, - "total_submitted": 30666, + "total_acs": 11236, + "total_submitted": 30835, "total_column_articles": 167, "frontend_question_id": "269", "is_new_question": false @@ -53940,9 +54024,9 @@ "question__title": "Missing Number", "question__title_slug": "missing-number", "question__hide": false, - "total_acs": 272441, - "total_submitted": 411998, - "total_column_articles": 2036, + "total_acs": 273694, + "total_submitted": 413817, + "total_column_articles": 2042, "frontend_question_id": "268", "is_new_question": false }, @@ -53961,9 +54045,9 @@ "question__title": "Palindrome Permutation II", "question__title_slug": "palindrome-permutation-ii", "question__hide": false, - "total_acs": 5618, - "total_submitted": 12047, - "total_column_articles": 115, + "total_acs": 5659, + "total_submitted": 12121, + "total_column_articles": 116, "frontend_question_id": "267", "is_new_question": false }, @@ -53982,9 +54066,9 @@ "question__title": "Palindrome Permutation", "question__title_slug": "palindrome-permutation", "question__hide": false, - "total_acs": 10551, - "total_submitted": 15107, - "total_column_articles": 157, + "total_acs": 10601, + "total_submitted": 15182, + "total_column_articles": 158, "frontend_question_id": "266", "is_new_question": false }, @@ -54003,9 +54087,9 @@ "question__title": "Paint House II", "question__title_slug": "paint-house-ii", "question__hide": false, - "total_acs": 11891, - "total_submitted": 18996, - "total_column_articles": 252, + "total_acs": 11964, + "total_submitted": 19098, + "total_column_articles": 253, "frontend_question_id": "265", "is_new_question": false }, @@ -54024,9 +54108,9 @@ "question__title": "Ugly Number II", "question__title_slug": "ugly-number-ii", "question__hide": false, - "total_acs": 143663, - "total_submitted": 244228, - "total_column_articles": 882, + "total_acs": 144144, + "total_submitted": 245086, + "total_column_articles": 884, "frontend_question_id": "264", "is_new_question": false }, @@ -54045,9 +54129,9 @@ "question__title": "Ugly Number", "question__title_slug": "ugly-number", "question__hide": false, - "total_acs": 140474, - "total_submitted": 275998, - "total_column_articles": 1066, + "total_acs": 141041, + "total_submitted": 277202, + "total_column_articles": 1072, "frontend_question_id": "263", "is_new_question": false }, @@ -54066,9 +54150,9 @@ "question__title": "Trips and Users", "question__title_slug": "trips-and-users", "question__hide": false, - "total_acs": 56973, - "total_submitted": 134889, - "total_column_articles": 546, + "total_acs": 57250, + "total_submitted": 135605, + "total_column_articles": 554, "frontend_question_id": "262", "is_new_question": false }, @@ -54087,9 +54171,9 @@ "question__title": "Graph Valid Tree", "question__title_slug": "graph-valid-tree", "question__hide": false, - "total_acs": 15740, - "total_submitted": 30899, - "total_column_articles": 213, + "total_acs": 15854, + "total_submitted": 31142, + "total_column_articles": 215, "frontend_question_id": "261", "is_new_question": false }, @@ -54108,9 +54192,9 @@ "question__title": "Single Number III", "question__title_slug": "single-number-iii", "question__hide": false, - "total_acs": 102445, - "total_submitted": 140481, - "total_column_articles": 887, + "total_acs": 102799, + "total_submitted": 141036, + "total_column_articles": 889, "frontend_question_id": "260", "is_new_question": false }, @@ -54129,8 +54213,8 @@ "question__title": "3Sum Smaller", "question__title_slug": "3sum-smaller", "question__hide": false, - "total_acs": 11543, - "total_submitted": 20819, + "total_acs": 11594, + "total_submitted": 20928, "total_column_articles": 133, "frontend_question_id": "259", "is_new_question": false @@ -54150,9 +54234,9 @@ "question__title": "Add Digits", "question__title_slug": "add-digits", "question__hide": false, - "total_acs": 149770, - "total_submitted": 210615, - "total_column_articles": 1279, + "total_acs": 150375, + "total_submitted": 211463, + "total_column_articles": 1285, "frontend_question_id": "258", "is_new_question": false }, @@ -54171,9 +54255,9 @@ "question__title": "Binary Tree Paths", "question__title_slug": "binary-tree-paths", "question__hide": false, - "total_acs": 260921, - "total_submitted": 370652, - "total_column_articles": 1732, + "total_acs": 262733, + "total_submitted": 373142, + "total_column_articles": 1737, "frontend_question_id": "257", "is_new_question": false }, @@ -54192,8 +54276,8 @@ "question__title": "Paint House", "question__title_slug": "paint-house", "question__hide": false, - "total_acs": 18990, - "total_submitted": 27650, + "total_acs": 19057, + "total_submitted": 27739, "total_column_articles": 284, "frontend_question_id": "256", "is_new_question": false @@ -54213,9 +54297,9 @@ "question__title": "Verify Preorder Sequence in Binary Search Tree", "question__title_slug": "verify-preorder-sequence-in-binary-search-tree", "question__hide": false, - "total_acs": 8494, - "total_submitted": 17228, - "total_column_articles": 98, + "total_acs": 8560, + "total_submitted": 17328, + "total_column_articles": 99, "frontend_question_id": "255", "is_new_question": false }, @@ -54234,8 +54318,8 @@ "question__title": "Factor Combinations", "question__title_slug": "factor-combinations", "question__hide": false, - "total_acs": 9416, - "total_submitted": 16501, + "total_acs": 9468, + "total_submitted": 16594, "total_column_articles": 128, "frontend_question_id": "254", "is_new_question": false @@ -54255,9 +54339,9 @@ "question__title": "Meeting Rooms II", "question__title_slug": "meeting-rooms-ii", "question__hide": false, - "total_acs": 58555, - "total_submitted": 112441, - "total_column_articles": 545, + "total_acs": 58867, + "total_submitted": 112996, + "total_column_articles": 546, "frontend_question_id": "253", "is_new_question": false }, @@ -54276,9 +54360,9 @@ "question__title": "Meeting Rooms", "question__title_slug": "meeting-rooms", "question__hide": false, - "total_acs": 21182, - "total_submitted": 36698, - "total_column_articles": 223, + "total_acs": 21281, + "total_submitted": 36878, + "total_column_articles": 225, "frontend_question_id": "252", "is_new_question": false }, @@ -54297,8 +54381,8 @@ "question__title": "Flatten 2D Vector", "question__title_slug": "flatten-2d-vector", "question__hide": false, - "total_acs": 6429, - "total_submitted": 11604, + "total_acs": 6466, + "total_submitted": 11658, "total_column_articles": 103, "frontend_question_id": "251", "is_new_question": false @@ -54318,9 +54402,9 @@ "question__title": "Count Univalue Subtrees", "question__title_slug": "count-univalue-subtrees", "question__hide": false, - "total_acs": 7170, - "total_submitted": 11332, - "total_column_articles": 136, + "total_acs": 7199, + "total_submitted": 11378, + "total_column_articles": 137, "frontend_question_id": "250", "is_new_question": false }, @@ -54339,8 +54423,8 @@ "question__title": "Group Shifted Strings", "question__title_slug": "group-shifted-strings", "question__hide": false, - "total_acs": 9519, - "total_submitted": 14671, + "total_acs": 9558, + "total_submitted": 14743, "total_column_articles": 159, "frontend_question_id": "249", "is_new_question": false @@ -54360,8 +54444,8 @@ "question__title": "Strobogrammatic Number III", "question__title_slug": "strobogrammatic-number-iii", "question__hide": false, - "total_acs": 4037, - "total_submitted": 8280, + "total_acs": 4058, + "total_submitted": 8307, "total_column_articles": 76, "frontend_question_id": "248", "is_new_question": false @@ -54381,8 +54465,8 @@ "question__title": "Strobogrammatic Number II", "question__title_slug": "strobogrammatic-number-ii", "question__hide": false, - "total_acs": 7829, - "total_submitted": 14467, + "total_acs": 7848, + "total_submitted": 14492, "total_column_articles": 125, "frontend_question_id": "247", "is_new_question": false @@ -54402,8 +54486,8 @@ "question__title": "Strobogrammatic Number", "question__title_slug": "strobogrammatic-number", "question__hide": false, - "total_acs": 9505, - "total_submitted": 20032, + "total_acs": 9548, + "total_submitted": 20120, "total_column_articles": 166, "frontend_question_id": "246", "is_new_question": false @@ -54423,8 +54507,8 @@ "question__title": "Shortest Word Distance III", "question__title_slug": "shortest-word-distance-iii", "question__hide": false, - "total_acs": 6916, - "total_submitted": 12045, + "total_acs": 6941, + "total_submitted": 12089, "total_column_articles": 86, "frontend_question_id": "245", "is_new_question": false @@ -54444,9 +54528,9 @@ "question__title": "Shortest Word Distance II", "question__title_slug": "shortest-word-distance-ii", "question__hide": false, - "total_acs": 8858, - "total_submitted": 14981, - "total_column_articles": 104, + "total_acs": 8910, + "total_submitted": 15050, + "total_column_articles": 105, "frontend_question_id": "244", "is_new_question": false }, @@ -54465,9 +54549,9 @@ "question__title": "Shortest Word Distance", "question__title_slug": "shortest-word-distance", "question__hide": false, - "total_acs": 14227, - "total_submitted": 21338, - "total_column_articles": 169, + "total_acs": 14298, + "total_submitted": 21440, + "total_column_articles": 170, "frontend_question_id": "243", "is_new_question": false }, @@ -54486,9 +54570,9 @@ "question__title": "Valid Anagram", "question__title_slug": "valid-anagram", "question__hide": false, - "total_acs": 513203, - "total_submitted": 782037, - "total_column_articles": 2879, + "total_acs": 516542, + "total_submitted": 787046, + "total_column_articles": 2899, "frontend_question_id": "242", "is_new_question": false }, @@ -54507,9 +54591,9 @@ "question__title": "Different Ways to Add Parentheses", "question__title_slug": "different-ways-to-add-parentheses", "question__hide": false, - "total_acs": 70082, - "total_submitted": 92561, - "total_column_articles": 679, + "total_acs": 70536, + "total_submitted": 93143, + "total_column_articles": 687, "frontend_question_id": "241", "is_new_question": false }, @@ -54528,9 +54612,9 @@ "question__title": "Search a 2D Matrix II", "question__title_slug": "search-a-2d-matrix-ii", "question__hide": false, - "total_acs": 325352, - "total_submitted": 622985, - "total_column_articles": 1566, + "total_acs": 326966, + "total_submitted": 625783, + "total_column_articles": 1569, "frontend_question_id": "240", "is_new_question": false }, @@ -54549,9 +54633,9 @@ "question__title": "Sliding Window Maximum", "question__title_slug": "sliding-window-maximum", "question__hide": false, - "total_acs": 373346, - "total_submitted": 746826, - "total_column_articles": 2691, + "total_acs": 375814, + "total_submitted": 752150, + "total_column_articles": 2725, "frontend_question_id": "239", "is_new_question": false }, @@ -54570,9 +54654,9 @@ "question__title": "Product of Array Except Self", "question__title_slug": "product-of-array-except-self", "question__hide": false, - "total_acs": 231496, - "total_submitted": 311737, - "total_column_articles": 1433, + "total_acs": 232526, + "total_submitted": 313021, + "total_column_articles": 1442, "frontend_question_id": "238", "is_new_question": false }, @@ -54591,9 +54675,9 @@ "question__title": "Delete Node in a Linked List", "question__title_slug": "delete-node-in-a-linked-list", "question__hide": false, - "total_acs": 320310, - "total_submitted": 372444, - "total_column_articles": 1660, + "total_acs": 321154, + "total_submitted": 373379, + "total_column_articles": 1662, "frontend_question_id": "237", "is_new_question": false }, @@ -54612,9 +54696,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": 467092, - "total_submitted": 673252, - "total_column_articles": 2409, + "total_acs": 469784, + "total_submitted": 677220, + "total_column_articles": 2418, "frontend_question_id": "236", "is_new_question": false }, @@ -54633,9 +54717,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": 293643, - "total_submitted": 433717, - "total_column_articles": 1627, + "total_acs": 295405, + "total_submitted": 436204, + "total_column_articles": 1637, "frontend_question_id": "235", "is_new_question": false }, @@ -54654,9 +54738,9 @@ "question__title": "Palindrome Linked List", "question__title_slug": "palindrome-linked-list", "question__hide": false, - "total_acs": 521635, - "total_submitted": 991422, - "total_column_articles": 3133, + "total_acs": 524501, + "total_submitted": 996542, + "total_column_articles": 3154, "frontend_question_id": "234", "is_new_question": false }, @@ -54675,9 +54759,9 @@ "question__title": "Number of Digit One", "question__title_slug": "number-of-digit-one", "question__hide": false, - "total_acs": 48958, - "total_submitted": 100401, - "total_column_articles": 579, + "total_acs": 49119, + "total_submitted": 100759, + "total_column_articles": 582, "frontend_question_id": "233", "is_new_question": false }, @@ -54696,9 +54780,9 @@ "question__title": "Implement Queue using Stacks", "question__title_slug": "implement-queue-using-stacks", "question__hide": false, - "total_acs": 295687, - "total_submitted": 429428, - "total_column_articles": 2058, + "total_acs": 297725, + "total_submitted": 432427, + "total_column_articles": 2072, "frontend_question_id": "232", "is_new_question": false }, @@ -54717,9 +54801,9 @@ "question__title": "Power of Two", "question__title_slug": "power-of-two", "question__hide": false, - "total_acs": 260241, - "total_submitted": 517248, - "total_column_articles": 1863, + "total_acs": 261516, + "total_submitted": 520002, + "total_column_articles": 1878, "frontend_question_id": "231", "is_new_question": false }, @@ -54738,9 +54822,9 @@ "question__title": "Kth Smallest Element in a BST", "question__title_slug": "kth-smallest-element-in-a-bst", "question__hide": false, - "total_acs": 241918, - "total_submitted": 319409, - "total_column_articles": 1658, + "total_acs": 242893, + "total_submitted": 320660, + "total_column_articles": 1665, "frontend_question_id": "230", "is_new_question": false }, @@ -54759,9 +54843,9 @@ "question__title": "Majority Element II", "question__title_slug": "majority-element-ii", "question__hide": false, - "total_acs": 88766, - "total_submitted": 164842, - "total_column_articles": 812, + "total_acs": 89109, + "total_submitted": 165489, + "total_column_articles": 815, "frontend_question_id": "229", "is_new_question": false }, @@ -54780,9 +54864,9 @@ "question__title": "Summary Ranges", "question__title_slug": "summary-ranges", "question__hide": false, - "total_acs": 82415, - "total_submitted": 148244, - "total_column_articles": 946, + "total_acs": 82879, + "total_submitted": 149150, + "total_column_articles": 951, "frontend_question_id": "228", "is_new_question": false }, @@ -54801,9 +54885,9 @@ "question__title": "Basic Calculator II", "question__title_slug": "basic-calculator-ii", "question__hide": false, - "total_acs": 134833, - "total_submitted": 304414, - "total_column_articles": 1023, + "total_acs": 135434, + "total_submitted": 305655, + "total_column_articles": 1028, "frontend_question_id": "227", "is_new_question": false }, @@ -54822,9 +54906,9 @@ "question__title": "Invert Binary Tree", "question__title_slug": "invert-binary-tree", "question__hide": false, - "total_acs": 564952, - "total_submitted": 711857, - "total_column_articles": 3673, + "total_acs": 568470, + "total_submitted": 716197, + "total_column_articles": 3708, "frontend_question_id": "226", "is_new_question": false }, @@ -54843,9 +54927,9 @@ "question__title": "Implement Stack using Queues", "question__title_slug": "implement-stack-using-queues", "question__hide": false, - "total_acs": 237562, - "total_submitted": 353513, - "total_column_articles": 5312, + "total_acs": 239240, + "total_submitted": 355996, + "total_column_articles": 5321, "frontend_question_id": "225", "is_new_question": false }, @@ -54864,9 +54948,9 @@ "question__title": "Basic Calculator", "question__title_slug": "basic-calculator", "question__hide": false, - "total_acs": 106451, - "total_submitted": 251624, - "total_column_articles": 933, + "total_acs": 106909, + "total_submitted": 252730, + "total_column_articles": 936, "frontend_question_id": "224", "is_new_question": false }, @@ -54885,8 +54969,8 @@ "question__title": "Rectangle Area", "question__title_slug": "rectangle-area", "question__hide": false, - "total_acs": 53342, - "total_submitted": 100000, + "total_acs": 53489, + "total_submitted": 100253, "total_column_articles": 618, "frontend_question_id": "223", "is_new_question": false @@ -54906,9 +54990,9 @@ "question__title": "Count Complete Tree Nodes", "question__title_slug": "count-complete-tree-nodes", "question__hide": false, - "total_acs": 233205, - "total_submitted": 290045, - "total_column_articles": 1507, + "total_acs": 235068, + "total_submitted": 292250, + "total_column_articles": 1511, "frontend_question_id": "222", "is_new_question": false }, @@ -54927,9 +55011,9 @@ "question__title": "Maximal Square", "question__title_slug": "maximal-square", "question__hide": false, - "total_acs": 238378, - "total_submitted": 483379, - "total_column_articles": 1521, + "total_acs": 239541, + "total_submitted": 485704, + "total_column_articles": 1525, "frontend_question_id": "221", "is_new_question": false }, @@ -54948,9 +55032,9 @@ "question__title": "Contains Duplicate III", "question__title_slug": "contains-duplicate-iii", "question__hide": false, - "total_acs": 88168, - "total_submitted": 300059, - "total_column_articles": 584, + "total_acs": 88444, + "total_submitted": 300733, + "total_column_articles": 586, "frontend_question_id": "220", "is_new_question": false }, @@ -54969,9 +55053,9 @@ "question__title": "Contains Duplicate II", "question__title_slug": "contains-duplicate-ii", "question__hide": false, - "total_acs": 208777, - "total_submitted": 470984, - "total_column_articles": 1670, + "total_acs": 209831, + "total_submitted": 473325, + "total_column_articles": 1677, "frontend_question_id": "219", "is_new_question": false }, @@ -54990,9 +55074,9 @@ "question__title": "The Skyline Problem", "question__title_slug": "the-skyline-problem", "question__hide": false, - "total_acs": 45003, - "total_submitted": 81407, - "total_column_articles": 398, + "total_acs": 45186, + "total_submitted": 81715, + "total_column_articles": 399, "frontend_question_id": "218", "is_new_question": false }, @@ -55011,9 +55095,9 @@ "question__title": "Contains Duplicate", "question__title_slug": "contains-duplicate", "question__hide": false, - "total_acs": 680772, - "total_submitted": 1221429, - "total_column_articles": 3200, + "total_acs": 683963, + "total_submitted": 1227170, + "total_column_articles": 3212, "frontend_question_id": "217", "is_new_question": false }, @@ -55032,9 +55116,9 @@ "question__title": "Combination Sum III", "question__title_slug": "combination-sum-iii", "question__hide": false, - "total_acs": 209891, - "total_submitted": 290767, - "total_column_articles": 1678, + "total_acs": 211668, + "total_submitted": 293279, + "total_column_articles": 1689, "frontend_question_id": "216", "is_new_question": false }, @@ -55053,9 +55137,9 @@ "question__title": "Kth Largest Element in an Array", "question__title_slug": "kth-largest-element-in-an-array", "question__hide": false, - "total_acs": 765709, - "total_submitted": 1191432, - "total_column_articles": 3644, + "total_acs": 769234, + "total_submitted": 1197390, + "total_column_articles": 3663, "frontend_question_id": "215", "is_new_question": false }, @@ -55074,9 +55158,9 @@ "question__title": "Shortest Palindrome", "question__title_slug": "shortest-palindrome", "question__hide": false, - "total_acs": 41996, - "total_submitted": 107163, - "total_column_articles": 426, + "total_acs": 42158, + "total_submitted": 107514, + "total_column_articles": 427, "frontend_question_id": "214", "is_new_question": false }, @@ -55095,9 +55179,9 @@ "question__title": "House Robber II", "question__title_slug": "house-robber-ii", "question__hide": false, - "total_acs": 292925, - "total_submitted": 666541, - "total_column_articles": 2443, + "total_acs": 294622, + "total_submitted": 670136, + "total_column_articles": 2453, "frontend_question_id": "213", "is_new_question": false }, @@ -55116,9 +55200,9 @@ "question__title": "Word Search II", "question__title_slug": "word-search-ii", "question__hide": false, - "total_acs": 84597, - "total_submitted": 189141, - "total_column_articles": 715, + "total_acs": 85053, + "total_submitted": 190370, + "total_column_articles": 717, "frontend_question_id": "212", "is_new_question": false }, @@ -55137,9 +55221,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": 66703, - "total_submitted": 133762, - "total_column_articles": 696, + "total_acs": 66970, + "total_submitted": 134378, + "total_column_articles": 699, "frontend_question_id": "211", "is_new_question": false }, @@ -55158,9 +55242,9 @@ "question__title": "Course Schedule II", "question__title_slug": "course-schedule-ii", "question__hide": false, - "total_acs": 157435, - "total_submitted": 279454, - "total_column_articles": 1182, + "total_acs": 158271, + "total_submitted": 280961, + "total_column_articles": 1188, "frontend_question_id": "210", "is_new_question": false }, @@ -55179,9 +55263,9 @@ "question__title": "Minimum Size Subarray Sum", "question__title_slug": "minimum-size-subarray-sum", "question__hide": false, - "total_acs": 440392, - "total_submitted": 923802, - "total_column_articles": 2774, + "total_acs": 444602, + "total_submitted": 933347, + "total_column_articles": 2801, "frontend_question_id": "209", "is_new_question": false }, @@ -55200,9 +55284,9 @@ "question__title": "Implement Trie (Prefix Tree)", "question__title_slug": "implement-trie-prefix-tree", "question__hide": false, - "total_acs": 234623, - "total_submitted": 325773, - "total_column_articles": 1484, + "total_acs": 235620, + "total_submitted": 327180, + "total_column_articles": 1486, "frontend_question_id": "208", "is_new_question": false }, @@ -55221,9 +55305,9 @@ "question__title": "Course Schedule", "question__title_slug": "course-schedule", "question__hide": false, - "total_acs": 260127, - "total_submitted": 482622, - "total_column_articles": 1845, + "total_acs": 261552, + "total_submitted": 485388, + "total_column_articles": 1855, "frontend_question_id": "207", "is_new_question": false }, @@ -55242,9 +55326,9 @@ "question__title": "Reverse Linked List", "question__title_slug": "reverse-linked-list", "question__hide": false, - "total_acs": 1271259, - "total_submitted": 1734532, - "total_column_articles": 10449, + "total_acs": 1279097, + "total_submitted": 1745403, + "total_column_articles": 10495, "frontend_question_id": "206", "is_new_question": false }, @@ -55263,9 +55347,9 @@ "question__title": "Isomorphic Strings", "question__title_slug": "isomorphic-strings", "question__hide": false, - "total_acs": 178220, - "total_submitted": 358413, - "total_column_articles": 1350, + "total_acs": 179378, + "total_submitted": 360835, + "total_column_articles": 1362, "frontend_question_id": "205", "is_new_question": false }, @@ -55284,9 +55368,9 @@ "question__title": "Count Primes", "question__title_slug": "count-primes", "question__hide": false, - "total_acs": 229440, - "total_submitted": 612892, - "total_column_articles": 1005, + "total_acs": 230243, + "total_submitted": 615122, + "total_column_articles": 1007, "frontend_question_id": "204", "is_new_question": false }, @@ -55305,9 +55389,9 @@ "question__title": "Remove Linked List Elements", "question__title_slug": "remove-linked-list-elements", "question__hide": false, - "total_acs": 454400, - "total_submitted": 837179, - "total_column_articles": 2769, + "total_acs": 458345, + "total_submitted": 844488, + "total_column_articles": 2788, "frontend_question_id": "203", "is_new_question": false }, @@ -55326,9 +55410,9 @@ "question__title": "Happy Number", "question__title_slug": "happy-number", "question__hide": false, - "total_acs": 317149, - "total_submitted": 502198, - "total_column_articles": 2355, + "total_acs": 319741, + "total_submitted": 506251, + "total_column_articles": 2369, "frontend_question_id": "202", "is_new_question": false }, @@ -55347,9 +55431,9 @@ "question__title": "Bitwise AND of Numbers Range", "question__title_slug": "bitwise-and-of-numbers-range", "question__hide": false, - "total_acs": 68696, - "total_submitted": 127909, - "total_column_articles": 480, + "total_acs": 68935, + "total_submitted": 128356, + "total_column_articles": 481, "frontend_question_id": "201", "is_new_question": false }, @@ -55368,9 +55452,9 @@ "question__title": "Number of Islands", "question__title_slug": "number-of-islands", "question__hide": false, - "total_acs": 575815, - "total_submitted": 979632, - "total_column_articles": 3542, + "total_acs": 578982, + "total_submitted": 984561, + "total_column_articles": 3563, "frontend_question_id": "200", "is_new_question": false }, @@ -55389,9 +55473,9 @@ "question__title": "Binary Tree Right Side View", "question__title_slug": "binary-tree-right-side-view", "question__hide": false, - "total_acs": 248637, - "total_submitted": 378789, - "total_column_articles": 2429, + "total_acs": 249959, + "total_submitted": 380813, + "total_column_articles": 2442, "frontend_question_id": "199", "is_new_question": false }, @@ -55410,9 +55494,9 @@ "question__title": "House Robber", "question__title_slug": "house-robber", "question__hide": false, - "total_acs": 653662, - "total_submitted": 1211270, - "total_column_articles": 4193, + "total_acs": 657016, + "total_submitted": 1216989, + "total_column_articles": 4216, "frontend_question_id": "198", "is_new_question": false }, @@ -55431,9 +55515,9 @@ "question__title": "Rising Temperature", "question__title_slug": "rising-temperature", "question__hide": false, - "total_acs": 151185, - "total_submitted": 280165, - "total_column_articles": 848, + "total_acs": 152060, + "total_submitted": 281774, + "total_column_articles": 856, "frontend_question_id": "197", "is_new_question": false }, @@ -55452,9 +55536,9 @@ "question__title": "Delete Duplicate Emails", "question__title_slug": "delete-duplicate-emails", "question__hide": false, - "total_acs": 177492, - "total_submitted": 259602, - "total_column_articles": 670, + "total_acs": 178844, + "total_submitted": 261483, + "total_column_articles": 676, "frontend_question_id": "196", "is_new_question": false }, @@ -55473,9 +55557,9 @@ "question__title": "Tenth Line", "question__title_slug": "tenth-line", "question__hide": false, - "total_acs": 47584, - "total_submitted": 107912, - "total_column_articles": 187, + "total_acs": 47757, + "total_submitted": 108353, + "total_column_articles": 188, "frontend_question_id": "195", "is_new_question": false }, @@ -55494,9 +55578,9 @@ "question__title": "Transpose File", "question__title_slug": "transpose-file", "question__hide": false, - "total_acs": 13866, - "total_submitted": 40198, - "total_column_articles": 96, + "total_acs": 13926, + "total_submitted": 40334, + "total_column_articles": 97, "frontend_question_id": "194", "is_new_question": false }, @@ -55515,9 +55599,9 @@ "question__title": "Valid Phone Numbers", "question__title_slug": "valid-phone-numbers", "question__hide": false, - "total_acs": 35390, - "total_submitted": 105856, - "total_column_articles": 177, + "total_acs": 35513, + "total_submitted": 106268, + "total_column_articles": 178, "frontend_question_id": "193", "is_new_question": false }, @@ -55536,9 +55620,9 @@ "question__title": "Word Frequency", "question__title_slug": "word-frequency", "question__hide": false, - "total_acs": 28418, - "total_submitted": 79144, - "total_column_articles": 214, + "total_acs": 28505, + "total_submitted": 79452, + "total_column_articles": 216, "frontend_question_id": "192", "is_new_question": false }, @@ -55557,9 +55641,9 @@ "question__title": "Number of 1 Bits", "question__title_slug": "number-of-1-bits", "question__hide": false, - "total_acs": 294681, - "total_submitted": 386776, - "total_column_articles": 1846, + "total_acs": 296160, + "total_submitted": 388682, + "total_column_articles": 1854, "frontend_question_id": "191", "is_new_question": false }, @@ -55578,9 +55662,9 @@ "question__title": "Reverse Bits", "question__title_slug": "reverse-bits", "question__hide": false, - "total_acs": 191616, - "total_submitted": 268218, - "total_column_articles": 1189, + "total_acs": 192368, + "total_submitted": 269196, + "total_column_articles": 1195, "frontend_question_id": "190", "is_new_question": false }, @@ -55599,9 +55683,9 @@ "question__title": "Rotate Array", "question__title_slug": "rotate-array", "question__hide": false, - "total_acs": 577642, - "total_submitted": 1304536, - "total_column_articles": 2898, + "total_acs": 579791, + "total_submitted": 1309531, + "total_column_articles": 2905, "frontend_question_id": "189", "is_new_question": false }, @@ -55620,9 +55704,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": 157573, - "total_submitted": 366604, - "total_column_articles": 1170, + "total_acs": 158472, + "total_submitted": 368048, + "total_column_articles": 1173, "frontend_question_id": "188", "is_new_question": false }, @@ -55641,9 +55725,9 @@ "question__title": "Repeated DNA Sequences", "question__title_slug": "repeated-dna-sequences", "question__hide": false, - "total_acs": 120140, - "total_submitted": 226562, - "total_column_articles": 892, + "total_acs": 120995, + "total_submitted": 228080, + "total_column_articles": 900, "frontend_question_id": "187", "is_new_question": false }, @@ -55662,8 +55746,8 @@ "question__title": "Reverse Words in a String II", "question__title_slug": "reverse-words-in-a-string-ii", "question__hide": false, - "total_acs": 11630, - "total_submitted": 15356, + "total_acs": 11679, + "total_submitted": 15410, "total_column_articles": 168, "frontend_question_id": "186", "is_new_question": false @@ -55683,9 +55767,9 @@ "question__title": "Department Top Three Salaries", "question__title_slug": "department-top-three-salaries", "question__hide": false, - "total_acs": 105355, - "total_submitted": 201068, - "total_column_articles": 888, + "total_acs": 105907, + "total_submitted": 202041, + "total_column_articles": 893, "frontend_question_id": "185", "is_new_question": false }, @@ -55704,9 +55788,9 @@ "question__title": "Department Highest Salary", "question__title_slug": "department-highest-salary", "question__hide": false, - "total_acs": 150807, - "total_submitted": 298380, - "total_column_articles": 1003, + "total_acs": 151594, + "total_submitted": 299743, + "total_column_articles": 1006, "frontend_question_id": "184", "is_new_question": false }, @@ -55725,9 +55809,9 @@ "question__title": "Customers Who Never Order", "question__title_slug": "customers-who-never-order", "question__hide": false, - "total_acs": 273509, - "total_submitted": 411218, - "total_column_articles": 946, + "total_acs": 275712, + "total_submitted": 414585, + "total_column_articles": 951, "frontend_question_id": "183", "is_new_question": false }, @@ -55746,9 +55830,9 @@ "question__title": "Duplicate Emails", "question__title_slug": "duplicate-emails", "question__hide": false, - "total_acs": 262188, - "total_submitted": 330694, - "total_column_articles": 895, + "total_acs": 263413, + "total_submitted": 332294, + "total_column_articles": 898, "frontend_question_id": "182", "is_new_question": false }, @@ -55767,9 +55851,9 @@ "question__title": "Employees Earning More Than Their Managers", "question__title_slug": "employees-earning-more-than-their-managers", "question__hide": false, - "total_acs": 241582, - "total_submitted": 349872, - "total_column_articles": 976, + "total_acs": 242700, + "total_submitted": 351523, + "total_column_articles": 980, "frontend_question_id": "181", "is_new_question": false }, @@ -55788,9 +55872,9 @@ "question__title": "Consecutive Numbers", "question__title_slug": "consecutive-numbers", "question__hide": false, - "total_acs": 130289, - "total_submitted": 270355, - "total_column_articles": 773, + "total_acs": 130953, + "total_submitted": 271881, + "total_column_articles": 777, "frontend_question_id": "180", "is_new_question": false }, @@ -55809,9 +55893,9 @@ "question__title": "Largest Number", "question__title_slug": "largest-number", "question__hide": false, - "total_acs": 180116, - "total_submitted": 437320, - "total_column_articles": 1333, + "total_acs": 180872, + "total_submitted": 439137, + "total_column_articles": 1339, "frontend_question_id": "179", "is_new_question": false }, @@ -55830,9 +55914,9 @@ "question__title": "Rank Scores", "question__title_slug": "rank-scores", "question__hide": false, - "total_acs": 175132, - "total_submitted": 287515, - "total_column_articles": 908, + "total_acs": 176045, + "total_submitted": 288949, + "total_column_articles": 912, "frontend_question_id": "178", "is_new_question": false }, @@ -55851,9 +55935,9 @@ "question__title": "Nth Highest Salary", "question__title_slug": "nth-highest-salary", "question__hide": false, - "total_acs": 183778, - "total_submitted": 392481, - "total_column_articles": 719, + "total_acs": 184573, + "total_submitted": 394158, + "total_column_articles": 721, "frontend_question_id": "177", "is_new_question": false }, @@ -55872,9 +55956,9 @@ "question__title": "Second Highest Salary", "question__title_slug": "second-highest-salary", "question__hide": false, - "total_acs": 363203, - "total_submitted": 1003998, - "total_column_articles": 1475, + "total_acs": 364978, + "total_submitted": 1008416, + "total_column_articles": 1483, "frontend_question_id": "176", "is_new_question": false }, @@ -55893,9 +55977,9 @@ "question__title": "Combine Two Tables", "question__title_slug": "combine-two-tables", "question__hide": false, - "total_acs": 436769, - "total_submitted": 590111, - "total_column_articles": 1951, + "total_acs": 438763, + "total_submitted": 592718, + "total_column_articles": 1959, "frontend_question_id": "175", "is_new_question": false }, @@ -55914,9 +55998,9 @@ "question__title": "Dungeon Game", "question__title_slug": "dungeon-game", "question__hide": false, - "total_acs": 56389, - "total_submitted": 115655, - "total_column_articles": 1224, + "total_acs": 56654, + "total_submitted": 116195, + "total_column_articles": 1250, "frontend_question_id": "174", "is_new_question": false }, @@ -55935,9 +56019,9 @@ "question__title": "Binary Search Tree Iterator", "question__title_slug": "binary-search-tree-iterator", "question__hide": false, - "total_acs": 105580, - "total_submitted": 129714, - "total_column_articles": 849, + "total_acs": 105973, + "total_submitted": 130172, + "total_column_articles": 851, "frontend_question_id": "173", "is_new_question": false }, @@ -55956,9 +56040,9 @@ "question__title": "Factorial Trailing Zeroes", "question__title_slug": "factorial-trailing-zeroes", "question__hide": false, - "total_acs": 158803, - "total_submitted": 320556, - "total_column_articles": 1053, + "total_acs": 159237, + "total_submitted": 321263, + "total_column_articles": 1056, "frontend_question_id": "172", "is_new_question": false }, @@ -55977,9 +56061,9 @@ "question__title": "Excel Sheet Column Number", "question__title_slug": "excel-sheet-column-number", "question__hide": false, - "total_acs": 148369, - "total_submitted": 207603, - "total_column_articles": 1222, + "total_acs": 149087, + "total_submitted": 208619, + "total_column_articles": 1226, "frontend_question_id": "171", "is_new_question": false }, @@ -55998,9 +56082,9 @@ "question__title": "Two Sum III - Data structure design", "question__title_slug": "two-sum-iii-data-structure-design", "question__hide": false, - "total_acs": 14880, - "total_submitted": 34868, - "total_column_articles": 144, + "total_acs": 14940, + "total_submitted": 35028, + "total_column_articles": 145, "frontend_question_id": "170", "is_new_question": false }, @@ -56019,9 +56103,9 @@ "question__title": "Majority Element", "question__title_slug": "majority-element", "question__hide": false, - "total_acs": 610950, - "total_submitted": 913225, - "total_column_articles": 3290, + "total_acs": 613810, + "total_submitted": 917492, + "total_column_articles": 3304, "frontend_question_id": "169", "is_new_question": false }, @@ -56040,9 +56124,9 @@ "question__title": "Excel Sheet Column Title", "question__title_slug": "excel-sheet-column-title", "question__hide": false, - "total_acs": 122467, - "total_submitted": 279974, - "total_column_articles": 1047, + "total_acs": 123127, + "total_submitted": 281428, + "total_column_articles": 1053, "frontend_question_id": "168", "is_new_question": false }, @@ -56061,9 +56145,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": 500016, - "total_submitted": 846598, - "total_column_articles": 3229, + "total_acs": 502140, + "total_submitted": 849940, + "total_column_articles": 3244, "frontend_question_id": "167", "is_new_question": false }, @@ -56082,9 +56166,9 @@ "question__title": "Fraction to Recurring Decimal", "question__title_slug": "fraction-to-recurring-decimal", "question__hide": false, - "total_acs": 58129, - "total_submitted": 173714, - "total_column_articles": 499, + "total_acs": 58348, + "total_submitted": 174421, + "total_column_articles": 500, "frontend_question_id": "166", "is_new_question": false }, @@ -56103,9 +56187,9 @@ "question__title": "Compare Version Numbers", "question__title_slug": "compare-version-numbers", "question__hide": false, - "total_acs": 134386, - "total_submitted": 258665, - "total_column_articles": 1221, + "total_acs": 135155, + "total_submitted": 260227, + "total_column_articles": 1226, "frontend_question_id": "165", "is_new_question": false }, @@ -56124,9 +56208,9 @@ "question__title": "Maximum Gap", "question__title_slug": "maximum-gap", "question__hide": false, - "total_acs": 76942, - "total_submitted": 127278, - "total_column_articles": 621, + "total_acs": 77199, + "total_submitted": 127689, + "total_column_articles": 624, "frontend_question_id": "164", "is_new_question": false }, @@ -56145,9 +56229,9 @@ "question__title": "Missing Ranges", "question__title_slug": "missing-ranges", "question__hide": false, - "total_acs": 16599, - "total_submitted": 46875, - "total_column_articles": 227, + "total_acs": 16683, + "total_submitted": 47111, + "total_column_articles": 229, "frontend_question_id": "163", "is_new_question": false }, @@ -56166,9 +56250,9 @@ "question__title": "Find Peak Element", "question__title_slug": "find-peak-element", "question__hide": false, - "total_acs": 267984, - "total_submitted": 541683, - "total_column_articles": 1734, + "total_acs": 269252, + "total_submitted": 544307, + "total_column_articles": 1743, "frontend_question_id": "162", "is_new_question": false }, @@ -56187,8 +56271,8 @@ "question__title": "One Edit Distance", "question__title_slug": "one-edit-distance", "question__hide": false, - "total_acs": 11951, - "total_submitted": 35064, + "total_acs": 12010, + "total_submitted": 35215, "total_column_articles": 155, "frontend_question_id": "161", "is_new_question": false @@ -56208,9 +56292,9 @@ "question__title": "Intersection of Two Linked Lists", "question__title_slug": "intersection-of-two-linked-lists", "question__hide": false, - "total_acs": 575396, - "total_submitted": 909768, - "total_column_articles": 3300, + "total_acs": 578863, + "total_submitted": 915245, + "total_column_articles": 3318, "frontend_question_id": "160", "is_new_question": false }, @@ -56229,9 +56313,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": 27400, - "total_submitted": 49114, - "total_column_articles": 304, + "total_acs": 27525, + "total_submitted": 49308, + "total_column_articles": 307, "frontend_question_id": "159", "is_new_question": false }, @@ -56250,8 +56334,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": 4523, - "total_submitted": 7487, + "total_acs": 4549, + "total_submitted": 7538, "total_column_articles": 93, "frontend_question_id": "158", "is_new_question": false @@ -56271,9 +56355,9 @@ "question__title": "Read N Characters Given Read4", "question__title_slug": "read-n-characters-given-read4", "question__hide": false, - "total_acs": 9068, - "total_submitted": 16728, - "total_column_articles": 125, + "total_acs": 9130, + "total_submitted": 16838, + "total_column_articles": 126, "frontend_question_id": "157", "is_new_question": false }, @@ -56292,8 +56376,8 @@ "question__title": "Binary Tree Upside Down", "question__title_slug": "binary-tree-upside-down", "question__hide": false, - "total_acs": 11961, - "total_submitted": 16523, + "total_acs": 12015, + "total_submitted": 16592, "total_column_articles": 214, "frontend_question_id": "156", "is_new_question": false @@ -56313,9 +56397,9 @@ "question__title": "Min Stack", "question__title_slug": "min-stack", "question__hide": false, - "total_acs": 436062, - "total_submitted": 743062, - "total_column_articles": 2352, + "total_acs": 437630, + "total_submitted": 745697, + "total_column_articles": 2364, "frontend_question_id": "155", "is_new_question": false }, @@ -56334,9 +56418,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": 158226, - "total_submitted": 300214, - "total_column_articles": 1202, + "total_acs": 158754, + "total_submitted": 301271, + "total_column_articles": 1208, "frontend_question_id": "154", "is_new_question": false }, @@ -56355,9 +56439,9 @@ "question__title": "Find Minimum in Rotated Sorted Array", "question__title_slug": "find-minimum-in-rotated-sorted-array", "question__hide": false, - "total_acs": 333114, - "total_submitted": 585129, - "total_column_articles": 2233, + "total_acs": 334421, + "total_submitted": 587262, + "total_column_articles": 2243, "frontend_question_id": "153", "is_new_question": false }, @@ -56376,9 +56460,9 @@ "question__title": "Maximum Product Subarray", "question__title_slug": "maximum-product-subarray", "question__hide": false, - "total_acs": 318489, - "total_submitted": 740418, - "total_column_articles": 1943, + "total_acs": 319968, + "total_submitted": 743680, + "total_column_articles": 1950, "frontend_question_id": "152", "is_new_question": false }, @@ -56397,9 +56481,9 @@ "question__title": "Reverse Words in a String", "question__title_slug": "reverse-words-in-a-string", "question__hide": false, - "total_acs": 319145, - "total_submitted": 626144, - "total_column_articles": 2461, + "total_acs": 321509, + "total_submitted": 630314, + "total_column_articles": 2483, "frontend_question_id": "151", "is_new_question": false }, @@ -56418,9 +56502,9 @@ "question__title": "Evaluate Reverse Polish Notation", "question__title_slug": "evaluate-reverse-polish-notation", "question__hide": false, - "total_acs": 230516, - "total_submitted": 437464, - "total_column_articles": 1688, + "total_acs": 232069, + "total_submitted": 440823, + "total_column_articles": 1695, "frontend_question_id": "150", "is_new_question": false }, @@ -56439,9 +56523,9 @@ "question__title": "Max Points on a Line", "question__title_slug": "max-points-on-a-line", "question__hide": false, - "total_acs": 72020, - "total_submitted": 187177, - "total_column_articles": 722, + "total_acs": 72309, + "total_submitted": 187796, + "total_column_articles": 725, "frontend_question_id": "149", "is_new_question": false }, @@ -56460,9 +56544,9 @@ "question__title": "Sort List", "question__title_slug": "sort-list", "question__hide": false, - "total_acs": 357037, - "total_submitted": 540121, - "total_column_articles": 1981, + "total_acs": 358527, + "total_submitted": 542479, + "total_column_articles": 1993, "frontend_question_id": "148", "is_new_question": false }, @@ -56481,9 +56565,9 @@ "question__title": "Insertion Sort List", "question__title_slug": "insertion-sort-list", "question__hide": false, - "total_acs": 136144, - "total_submitted": 196547, - "total_column_articles": 1037, + "total_acs": 136625, + "total_submitted": 197223, + "total_column_articles": 1041, "frontend_question_id": "147", "is_new_question": false }, @@ -56502,9 +56586,9 @@ "question__title": "LRU Cache", "question__title_slug": "lru-cache", "question__hide": false, - "total_acs": 423817, - "total_submitted": 793960, - "total_column_articles": 3114, + "total_acs": 425727, + "total_submitted": 797564, + "total_column_articles": 3139, "frontend_question_id": "146", "is_new_question": false }, @@ -56523,9 +56607,9 @@ "question__title": "Binary Tree Postorder Traversal", "question__title_slug": "binary-tree-postorder-traversal", "question__hide": false, - "total_acs": 535281, - "total_submitted": 703052, - "total_column_articles": 2413, + "total_acs": 538799, + "total_submitted": 707646, + "total_column_articles": 2419, "frontend_question_id": "145", "is_new_question": false }, @@ -56544,9 +56628,9 @@ "question__title": "Binary Tree Preorder Traversal", "question__title_slug": "binary-tree-preorder-traversal", "question__hide": false, - "total_acs": 736611, - "total_submitted": 1034437, - "total_column_articles": 3098, + "total_acs": 741375, + "total_submitted": 1041170, + "total_column_articles": 3126, "frontend_question_id": "144", "is_new_question": false }, @@ -56565,9 +56649,9 @@ "question__title": "Reorder List", "question__title_slug": "reorder-list", "question__hide": false, - "total_acs": 219264, - "total_submitted": 340330, - "total_column_articles": 1658, + "total_acs": 220348, + "total_submitted": 341867, + "total_column_articles": 1662, "frontend_question_id": "143", "is_new_question": false }, @@ -56586,9 +56670,9 @@ "question__title": "Linked List Cycle II", "question__title_slug": "linked-list-cycle-ii", "question__hide": false, - "total_acs": 564937, - "total_submitted": 1000403, - "total_column_articles": 3214, + "total_acs": 568623, + "total_submitted": 1006936, + "total_column_articles": 3237, "frontend_question_id": "142", "is_new_question": false }, @@ -56607,9 +56691,9 @@ "question__title": "Linked List Cycle", "question__title_slug": "linked-list-cycle", "question__hide": false, - "total_acs": 874139, - "total_submitted": 1698331, - "total_column_articles": 4443, + "total_acs": 878598, + "total_submitted": 1707097, + "total_column_articles": 4468, "frontend_question_id": "141", "is_new_question": false }, @@ -56628,9 +56712,9 @@ "question__title": "Word Break II", "question__title_slug": "word-break-ii", "question__hide": false, - "total_acs": 79342, - "total_submitted": 143238, - "total_column_articles": 898, + "total_acs": 79944, + "total_submitted": 143958, + "total_column_articles": 907, "frontend_question_id": "140", "is_new_question": false }, @@ -56649,9 +56733,9 @@ "question__title": "Word Break", "question__title_slug": "word-break", "question__hide": false, - "total_acs": 375339, - "total_submitted": 697661, - "total_column_articles": 2154, + "total_acs": 377770, + "total_submitted": 702035, + "total_column_articles": 2162, "frontend_question_id": "139", "is_new_question": false }, @@ -56670,9 +56754,9 @@ "question__title": "Copy List with Random Pointer", "question__title_slug": "copy-list-with-random-pointer", "question__hide": false, - "total_acs": 175934, - "total_submitted": 262467, - "total_column_articles": 1254, + "total_acs": 176777, + "total_submitted": 264028, + "total_column_articles": 1259, "frontend_question_id": "138", "is_new_question": false }, @@ -56691,9 +56775,9 @@ "question__title": "Single Number II", "question__title_slug": "single-number-ii", "question__hide": false, - "total_acs": 138518, - "total_submitted": 192080, - "total_column_articles": 1007, + "total_acs": 139051, + "total_submitted": 192804, + "total_column_articles": 1009, "frontend_question_id": "137", "is_new_question": false }, @@ -56712,9 +56796,9 @@ "question__title": "Single Number", "question__title_slug": "single-number", "question__hide": false, - "total_acs": 804915, - "total_submitted": 1114884, - "total_column_articles": 3594, + "total_acs": 808820, + "total_submitted": 1120298, + "total_column_articles": 3604, "frontend_question_id": "136", "is_new_question": false }, @@ -56733,9 +56817,9 @@ "question__title": "Candy", "question__title_slug": "candy", "question__hide": false, - "total_acs": 180675, - "total_submitted": 364762, - "total_column_articles": 1337, + "total_acs": 181698, + "total_submitted": 366749, + "total_column_articles": 1343, "frontend_question_id": "135", "is_new_question": false }, @@ -56754,9 +56838,9 @@ "question__title": "Gas Station", "question__title_slug": "gas-station", "question__hide": false, - "total_acs": 214029, - "total_submitted": 405939, - "total_column_articles": 1502, + "total_acs": 215185, + "total_submitted": 408607, + "total_column_articles": 1508, "frontend_question_id": "134", "is_new_question": false }, @@ -56775,9 +56859,9 @@ "question__title": "Clone Graph", "question__title_slug": "clone-graph", "question__hide": false, - "total_acs": 105287, - "total_submitted": 153356, - "total_column_articles": 731, + "total_acs": 105710, + "total_submitted": 153913, + "total_column_articles": 734, "frontend_question_id": "133", "is_new_question": false }, @@ -56796,8 +56880,8 @@ "question__title": "Palindrome Partitioning II", "question__title_slug": "palindrome-partitioning-ii", "question__hide": false, - "total_acs": 68867, - "total_submitted": 138239, + "total_acs": 69225, + "total_submitted": 138845, "total_column_articles": 565, "frontend_question_id": "132", "is_new_question": false @@ -56817,9 +56901,9 @@ "question__title": "Palindrome Partitioning", "question__title_slug": "palindrome-partitioning", "question__hide": false, - "total_acs": 244408, - "total_submitted": 333449, - "total_column_articles": 1471, + "total_acs": 245966, + "total_submitted": 335535, + "total_column_articles": 1481, "frontend_question_id": "131", "is_new_question": false }, @@ -56838,9 +56922,9 @@ "question__title": "Surrounded Regions", "question__title_slug": "surrounded-regions", "question__hide": false, - "total_acs": 204779, - "total_submitted": 444385, - "total_column_articles": 1952, + "total_acs": 205650, + "total_submitted": 446225, + "total_column_articles": 1961, "frontend_question_id": "130", "is_new_question": false }, @@ -56859,9 +56943,9 @@ "question__title": "Sum Root to Leaf Numbers", "question__title_slug": "sum-root-to-leaf-numbers", "question__hide": false, - "total_acs": 190095, - "total_submitted": 272273, - "total_column_articles": 1642, + "total_acs": 190919, + "total_submitted": 273449, + "total_column_articles": 1646, "frontend_question_id": "129", "is_new_question": false }, @@ -56880,9 +56964,9 @@ "question__title": "Longest Consecutive Sequence", "question__title_slug": "longest-consecutive-sequence", "question__hide": false, - "total_acs": 332322, - "total_submitted": 602770, - "total_column_articles": 2012, + "total_acs": 334189, + "total_submitted": 606187, + "total_column_articles": 2025, "frontend_question_id": "128", "is_new_question": false }, @@ -56901,9 +56985,9 @@ "question__title": "Word Ladder", "question__title_slug": "word-ladder", "question__hide": false, - "total_acs": 170261, - "total_submitted": 354173, - "total_column_articles": 916, + "total_acs": 170988, + "total_submitted": 355627, + "total_column_articles": 923, "frontend_question_id": "127", "is_new_question": false }, @@ -56922,9 +57006,9 @@ "question__title": "Word Ladder II", "question__title_slug": "word-ladder-ii", "question__hide": false, - "total_acs": 50870, - "total_submitted": 130205, - "total_column_articles": 456, + "total_acs": 51022, + "total_submitted": 130795, + "total_column_articles": 459, "frontend_question_id": "126", "is_new_question": false }, @@ -56943,9 +57027,9 @@ "question__title": "Valid Palindrome", "question__title_slug": "valid-palindrome", "question__hide": false, - "total_acs": 418795, - "total_submitted": 897525, - "total_column_articles": 2636, + "total_acs": 421151, + "total_submitted": 902708, + "total_column_articles": 2652, "frontend_question_id": "125", "is_new_question": false }, @@ -56964,9 +57048,9 @@ "question__title": "Binary Tree Maximum Path Sum", "question__title_slug": "binary-tree-maximum-path-sum", "question__hide": false, - "total_acs": 283217, - "total_submitted": 625414, - "total_column_articles": 1760, + "total_acs": 284543, + "total_submitted": 628407, + "total_column_articles": 1765, "frontend_question_id": "124", "is_new_question": false }, @@ -56985,9 +57069,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": 220436, - "total_submitted": 382028, - "total_column_articles": 1299, + "total_acs": 221506, + "total_submitted": 383667, + "total_column_articles": 1304, "frontend_question_id": "123", "is_new_question": false }, @@ -57006,9 +57090,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": 757450, - "total_submitted": 1063232, - "total_column_articles": 4095, + "total_acs": 760978, + "total_submitted": 1067928, + "total_column_articles": 4114, "frontend_question_id": "122", "is_new_question": false }, @@ -57027,9 +57111,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": 953309, - "total_submitted": 1640969, - "total_column_articles": 5462, + "total_acs": 958218, + "total_submitted": 1649947, + "total_column_articles": 5485, "frontend_question_id": "121", "is_new_question": false }, @@ -57048,9 +57132,9 @@ "question__title": "Triangle", "question__title_slug": "triangle", "question__hide": false, - "total_acs": 265079, - "total_submitted": 385733, - "total_column_articles": 2218, + "total_acs": 266190, + "total_submitted": 387381, + "total_column_articles": 2230, "frontend_question_id": "120", "is_new_question": false }, @@ -57069,9 +57153,9 @@ "question__title": "Pascal's Triangle II", "question__title_slug": "pascals-triangle-ii", "question__hide": false, - "total_acs": 236941, - "total_submitted": 344565, - "total_column_articles": 1874, + "total_acs": 238321, + "total_submitted": 346498, + "total_column_articles": 1878, "frontend_question_id": "119", "is_new_question": false }, @@ -57090,9 +57174,9 @@ "question__title": "Pascal's Triangle", "question__title_slug": "pascals-triangle", "question__hide": false, - "total_acs": 358530, - "total_submitted": 475499, - "total_column_articles": 2830, + "total_acs": 360560, + "total_submitted": 478064, + "total_column_articles": 2842, "frontend_question_id": "118", "is_new_question": false }, @@ -57111,9 +57195,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": 161624, - "total_submitted": 249837, - "total_column_articles": 1229, + "total_acs": 162539, + "total_submitted": 251200, + "total_column_articles": 1240, "frontend_question_id": "117", "is_new_question": false }, @@ -57132,9 +57216,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": 304571, - "total_submitted": 422433, - "total_column_articles": 2328, + "total_acs": 306261, + "total_submitted": 424607, + "total_column_articles": 2348, "frontend_question_id": "116", "is_new_question": false }, @@ -57153,9 +57237,9 @@ "question__title": "Distinct Subsequences", "question__title_slug": "distinct-subsequences", "question__hide": false, - "total_acs": 113252, - "total_submitted": 216286, - "total_column_articles": 1095, + "total_acs": 113880, + "total_submitted": 217456, + "total_column_articles": 1100, "frontend_question_id": "115", "is_new_question": false }, @@ -57174,9 +57258,9 @@ "question__title": "Flatten Binary Tree to Linked List", "question__title_slug": "flatten-binary-tree-to-linked-list", "question__hide": false, - "total_acs": 313603, - "total_submitted": 429990, - "total_column_articles": 2546, + "total_acs": 315388, + "total_submitted": 432445, + "total_column_articles": 2578, "frontend_question_id": "114", "is_new_question": false }, @@ -57195,9 +57279,9 @@ "question__title": "Path Sum II", "question__title_slug": "path-sum-ii", "question__hide": false, - "total_acs": 305251, - "total_submitted": 482942, - "total_column_articles": 2011, + "total_acs": 306744, + "total_submitted": 485457, + "total_column_articles": 2022, "frontend_question_id": "113", "is_new_question": false }, @@ -57216,9 +57300,9 @@ "question__title": "Path Sum", "question__title_slug": "path-sum", "question__hide": false, - "total_acs": 470052, - "total_submitted": 879668, - "total_column_articles": 2744, + "total_acs": 472822, + "total_submitted": 884939, + "total_column_articles": 2757, "frontend_question_id": "112", "is_new_question": false }, @@ -57237,9 +57321,9 @@ "question__title": "Minimum Depth of Binary Tree", "question__title_slug": "minimum-depth-of-binary-tree", "question__hide": false, - "total_acs": 475278, - "total_submitted": 928141, - "total_column_articles": 3359, + "total_acs": 478218, + "total_submitted": 933104, + "total_column_articles": 3383, "frontend_question_id": "111", "is_new_question": false }, @@ -57258,9 +57342,9 @@ "question__title": "Balanced Binary Tree", "question__title_slug": "balanced-binary-tree", "question__hide": false, - "total_acs": 433850, - "total_submitted": 756973, - "total_column_articles": 2283, + "total_acs": 436382, + "total_submitted": 761179, + "total_column_articles": 2288, "frontend_question_id": "110", "is_new_question": false }, @@ -57279,9 +57363,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": 134023, - "total_submitted": 175369, - "total_column_articles": 1045, + "total_acs": 134568, + "total_submitted": 176052, + "total_column_articles": 1048, "frontend_question_id": "109", "is_new_question": false }, @@ -57300,9 +57384,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": 310383, - "total_submitted": 402208, - "total_column_articles": 1844, + "total_acs": 312186, + "total_submitted": 404501, + "total_column_articles": 1852, "frontend_question_id": "108", "is_new_question": false }, @@ -57321,9 +57405,9 @@ "question__title": "Binary Tree Level Order Traversal II", "question__title_slug": "binary-tree-level-order-traversal-ii", "question__hide": false, - "total_acs": 242619, - "total_submitted": 337301, - "total_column_articles": 1811, + "total_acs": 243741, + "total_submitted": 338726, + "total_column_articles": 1818, "frontend_question_id": "107", "is_new_question": false }, @@ -57342,9 +57426,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": 239900, - "total_submitted": 331107, - "total_column_articles": 1498, + "total_acs": 241635, + "total_submitted": 333619, + "total_column_articles": 1506, "frontend_question_id": "106", "is_new_question": false }, @@ -57363,9 +57447,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": 433526, - "total_submitted": 607409, - "total_column_articles": 2359, + "total_acs": 435967, + "total_submitted": 610861, + "total_column_articles": 2368, "frontend_question_id": "105", "is_new_question": false }, @@ -57384,9 +57468,9 @@ "question__title": "Maximum Depth of Binary Tree", "question__title_slug": "maximum-depth-of-binary-tree", "question__hide": false, - "total_acs": 877809, - "total_submitted": 1138702, - "total_column_articles": 4436, + "total_acs": 882940, + "total_submitted": 1145531, + "total_column_articles": 4478, "frontend_question_id": "104", "is_new_question": false }, @@ -57405,9 +57489,9 @@ "question__title": "Binary Tree Zigzag Level Order Traversal", "question__title_slug": "binary-tree-zigzag-level-order-traversal", "question__hide": false, - "total_acs": 274063, - "total_submitted": 477678, - "total_column_articles": 2285, + "total_acs": 275179, + "total_submitted": 479592, + "total_column_articles": 2290, "frontend_question_id": "103", "is_new_question": false }, @@ -57426,9 +57510,9 @@ "question__title": "Binary Tree Level Order Traversal", "question__title_slug": "binary-tree-level-order-traversal", "question__hide": false, - "total_acs": 700499, - "total_submitted": 1075251, - "total_column_articles": 4030, + "total_acs": 704706, + "total_submitted": 1081599, + "total_column_articles": 4048, "frontend_question_id": "102", "is_new_question": false }, @@ -57447,9 +57531,9 @@ "question__title": "Symmetric Tree", "question__title_slug": "symmetric-tree", "question__hide": false, - "total_acs": 716387, - "total_submitted": 1228108, - "total_column_articles": 3746, + "total_acs": 720625, + "total_submitted": 1234909, + "total_column_articles": 3770, "frontend_question_id": "101", "is_new_question": false }, @@ -57468,9 +57552,9 @@ "question__title": "Same Tree", "question__title_slug": "same-tree", "question__hide": false, - "total_acs": 401360, - "total_submitted": 671047, - "total_column_articles": 2825, + "total_acs": 403530, + "total_submitted": 674555, + "total_column_articles": 2837, "frontend_question_id": "100", "is_new_question": false }, @@ -57489,9 +57573,9 @@ "question__title": "Recover Binary Search Tree", "question__title_slug": "recover-binary-search-tree", "question__hide": false, - "total_acs": 120723, - "total_submitted": 199967, - "total_column_articles": 975, + "total_acs": 121394, + "total_submitted": 201056, + "total_column_articles": 981, "frontend_question_id": "99", "is_new_question": false }, @@ -57510,9 +57594,9 @@ "question__title": "Validate Binary Search Tree", "question__title_slug": "validate-binary-search-tree", "question__hide": false, - "total_acs": 621754, - "total_submitted": 1698207, - "total_column_articles": 3522, + "total_acs": 625799, + "total_submitted": 1708798, + "total_column_articles": 3555, "frontend_question_id": "98", "is_new_question": false }, @@ -57531,9 +57615,9 @@ "question__title": "Interleaving String", "question__title_slug": "interleaving-string", "question__hide": false, - "total_acs": 101959, - "total_submitted": 226530, - "total_column_articles": 798, + "total_acs": 102506, + "total_submitted": 227764, + "total_column_articles": 801, "frontend_question_id": "97", "is_new_question": false }, @@ -57552,9 +57636,9 @@ "question__title": "Unique Binary Search Trees", "question__title_slug": "unique-binary-search-trees", "question__hide": false, - "total_acs": 309224, - "total_submitted": 436848, - "total_column_articles": 2193, + "total_acs": 311137, + "total_submitted": 439543, + "total_column_articles": 2202, "frontend_question_id": "96", "is_new_question": false }, @@ -57573,9 +57657,9 @@ "question__title": "Unique Binary Search Trees II", "question__title_slug": "unique-binary-search-trees-ii", "question__hide": false, - "total_acs": 151534, - "total_submitted": 207976, - "total_column_articles": 957, + "total_acs": 152177, + "total_submitted": 208816, + "total_column_articles": 960, "frontend_question_id": "95", "is_new_question": false }, @@ -57594,9 +57678,9 @@ "question__title": "Binary Tree Inorder Traversal", "question__title_slug": "binary-tree-inorder-traversal", "question__hide": false, - "total_acs": 996930, - "total_submitted": 1309983, - "total_column_articles": 3776, + "total_acs": 1003166, + "total_submitted": 1318173, + "total_column_articles": 3794, "frontend_question_id": "94", "is_new_question": false }, @@ -57615,9 +57699,9 @@ "question__title": "Restore IP Addresses", "question__title_slug": "restore-ip-addresses", "question__hide": false, - "total_acs": 284202, - "total_submitted": 495113, - "total_column_articles": 2172, + "total_acs": 286047, + "total_submitted": 497972, + "total_column_articles": 2180, "frontend_question_id": "93", "is_new_question": false }, @@ -57636,9 +57720,9 @@ "question__title": "Reverse Linked List II", "question__title_slug": "reverse-linked-list-ii", "question__hide": false, - "total_acs": 352584, - "total_submitted": 634704, - "total_column_articles": 3322, + "total_acs": 354245, + "total_submitted": 637616, + "total_column_articles": 3339, "frontend_question_id": "92", "is_new_question": false }, @@ -57657,9 +57741,9 @@ "question__title": "Decode Ways", "question__title_slug": "decode-ways", "question__hide": false, - "total_acs": 246094, - "total_submitted": 751311, - "total_column_articles": 2131, + "total_acs": 247292, + "total_submitted": 754248, + "total_column_articles": 2142, "frontend_question_id": "91", "is_new_question": false }, @@ -57678,9 +57762,9 @@ "question__title": "Subsets II", "question__title_slug": "subsets-ii", "question__hide": false, - "total_acs": 253373, - "total_submitted": 397918, - "total_column_articles": 1989, + "total_acs": 255045, + "total_submitted": 400501, + "total_column_articles": 1998, "frontend_question_id": "90", "is_new_question": false }, @@ -57699,9 +57783,9 @@ "question__title": "Gray Code", "question__title_slug": "gray-code", "question__hide": false, - "total_acs": 105943, - "total_submitted": 141362, - "total_column_articles": 854, + "total_acs": 106299, + "total_submitted": 141854, + "total_column_articles": 855, "frontend_question_id": "89", "is_new_question": false }, @@ -57720,9 +57804,9 @@ "question__title": "Merge Sorted Array", "question__title_slug": "merge-sorted-array", "question__hide": false, - "total_acs": 781812, - "total_submitted": 1493043, - "total_column_articles": 5248, + "total_acs": 786035, + "total_submitted": 1501394, + "total_column_articles": 5269, "frontend_question_id": "88", "is_new_question": false }, @@ -57741,9 +57825,9 @@ "question__title": "Scramble String", "question__title_slug": "scramble-string", "question__hide": false, - "total_acs": 52863, - "total_submitted": 111122, - "total_column_articles": 409, + "total_acs": 53020, + "total_submitted": 111552, + "total_column_articles": 410, "frontend_question_id": "87", "is_new_question": false }, @@ -57762,9 +57846,9 @@ "question__title": "Partition List", "question__title_slug": "partition-list", "question__hide": false, - "total_acs": 184827, - "total_submitted": 289688, - "total_column_articles": 1777, + "total_acs": 186048, + "total_submitted": 291500, + "total_column_articles": 1793, "frontend_question_id": "86", "is_new_question": false }, @@ -57783,9 +57867,9 @@ "question__title": "Maximal Rectangle", "question__title_slug": "maximal-rectangle", "question__hide": false, - "total_acs": 155829, - "total_submitted": 287839, - "total_column_articles": 1081, + "total_acs": 156611, + "total_submitted": 289099, + "total_column_articles": 1082, "frontend_question_id": "85", "is_new_question": false }, @@ -57804,9 +57888,9 @@ "question__title": "Largest Rectangle in Histogram", "question__title_slug": "largest-rectangle-in-histogram", "question__hide": false, - "total_acs": 302006, - "total_submitted": 674313, - "total_column_articles": 1771, + "total_acs": 303512, + "total_submitted": 677566, + "total_column_articles": 1781, "frontend_question_id": "84", "is_new_question": false }, @@ -57825,9 +57909,9 @@ "question__title": "Remove Duplicates from Sorted List", "question__title_slug": "remove-duplicates-from-sorted-list", "question__hide": false, - "total_acs": 506678, - "total_submitted": 951547, - "total_column_articles": 3165, + "total_acs": 509236, + "total_submitted": 956529, + "total_column_articles": 3183, "frontend_question_id": "83", "is_new_question": false }, @@ -57846,9 +57930,9 @@ "question__title": "Remove Duplicates from Sorted List II", "question__title_slug": "remove-duplicates-from-sorted-list-ii", "question__hide": false, - "total_acs": 302462, - "total_submitted": 564696, - "total_column_articles": 2530, + "total_acs": 303790, + "total_submitted": 567002, + "total_column_articles": 2537, "frontend_question_id": "82", "is_new_question": false }, @@ -57867,9 +57951,9 @@ "question__title": "Search in Rotated Sorted Array II", "question__title_slug": "search-in-rotated-sorted-array-ii", "question__hide": false, - "total_acs": 179801, - "total_submitted": 436910, - "total_column_articles": 1369, + "total_acs": 180496, + "total_submitted": 438680, + "total_column_articles": 1375, "frontend_question_id": "81", "is_new_question": false }, @@ -57888,9 +57972,9 @@ "question__title": "Remove Duplicates from Sorted Array II", "question__title_slug": "remove-duplicates-from-sorted-array-ii", "question__hide": false, - "total_acs": 207797, - "total_submitted": 336163, - "total_column_articles": 1758, + "total_acs": 208794, + "total_submitted": 337786, + "total_column_articles": 1767, "frontend_question_id": "80", "is_new_question": false }, @@ -57909,9 +57993,9 @@ "question__title": "Word Search", "question__title_slug": "word-search", "question__hide": false, - "total_acs": 379421, - "total_submitted": 816643, - "total_column_articles": 2308, + "total_acs": 381173, + "total_submitted": 820421, + "total_column_articles": 2324, "frontend_question_id": "79", "is_new_question": false }, @@ -57930,9 +58014,9 @@ "question__title": "Subsets", "question__title_slug": "subsets", "question__hide": false, - "total_acs": 541805, - "total_submitted": 669991, - "total_column_articles": 3780, + "total_acs": 544739, + "total_submitted": 673429, + "total_column_articles": 3801, "frontend_question_id": "78", "is_new_question": false }, @@ -57951,9 +58035,9 @@ "question__title": "Combinations", "question__title_slug": "combinations", "question__hide": false, - "total_acs": 445971, - "total_submitted": 577380, - "total_column_articles": 2510, + "total_acs": 449124, + "total_submitted": 581485, + "total_column_articles": 2524, "frontend_question_id": "77", "is_new_question": false }, @@ -57972,9 +58056,9 @@ "question__title": "Minimum Window Substring", "question__title_slug": "minimum-window-substring", "question__hide": false, - "total_acs": 361975, - "total_submitted": 805678, - "total_column_articles": 2914, + "total_acs": 364656, + "total_submitted": 811179, + "total_column_articles": 2933, "frontend_question_id": "76", "is_new_question": false }, @@ -57993,9 +58077,9 @@ "question__title": "Sort Colors", "question__title_slug": "sort-colors", "question__hide": false, - "total_acs": 467539, - "total_submitted": 777186, - "total_column_articles": 3203, + "total_acs": 470211, + "total_submitted": 781469, + "total_column_articles": 3218, "frontend_question_id": "75", "is_new_question": false }, @@ -58014,9 +58098,9 @@ "question__title": "Search a 2D Matrix", "question__title_slug": "search-a-2d-matrix", "question__hide": false, - "total_acs": 277299, - "total_submitted": 574492, - "total_column_articles": 2704, + "total_acs": 278600, + "total_submitted": 577039, + "total_column_articles": 2718, "frontend_question_id": "74", "is_new_question": false }, @@ -58035,9 +58119,9 @@ "question__title": "Set Matrix Zeroes", "question__title_slug": "set-matrix-zeroes", "question__hide": false, - "total_acs": 219107, - "total_submitted": 350966, - "total_column_articles": 1620, + "total_acs": 220132, + "total_submitted": 352424, + "total_column_articles": 1630, "frontend_question_id": "73", "is_new_question": false }, @@ -58056,9 +58140,9 @@ "question__title": "Edit Distance", "question__title_slug": "edit-distance", "question__hide": false, - "total_acs": 316793, - "total_submitted": 504994, - "total_column_articles": 2684, + "total_acs": 318439, + "total_submitted": 507567, + "total_column_articles": 2719, "frontend_question_id": "72", "is_new_question": false }, @@ -58077,9 +58161,9 @@ "question__title": "Simplify Path", "question__title_slug": "simplify-path", "question__hide": false, - "total_acs": 166214, - "total_submitted": 375911, - "total_column_articles": 1545, + "total_acs": 166927, + "total_submitted": 377532, + "total_column_articles": 1551, "frontend_question_id": "71", "is_new_question": false }, @@ -58098,9 +58182,9 @@ "question__title": "Climbing Stairs", "question__title_slug": "climbing-stairs", "question__hide": false, - "total_acs": 994961, - "total_submitted": 1843827, - "total_column_articles": 5557, + "total_acs": 1000643, + "total_submitted": 1854238, + "total_column_articles": 5592, "frontend_question_id": "70", "is_new_question": false }, @@ -58119,9 +58203,9 @@ "question__title": "Sqrt(x)", "question__title_slug": "sqrtx", "question__hide": false, - "total_acs": 646827, - "total_submitted": 1670132, - "total_column_articles": 3205, + "total_acs": 650375, + "total_submitted": 1679940, + "total_column_articles": 3226, "frontend_question_id": "69", "is_new_question": false }, @@ -58140,9 +58224,9 @@ "question__title": "Text Justification", "question__title_slug": "text-justification", "question__hide": false, - "total_acs": 49378, - "total_submitted": 94877, - "total_column_articles": 747, + "total_acs": 49618, + "total_submitted": 95306, + "total_column_articles": 752, "frontend_question_id": "68", "is_new_question": false }, @@ -58161,9 +58245,9 @@ "question__title": "Add Binary", "question__title_slug": "add-binary", "question__hide": false, - "total_acs": 286350, - "total_submitted": 535553, - "total_column_articles": 2574, + "total_acs": 287842, + "total_submitted": 538440, + "total_column_articles": 2593, "frontend_question_id": "67", "is_new_question": false }, @@ -58182,9 +58266,9 @@ "question__title": "Plus One", "question__title_slug": "plus-one", "question__hide": false, - "total_acs": 564734, - "total_submitted": 1242507, - "total_column_articles": 5051, + "total_acs": 567542, + "total_submitted": 1248880, + "total_column_articles": 5075, "frontend_question_id": "66", "is_new_question": false }, @@ -58203,9 +58287,9 @@ "question__title": "Valid Number", "question__title_slug": "valid-number", "question__hide": false, - "total_acs": 60231, - "total_submitted": 219008, - "total_column_articles": 855, + "total_acs": 60411, + "total_submitted": 219600, + "total_column_articles": 860, "frontend_question_id": "65", "is_new_question": false }, @@ -58224,9 +58308,9 @@ "question__title": "Minimum Path Sum", "question__title_slug": "minimum-path-sum", "question__hide": false, - "total_acs": 429555, - "total_submitted": 619367, - "total_column_articles": 3065, + "total_acs": 431699, + "total_submitted": 622403, + "total_column_articles": 3083, "frontend_question_id": "64", "is_new_question": false }, @@ -58245,9 +58329,9 @@ "question__title": "Unique Paths II", "question__title_slug": "unique-paths-ii", "question__hide": false, - "total_acs": 315054, - "total_submitted": 772091, - "total_column_articles": 2630, + "total_acs": 316962, + "total_submitted": 776610, + "total_column_articles": 2645, "frontend_question_id": "63", "is_new_question": false }, @@ -58266,9 +58350,9 @@ "question__title": "Unique Paths", "question__title_slug": "unique-paths", "question__hide": false, - "total_acs": 532704, - "total_submitted": 788661, - "total_column_articles": 3705, + "total_acs": 535764, + "total_submitted": 793179, + "total_column_articles": 3728, "frontend_question_id": "62", "is_new_question": false }, @@ -58287,9 +58371,9 @@ "question__title": "Rotate List", "question__title_slug": "rotate-list", "question__hide": false, - "total_acs": 285715, - "total_submitted": 687022, - "total_column_articles": 2815, + "total_acs": 287099, + "total_submitted": 690344, + "total_column_articles": 2823, "frontend_question_id": "61", "is_new_question": false }, @@ -58308,9 +58392,9 @@ "question__title": "Permutation Sequence", "question__title_slug": "permutation-sequence", "question__hide": false, - "total_acs": 118848, - "total_submitted": 222719, - "total_column_articles": 1328, + "total_acs": 119262, + "total_submitted": 223454, + "total_column_articles": 1337, "frontend_question_id": "60", "is_new_question": false }, @@ -58329,9 +58413,9 @@ "question__title": "Spiral Matrix II", "question__title_slug": "spiral-matrix-ii", "question__hide": false, - "total_acs": 255153, - "total_submitted": 341038, - "total_column_articles": 2919, + "total_acs": 257222, + "total_submitted": 344011, + "total_column_articles": 2934, "frontend_question_id": "59", "is_new_question": false }, @@ -58350,9 +58434,9 @@ "question__title": "Length of Last Word", "question__title_slug": "length-of-last-word", "question__hide": false, - "total_acs": 376350, - "total_submitted": 905849, - "total_column_articles": 3993, + "total_acs": 378651, + "total_submitted": 910310, + "total_column_articles": 4020, "frontend_question_id": "58", "is_new_question": false }, @@ -58371,9 +58455,9 @@ "question__title": "Insert Interval", "question__title_slug": "insert-interval", "question__hide": false, - "total_acs": 129521, - "total_submitted": 309308, - "total_column_articles": 1296, + "total_acs": 130172, + "total_submitted": 310841, + "total_column_articles": 1303, "frontend_question_id": "57", "is_new_question": false }, @@ -58392,9 +58476,9 @@ "question__title": "Merge Intervals", "question__title_slug": "merge-intervals", "question__hide": false, - "total_acs": 550031, - "total_submitted": 1118164, - "total_column_articles": 3725, + "total_acs": 553315, + "total_submitted": 1124617, + "total_column_articles": 3749, "frontend_question_id": "56", "is_new_question": false }, @@ -58413,9 +58497,9 @@ "question__title": "Jump Game", "question__title_slug": "jump-game", "question__hide": false, - "total_acs": 611561, - "total_submitted": 1400647, - "total_column_articles": 4279, + "total_acs": 615204, + "total_submitted": 1409055, + "total_column_articles": 4312, "frontend_question_id": "55", "is_new_question": false }, @@ -58434,9 +58518,9 @@ "question__title": "Spiral Matrix", "question__title_slug": "spiral-matrix", "question__hide": false, - "total_acs": 320564, - "total_submitted": 652128, - "total_column_articles": 3417, + "total_acs": 322318, + "total_submitted": 655682, + "total_column_articles": 3433, "frontend_question_id": "54", "is_new_question": false }, @@ -58455,9 +58539,9 @@ "question__title": "Maximum Subarray", "question__title_slug": "maximum-subarray", "question__hide": false, - "total_acs": 1226947, - "total_submitted": 2236707, - "total_column_articles": 6059, + "total_acs": 1232403, + "total_submitted": 2246411, + "total_column_articles": 6084, "frontend_question_id": "53", "is_new_question": false }, @@ -58476,9 +58560,9 @@ "question__title": "N-Queens II", "question__title_slug": "n-queens-ii", "question__hide": false, - "total_acs": 106300, - "total_submitted": 129090, - "total_column_articles": 842, + "total_acs": 106813, + "total_submitted": 129725, + "total_column_articles": 852, "frontend_question_id": "52", "is_new_question": false }, @@ -58497,9 +58581,9 @@ "question__title": "N-Queens", "question__title_slug": "n-queens", "question__hide": false, - "total_acs": 261653, - "total_submitted": 353022, - "total_column_articles": 2657, + "total_acs": 263206, + "total_submitted": 354991, + "total_column_articles": 2671, "frontend_question_id": "51", "is_new_question": false }, @@ -58518,9 +58602,9 @@ "question__title": "Pow(x, n)", "question__title_slug": "powx-n", "question__hide": false, - "total_acs": 336154, - "total_submitted": 884805, - "total_column_articles": 1926, + "total_acs": 337685, + "total_submitted": 888799, + "total_column_articles": 1932, "frontend_question_id": "50", "is_new_question": false }, @@ -58539,9 +58623,9 @@ "question__title": "Group Anagrams", "question__title_slug": "group-anagrams", "question__hide": false, - "total_acs": 398328, - "total_submitted": 588104, - "total_column_articles": 2220, + "total_acs": 400584, + "total_submitted": 591503, + "total_column_articles": 2235, "frontend_question_id": "49", "is_new_question": false }, @@ -58560,9 +58644,9 @@ "question__title": "Rotate Image", "question__title_slug": "rotate-image", "question__hide": false, - "total_acs": 393565, - "total_submitted": 528775, - "total_column_articles": 3923, + "total_acs": 395847, + "total_submitted": 531866, + "total_column_articles": 3939, "frontend_question_id": "48", "is_new_question": false }, @@ -58581,9 +58665,9 @@ "question__title": "Permutations II", "question__title_slug": "permutations-ii", "question__hide": false, - "total_acs": 393594, - "total_submitted": 603065, - "total_column_articles": 2534, + "total_acs": 395994, + "total_submitted": 606623, + "total_column_articles": 2544, "frontend_question_id": "47", "is_new_question": false }, @@ -58602,9 +58686,9 @@ "question__title": "Permutations", "question__title_slug": "permutations", "question__hide": false, - "total_acs": 751772, - "total_submitted": 954313, - "total_column_articles": 5116, + "total_acs": 755791, + "total_submitted": 959333, + "total_column_articles": 5133, "frontend_question_id": "46", "is_new_question": false }, @@ -58623,9 +58707,9 @@ "question__title": "Jump Game II", "question__title_slug": "jump-game-ii", "question__hide": false, - "total_acs": 417982, - "total_submitted": 925447, - "total_column_articles": 2893, + "total_acs": 420724, + "total_submitted": 931711, + "total_column_articles": 2919, "frontend_question_id": "45", "is_new_question": false }, @@ -58644,9 +58728,9 @@ "question__title": "Wildcard Matching", "question__title_slug": "wildcard-matching", "question__hide": false, - "total_acs": 124275, - "total_submitted": 369222, - "total_column_articles": 816, + "total_acs": 124894, + "total_submitted": 370895, + "total_column_articles": 823, "frontend_question_id": "44", "is_new_question": false }, @@ -58665,9 +58749,9 @@ "question__title": "Multiply Strings", "question__title_slug": "multiply-strings", "question__hide": false, - "total_acs": 267485, - "total_submitted": 598675, - "total_column_articles": 1802, + "total_acs": 268768, + "total_submitted": 601866, + "total_column_articles": 1812, "frontend_question_id": "43", "is_new_question": false }, @@ -58686,9 +58770,9 @@ "question__title": "Trapping Rain Water", "question__title_slug": "trapping-rain-water", "question__hide": false, - "total_acs": 597525, - "total_submitted": 960820, - "total_column_articles": 3812, + "total_acs": 600728, + "total_submitted": 965965, + "total_column_articles": 3830, "frontend_question_id": "42", "is_new_question": false }, @@ -58707,9 +58791,9 @@ "question__title": "First Missing Positive", "question__title_slug": "first-missing-positive", "question__hide": false, - "total_acs": 262690, - "total_submitted": 614330, - "total_column_articles": 2019, + "total_acs": 264036, + "total_submitted": 617309, + "total_column_articles": 2030, "frontend_question_id": "41", "is_new_question": false }, @@ -58728,9 +58812,9 @@ "question__title": "Combination Sum II", "question__title_slug": "combination-sum-ii", "question__hide": false, - "total_acs": 364994, - "total_submitted": 605234, - "total_column_articles": 2349, + "total_acs": 367387, + "total_submitted": 609338, + "total_column_articles": 2359, "frontend_question_id": "40", "is_new_question": false }, @@ -58749,9 +58833,9 @@ "question__title": "Combination Sum", "question__title_slug": "combination-sum", "question__hide": false, - "total_acs": 629231, - "total_submitted": 866576, - "total_column_articles": 3438, + "total_acs": 633058, + "total_submitted": 871781, + "total_column_articles": 3454, "frontend_question_id": "39", "is_new_question": false }, @@ -58770,9 +58854,9 @@ "question__title": "Count and Say", "question__title_slug": "count-and-say", "question__hide": false, - "total_acs": 315021, - "total_submitted": 523559, - "total_column_articles": 3093, + "total_acs": 316077, + "total_submitted": 525347, + "total_column_articles": 3097, "frontend_question_id": "38", "is_new_question": false }, @@ -58791,9 +58875,9 @@ "question__title": "Sudoku Solver", "question__title_slug": "sudoku-solver", "question__hide": false, - "total_acs": 175900, - "total_submitted": 260249, - "total_column_articles": 1375, + "total_acs": 176918, + "total_submitted": 261651, + "total_column_articles": 1388, "frontend_question_id": "37", "is_new_question": false }, @@ -58812,9 +58896,9 @@ "question__title": "Valid Sudoku", "question__title_slug": "valid-sudoku", "question__hide": false, - "total_acs": 330747, - "total_submitted": 522659, - "total_column_articles": 2335, + "total_acs": 332448, + "total_submitted": 525461, + "total_column_articles": 2347, "frontend_question_id": "36", "is_new_question": false }, @@ -58833,9 +58917,9 @@ "question__title": "Search Insert Position", "question__title_slug": "search-insert-position", "question__hide": false, - "total_acs": 978896, - "total_submitted": 2174869, - "total_column_articles": 6609, + "total_acs": 985042, + "total_submitted": 2188123, + "total_column_articles": 6647, "frontend_question_id": "35", "is_new_question": false }, @@ -58854,9 +58938,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": 672710, - "total_submitted": 1590269, - "total_column_articles": 6386, + "total_acs": 676963, + "total_submitted": 1600145, + "total_column_articles": 6420, "frontend_question_id": "34", "is_new_question": false }, @@ -58875,9 +58959,9 @@ "question__title": "Search in Rotated Sorted Array", "question__title_slug": "search-in-rotated-sorted-array", "question__hide": false, - "total_acs": 646504, - "total_submitted": 1475513, - "total_column_articles": 4129, + "total_acs": 649691, + "total_submitted": 1482739, + "total_column_articles": 4136, "frontend_question_id": "33", "is_new_question": false }, @@ -58896,9 +58980,9 @@ "question__title": "Longest Valid Parentheses", "question__title_slug": "longest-valid-parentheses", "question__hide": false, - "total_acs": 327725, - "total_submitted": 886113, - "total_column_articles": 2039, + "total_acs": 329309, + "total_submitted": 890251, + "total_column_articles": 2052, "frontend_question_id": "32", "is_new_question": false }, @@ -58917,9 +59001,9 @@ "question__title": "Next Permutation", "question__title_slug": "next-permutation", "question__hide": false, - "total_acs": 377831, - "total_submitted": 993351, - "total_column_articles": 2865, + "total_acs": 379725, + "total_submitted": 998084, + "total_column_articles": 2879, "frontend_question_id": "31", "is_new_question": false }, @@ -58938,9 +59022,9 @@ "question__title": "Substring with Concatenation of All Words", "question__title_slug": "substring-with-concatenation-of-all-words", "question__hide": false, - "total_acs": 144921, - "total_submitted": 367011, - "total_column_articles": 1173, + "total_acs": 145608, + "total_submitted": 368574, + "total_column_articles": 1178, "frontend_question_id": "30", "is_new_question": false }, @@ -58959,9 +59043,9 @@ "question__title": "Divide Two Integers", "question__title_slug": "divide-two-integers", "question__hide": false, - "total_acs": 189319, - "total_submitted": 853589, - "total_column_articles": 1445, + "total_acs": 190056, + "total_submitted": 857508, + "total_column_articles": 1450, "frontend_question_id": "29", "is_new_question": false }, @@ -58980,9 +59064,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": 758169, - "total_submitted": 1818323, - "total_column_articles": 5183, + "total_acs": 761793, + "total_submitted": 1825409, + "total_column_articles": 5218, "frontend_question_id": "28", "is_new_question": false }, @@ -59001,9 +59085,9 @@ "question__title": "Remove Element", "question__title_slug": "remove-element", "question__hide": false, - "total_acs": 875786, - "total_submitted": 1476387, - "total_column_articles": 6689, + "total_acs": 882538, + "total_submitted": 1487719, + "total_column_articles": 6739, "frontend_question_id": "27", "is_new_question": false }, @@ -59022,9 +59106,9 @@ "question__title": "Remove Duplicates from Sorted Array", "question__title_slug": "remove-duplicates-from-sorted-array", "question__hide": false, - "total_acs": 1311160, - "total_submitted": 2406476, - "total_column_articles": 7329, + "total_acs": 1318439, + "total_submitted": 2419137, + "total_column_articles": 7380, "frontend_question_id": "26", "is_new_question": false }, @@ -59043,9 +59127,9 @@ "question__title": "Reverse Nodes in k-Group", "question__title_slug": "reverse-nodes-in-k-group", "question__hide": false, - "total_acs": 410669, - "total_submitted": 606694, - "total_column_articles": 3486, + "total_acs": 412691, + "total_submitted": 609642, + "total_column_articles": 3503, "frontend_question_id": "25", "is_new_question": false }, @@ -59064,9 +59148,9 @@ "question__title": "Swap Nodes in Pairs", "question__title_slug": "swap-nodes-in-pairs", "question__hide": false, - "total_acs": 538145, - "total_submitted": 756350, - "total_column_articles": 3957, + "total_acs": 541616, + "total_submitted": 760965, + "total_column_articles": 3976, "frontend_question_id": "24", "is_new_question": false }, @@ -59085,9 +59169,9 @@ "question__title": "Merge k Sorted Lists", "question__title_slug": "merge-k-sorted-lists", "question__hide": false, - "total_acs": 566249, - "total_submitted": 987054, - "total_column_articles": 3748, + "total_acs": 569273, + "total_submitted": 991950, + "total_column_articles": 3774, "frontend_question_id": "23", "is_new_question": false }, @@ -59106,9 +59190,9 @@ "question__title": "Generate Parentheses", "question__title_slug": "generate-parentheses", "question__hide": false, - "total_acs": 612839, - "total_submitted": 790393, - "total_column_articles": 4219, + "total_acs": 616073, + "total_submitted": 794541, + "total_column_articles": 4240, "frontend_question_id": "22", "is_new_question": false }, @@ -59127,9 +59211,9 @@ "question__title": "Merge Two Sorted Lists", "question__title_slug": "merge-two-sorted-lists", "question__hide": false, - "total_acs": 1211889, - "total_submitted": 1820544, - "total_column_articles": 6322, + "total_acs": 1218997, + "total_submitted": 1832023, + "total_column_articles": 6361, "frontend_question_id": "21", "is_new_question": false }, @@ -59148,9 +59232,9 @@ "question__title": "Valid Parentheses", "question__title_slug": "valid-parentheses", "question__hide": false, - "total_acs": 1292804, - "total_submitted": 2906602, - "total_column_articles": 8608, + "total_acs": 1299894, + "total_submitted": 2923637, + "total_column_articles": 8653, "frontend_question_id": "20", "is_new_question": false }, @@ -59169,9 +59253,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": 964711, - "total_submitted": 2156168, - "total_column_articles": 6898, + "total_acs": 970480, + "total_submitted": 2167103, + "total_column_articles": 6941, "frontend_question_id": "19", "is_new_question": false }, @@ -59190,9 +59274,9 @@ "question__title": "4Sum", "question__title_slug": "4sum", "question__hide": false, - "total_acs": 386823, - "total_submitted": 1022668, - "total_column_articles": 2494, + "total_acs": 389233, + "total_submitted": 1029855, + "total_column_articles": 2512, "frontend_question_id": "18", "is_new_question": false }, @@ -59211,9 +59295,9 @@ "question__title": "Letter Combinations of a Phone Number", "question__title_slug": "letter-combinations-of-a-phone-number", "question__hide": false, - "total_acs": 594110, - "total_submitted": 1027564, - "total_column_articles": 4910, + "total_acs": 597693, + "total_submitted": 1033395, + "total_column_articles": 4934, "frontend_question_id": "17", "is_new_question": false }, @@ -59232,9 +59316,9 @@ "question__title": "3Sum Closest", "question__title_slug": "3sum-closest", "question__hide": false, - "total_acs": 418785, - "total_submitted": 922369, - "total_column_articles": 2188, + "total_acs": 420659, + "total_submitted": 927230, + "total_column_articles": 2199, "frontend_question_id": "16", "is_new_question": false }, @@ -59253,9 +59337,9 @@ "question__title": "3Sum", "question__title_slug": "3sum", "question__hide": false, - "total_acs": 1179153, - "total_submitted": 3240304, - "total_column_articles": 5173, + "total_acs": 1185621, + "total_submitted": 3256604, + "total_column_articles": 5198, "frontend_question_id": "15", "is_new_question": false }, @@ -59274,9 +59358,9 @@ "question__title": "Longest Common Prefix", "question__title_slug": "longest-common-prefix", "question__hide": false, - "total_acs": 972644, - "total_submitted": 2259108, - "total_column_articles": 5985, + "total_acs": 977612, + "total_submitted": 2269781, + "total_column_articles": 6018, "frontend_question_id": "14", "is_new_question": false }, @@ -59295,9 +59379,9 @@ "question__title": "Roman to Integer", "question__title_slug": "roman-to-integer", "question__hide": false, - "total_acs": 733316, - "total_submitted": 1177687, - "total_column_articles": 5879, + "total_acs": 737034, + "total_submitted": 1183437, + "total_column_articles": 5916, "frontend_question_id": "13", "is_new_question": false }, @@ -59316,9 +59400,9 @@ "question__title": "Integer to Roman", "question__title_slug": "integer-to-roman", "question__hide": false, - "total_acs": 342195, - "total_submitted": 517309, - "total_column_articles": 2654, + "total_acs": 343921, + "total_submitted": 519912, + "total_column_articles": 2669, "frontend_question_id": "12", "is_new_question": false }, @@ -59337,9 +59421,9 @@ "question__title": "Container With Most Water", "question__title_slug": "container-with-most-water", "question__hide": false, - "total_acs": 864185, - "total_submitted": 1420529, - "total_column_articles": 4822, + "total_acs": 868574, + "total_submitted": 1428481, + "total_column_articles": 4843, "frontend_question_id": "11", "is_new_question": false }, @@ -59358,9 +59442,9 @@ "question__title": "Regular Expression Matching", "question__title_slug": "regular-expression-matching", "question__hide": false, - "total_acs": 326882, - "total_submitted": 1042976, - "total_column_articles": 1916, + "total_acs": 328325, + "total_submitted": 1050960, + "total_column_articles": 1922, "frontend_question_id": "10", "is_new_question": false }, @@ -59379,9 +59463,9 @@ "question__title": "Palindrome Number", "question__title_slug": "palindrome-number", "question__hide": false, - "total_acs": 1205973, - "total_submitted": 2130026, - "total_column_articles": 7429, + "total_acs": 1212900, + "total_submitted": 2143367, + "total_column_articles": 7478, "frontend_question_id": "9", "is_new_question": false }, @@ -59400,9 +59484,9 @@ "question__title": "String to Integer (atoi)", "question__title_slug": "string-to-integer-atoi", "question__hide": false, - "total_acs": 517848, - "total_submitted": 2414268, - "total_column_articles": 3877, + "total_acs": 520110, + "total_submitted": 2426024, + "total_column_articles": 3886, "frontend_question_id": "8", "is_new_question": false }, @@ -59421,9 +59505,9 @@ "question__title": "Reverse Integer", "question__title_slug": "reverse-integer", "question__hide": false, - "total_acs": 1111829, - "total_submitted": 3142086, - "total_column_articles": 6752, + "total_acs": 1115281, + "total_submitted": 3152249, + "total_column_articles": 6776, "frontend_question_id": "7", "is_new_question": false }, @@ -59442,9 +59526,9 @@ "question__title": "Zigzag Conversion", "question__title_slug": "zigzag-conversion", "question__hide": false, - "total_acs": 503192, - "total_submitted": 967608, - "total_column_articles": 4126, + "total_acs": 505561, + "total_submitted": 971990, + "total_column_articles": 4148, "frontend_question_id": "6", "is_new_question": false }, @@ -59463,9 +59547,9 @@ "question__title": "Longest Palindromic Substring", "question__title_slug": "longest-palindromic-substring", "question__hide": false, - "total_acs": 1243997, - "total_submitted": 3341721, - "total_column_articles": 6689, + "total_acs": 1250417, + "total_submitted": 3358547, + "total_column_articles": 6720, "frontend_question_id": "5", "is_new_question": false }, @@ -59484,9 +59568,9 @@ "question__title": "Median of Two Sorted Arrays", "question__title_slug": "median-of-two-sorted-arrays", "question__hide": false, - "total_acs": 837954, - "total_submitted": 2016050, - "total_column_articles": 6099, + "total_acs": 842000, + "total_submitted": 2025514, + "total_column_articles": 6127, "frontend_question_id": "4", "is_new_question": false }, @@ -59505,9 +59589,9 @@ "question__title": "Longest Substring Without Repeating Characters", "question__title_slug": "longest-substring-without-repeating-characters", "question__hide": false, - "total_acs": 2058051, - "total_submitted": 5272725, - "total_column_articles": 12085, + "total_acs": 2068506, + "total_submitted": 5299259, + "total_column_articles": 12151, "frontend_question_id": "3", "is_new_question": false }, @@ -59526,9 +59610,9 @@ "question__title": "Add Two Numbers", "question__title_slug": "add-two-numbers", "question__hide": false, - "total_acs": 1553322, - "total_submitted": 3683707, - "total_column_articles": 10874, + "total_acs": 1560597, + "total_submitted": 3699709, + "total_column_articles": 10922, "frontend_question_id": "2", "is_new_question": false }, @@ -59547,9 +59631,9 @@ "question__title": "Two Sum", "question__title_slug": "two-sum", "question__hide": false, - "total_acs": 3954487, - "total_submitted": 7489435, - "total_column_articles": 19762, + "total_acs": 3974567, + "total_submitted": 7526417, + "total_column_articles": 19846, "frontend_question_id": "1", "is_new_question": false }, diff --git a/leetcode-cn/originData/[no content]sort-array-by-moving-items-to-empty-space.json b/leetcode-cn/originData/[no content]sort-array-by-moving-items-to-empty-space.json new file mode 100644 index 00000000..d781e60c --- /dev/null +++ b/leetcode-cn/originData/[no content]sort-array-by-moving-items-to-empty-space.json @@ -0,0 +1,69 @@ +{ + "data": { + "question": { + "questionId": "2489", + "questionFrontendId": "2459", + "categoryTitle": "Algorithms", + "boundTopicId": 1779032, + "title": "Sort Array by Moving Items to Empty Space", + "titleSlug": "sort-array-by-moving-items-to-empty-space", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Hard", + "likes": 0, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": null, + "topicTags": [ + { + "name": "Greedy", + "slug": "greedy", + "translatedName": "贪心", + "__typename": "TopicTagNode" + }, + { + "name": "Array", + "slug": "array", + "translatedName": "数组", + "__typename": "TopicTagNode" + }, + { + "name": "Sorting", + "slug": "sorting", + "translatedName": "排序", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"34\", \"totalSubmission\": \"52\", \"totalAcceptedRaw\": 34, \"totalSubmissionRaw\": 52, \"acRate\": \"65.4%\"}", + "hints": [ + "There are two possibilities for nums to be sorted. Find the minimum number of operations needed for the first possibility, then find the minimum number of operations needed for the second possibility. The answer is the minimum out of the two.", + "If the empty space is not at its ending position, then you can move the item that should be where the empty space is to the empty space.", + "If the empty space is at its ending position, then you need to move an out-of-place item to the empty space." + ], + "solution": null, + "status": null, + "sampleTestCase": "[4,2,0,3,1]", + "metaData": "{\n \"name\": \"sortArray\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[]\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[4,2,0,3,1]\n[1,2,3,4,0]\n[1,0,2,4,3]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/apply-operations-to-an-array.json b/leetcode-cn/originData/apply-operations-to-an-array.json new file mode 100644 index 00000000..48d73816 --- /dev/null +++ b/leetcode-cn/originData/apply-operations-to-an-array.json @@ -0,0 +1,176 @@ +{ + "data": { + "question": { + "questionId": "2551", + "questionFrontendId": "2460", + "categoryTitle": "Algorithms", + "boundTopicId": 1945651, + "title": "Apply Operations to an Array", + "titleSlug": "apply-operations-to-an-array", + "content": "

You are given a 0-indexed array nums of size n consisting of non-negative integers.

\n\n

You need to apply n - 1 operations to this array where, in the ith operation (0-indexed), you will apply the following on the ith element of nums:

\n\n
    \n\t
  • If nums[i] == nums[i + 1], then multiply nums[i] by 2 and set nums[i + 1] to 0. Otherwise, you skip this operation.
  • \n
\n\n

After performing all the operations, shift all the 0's to the end of the array.

\n\n
    \n\t
  • For example, the array [1,0,2,0,0,1] after shifting all its 0's to the end, is [1,2,1,0,0,0].
  • \n
\n\n

Return the resulting array.

\n\n

Note that the operations are applied sequentially, not all at once.

\n\n

 

\n

Example 1:

\n\n
\nInput: nums = [1,2,2,1,1,0]\nOutput: [1,4,2,0,0,0]\nExplanation: We do the following operations:\n- i = 0: nums[0] and nums[1] are not equal, so we skip this operation.\n- i = 1: nums[1] and nums[2] are equal, we multiply nums[1] by 2 and change nums[2] to 0. The array becomes [1,4,0,1,1,0].\n- i = 2: nums[2] and nums[3] are not equal, so we skip this operation.\n- i = 3: nums[3] and nums[4] are equal, we multiply nums[3] by 2 and change nums[4] to 0. The array becomes [1,4,0,2,0,0].\n- i = 4: nums[4] and nums[5] are equal, we multiply nums[4] by 2 and change nums[5] to 0. The array becomes [1,4,0,2,0,0].\nAfter that, we shift the 0's to the end, which gives the array [1,4,2,0,0,0].\n
\n\n

Example 2:

\n\n
\nInput: nums = [0,1]\nOutput: [1,0]\nExplanation: No operation can be applied, we just shift the 0 to the end.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 2 <= nums.length <= 2000
  • \n\t
  • 0 <= nums[i] <= 1000
  • \n
\n", + "translatedTitle": "对数组执行操作", + "translatedContent": "

给你一个下标从 0 开始的数组 nums ,数组大小为 n ,且由 非负 整数组成。

\n\n

你需要对数组执行 n - 1 步操作,其中第 i 步操作(从 0 开始计数)要求对 nums 中第 i 个元素执行下述指令:

\n\n
    \n\t
  • 如果 nums[i] == nums[i + 1] ,则 nums[i] 的值变成原来的 2 倍,nums[i + 1] 的值变成 0 。否则,跳过这步操作。
  • \n
\n\n

在执行完 全部 操作后,将所有 0 移动 到数组的 末尾

\n\n
    \n\t
  • 例如,数组 [1,0,2,0,0,1] 将所有 0 移动到末尾后变为 [1,2,1,0,0,0]
  • \n
\n\n

返回结果数组。

\n\n

注意 操作应当 依次有序 执行,而不是一次性全部执行。

\n\n

 

\n\n

示例 1:

\n\n
\n输入:nums = [1,2,2,1,1,0]\n输出:[1,4,2,0,0,0]\n解释:执行以下操作:\n- i = 0: nums[0] 和 nums[1] 不相等,跳过这步操作。\n- i = 1: nums[1] 和 nums[2] 相等,nums[1] 的值变成原来的 2 倍,nums[2] 的值变成 0 。数组变成 [1,4,0,1,1,0] 。\n- i = 2: nums[2] 和 nums[3] 不相等,所以跳过这步操作。\n- i = 3: nums[3] 和 nums[4] 相等,nums[3] 的值变成原来的 2 倍,nums[4] 的值变成 0 。数组变成 [1,4,0,2,0,0] 。\n- i = 4: nums[4] 和 nums[5] 相等,nums[4] 的值变成原来的 2 倍,nums[5] 的值变成 0 。数组变成 [1,4,0,2,0,0] 。\n执行完所有操作后,将 0 全部移动到数组末尾,得到结果数组 [1,4,2,0,0,0] 。\n
\n\n

示例 2:

\n\n
\n输入:nums = [0,1]\n输出:[1,0]\n解释:无法执行任何操作,只需要将 0 移动到末尾。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 2 <= nums.length <= 2000
  • \n\t
  • 0 <= nums[i] <= 1000
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 4, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"dart\": false}", + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": "数组", + "__typename": "TopicTagNode" + }, + { + "name": "Simulation", + "slug": "simulation", + "translatedName": "模拟", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n vector applyOperations(vector& nums) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int[] applyOperations(int[] nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def applyOperations(self, nums):\n \"\"\"\n :type nums: List[int]\n :rtype: List[int]\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def applyOperations(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* applyOperations(int* nums, int numsSize, int* returnSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int[] ApplyOperations(int[] nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums\n * @return {number[]}\n */\nvar applyOperations = function(nums) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums\n# @return {Integer[]}\ndef apply_operations(nums)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func applyOperations(_ nums: [Int]) -> [Int] {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func applyOperations(nums []int) []int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def applyOperations(nums: Array[Int]): Array[Int] = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun applyOperations(nums: IntArray): IntArray {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn apply_operations(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 applyOperations($nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function applyOperations(nums: number[]): number[] {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (apply-operations nums)\n (-> (listof exact-integer?) (listof exact-integer?))\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec apply_operations(Nums :: [integer()]) -> [integer()].\napply_operations(Nums) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec apply_operations(nums :: [integer]) :: [integer]\n def apply_operations(nums) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n List applyOperations(List nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"6.8K\", \"totalSubmission\": \"9.9K\", \"totalAcceptedRaw\": 6764, \"totalSubmissionRaw\": 9858, \"acRate\": \"68.6%\"}", + "hints": [ + "Iterate over the array and simulate the described process." + ], + "solution": null, + "status": null, + "sampleTestCase": "[1,2,2,1,1,0]", + "metaData": "{\n \"name\": \"applyOperations\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[]\"\n }\n ],\n \"return\": {\n \"type\": \"integer[]\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[1,2,2,1,1,0]\n[0,1]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/average-value-of-even-numbers-that-are-divisible-by-three.json b/leetcode-cn/originData/average-value-of-even-numbers-that-are-divisible-by-three.json new file mode 100644 index 00000000..0adba6dc --- /dev/null +++ b/leetcode-cn/originData/average-value-of-even-numbers-that-are-divisible-by-three.json @@ -0,0 +1,177 @@ +{ + "data": { + "question": { + "questionId": "2542", + "questionFrontendId": "2455", + "categoryTitle": "Algorithms", + "boundTopicId": 1929911, + "title": "Average Value of Even Numbers That Are Divisible by Three", + "titleSlug": "average-value-of-even-numbers-that-are-divisible-by-three", + "content": "

Given an integer array nums of positive integers, return the average value of all even integers that are divisible by 3.

\n\n

Note that the average of n elements is the sum of the n elements divided by n and rounded down to the nearest integer.

\n\n

 

\n

Example 1:

\n\n
\nInput: nums = [1,3,6,10,12,15]\nOutput: 9\nExplanation: 6 and 12 are even numbers that are divisible by 3. (6 + 12) / 2 = 9.\n
\n\n

Example 2:

\n\n
\nInput: nums = [1,2,4,7,10]\nOutput: 0\nExplanation: There is no single number that satisfies the requirement, so return 0.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= nums.length <= 1000
  • \n\t
  • 1 <= nums[i] <= 1000
  • \n
\n", + "translatedTitle": "可被三整除的偶数的平均值", + "translatedContent": "

给你一个由正整数组成的整数数组 nums ,返回其中可被 3 整除的所有偶数的平均值。

\n\n

注意:n 个元素的平均值等于 n 个元素 求和 再除以 n ,结果 向下取整 到最接近的整数。

\n\n

 

\n\n

示例 1:

\n\n
\n输入:nums = [1,3,6,10,12,15]\n输出:9\n解释:6 和 12 是可以被 3 整除的偶数。(6 + 12) / 2 = 9 。\n
\n\n

示例 2:

\n\n
\n输入:nums = [1,2,4,7,10]\n输出:0\n解释:不存在满足题目要求的整数,所以返回 0 。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= nums.length <= 1000
  • \n\t
  • 1 <= nums[i] <= 1000
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 4, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"dart\": false}", + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": "数组", + "__typename": "TopicTagNode" + }, + { + "name": "Math", + "slug": "math", + "translatedName": "数学", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int averageValue(vector& nums) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int averageValue(int[] nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def averageValue(self, nums):\n \"\"\"\n :type nums: List[int]\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def averageValue(self, nums: List[int]) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int averageValue(int* nums, int numsSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int AverageValue(int[] nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums\n * @return {number}\n */\nvar averageValue = function(nums) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums\n# @return {Integer}\ndef average_value(nums)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func averageValue(_ nums: [Int]) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func averageValue(nums []int) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def averageValue(nums: Array[Int]): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun averageValue(nums: IntArray): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn average_value(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 averageValue($nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function averageValue(nums: number[]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (average-value nums)\n (-> (listof exact-integer?) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec average_value(Nums :: [integer()]) -> integer().\naverage_value(Nums) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec average_value(nums :: [integer]) :: integer\n def average_value(nums) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int averageValue(List nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"8K\", \"totalSubmission\": \"12.8K\", \"totalAcceptedRaw\": 7987, \"totalSubmissionRaw\": 12814, \"acRate\": \"62.3%\"}", + "hints": [ + "What is the property of a number if it is divisible by both 2 and 3 at the same time?", + "It is equivalent to finding all the numbers that are divisible by 6." + ], + "solution": null, + "status": null, + "sampleTestCase": "[1,3,6,10,12,15]", + "metaData": "{\n \"name\": \"averageValue\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[]\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[1,3,6,10,12,15]\n[1,2,4,7,10]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/destroy-sequential-targets.json b/leetcode-cn/originData/destroy-sequential-targets.json new file mode 100644 index 00000000..16b4204f --- /dev/null +++ b/leetcode-cn/originData/destroy-sequential-targets.json @@ -0,0 +1,183 @@ +{ + "data": { + "question": { + "questionId": "2548", + "questionFrontendId": "2453", + "categoryTitle": "Algorithms", + "boundTopicId": 1930647, + "title": "Destroy Sequential Targets", + "titleSlug": "destroy-sequential-targets", + "content": "

You are given a 0-indexed array nums consisting of positive integers, representing targets on a number line. You are also given an integer space.

\n\n

You have a machine which can destroy targets. Seeding the machine with some nums[i] allows it to destroy all targets with values that can be represented as nums[i] + c * space, where c is any non-negative integer. You want to destroy the maximum number of targets in nums.

\n\n

Return the minimum value of nums[i] you can seed the machine with to destroy the maximum number of targets.

\n\n

 

\n

Example 1:

\n\n
\nInput: nums = [3,7,8,1,1,5], space = 2\nOutput: 1\nExplanation: If we seed the machine with nums[3], then we destroy all targets equal to 1,3,5,7,9,... \nIn this case, we would destroy 5 total targets (all except for nums[2]). \nIt is impossible to destroy more than 5 targets, so we return nums[3].\n
\n\n

Example 2:

\n\n
\nInput: nums = [1,3,5,2,4,6], space = 2\nOutput: 1\nExplanation: Seeding the machine with nums[0], or nums[3] destroys 3 targets. \nIt is not possible to destroy more than 3 targets.\nSince nums[0] is the minimal integer that can destroy 3 targets, we return 1.\n
\n\n

Example 3:

\n\n
\nInput: nums = [6,2,5], space = 100\nOutput: 2\nExplanation: Whatever initial seed we select, we can only destroy 1 target. The minimal seed is nums[1].\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= nums.length <= 105
  • \n\t
  • 1 <= nums[i] <= 109
  • \n\t
  • 1 <= space <= 109
  • \n
\n", + "translatedTitle": "摧毁一系列目标", + "translatedContent": "

给你一个下标从 0 开始的数组 nums ,它包含若干正整数,表示数轴上你需要摧毁的目标所在的位置。同时给你一个整数 space 。

\n\n

你有一台机器可以摧毁目标。给机器 输入 nums[i] ,这台机器会摧毁所有位置在 nums[i] + c * space 的目标,其中 c 是任意非负整数。你想摧毁 nums 中 尽可能多 的目标。

\n\n

请你返回在摧毁数目最多的前提下,nums[i] 的 最小值 。

\n\n

 

\n\n

示例 1:

\n\n
输入:nums = [3,7,8,1,1,5], space = 2\n输出:1\n解释:如果我们输入 nums[3] ,我们可以摧毁位于 1,3,5,7,9,... 这些位置的目标。\n这种情况下, 我们总共可以摧毁 5 个目标(除了 nums[2])。\n没有办法摧毁多于 5 个目标,所以我们返回 nums[3] 。\n
\n\n

示例 2:

\n\n
输入:nums = [1,3,5,2,4,6], space = 2\n输出:1\n解释:输入 nums[0] 或者 nums[3] 都会摧毁 3 个目标。\n没有办法摧毁多于 3 个目标。\n由于 nums[0] 是最小的可以摧毁 3 个目标的整数,所以我们返回 1 。\n
\n\n

示例 3:

\n\n
输入:nums = [6,2,5], space = 100\n输出:2\n解释:无论我们输入哪个数字,都只能摧毁 1 个目标。输入的最小整数是 nums[1] 。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= nums.length <= 105
  • \n\t
  • 1 <= nums[i] <= 109
  • \n\t
  • 1 <= space <= 109
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 6, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"dart\": false}", + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": "数组", + "__typename": "TopicTagNode" + }, + { + "name": "Hash Table", + "slug": "hash-table", + "translatedName": "哈希表", + "__typename": "TopicTagNode" + }, + { + "name": "Counting", + "slug": "counting", + "translatedName": "计数", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int destroyTargets(vector& nums, int space) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int destroyTargets(int[] nums, int space) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def destroyTargets(self, nums, space):\n \"\"\"\n :type nums: List[int]\n :type space: int\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def destroyTargets(self, nums: List[int], space: int) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int destroyTargets(int* nums, int numsSize, int space){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int DestroyTargets(int[] nums, int space) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums\n * @param {number} space\n * @return {number}\n */\nvar destroyTargets = function(nums, space) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums\n# @param {Integer} space\n# @return {Integer}\ndef destroy_targets(nums, space)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func destroyTargets(_ nums: [Int], _ space: Int) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func destroyTargets(nums []int, space int) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def destroyTargets(nums: Array[Int], space: Int): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun destroyTargets(nums: IntArray, space: Int): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn destroy_targets(nums: Vec, space: i32) -> i32 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[] $nums\n * @param Integer $space\n * @return Integer\n */\n function destroyTargets($nums, $space) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function destroyTargets(nums: number[], space: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (destroy-targets nums space)\n (-> (listof exact-integer?) exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec destroy_targets(Nums :: [integer()], Space :: integer()) -> integer().\ndestroy_targets(Nums, Space) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec destroy_targets(nums :: [integer], space :: integer) :: integer\n def destroy_targets(nums, space) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int destroyTargets(List nums, int space) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"3.3K\", \"totalSubmission\": \"9.9K\", \"totalAcceptedRaw\": 3324, \"totalSubmissionRaw\": 9884, \"acRate\": \"33.6%\"}", + "hints": [ + "Keep track of nums[i] modulo k.", + "Iterate over nums in sorted order." + ], + "solution": null, + "status": null, + "sampleTestCase": "[3,7,8,1,1,5]\n2", + "metaData": "{\n \"name\": \"destroyTargets\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"space\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[3,7,8,1,1,5]\n2\n[1,3,5,2,4,6]\n2\n[6,2,5]\n100", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/height-of-binary-tree-after-subtree-removal-queries.json b/leetcode-cn/originData/height-of-binary-tree-after-subtree-removal-queries.json new file mode 100644 index 00000000..9c26a620 --- /dev/null +++ b/leetcode-cn/originData/height-of-binary-tree-after-subtree-removal-queries.json @@ -0,0 +1,195 @@ +{ + "data": { + "question": { + "questionId": "2545", + "questionFrontendId": "2458", + "categoryTitle": "Algorithms", + "boundTopicId": 1929915, + "title": "Height of Binary Tree After Subtree Removal Queries", + "titleSlug": "height-of-binary-tree-after-subtree-removal-queries", + "content": "

You are given the root of a binary tree with n nodes. Each node is assigned a unique value from 1 to n. You are also given an array queries of size m.

\n\n

You have to perform m independent queries on the tree where in the ith query you do the following:

\n\n
    \n\t
  • Remove the subtree rooted at the node with the value queries[i] from the tree. It is guaranteed that queries[i] will not be equal to the value of the root.
  • \n
\n\n

Return an array answer of size m where answer[i] is the height of the tree after performing the ith query.

\n\n

Note:

\n\n
    \n\t
  • The queries are independent, so the tree returns to its initial state after each query.
  • \n\t
  • The height of a tree is the number of edges in the longest simple path from the root to some node in the tree.
  • \n
\n\n

 

\n

Example 1:

\n\"\"\n
\nInput: root = [1,3,4,2,null,6,5,null,null,null,null,null,7], queries = [4]\nOutput: [2]\nExplanation: The diagram above shows the tree after removing the subtree rooted at node with value 4.\nThe height of the tree is 2 (The path 1 -> 3 -> 2).\n
\n\n

Example 2:

\n\"\"\n
\nInput: root = [5,8,9,2,1,3,7,4,6], queries = [3,2,4,8]\nOutput: [3,2,3,2]\nExplanation: We have the following queries:\n- Removing the subtree rooted at node with value 3. The height of the tree becomes 3 (The path 5 -> 8 -> 2 -> 4).\n- Removing the subtree rooted at node with value 2. The height of the tree becomes 2 (The path 5 -> 8 -> 1).\n- Removing the subtree rooted at node with value 4. The height of the tree becomes 3 (The path 5 -> 8 -> 2 -> 6).\n- Removing the subtree rooted at node with value 8. The height of the tree becomes 2 (The path 5 -> 9 -> 3).\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • The number of nodes in the tree is n.
  • \n\t
  • 2 <= n <= 105
  • \n\t
  • 1 <= Node.val <= n
  • \n\t
  • All the values in the tree are unique.
  • \n\t
  • m == queries.length
  • \n\t
  • 1 <= m <= min(n, 104)
  • \n\t
  • 1 <= queries[i] <= n
  • \n\t
  • queries[i] != root.val
  • \n
\n", + "translatedTitle": "移除子树后的二叉树高度", + "translatedContent": "

给你一棵 二叉树 的根节点 root ,树中有 n 个节点。每个节点都可以被分配一个从 1n 且互不相同的值。另给你一个长度为 m 的数组 queries

\n\n

你必须在树上执行 m独立 的查询,其中第 i 个查询你需要执行以下操作:

\n\n
    \n\t
  • 从树中 移除queries[i] 的值作为根节点的子树。题目所用测试用例保证 queries[i] 等于根节点的值。
  • \n
\n\n

返回一个长度为 m 的数组 answer ,其中 answer[i] 是执行第 i 个查询后树的高度。

\n\n

注意:

\n\n
    \n\t
  • 查询之间是独立的,所以在每个查询执行后,树会回到其 初始 状态。
  • \n\t
  • 树的高度是从根到树中某个节点的 最长简单路径中的边数
  • \n
\n\n

 

\n\n

示例 1:

\n\n

\"\"

\n\n
\n输入:root = [1,3,4,2,null,6,5,null,null,null,null,null,7], queries = [4]\n输出:[2]\n解释:上图展示了从树中移除以 4 为根节点的子树。\n树的高度是 2(路径为 1 -> 3 -> 2)。\n
\n\n

示例 2:

\n\n

\"\"

\n\n
\n输入:root = [5,8,9,2,1,3,7,4,6], queries = [3,2,4,8]\n输出:[3,2,3,2]\n解释:执行下述查询:\n- 移除以 3 为根节点的子树。树的高度变为 3(路径为 5 -> 8 -> 2 -> 4)。\n- 移除以 2 为根节点的子树。树的高度变为 2(路径为 5 -> 8 -> 1)。\n- 移除以 4 为根节点的子树。树的高度变为 3(路径为 5 -> 8 -> 2 -> 6)。\n- 移除以 8 为根节点的子树。树的高度变为 2(路径为 5 -> 9 -> 3)。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 树中节点的数目是 n
  • \n\t
  • 2 <= n <= 105
  • \n\t
  • 1 <= Node.val <= n
  • \n\t
  • 树中的所有值 互不相同
  • \n\t
  • m == queries.length
  • \n\t
  • 1 <= m <= min(n, 104)
  • \n\t
  • 1 <= queries[i] <= n
  • \n\t
  • queries[i] != root.val
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Hard", + "likes": 18, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"dart\": false}", + "topicTags": [ + { + "name": "Tree", + "slug": "tree", + "translatedName": "树", + "__typename": "TopicTagNode" + }, + { + "name": "Depth-First Search", + "slug": "depth-first-search", + "translatedName": "深度优先搜索", + "__typename": "TopicTagNode" + }, + { + "name": "Breadth-First Search", + "slug": "breadth-first-search", + "translatedName": "广度优先搜索", + "__typename": "TopicTagNode" + }, + { + "name": "Array", + "slug": "array", + "translatedName": "数组", + "__typename": "TopicTagNode" + }, + { + "name": "Binary Tree", + "slug": "binary-tree", + "translatedName": "二叉树", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "/**\n * Definition for a binary tree node.\n * struct TreeNode {\n * int val;\n * TreeNode *left;\n * TreeNode *right;\n * TreeNode() : val(0), left(nullptr), right(nullptr) {}\n * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}\n * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}\n * };\n */\nclass Solution {\npublic:\n vector treeQueries(TreeNode* root, vector& queries) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "/**\n * Definition for a binary tree node.\n * public class TreeNode {\n * int val;\n * TreeNode left;\n * TreeNode right;\n * TreeNode() {}\n * TreeNode(int val) { this.val = val; }\n * TreeNode(int val, TreeNode left, TreeNode right) {\n * this.val = val;\n * this.left = left;\n * this.right = right;\n * }\n * }\n */\nclass Solution {\n public int[] treeQueries(TreeNode root, int[] queries) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "# Definition for a binary tree node.\n# class TreeNode(object):\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution(object):\n def treeQueries(self, root, queries):\n \"\"\"\n :type root: Optional[TreeNode]\n :type queries: List[int]\n :rtype: List[int]\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def treeQueries(self, root: Optional[TreeNode], queries: List[int]) -> List[int]:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "/**\n * Definition for a binary tree node.\n * struct TreeNode {\n * int val;\n * struct TreeNode *left;\n * struct TreeNode *right;\n * };\n */\n/**\n * Note: The returned array must be malloced, assume caller calls free().\n */\nint* treeQueries(struct TreeNode* root, int* queries, int queriesSize, int* returnSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "/**\n * Definition for a binary tree node.\n * public class TreeNode {\n * public int val;\n * public TreeNode left;\n * public TreeNode right;\n * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) {\n * this.val = val;\n * this.left = left;\n * this.right = right;\n * }\n * }\n */\npublic class Solution {\n public int[] TreeQueries(TreeNode root, int[] queries) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * Definition for a binary tree node.\n * function TreeNode(val, left, right) {\n * this.val = (val===undefined ? 0 : val)\n * this.left = (left===undefined ? null : left)\n * this.right = (right===undefined ? null : right)\n * }\n */\n/**\n * @param {TreeNode} root\n * @param {number[]} queries\n * @return {number[]}\n */\nvar treeQueries = function(root, queries) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# Definition for a binary tree node.\n# class TreeNode\n# attr_accessor :val, :left, :right\n# def initialize(val = 0, left = nil, right = nil)\n# @val = val\n# @left = left\n# @right = right\n# end\n# end\n# @param {TreeNode} root\n# @param {Integer[]} queries\n# @return {Integer[]}\ndef tree_queries(root, queries)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "/**\n * Definition for a binary tree node.\n * public class TreeNode {\n * public var val: Int\n * public var left: TreeNode?\n * public var right: TreeNode?\n * public init() { self.val = 0; self.left = nil; self.right = nil; }\n * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; }\n * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) {\n * self.val = val\n * self.left = left\n * self.right = right\n * }\n * }\n */\nclass Solution {\n func treeQueries(_ root: TreeNode?, _ queries: [Int]) -> [Int] {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "/**\n * Definition for a binary tree node.\n * type TreeNode struct {\n * Val int\n * Left *TreeNode\n * Right *TreeNode\n * }\n */\nfunc treeQueries(root *TreeNode, queries []int) []int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "/**\n * Definition for a binary tree node.\n * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) {\n * var value: Int = _value\n * var left: TreeNode = _left\n * var right: TreeNode = _right\n * }\n */\nobject Solution {\n def treeQueries(root: TreeNode, queries: Array[Int]): Array[Int] = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "/**\n * Example:\n * var ti = TreeNode(5)\n * var v = ti.`val`\n * Definition for a binary tree node.\n * class TreeNode(var `val`: Int) {\n * var left: TreeNode? = null\n * var right: TreeNode? = null\n * }\n */\nclass Solution {\n fun treeQueries(root: TreeNode?, queries: IntArray): IntArray {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "// Definition for a binary tree node.\n// #[derive(Debug, PartialEq, Eq)]\n// pub struct TreeNode {\n// pub val: i32,\n// pub left: Option>>,\n// pub right: Option>>,\n// }\n//\n// impl TreeNode {\n// #[inline]\n// pub fn new(val: i32) -> Self {\n// TreeNode {\n// val,\n// left: None,\n// right: None\n// }\n// }\n// }\nuse std::rc::Rc;\nuse std::cell::RefCell;\nimpl Solution {\n pub fn tree_queries(root: Option>>, queries: Vec) -> Vec {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "/**\n * Definition for a binary tree node.\n * class TreeNode {\n * public $val = null;\n * public $left = null;\n * public $right = null;\n * function __construct($val = 0, $left = null, $right = null) {\n * $this->val = $val;\n * $this->left = $left;\n * $this->right = $right;\n * }\n * }\n */\nclass Solution {\n\n /**\n * @param TreeNode $root\n * @param Integer[] $queries\n * @return Integer[]\n */\n function treeQueries($root, $queries) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "/**\n * Definition for a binary tree node.\n * class TreeNode {\n * val: number\n * left: TreeNode | null\n * right: TreeNode | null\n * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {\n * this.val = (val===undefined ? 0 : val)\n * this.left = (left===undefined ? null : left)\n * this.right = (right===undefined ? null : right)\n * }\n * }\n */\n\nfunction treeQueries(root: TreeNode | null, queries: number[]): number[] {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "; Definition for a binary tree node.\n#|\n\n; val : integer?\n; left : (or/c tree-node? #f)\n; right : (or/c tree-node? #f)\n(struct tree-node\n (val left right) #:mutable #:transparent)\n\n; constructor\n(define (make-tree-node [val 0])\n (tree-node val #f #f))\n\n|#\n\n(define/contract (tree-queries root queries)\n (-> (or/c tree-node? #f) (listof exact-integer?) (listof exact-integer?))\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "%% Definition for a binary tree node.\n%%\n%% -record(tree_node, {val = 0 :: integer(),\n%% left = null :: 'null' | #tree_node{},\n%% right = null :: 'null' | #tree_node{}}).\n\n-spec tree_queries(Root :: #tree_node{} | null, Queries :: [integer()]) -> [integer()].\ntree_queries(Root, Queries) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "# Definition for a binary tree node.\n#\n# defmodule TreeNode do\n# @type t :: %__MODULE__{\n# val: integer,\n# left: TreeNode.t() | nil,\n# right: TreeNode.t() | nil\n# }\n# defstruct val: 0, left: nil, right: nil\n# end\n\ndefmodule Solution do\n @spec tree_queries(root :: TreeNode.t | nil, queries :: [integer]) :: [integer]\n def tree_queries(root, queries) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "/**\n * Definition for a binary tree node.\n * class TreeNode {\n * int val;\n * TreeNode? left;\n * TreeNode? right;\n * TreeNode([this.val = 0, this.left, this.right]);\n * }\n */\nclass Solution {\n List treeQueries(TreeNode? root, List queries) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"3.6K\", \"totalSubmission\": \"9K\", \"totalAcceptedRaw\": 3551, \"totalSubmissionRaw\": 9032, \"acRate\": \"39.3%\"}", + "hints": [ + "Try pre-computing the answer for each node from 1 to n, and answer each query in O(1).", + "The answers can be precomputed in a single tree traversal after computing the height of each subtree." + ], + "solution": null, + "status": null, + "sampleTestCase": "[1,3,4,2,null,6,5,null,null,null,null,null,7]\n[4]", + "metaData": "{\n \"name\": \"treeQueries\",\n \"params\": [\n {\n \"name\": \"root\",\n \"type\": \"TreeNode\"\n },\n {\n \"type\": \"integer[]\",\n \"name\": \"queries\"\n }\n ],\n \"return\": {\n \"type\": \"integer[]\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[1,3,4,2,null,6,5,null,null,null,null,null,7]\n[4]\n[5,8,9,2,1,3,7,4,6]\n[3,2,4,8]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/maximum-sum-of-distinct-subarrays-with-length-k.json b/leetcode-cn/originData/maximum-sum-of-distinct-subarrays-with-length-k.json new file mode 100644 index 00000000..1a04ffb5 --- /dev/null +++ b/leetcode-cn/originData/maximum-sum-of-distinct-subarrays-with-length-k.json @@ -0,0 +1,184 @@ +{ + "data": { + "question": { + "questionId": "2552", + "questionFrontendId": "2461", + "categoryTitle": "Algorithms", + "boundTopicId": 1945654, + "title": "Maximum Sum of Distinct Subarrays With Length K", + "titleSlug": "maximum-sum-of-distinct-subarrays-with-length-k", + "content": "

You are given an integer array nums and an integer k. Find the maximum subarray sum of all the subarrays of nums that meet the following conditions:

\n\n
    \n\t
  • The length of the subarray is k, and
  • \n\t
  • All the elements of the subarray are distinct.
  • \n
\n\n

Return the maximum subarray sum of all the subarrays that meet the conditions. If no subarray meets the conditions, return 0.

\n\n

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

\n\n

 

\n

Example 1:

\n\n
\nInput: nums = [1,5,4,2,9,9,9], k = 3\nOutput: 15\nExplanation: The subarrays of nums with length 3 are:\n- [1,5,4] which meets the requirements and has a sum of 10.\n- [5,4,2] which meets the requirements and has a sum of 11.\n- [4,2,9] which meets the requirements and has a sum of 15.\n- [2,9,9] which does not meet the requirements because the element 9 is repeated.\n- [9,9,9] which does not meet the requirements because the element 9 is repeated.\nWe return 15 because it is the maximum subarray sum of all the subarrays that meet the conditions\n
\n\n

Example 2:

\n\n
\nInput: nums = [4,4,4], k = 3\nOutput: 0\nExplanation: The subarrays of nums with length 3 are:\n- [4,4,4] which does not meet the requirements because the element 4 is repeated.\nWe return 0 because no subarrays meet the conditions.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= k <= nums.length <= 105
  • \n\t
  • 1 <= nums[i] <= 105
  • \n
\n", + "translatedTitle": "长度为 K 子数组中的最大和", + "translatedContent": "

给你一个整数数组 nums 和一个整数 k 。请你从 nums 中满足下述条件的全部子数组中找出最大子数组和:

\n\n
    \n\t
  • 子数组的长度是 k,且
  • \n\t
  • 子数组中的所有元素 各不相同 。
  • \n
\n\n

返回满足题面要求的最大子数组和。如果不存在子数组满足这些条件,返回 0

\n\n

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

\n\n

 

\n\n

示例 1:

\n\n
输入:nums = [1,5,4,2,9,9,9], k = 3\n输出:15\n解释:nums 中长度为 3 的子数组是:\n- [1,5,4] 满足全部条件,和为 10 。\n- [5,4,2] 满足全部条件,和为 11 。\n- [4,2,9] 满足全部条件,和为 15 。\n- [2,9,9] 不满足全部条件,因为元素 9 出现重复。\n- [9,9,9] 不满足全部条件,因为元素 9 出现重复。\n因为 15 是满足全部条件的所有子数组中的最大子数组和,所以返回 15 。\n
\n\n

示例 2:

\n\n
输入:nums = [4,4,4], k = 3\n输出:0\n解释:nums 中长度为 3 的子数组是:\n- [4,4,4] 不满足全部条件,因为元素 4 出现重复。\n因为不存在满足全部条件的子数组,所以返回 0 。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= k <= nums.length <= 105
  • \n\t
  • 1 <= nums[i] <= 105
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 21, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": false, \"java\": false, \"python\": false, \"python3\": false, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"dart\": false}", + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": "数组", + "__typename": "TopicTagNode" + }, + { + "name": "Hash Table", + "slug": "hash-table", + "translatedName": "哈希表", + "__typename": "TopicTagNode" + }, + { + "name": "Sliding Window", + "slug": "sliding-window", + "translatedName": "滑动窗口", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n long long maximumSubarraySum(vector& nums, int k) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public long maximumSubarraySum(int[] nums, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def maximumSubarraySum(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 maximumSubarraySum(self, nums: List[int], k: int) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "long long maximumSubarraySum(int* nums, int numsSize, int k){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public long MaximumSubarraySum(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 maximumSubarraySum = function(nums, k) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums\n# @param {Integer} k\n# @return {Integer}\ndef maximum_subarray_sum(nums, k)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func maximumSubarraySum(_ nums: [Int], _ k: Int) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func maximumSubarraySum(nums []int, k int) int64 {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def maximumSubarraySum(nums: Array[Int], k: Int): Long = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun maximumSubarraySum(nums: IntArray, k: Int): Long {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn maximum_subarray_sum(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 maximumSubarraySum($nums, $k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function maximumSubarraySum(nums: number[], k: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (maximum-subarray-sum nums k)\n (-> (listof exact-integer?) exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec maximum_subarray_sum(Nums :: [integer()], K :: integer()) -> integer().\nmaximum_subarray_sum(Nums, K) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec maximum_subarray_sum(nums :: [integer], k :: integer) :: integer\n def maximum_subarray_sum(nums, k) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int maximumSubarraySum(List nums, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"5.6K\", \"totalSubmission\": \"19.9K\", \"totalAcceptedRaw\": 5649, \"totalSubmissionRaw\": 19852, \"acRate\": \"28.5%\"}", + "hints": [ + "Which elements change when moving from the subarray of size k that ends at index i to the subarray of size k that ends at index i + 1?", + "Only two elements change, the element at i + 1 is added into the subarray, and the element at i - k + 1 gets removed from the subarray.", + "Iterate through each subarray of size k and keep track of the sum of the subarray and the frequency of each element." + ], + "solution": null, + "status": null, + "sampleTestCase": "[1,5,4,2,9,9,9]\n3", + "metaData": "{\n \"name\": \"maximumSubarraySum\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"k\"\n }\n ],\n \"return\": {\n \"type\": \"long\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[1,5,4,2,9,9,9]\n3\n[4,4,4]\n3", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/minimum-addition-to-make-integer-beautiful.json b/leetcode-cn/originData/minimum-addition-to-make-integer-beautiful.json new file mode 100644 index 00000000..027508a6 --- /dev/null +++ b/leetcode-cn/originData/minimum-addition-to-make-integer-beautiful.json @@ -0,0 +1,177 @@ +{ + "data": { + "question": { + "questionId": "2544", + "questionFrontendId": "2457", + "categoryTitle": "Algorithms", + "boundTopicId": 1929913, + "title": "Minimum Addition to Make Integer Beautiful", + "titleSlug": "minimum-addition-to-make-integer-beautiful", + "content": "

You are given two positive integers n and target.

\n\n

An integer is considered beautiful if the sum of its digits is less than or equal to target.

\n\n

Return the minimum non-negative integer x such that n + x is beautiful. The input will be generated such that it is always possible to make n beautiful.

\n\n

 

\n

Example 1:

\n\n
\nInput: n = 16, target = 6\nOutput: 4\nExplanation: Initially n is 16 and its digit sum is 1 + 6 = 7. After adding 4, n becomes 20 and digit sum becomes 2 + 0 = 2. It can be shown that we can not make n beautiful with adding non-negative integer less than 4.\n
\n\n

Example 2:

\n\n
\nInput: n = 467, target = 6\nOutput: 33\nExplanation: Initially n is 467 and its digit sum is 4 + 6 + 7 = 17. After adding 33, n becomes 500 and digit sum becomes 5 + 0 + 0 = 5. It can be shown that we can not make n beautiful with adding non-negative integer less than 33.\n
\n\n

Example 3:

\n\n
\nInput: n = 1, target = 1\nOutput: 0\nExplanation: Initially n is 1 and its digit sum is 1, which is already smaller than or equal to target.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= n <= 1012
  • \n\t
  • 1 <= target <= 150
  • \n\t
  • The input will be generated such that it is always possible to make n beautiful.
  • \n
\n", + "translatedTitle": "美丽整数的最小增量", + "translatedContent": "

给你两个正整数 ntarget

\n\n

如果某个整数每一位上的数字相加小于或等于 target ,则认为这个整数是一个 美丽整数

\n\n

找出并返回满足 n + x美丽整数 的最小非负整数 x 。生成的输入保证总可以使 n 变成一个美丽整数。

\n\n

 

\n\n

示例 1:

\n\n
输入:n = 16, target = 6\n输出:4\n解释:最初,n 是 16 ,且其每一位数字的和是 1 + 6 = 7 。在加 4 之后,n 变为 20 且每一位数字的和变成 2 + 0 = 2 。可以证明无法加上一个小于 4 的非负整数使 n 变成一个美丽整数。\n
\n\n

示例 2:

\n\n
输入:n = 467, target = 6\n输出:33\n解释:最初,n 是 467 ,且其每一位数字的和是 4 + 6 + 7 = 17 。在加 33 之后,n 变为 500 且每一位数字的和变成 5 + 0 + 0 = 5 。可以证明无法加上一个小于 33 的非负整数使 n 变成一个美丽整数。
\n\n

示例 3:

\n\n
输入:n = 1, target = 1\n输出:0\n解释:最初,n 是 1 ,且其每一位数字的和是 1 ,已经小于等于 target 。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= n <= 1012
  • \n\t
  • 1 <= target <= 150
  • \n\t
  • 生成的输入保证总可以使 n 变成一个美丽整数。
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 19, + "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": "Greedy", + "slug": "greedy", + "translatedName": "贪心", + "__typename": "TopicTagNode" + }, + { + "name": "Math", + "slug": "math", + "translatedName": "数学", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n long long makeIntegerBeautiful(long long n, int target) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public long makeIntegerBeautiful(long n, int target) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def makeIntegerBeautiful(self, n, target):\n \"\"\"\n :type n: int\n :type target: int\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def makeIntegerBeautiful(self, n: int, target: int) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "long long makeIntegerBeautiful(long long n, int target){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public long MakeIntegerBeautiful(long n, int target) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number} n\n * @param {number} target\n * @return {number}\n */\nvar makeIntegerBeautiful = function(n, target) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer} n\n# @param {Integer} target\n# @return {Integer}\ndef make_integer_beautiful(n, target)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func makeIntegerBeautiful(_ n: Int, _ target: Int) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func makeIntegerBeautiful(n int64, target int) int64 {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def makeIntegerBeautiful(n: Long, target: Int): Long = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun makeIntegerBeautiful(n: Long, target: Int): Long {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn make_integer_beautiful(n: i64, target: i32) -> i64 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer $n\n * @param Integer $target\n * @return Integer\n */\n function makeIntegerBeautiful($n, $target) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function makeIntegerBeautiful(n: number, target: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (make-integer-beautiful n target)\n (-> exact-integer? exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec make_integer_beautiful(N :: integer(), Target :: integer()) -> integer().\nmake_integer_beautiful(N, Target) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec make_integer_beautiful(n :: integer, target :: integer) :: integer\n def make_integer_beautiful(n, target) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int makeIntegerBeautiful(int n, int target) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"5.8K\", \"totalSubmission\": \"14.9K\", \"totalAcceptedRaw\": 5787, \"totalSubmissionRaw\": 14914, \"acRate\": \"38.8%\"}", + "hints": [ + "Think about each digit independently.", + "Turn the rightmost non-zero digit to zero until the digit sum is greater than target." + ], + "solution": null, + "status": null, + "sampleTestCase": "16\n6", + "metaData": "{\n \"name\": \"makeIntegerBeautiful\",\n \"params\": [\n {\n \"name\": \"n\",\n \"type\": \"long\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"target\"\n }\n ],\n \"return\": {\n \"type\": \"long\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "16\n6\n467\n6\n1\n1", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/minimum-number-of-food-buckets-to-feed-the-hamsters.json b/leetcode-cn/originData/minimum-number-of-food-buckets-to-feed-the-hamsters.json new file mode 100644 index 00000000..e9113345 --- /dev/null +++ b/leetcode-cn/originData/minimum-number-of-food-buckets-to-feed-the-hamsters.json @@ -0,0 +1,185 @@ +{ + "data": { + "question": { + "questionId": "2191", + "questionFrontendId": "2086", + "categoryTitle": "Algorithms", + "boundTopicId": 1121117, + "title": "Minimum Number of Food Buckets to Feed the Hamsters", + "titleSlug": "minimum-number-of-food-buckets-to-feed-the-hamsters", + "content": "

You are given a 0-indexed string hamsters where hamsters[i] is either:

\n\n
    \n\t
  • 'H' indicating that there is a hamster at index i, or
  • \n\t
  • '.' indicating that index i is empty.
  • \n
\n\n

You will add some number of food buckets at the empty indices in order to feed the hamsters. A hamster can be fed if there is at least one food bucket to its left or to its right. More formally, a hamster at index i can be fed if you place a food bucket at index i - 1 and/or at index i + 1.

\n\n

Return the minimum number of food buckets you should place at empty indices to feed all the hamsters or -1 if it is impossible to feed all of them.

\n\n

 

\n

Example 1:

\n\"\"\n
\nInput: hamsters = "H..H"\nOutput: 2\nExplanation: We place two food buckets at indices 1 and 2.\nIt can be shown that if we place only one food bucket, one of the hamsters will not be fed.\n
\n\n

Example 2:

\n\"\"\n
\nInput: hamsters = ".H.H."\nOutput: 1\nExplanation: We place one food bucket at index 2.\n
\n\n

Example 3:

\n\"\"\n
\nInput: hamsters = ".HHH."\nOutput: -1\nExplanation: If we place a food bucket at every empty index as shown, the hamster at index 2 will not be able to eat.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= hamsters.length <= 105
  • \n\t
  • hamsters[i] is either'H' or '.'.
  • \n
\n", + "translatedTitle": "从房屋收集雨水需要的最少水桶数", + "translatedContent": "

给你一个下标从 0 开始的字符串 street 。street 中每个字符要么是表示房屋的 'H' ,要么是表示空位的 '.' 。

\n\n

你可以在 空位 放置水桶,从相邻的房屋收集雨水。位置在 i - 1 或者 i + 1 的水桶可以收集位置为 i 处房屋的雨水。一个水桶如果相邻两个位置都有房屋,那么它可以收集 两个 房屋的雨水。

\n\n

在确保 每个 房屋旁边都 至少 有一个水桶的前提下,请你返回需要的 最少 水桶数。如果无解请返回 -1 。

\n\n

 

\n\n

示例 1:

\n\n
输入:street = \"H..H\"\n输出:2\n解释:\n我们可以在下标为 1 和 2 处放水桶。\n\"H..H\" -> \"HBBH\"('B' 表示放置水桶)。\n下标为 0 处的房屋右边有水桶,下标为 3 处的房屋左边有水桶。\n所以每个房屋旁边都至少有一个水桶收集雨水。\n
\n\n

示例 2:

\n\n
输入:street = \".H.H.\"\n输出:1\n解释:\n我们可以在下标为 2 处放置一个水桶。\n\".H.H.\" -> \".HBH.\"('B' 表示放置水桶)。\n下标为 1 处的房屋右边有水桶,下标为 3 处的房屋左边有水桶。\n所以每个房屋旁边都至少有一个水桶收集雨水。\n
\n\n

示例 3:

\n\n
输入:street = \".HHH.\"\n输出:-1\n解释:\n没有空位可以放置水桶收集下标为 2 处的雨水。\n所以没有办法收集所有房屋的雨水。\n
\n\n

示例 4:

\n\n
输入:street = \"H\"\n输出:-1\n解释:\n没有空位放置水桶。\n所以没有办法收集所有房屋的雨水。\n
\n\n

示例 5:

\n\n
输入:street = \".\"\n输出:0\n解释:\n没有房屋需要收集雨水。\n所以需要 0 个水桶。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= street.length <= 105
  • \n\t
  • street[i] 要么是 'H' ,要么是 '.'
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 24, + "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": "String", + "slug": "string", + "translatedName": "字符串", + "__typename": "TopicTagNode" + }, + { + "name": "Dynamic Programming", + "slug": "dynamic-programming", + "translatedName": "动态规划", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int minimumBuckets(string hamsters) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int minimumBuckets(String hamsters) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def minimumBuckets(self, hamsters):\n \"\"\"\n :type hamsters: str\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def minimumBuckets(self, hamsters: str) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int minimumBuckets(char * hamsters){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int MinimumBuckets(string hamsters) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {string} hamsters\n * @return {number}\n */\nvar minimumBuckets = function(hamsters) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {String} hamsters\n# @return {Integer}\ndef minimum_buckets(hamsters)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func minimumBuckets(_ hamsters: String) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func minimumBuckets(hamsters string) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def minimumBuckets(hamsters: String): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun minimumBuckets(hamsters: String): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn minimum_buckets(hamsters: String) -> i32 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param String $hamsters\n * @return Integer\n */\n function minimumBuckets($hamsters) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function minimumBuckets(hamsters: string): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (minimum-buckets hamsters)\n (-> string? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec minimum_buckets(Hamsters :: unicode:unicode_binary()) -> integer().\nminimum_buckets(Hamsters) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec minimum_buckets(hamsters :: String.t) :: integer\n def minimum_buckets(hamsters) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int minimumBuckets(String hamsters) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"4.8K\", \"totalSubmission\": \"10.3K\", \"totalAcceptedRaw\": 4754, \"totalSubmissionRaw\": 10318, \"acRate\": \"46.1%\"}", + "hints": [ + "When is it impossible to collect the rainwater from all the houses?", + "When one or more houses do not have an empty space adjacent to it.", + "Assuming the rainwater from all previous houses is collected. If there is a house at index i and you are able to place a bucket at index i - 1 or i + 1, where should you put it?", + "It is always better to place a bucket at index i + 1 because it can collect the rainwater from the next house as well." + ], + "solution": null, + "status": null, + "sampleTestCase": "\"H..H\"", + "metaData": "{\n \"name\": \"minimumBuckets\",\n \"params\": [\n {\n \"name\": \"hamsters\",\n \"type\": \"string\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "\"H..H\"\n\".H.H.\"\n\".HHH.\"", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/minimum-total-distance-traveled.json b/leetcode-cn/originData/minimum-total-distance-traveled.json new file mode 100644 index 00000000..b80c7aa5 --- /dev/null +++ b/leetcode-cn/originData/minimum-total-distance-traveled.json @@ -0,0 +1,184 @@ +{ + "data": { + "question": { + "questionId": "2554", + "questionFrontendId": "2463", + "categoryTitle": "Algorithms", + "boundTopicId": 1946379, + "title": "Minimum Total Distance Traveled", + "titleSlug": "minimum-total-distance-traveled", + "content": "

There are some robots and factories on the X-axis. You are given an integer array robot where robot[i] is the position of the ith robot. You are also given a 2D integer array factory where factory[j] = [positionj, limitj] indicates that positionj is the position of the jth factory and that the jth factory can repair at most limitj robots.

\n\n

The positions of each robot are unique. The positions of each factory are also unique. Note that a robot can be in the same position as a factory initially.

\n\n

All the robots are initially broken; they keep moving in one direction. The direction could be the negative or the positive direction of the X-axis. When a robot reaches a factory that did not reach its limit, the factory repairs the robot, and it stops moving.

\n\n

At any moment, you can set the initial direction of moving for some robot. Your target is to minimize the total distance traveled by all the robots.

\n\n

Return the minimum total distance traveled by all the robots. The test cases are generated such that all the robots can be repaired.

\n\n

Note that

\n\n
    \n\t
  • All robots move at the same speed.
  • \n\t
  • If two robots move in the same direction, they will never collide.
  • \n\t
  • If two robots move in opposite directions and they meet at some point, they do not collide. They cross each other.
  • \n\t
  • If a robot passes by a factory that reached its limits, it crosses it as if it does not exist.
  • \n\t
  • If the robot moved from a position x to a position y, the distance it moved is |y - x|.
  • \n
\n\n

 

\n

Example 1:

\n\"\"\n
\nInput: robot = [0,4,6], factory = [[2,2],[6,2]]\nOutput: 4\nExplanation: As shown in the figure:\n- The first robot at position 0 moves in the positive direction. It will be repaired at the first factory.\n- The second robot at position 4 moves in the negative direction. It will be repaired at the first factory.\n- The third robot at position 6 will be repaired at the second factory. It does not need to move.\nThe limit of the first factory is 2, and it fixed 2 robots.\nThe limit of the second factory is 2, and it fixed 1 robot.\nThe total distance is |2 - 0| + |2 - 4| + |6 - 6| = 4. It can be shown that we cannot achieve a better total distance than 4.\n
\n\n

Example 2:

\n\"\"\n
\nInput: robot = [1,-1], factory = [[-2,1],[2,1]]\nOutput: 2\nExplanation: As shown in the figure:\n- The first robot at position 1 moves in the positive direction. It will be repaired at the second factory.\n- The second robot at position -1 moves in the negative direction. It will be repaired at the first factory.\nThe limit of the first factory is 1, and it fixed 1 robot.\nThe limit of the second factory is 1, and it fixed 1 robot.\nThe total distance is |2 - 1| + |(-2) - (-1)| = 2. It can be shown that we cannot achieve a better total distance than 2.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= robot.length, factory.length <= 100
  • \n\t
  • factory[j].length == 2
  • \n\t
  • -109 <= robot[i], positionj <= 109
  • \n\t
  • 0 <= limitj <= robot.length
  • \n\t
  • The input will be generated such that it is always possible to repair every robot.
  • \n
\n", + "translatedTitle": "最小移动总距离", + "translatedContent": "

X 轴上有一些机器人和工厂。给你一个整数数组 robot ,其中 robot[i] 是第 i 个机器人的位置。再给你一个二维整数数组 factory ,其中 factory[j] = [positionj, limitj] ,表示第 j 个工厂的位置在 positionj ,且第 j 个工厂最多可以修理 limitj 个机器人。

\n\n

每个机器人所在的位置 互不相同 。每个工厂所在的位置也 互不相同 。注意一个机器人可能一开始跟一个工厂在 相同的位置 。

\n\n

所有机器人一开始都是坏的,他们会沿着设定的方向一直移动。设定的方向要么是 X 轴的正方向,要么是 X 轴的负方向。当一个机器人经过一个没达到上限的工厂时,这个工厂会维修这个机器人,且机器人停止移动。

\n\n

任何时刻,你都可以设置 部分 机器人的移动方向。你的目标是最小化所有机器人总的移动距离。

\n\n

请你返回所有机器人移动的最小总距离。测试数据保证所有机器人都可以被维修。

\n\n

注意:

\n\n
    \n\t
  • 所有机器人移动速度相同。
  • \n\t
  • 如果两个机器人移动方向相同,它们永远不会碰撞。
  • \n\t
  • 如果两个机器人迎面相遇,它们也不会碰撞,它们彼此之间会擦肩而过。
  • \n\t
  • 如果一个机器人经过了一个已经达到上限的工厂,机器人会当作工厂不存在,继续移动。
  • \n\t
  • 机器人从位置 x 到位置 y 的移动距离为 |y - x| 。
  • \n
\n\n

 

\n\n

示例 1:

\n\n

\"\"

\n\n
\n输入:robot = [0,4,6], factory = [[2,2],[6,2]]\n输出:4\n解释:如上图所示:\n- 第一个机器人从位置 0 沿着正方向移动,在第一个工厂处维修。\n- 第二个机器人从位置 4 沿着负方向移动,在第一个工厂处维修。\n- 第三个机器人在位置 6 被第二个工厂维修,它不需要移动。\n第一个工厂的维修上限是 2 ,它维修了 2 个机器人。\n第二个工厂的维修上限是 2 ,它维修了 1 个机器人。\n总移动距离是 |2 - 0| + |2 - 4| + |6 - 6| = 4 。没有办法得到比 4 更少的总移动距离。\n
\n\n

示例 2:

\n\n

\"\"

\n\n
\n输入:robot = [1,-1], factory = [[-2,1],[2,1]]\n输出:2\n解释:如上图所示:\n- 第一个机器人从位置 1 沿着正方向移动,在第二个工厂处维修。\n- 第二个机器人在位置 -1 沿着负方向移动,在第一个工厂处维修。\n第一个工厂的维修上限是 1 ,它维修了 1 个机器人。\n第二个工厂的维修上限是 1 ,它维修了 1 个机器人。\n总移动距离是 |2 - 1| + |(-2) - (-1)| = 2 。没有办法得到比 2 更少的总移动距离。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= robot.length, factory.length <= 100
  • \n\t
  • factory[j].length == 2
  • \n\t
  • -109 <= robot[i], positionj <= 109
  • \n\t
  • 0 <= limitj <= robot.length
  • \n\t
  • 测试数据保证所有机器人都可以被维修。
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Hard", + "likes": 30, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": false, \"java\": false, \"python\": false, \"python3\": false, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"dart\": false}", + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": "数组", + "__typename": "TopicTagNode" + }, + { + "name": "Dynamic Programming", + "slug": "dynamic-programming", + "translatedName": "动态规划", + "__typename": "TopicTagNode" + }, + { + "name": "Sorting", + "slug": "sorting", + "translatedName": "排序", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n long long minimumTotalDistance(vector& robot, vector>& factory) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public long minimumTotalDistance(List robot, int[][] factory) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def minimumTotalDistance(self, robot, factory):\n \"\"\"\n :type robot: List[int]\n :type factory: List[List[int]]\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def minimumTotalDistance(self, robot: List[int], factory: List[List[int]]) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "long long minimumTotalDistance(int* robot, int robotSize, int** factory, int factorySize, int* factoryColSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public long MinimumTotalDistance(IList robot, int[][] factory) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} robot\n * @param {number[][]} factory\n * @return {number}\n */\nvar minimumTotalDistance = function(robot, factory) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} robot\n# @param {Integer[][]} factory\n# @return {Integer}\ndef minimum_total_distance(robot, factory)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func minimumTotalDistance(_ robot: [Int], _ factory: [[Int]]) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func minimumTotalDistance(robot []int, factory [][]int) int64 {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def minimumTotalDistance(robot: List[Int], factory: Array[Array[Int]]): Long = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun minimumTotalDistance(robot: List, factory: Array): Long {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn minimum_total_distance(robot: Vec, factory: Vec>) -> i64 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[] $robot\n * @param Integer[][] $factory\n * @return Integer\n */\n function minimumTotalDistance($robot, $factory) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function minimumTotalDistance(robot: number[], factory: number[][]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (minimum-total-distance robot factory)\n (-> (listof exact-integer?) (listof (listof exact-integer?)) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec minimum_total_distance(Robot :: [integer()], Factory :: [[integer()]]) -> integer().\nminimum_total_distance(Robot, Factory) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec minimum_total_distance(robot :: [integer], factory :: [[integer]]) :: integer\n def minimum_total_distance(robot, factory) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int minimumTotalDistance(List robot, List> factory) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"2.5K\", \"totalSubmission\": \"5.6K\", \"totalAcceptedRaw\": 2461, \"totalSubmissionRaw\": 5616, \"acRate\": \"43.8%\"}", + "hints": [ + "Sort robots and factories by their positions.", + "After sorting, notice that each factory should repair some subsegment of robots.", + "Find the minimum total distance to repair first i robots with first j factories." + ], + "solution": null, + "status": null, + "sampleTestCase": "[0,4,6]\n[[2,2],[6,2]]", + "metaData": "{\n \"name\": \"minimumTotalDistance\",\n \"params\": [\n {\n \"name\": \"robot\",\n \"type\": \"list\"\n },\n {\n \"type\": \"integer[][]\",\n \"name\": \"factory\"\n }\n ],\n \"return\": {\n \"type\": \"long\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[0,4,6]\n[[2,2],[6,2]]\n[1,-1]\n[[-2,1],[2,1]]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/most-popular-video-creator.json b/leetcode-cn/originData/most-popular-video-creator.json new file mode 100644 index 00000000..cac984a5 --- /dev/null +++ b/leetcode-cn/originData/most-popular-video-creator.json @@ -0,0 +1,195 @@ +{ + "data": { + "question": { + "questionId": "2543", + "questionFrontendId": "2456", + "categoryTitle": "Algorithms", + "boundTopicId": 1929912, + "title": "Most Popular Video Creator", + "titleSlug": "most-popular-video-creator", + "content": "

You are given two string arrays creators and ids, and an integer array views, all of length n. The ith video on a platform was created by creator[i], has an id of ids[i], and has views[i] views.

\n\n

The popularity of a creator is the sum of the number of views on all of the creator's videos. Find the creator with the highest popularity and the id of their most viewed video.

\n\n
    \n\t
  • If multiple creators have the highest popularity, find all of them.
  • \n\t
  • If multiple videos have the highest view count for a creator, find the lexicographically smallest id.
  • \n
\n\n

Return a 2D array of strings answer where answer[i] = [creatori, idi] means that creatori has the highest popularity and idi is the id of their most popular video. The answer can be returned in any order.

\n\n

 

\n

Example 1:

\n\n
\nInput: creators = ["alice","bob","alice","chris"], ids = ["one","two","three","four"], views = [5,10,5,4]\nOutput: [["alice","one"],["bob","two"]]\nExplanation:\nThe popularity of alice is 5 + 5 = 10.\nThe popularity of bob is 10.\nThe popularity of chris is 4.\nalice and bob are the most popular creators.\nFor bob, the video with the highest view count is "two".\nFor alice, the videos with the highest view count are "one" and "three". Since "one" is lexicographically smaller than "three", it is included in the answer.\n
\n\n

Example 2:

\n\n
\nInput: creators = ["alice","alice","alice"], ids = ["a","b","c"], views = [1,2,2]\nOutput: [["alice","b"]]\nExplanation:\nThe videos with id "b" and "c" have the highest view count.\nSince "b" is lexicographically smaller than "c", it is included in the answer.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • n == creators.length == ids.length == views.length
  • \n\t
  • 1 <= n <= 105
  • \n\t
  • 1 <= creators[i].length, ids[i].length <= 5
  • \n\t
  • creators[i] and ids[i] consist only of lowercase English letters.
  • \n\t
  • 0 <= views[i] <= 105
  • \n
\n", + "translatedTitle": "最流行的视频创作者", + "translatedContent": "

给你两个字符串数组 creatorsids ,和一个整数数组 views ,所有数组的长度都是 n 。平台上第 i 个视频者是 creator[i] ,视频分配的 id 是 ids[i] ,且播放量为 views[i]

\n\n

视频创作者的 流行度 是该创作者的 所有 视频的播放量的 总和 。请找出流行度 最高 创作者以及该创作者播放量 最大 的视频的 id 。

\n\n
    \n\t
  • 如果存在多个创作者流行度都最高,则需要找出所有符合条件的创作者。
  • \n\t
  • 如果某个创作者存在多个播放量最高的视频,则只需要找出字典序最小的 id
  • \n
\n\n

返回一个二维字符串数组 answer ,其中 answer[i] = [creatori, idi] 表示 creatori 的流行度 最高 且其最流行的视频 id 是 idi ,可以按任何顺序返回该结果

\n\n

 

\n\n

示例 1:

\n\n
\n输入:creators = [\"alice\",\"bob\",\"alice\",\"chris\"], ids = [\"one\",\"two\",\"three\",\"four\"], views = [5,10,5,4]\n输出:[[\"alice\",\"one\"],[\"bob\",\"two\"]]\n解释:\nalice 的流行度是 5 + 5 = 10 。\nbob 的流行度是 10 。\nchris 的流行度是 4 。\nalice 和 bob 是流行度最高的创作者。\nbob 播放量最高的视频 id 为 \"two\" 。\nalice 播放量最高的视频 id 是 \"one\" 和 \"three\" 。由于 \"one\" 的字典序比 \"three\" 更小,所以结果中返回的 id 是 \"one\" 。\n
\n\n

示例 2:

\n\n
\n输入:creators = [\"alice\",\"alice\",\"alice\"], ids = [\"a\",\"b\",\"c\"], views = [1,2,2]\n输出:[[\"alice\",\"b\"]]\n解释:\nid 为 \"b\" 和 \"c\" 的视频都满足播放量最高的条件。\n由于 \"b\" 的字典序比 \"c\" 更小,所以结果中返回的 id 是 \"b\" 。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • n == creators.length == ids.length == views.length
  • \n\t
  • 1 <= n <= 105
  • \n\t
  • 1 <= creators[i].length, ids[i].length <= 5
  • \n\t
  • creators[i]ids[i] 仅由小写英文字母组成
  • \n\t
  • 0 <= views[i] <= 105
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 16, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": false, \"java\": false, \"python\": true, \"python3\": false, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"dart\": false}", + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": "数组", + "__typename": "TopicTagNode" + }, + { + "name": "Hash Table", + "slug": "hash-table", + "translatedName": "哈希表", + "__typename": "TopicTagNode" + }, + { + "name": "String", + "slug": "string", + "translatedName": "字符串", + "__typename": "TopicTagNode" + }, + { + "name": "Sorting", + "slug": "sorting", + "translatedName": "排序", + "__typename": "TopicTagNode" + }, + { + "name": "Heap (Priority Queue)", + "slug": "heap-priority-queue", + "translatedName": "堆(优先队列)", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n vector> mostPopularCreator(vector& creators, vector& ids, vector& views) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public List> mostPopularCreator(String[] creators, String[] ids, int[] views) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def mostPopularCreator(self, creators, ids, views):\n \"\"\"\n :type creators: List[str]\n :type ids: List[str]\n :type views: List[int]\n :rtype: List[List[str]]\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def mostPopularCreator(self, creators: List[str], ids: List[str], views: List[int]) -> List[List[str]]:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "/**\n * Return an array of arrays of size *returnSize.\n * The sizes of the arrays are returned as *returnColumnSizes array.\n * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free().\n */\nchar *** mostPopularCreator(char ** creators, int creatorsSize, char ** ids, int idsSize, int* views, int viewsSize, int* returnSize, int** returnColumnSizes){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public IList> MostPopularCreator(string[] creators, string[] ids, int[] views) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {string[]} creators\n * @param {string[]} ids\n * @param {number[]} views\n * @return {string[][]}\n */\nvar mostPopularCreator = function(creators, ids, views) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {String[]} creators\n# @param {String[]} ids\n# @param {Integer[]} views\n# @return {String[][]}\ndef most_popular_creator(creators, ids, views)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func mostPopularCreator(_ creators: [String], _ ids: [String], _ views: [Int]) -> [[String]] {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func mostPopularCreator(creators []string, ids []string, views []int) [][]string {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def mostPopularCreator(creators: Array[String], ids: Array[String], views: Array[Int]): List[List[String]] = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun mostPopularCreator(creators: Array, ids: Array, views: IntArray): List> {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn most_popular_creator(creators: Vec, ids: Vec, views: Vec) -> Vec> {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param String[] $creators\n * @param String[] $ids\n * @param Integer[] $views\n * @return String[][]\n */\n function mostPopularCreator($creators, $ids, $views) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function mostPopularCreator(creators: string[], ids: string[], views: number[]): string[][] {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (most-popular-creator creators ids views)\n (-> (listof string?) (listof string?) (listof exact-integer?) (listof (listof string?)))\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec most_popular_creator(Creators :: [unicode:unicode_binary()], Ids :: [unicode:unicode_binary()], Views :: [integer()]) -> [[unicode:unicode_binary()]].\nmost_popular_creator(Creators, Ids, Views) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec most_popular_creator(creators :: [String.t], ids :: [String.t], views :: [integer]) :: [[String.t]]\n def most_popular_creator(creators, ids, views) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n List> mostPopularCreator(List creators, List ids, List views) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"7.1K\", \"totalSubmission\": \"18.5K\", \"totalAcceptedRaw\": 7055, \"totalSubmissionRaw\": 18515, \"acRate\": \"38.1%\"}", + "hints": [ + "Use a hash table to store and categorize videos based on their creator.", + "For each creator, iterate through all their videos and use three variables to keep track of their popularity, their most popular video, and the id of their most popular video." + ], + "solution": null, + "status": null, + "sampleTestCase": "[\"alice\",\"bob\",\"alice\",\"chris\"]\n[\"one\",\"two\",\"three\",\"four\"]\n[5,10,5,4]", + "metaData": "{\n \"name\": \"mostPopularCreator\",\n \"params\": [\n {\n \"name\": \"creators\",\n \"type\": \"string[]\"\n },\n {\n \"type\": \"string[]\",\n \"name\": \"ids\"\n },\n {\n \"type\": \"integer[]\",\n \"name\": \"views\"\n }\n ],\n \"return\": {\n \"type\": \"list>\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[\"alice\",\"bob\",\"alice\",\"chris\"]\n[\"one\",\"two\",\"three\",\"four\"]\n[5,10,5,4]\n[\"alice\",\"alice\",\"alice\"]\n[\"a\",\"b\",\"c\"]\n[1,2,2]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/odd-string-difference.json b/leetcode-cn/originData/odd-string-difference.json new file mode 100644 index 00000000..35954db8 --- /dev/null +++ b/leetcode-cn/originData/odd-string-difference.json @@ -0,0 +1,183 @@ +{ + "data": { + "question": { + "questionId": "2547", + "questionFrontendId": "2451", + "categoryTitle": "Algorithms", + "boundTopicId": 1930511, + "title": "Odd String Difference", + "titleSlug": "odd-string-difference", + "content": "

You are given an array of equal-length strings words. Assume that the length of each string is n.

\n\n

Each string words[i] can be converted into a difference integer array difference[i] of length n - 1 where difference[i][j] = words[i][j+1] - words[i][j] where 0 <= j <= n - 2. Note that the difference between two letters is the difference between their positions in the alphabet i.e. the position of 'a' is 0, 'b' is 1, and 'z' is 25.

\n\n
    \n\t
  • For example, for the string "acb", the difference integer array is [2 - 0, 1 - 2] = [2, -1].
  • \n
\n\n

All the strings in words have the same difference integer array, except one. You should find that string.

\n\n

Return the string in words that has different difference integer array.

\n\n

 

\n

Example 1:

\n\n
\nInput: words = ["adc","wzy","abc"]\nOutput: "abc"\nExplanation: \n- The difference integer array of "adc" is [3 - 0, 2 - 3] = [3, -1].\n- The difference integer array of "wzy" is [25 - 22, 24 - 25]= [3, -1].\n- The difference integer array of "abc" is [1 - 0, 2 - 1] = [1, 1]. \nThe odd array out is [1, 1], so we return the corresponding string, "abc".\n
\n\n

Example 2:

\n\n
\nInput: words = ["aaa","bob","ccc","ddd"]\nOutput: "bob"\nExplanation: All the integer arrays are [0, 0] except for "bob", which corresponds to [13, -13].\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 3 <= words.length <= 100
  • \n\t
  • n == words[i].length
  • \n\t
  • 2 <= n <= 20
  • \n\t
  • words[i] consists of lowercase English letters.
  • \n
\n", + "translatedTitle": "差值数组不同的字符串", + "translatedContent": "

给你一个字符串数组 words ,每一个字符串长度都相同,令所有字符串的长度都为 n 。

\n\n

每个字符串 words[i] 可以被转化为一个长度为 n - 1 的 差值整数数组 difference[i] ,其中对于 0 <= j <= n - 2 有 difference[i][j] = words[i][j+1] - words[i][j] 。注意两个字母的差值定义为它们在字母表中 位置 之差,也就是说 'a' 的位置是 0 ,'b' 的位置是 1 ,'z' 的位置是 25 。

\n\n
    \n\t
  • 比方说,字符串 \"acb\" 的差值整数数组是 [2 - 0, 1 - 2] = [2, -1] 。
  • \n
\n\n

words 中所有字符串 除了一个字符串以外 ,其他字符串的差值整数数组都相同。你需要找到那个不同的字符串。

\n\n

请你返回 words中 差值整数数组 不同的字符串。

\n\n

 

\n\n

示例 1:

\n\n
\n输入:words = [\"adc\",\"wzy\",\"abc\"]\n输出:\"abc\"\n解释:\n- \"adc\" 的差值整数数组是 [3 - 0, 2 - 3] = [3, -1] 。\n- \"wzy\" 的差值整数数组是 [25 - 22, 24 - 25]= [3, -1] 。\n- \"abc\" 的差值整数数组是 [1 - 0, 2 - 1] = [1, 1] 。\n不同的数组是 [1, 1],所以返回对应的字符串,\"abc\"。\n
\n\n

示例 2:

\n\n
\n输入:words = [\"aaa\",\"bob\",\"ccc\",\"ddd\"]\n输出:\"bob\"\n解释:除了 \"bob\" 的差值整数数组是 [13, -13] 以外,其他字符串的差值整数数组都是 [0, 0] 。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 3 <= words.length <= 100
  • \n\t
  • n == words[i].length
  • \n\t
  • 2 <= n <= 20
  • \n\t
  • words[i] 只含有小写英文字母。
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 5, + "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": "Hash Table", + "slug": "hash-table", + "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 oddString(vector& words) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public String oddString(String[] words) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def oddString(self, words):\n \"\"\"\n :type words: List[str]\n :rtype: str\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def oddString(self, words: List[str]) -> str:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "char * oddString(char ** words, int wordsSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public string OddString(string[] words) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {string[]} words\n * @return {string}\n */\nvar oddString = function(words) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {String[]} words\n# @return {String}\ndef odd_string(words)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func oddString(_ words: [String]) -> String {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func oddString(words []string) string {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def oddString(words: Array[String]): String = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun oddString(words: Array): String {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn odd_string(words: Vec) -> String {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param String[] $words\n * @return String\n */\n function oddString($words) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function oddString(words: string[]): string {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (odd-string words)\n (-> (listof string?) string?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec odd_string(Words :: [unicode:unicode_binary()]) -> unicode:unicode_binary().\nodd_string(Words) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec odd_string(words :: [String.t]) :: String.t\n def odd_string(words) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n String oddString(List words) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"4K\", \"totalSubmission\": \"6.9K\", \"totalAcceptedRaw\": 4038, \"totalSubmissionRaw\": 6881, \"acRate\": \"58.7%\"}", + "hints": [ + "Find the difference integer array for each string.", + "Compare them to find the odd one out." + ], + "solution": null, + "status": null, + "sampleTestCase": "[\"adc\",\"wzy\",\"abc\"]", + "metaData": "{\n \"name\": \"oddString\",\n \"params\": [\n {\n \"name\": \"words\",\n \"type\": \"string[]\"\n }\n ],\n \"return\": {\n \"type\": \"string\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[\"adc\",\"wzy\",\"abc\"]\n[\"aaa\",\"bob\",\"ccc\",\"ddd\"]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/total-cost-to-hire-k-workers.json b/leetcode-cn/originData/total-cost-to-hire-k-workers.json new file mode 100644 index 00000000..0a3c79e6 --- /dev/null +++ b/leetcode-cn/originData/total-cost-to-hire-k-workers.json @@ -0,0 +1,190 @@ +{ + "data": { + "question": { + "questionId": "2553", + "questionFrontendId": "2462", + "categoryTitle": "Algorithms", + "boundTopicId": 1946378, + "title": "Total Cost to Hire K Workers", + "titleSlug": "total-cost-to-hire-k-workers", + "content": "

You are given a 0-indexed integer array costs where costs[i] is the cost of hiring the ith worker.

\n\n

You are also given two integers k and candidates. We want to hire exactly k workers according to the following rules:

\n\n
    \n\t
  • You will run k sessions and hire exactly one worker in each session.
  • \n\t
  • In each hiring session, choose the worker with the lowest cost from either the first candidates workers or the last candidates workers. Break the tie by the smallest index.\n\t
      \n\t\t
    • For example, if costs = [3,2,7,7,1,2] and candidates = 2, then in the first hiring session, we will choose the 4th worker because they have the lowest cost [3,2,7,7,1,2].
    • \n\t\t
    • In the second hiring session, we will choose 1st worker because they have the same lowest cost as 4th worker but they have the smallest index [3,2,7,7,2]. Please note that the indexing may be changed in the process.
    • \n\t
    \n\t
  • \n\t
  • If there are fewer than candidates workers remaining, choose the worker with the lowest cost among them. Break the tie by the smallest index.
  • \n\t
  • A worker can only be chosen once.
  • \n
\n\n

Return the total cost to hire exactly k workers.

\n\n

 

\n

Example 1:

\n\n
\nInput: costs = [17,12,10,2,7,2,11,20,8], k = 3, candidates = 4\nOutput: 11\nExplanation: We hire 3 workers in total. The total cost is initially 0.\n- In the first hiring round we choose the worker from [17,12,10,2,7,2,11,20,8]. The lowest cost is 2, and we break the tie by the smallest index, which is 3. The total cost = 0 + 2 = 2.\n- In the second hiring round we choose the worker from [17,12,10,7,2,11,20,8]. The lowest cost is 2 (index 4). The total cost = 2 + 2 = 4.\n- In the third hiring round we choose the worker from [17,12,10,7,11,20,8]. The lowest cost is 7 (index 3). The total cost = 4 + 7 = 11. Notice that the worker with index 3 was common in the first and last four workers.\nThe total hiring cost is 11.\n
\n\n

Example 2:

\n\n
\nInput: costs = [1,2,4,1], k = 3, candidates = 3\nOutput: 4\nExplanation: We hire 3 workers in total. The total cost is initially 0.\n- In the first hiring round we choose the worker from [1,2,4,1]. The lowest cost is 1, and we break the tie by the smallest index, which is 0. The total cost = 0 + 1 = 1. Notice that workers with index 1 and 2 are common in the first and last 3 workers.\n- In the second hiring round we choose the worker from [2,4,1]. The lowest cost is 1 (index 2). The total cost = 1 + 1 = 2.\n- In the third hiring round there are less than three candidates. We choose the worker from the remaining workers [2,4]. The lowest cost is 2 (index 0). The total cost = 2 + 2 = 4.\nThe total hiring cost is 4.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= costs.length <= 105
  • \n\t
  • 1 <= costs[i] <= 105
  • \n\t
  • 1 <= k, candidates <= costs.length
  • \n
\n", + "translatedTitle": "雇佣 K 位工人的总代价", + "translatedContent": "

给你一个下标从 0 开始的整数数组 costs ,其中 costs[i] 是雇佣第 i 位工人的代价。

\n\n

同时给你两个整数 k 和 candidates 。我们想根据以下规则恰好雇佣 k 位工人:

\n\n
    \n\t
  • 总共进行 k 轮雇佣,且每一轮恰好雇佣一位工人。
  • \n\t
  • 在每一轮雇佣中,从最前面 candidates 和最后面 candidates 人中选出代价最小的一位工人,如果有多位代价相同且最小的工人,选择下标更小的一位工人。\n\t
      \n\t\t
    • 比方说,costs = [3,2,7,7,1,2] 且 candidates = 2 ,第一轮雇佣中,我们选择第 4 位工人,因为他的代价最小 [3,2,7,7,1,2] 。
    • \n\t\t
    • 第二轮雇佣,我们选择第 1 位工人,因为他们的代价与第 4 位工人一样都是最小代价,而且下标更小,[3,2,7,7,2] 。注意每一轮雇佣后,剩余工人的下标可能会发生变化。
    • \n\t
    \n\t
  • \n\t
  • 如果剩余员工数目不足 candidates 人,那么下一轮雇佣他们中代价最小的一人,如果有多位代价相同且最小的工人,选择下标更小的一位工人。
  • \n\t
  • 一位工人只能被选择一次。
  • \n
\n\n

返回雇佣恰好 k 位工人的总代价。

\n\n

 

\n\n

示例 1:

\n\n
输入:costs = [17,12,10,2,7,2,11,20,8], k = 3, candidates = 4\n输出:11\n解释:我们总共雇佣 3 位工人。总代价一开始为 0 。\n- 第一轮雇佣,我们从 [17,12,10,2,7,2,11,20,8] 中选择。最小代价是 2 ,有两位工人,我们选择下标更小的一位工人,即第 3 位工人。总代价是 0 + 2 = 2 。\n- 第二轮雇佣,我们从 [17,12,10,7,2,11,20,8] 中选择。最小代价是 2 ,下标为 4 ,总代价是 2 + 2 = 4 。\n- 第三轮雇佣,我们从 [17,12,10,7,11,20,8] 中选择,最小代价是 7 ,下标为 3 ,总代价是 4 + 7 = 11 。注意下标为 3 的工人同时在最前面和最后面 4 位工人中。\n总雇佣代价是 11 。\n
\n\n

示例 2:

\n\n
输入:costs = [1,2,4,1], k = 3, candidates = 3\n输出:4\n解释:我们总共雇佣 3 位工人。总代价一开始为 0 。\n- 第一轮雇佣,我们从 [1,2,4,1] 中选择。最小代价为 1 ,有两位工人,我们选择下标更小的一位工人,即第 0 位工人,总代价是 0 + 1 = 1 。注意,下标为 1 和 2 的工人同时在最前面和最后面 3 位工人中。\n- 第二轮雇佣,我们从 [2,4,1] 中选择。最小代价为 1 ,下标为 2 ,总代价是 1 + 1 = 2 。\n- 第三轮雇佣,少于 3 位工人,我们从剩余工人 [2,4] 中选择。最小代价是 2 ,下标为 0 。总代价为 2 + 2 = 4 。\n总雇佣代价是 4 。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= costs.length <= 105
  • \n\t
  • 1 <= costs[i] <= 105
  • \n\t
  • 1 <= k, candidates <= costs.length
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 14, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": false, \"java\": false, \"python\": false, \"python3\": false, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"dart\": false}", + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": "数组", + "__typename": "TopicTagNode" + }, + { + "name": "Two Pointers", + "slug": "two-pointers", + "translatedName": "双指针", + "__typename": "TopicTagNode" + }, + { + "name": "Simulation", + "slug": "simulation", + "translatedName": "模拟", + "__typename": "TopicTagNode" + }, + { + "name": "Heap (Priority Queue)", + "slug": "heap-priority-queue", + "translatedName": "堆(优先队列)", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n long long totalCost(vector& costs, int k, int candidates) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public long totalCost(int[] costs, int k, int candidates) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def totalCost(self, costs, k, candidates):\n \"\"\"\n :type costs: List[int]\n :type k: int\n :type candidates: int\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def totalCost(self, costs: List[int], k: int, candidates: int) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "long long totalCost(int* costs, int costsSize, int k, int candidates){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public long TotalCost(int[] costs, int k, int candidates) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} costs\n * @param {number} k\n * @param {number} candidates\n * @return {number}\n */\nvar totalCost = function(costs, k, candidates) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} costs\n# @param {Integer} k\n# @param {Integer} candidates\n# @return {Integer}\ndef total_cost(costs, k, candidates)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func totalCost(_ costs: [Int], _ k: Int, _ candidates: Int) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func totalCost(costs []int, k int, candidates int) int64 {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def totalCost(costs: Array[Int], k: Int, candidates: Int): Long = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun totalCost(costs: IntArray, k: Int, candidates: Int): Long {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn total_cost(costs: Vec, k: i32, candidates: i32) -> i64 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[] $costs\n * @param Integer $k\n * @param Integer $candidates\n * @return Integer\n */\n function totalCost($costs, $k, $candidates) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function totalCost(costs: number[], k: number, candidates: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (total-cost costs k candidates)\n (-> (listof exact-integer?) exact-integer? exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec total_cost(Costs :: [integer()], K :: integer(), Candidates :: integer()) -> integer().\ntotal_cost(Costs, K, Candidates) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec total_cost(costs :: [integer], k :: integer, candidates :: integer) :: integer\n def total_cost(costs, k, candidates) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int totalCost(List costs, int k, int candidates) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"4.3K\", \"totalSubmission\": \"11.9K\", \"totalAcceptedRaw\": 4268, \"totalSubmissionRaw\": 11913, \"acRate\": \"35.8%\"}", + "hints": [ + "Maintain two minheaps: one for the left and one for the right.", + "Compare the top element from two heaps and remove the appropriate one.", + "Add a new element to the heap and maintain its size as k." + ], + "solution": null, + "status": null, + "sampleTestCase": "[17,12,10,2,7,2,11,20,8]\n3\n4", + "metaData": "{\n \"name\": \"totalCost\",\n \"params\": [\n {\n \"name\": \"costs\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"k\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"candidates\"\n }\n ],\n \"return\": {\n \"type\": \"long\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[17,12,10,2,7,2,11,20,8]\n3\n4\n[1,2,4,1]\n3\n3", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/problem (Chinese)/从房屋收集雨水需要的最少水桶数 [minimum-number-of-food-buckets-to-feed-the-hamsters].html b/leetcode-cn/problem (Chinese)/从房屋收集雨水需要的最少水桶数 [minimum-number-of-food-buckets-to-feed-the-hamsters].html new file mode 100644 index 00000000..a00090ab --- /dev/null +++ b/leetcode-cn/problem (Chinese)/从房屋收集雨水需要的最少水桶数 [minimum-number-of-food-buckets-to-feed-the-hamsters].html @@ -0,0 +1,65 @@ +

给你一个下标从 0 开始的字符串 street 。street 中每个字符要么是表示房屋的 'H' ,要么是表示空位的 '.' 。

+ +

你可以在 空位 放置水桶,从相邻的房屋收集雨水。位置在 i - 1 或者 i + 1 的水桶可以收集位置为 i 处房屋的雨水。一个水桶如果相邻两个位置都有房屋,那么它可以收集 两个 房屋的雨水。

+ +

在确保 每个 房屋旁边都 至少 有一个水桶的前提下,请你返回需要的 最少 水桶数。如果无解请返回 -1 。

+ +

 

+ +

示例 1:

+ +
输入:street = "H..H"
+输出:2
+解释:
+我们可以在下标为 1 和 2 处放水桶。
+"H..H" -> "HBBH"('B' 表示放置水桶)。
+下标为 0 处的房屋右边有水桶,下标为 3 处的房屋左边有水桶。
+所以每个房屋旁边都至少有一个水桶收集雨水。
+
+ +

示例 2:

+ +
输入:street = ".H.H."
+输出:1
+解释:
+我们可以在下标为 2 处放置一个水桶。
+".H.H." -> ".HBH."('B' 表示放置水桶)。
+下标为 1 处的房屋右边有水桶,下标为 3 处的房屋左边有水桶。
+所以每个房屋旁边都至少有一个水桶收集雨水。
+
+ +

示例 3:

+ +
输入:street = ".HHH."
+输出:-1
+解释:
+没有空位可以放置水桶收集下标为 2 处的雨水。
+所以没有办法收集所有房屋的雨水。
+
+ +

示例 4:

+ +
输入:street = "H"
+输出:-1
+解释:
+没有空位放置水桶。
+所以没有办法收集所有房屋的雨水。
+
+ +

示例 5:

+ +
输入:street = "."
+输出:0
+解释:
+没有房屋需要收集雨水。
+所以需要 0 个水桶。
+
+ +

 

+ +

提示:

+ +
    +
  • 1 <= street.length <= 105
  • +
  • street[i] 要么是 'H' ,要么是 '.'
  • +
diff --git a/leetcode-cn/problem (Chinese)/可被三整除的偶数的平均值 [average-value-of-even-numbers-that-are-divisible-by-three].html b/leetcode-cn/problem (Chinese)/可被三整除的偶数的平均值 [average-value-of-even-numbers-that-are-divisible-by-three].html new file mode 100644 index 00000000..d01a97a1 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/可被三整除的偶数的平均值 [average-value-of-even-numbers-that-are-divisible-by-three].html @@ -0,0 +1,30 @@ +

给你一个由正整数组成的整数数组 nums ,返回其中可被 3 整除的所有偶数的平均值。

+ +

注意:n 个元素的平均值等于 n 个元素 求和 再除以 n ,结果 向下取整 到最接近的整数。

+ +

 

+ +

示例 1:

+ +
+输入:nums = [1,3,6,10,12,15]
+输出:9
+解释:6 和 12 是可以被 3 整除的偶数。(6 + 12) / 2 = 9 。
+
+ +

示例 2:

+ +
+输入:nums = [1,2,4,7,10]
+输出:0
+解释:不存在满足题目要求的整数,所以返回 0 。
+
+ +

 

+ +

提示:

+ +
    +
  • 1 <= nums.length <= 1000
  • +
  • 1 <= nums[i] <= 1000
  • +
diff --git a/leetcode-cn/problem (Chinese)/对数组执行操作 [apply-operations-to-an-array].html b/leetcode-cn/problem (Chinese)/对数组执行操作 [apply-operations-to-an-array].html new file mode 100644 index 00000000..ead0c861 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/对数组执行操作 [apply-operations-to-an-array].html @@ -0,0 +1,50 @@ +

给你一个下标从 0 开始的数组 nums ,数组大小为 n ,且由 非负 整数组成。

+ +

你需要对数组执行 n - 1 步操作,其中第 i 步操作(从 0 开始计数)要求对 nums 中第 i 个元素执行下述指令:

+ +
    +
  • 如果 nums[i] == nums[i + 1] ,则 nums[i] 的值变成原来的 2 倍,nums[i + 1] 的值变成 0 。否则,跳过这步操作。
  • +
+ +

在执行完 全部 操作后,将所有 0 移动 到数组的 末尾

+ +
    +
  • 例如,数组 [1,0,2,0,0,1] 将所有 0 移动到末尾后变为 [1,2,1,0,0,0]
  • +
+ +

返回结果数组。

+ +

注意 操作应当 依次有序 执行,而不是一次性全部执行。

+ +

 

+ +

示例 1:

+ +
+输入:nums = [1,2,2,1,1,0]
+输出:[1,4,2,0,0,0]
+解释:执行以下操作:
+- i = 0: nums[0] 和 nums[1] 不相等,跳过这步操作。
+- i = 1: nums[1] 和 nums[2] 相等,nums[1] 的值变成原来的 2 倍,nums[2] 的值变成 0 。数组变成 [1,4,0,1,1,0] 。
+- i = 2: nums[2] 和 nums[3] 不相等,所以跳过这步操作。
+- i = 3: nums[3] 和 nums[4] 相等,nums[3] 的值变成原来的 2 倍,nums[4] 的值变成 0 。数组变成 [1,4,0,2,0,0] 。
+- i = 4: nums[4] 和 nums[5] 相等,nums[4] 的值变成原来的 2 倍,nums[5] 的值变成 0 。数组变成 [1,4,0,2,0,0] 。
+执行完所有操作后,将 0 全部移动到数组末尾,得到结果数组 [1,4,2,0,0,0] 。
+
+ +

示例 2:

+ +
+输入:nums = [0,1]
+输出:[1,0]
+解释:无法执行任何操作,只需要将 0 移动到末尾。
+
+ +

 

+ +

提示:

+ +
    +
  • 2 <= nums.length <= 2000
  • +
  • 0 <= nums[i] <= 1000
  • +
diff --git a/leetcode-cn/problem (Chinese)/差值数组不同的字符串 [odd-string-difference].html b/leetcode-cn/problem (Chinese)/差值数组不同的字符串 [odd-string-difference].html new file mode 100644 index 00000000..9a665041 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/差值数组不同的字符串 [odd-string-difference].html @@ -0,0 +1,44 @@ +

给你一个字符串数组 words ,每一个字符串长度都相同,令所有字符串的长度都为 n 。

+ +

每个字符串 words[i] 可以被转化为一个长度为 n - 1 的 差值整数数组 difference[i] ,其中对于 0 <= j <= n - 2 有 difference[i][j] = words[i][j+1] - words[i][j] 。注意两个字母的差值定义为它们在字母表中 位置 之差,也就是说 'a' 的位置是 0 ,'b' 的位置是 1 ,'z' 的位置是 25 。

+ +
    +
  • 比方说,字符串 "acb" 的差值整数数组是 [2 - 0, 1 - 2] = [2, -1] 。
  • +
+ +

words 中所有字符串 除了一个字符串以外 ,其他字符串的差值整数数组都相同。你需要找到那个不同的字符串。

+ +

请你返回 words中 差值整数数组 不同的字符串。

+ +

 

+ +

示例 1:

+ +
+输入:words = ["adc","wzy","abc"]
+输出:"abc"
+解释:
+- "adc" 的差值整数数组是 [3 - 0, 2 - 3] = [3, -1] 。
+- "wzy" 的差值整数数组是 [25 - 22, 24 - 25]= [3, -1] 。
+- "abc" 的差值整数数组是 [1 - 0, 2 - 1] = [1, 1] 。
+不同的数组是 [1, 1],所以返回对应的字符串,"abc"。
+
+ +

示例 2:

+ +
+输入:words = ["aaa","bob","ccc","ddd"]
+输出:"bob"
+解释:除了 "bob" 的差值整数数组是 [13, -13] 以外,其他字符串的差值整数数组都是 [0, 0] 。
+
+ +

 

+ +

提示:

+ +
    +
  • 3 <= words.length <= 100
  • +
  • n == words[i].length
  • +
  • 2 <= n <= 20
  • +
  • words[i] 只含有小写英文字母。
  • +
diff --git a/leetcode-cn/problem (Chinese)/摧毁一系列目标 [destroy-sequential-targets].html b/leetcode-cn/problem (Chinese)/摧毁一系列目标 [destroy-sequential-targets].html new file mode 100644 index 00000000..6da0ef8f --- /dev/null +++ b/leetcode-cn/problem (Chinese)/摧毁一系列目标 [destroy-sequential-targets].html @@ -0,0 +1,42 @@ +

给你一个下标从 0 开始的数组 nums ,它包含若干正整数,表示数轴上你需要摧毁的目标所在的位置。同时给你一个整数 space 。

+ +

你有一台机器可以摧毁目标。给机器 输入 nums[i] ,这台机器会摧毁所有位置在 nums[i] + c * space 的目标,其中 c 是任意非负整数。你想摧毁 nums 中 尽可能多 的目标。

+ +

请你返回在摧毁数目最多的前提下,nums[i] 的 最小值 。

+ +

 

+ +

示例 1:

+ +
输入:nums = [3,7,8,1,1,5], space = 2
+输出:1
+解释:如果我们输入 nums[3] ,我们可以摧毁位于 1,3,5,7,9,... 这些位置的目标。
+这种情况下, 我们总共可以摧毁 5 个目标(除了 nums[2])。
+没有办法摧毁多于 5 个目标,所以我们返回 nums[3] 。
+
+ +

示例 2:

+ +
输入:nums = [1,3,5,2,4,6], space = 2
+输出:1
+解释:输入 nums[0] 或者 nums[3] 都会摧毁 3 个目标。
+没有办法摧毁多于 3 个目标。
+由于 nums[0] 是最小的可以摧毁 3 个目标的整数,所以我们返回 1 。
+
+ +

示例 3:

+ +
输入:nums = [6,2,5], space = 100
+输出:2
+解释:无论我们输入哪个数字,都只能摧毁 1 个目标。输入的最小整数是 nums[1] 。
+
+ +

 

+ +

提示:

+ +
    +
  • 1 <= nums.length <= 105
  • +
  • 1 <= nums[i] <= 109
  • +
  • 1 <= space <= 109
  • +
diff --git a/leetcode-cn/problem (Chinese)/最小移动总距离 [minimum-total-distance-traveled].html b/leetcode-cn/problem (Chinese)/最小移动总距离 [minimum-total-distance-traveled].html new file mode 100644 index 00000000..e07e8c89 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/最小移动总距离 [minimum-total-distance-traveled].html @@ -0,0 +1,64 @@ +

X 轴上有一些机器人和工厂。给你一个整数数组 robot ,其中 robot[i] 是第 i 个机器人的位置。再给你一个二维整数数组 factory ,其中 factory[j] = [positionj, limitj] ,表示第 j 个工厂的位置在 positionj ,且第 j 个工厂最多可以修理 limitj 个机器人。

+ +

每个机器人所在的位置 互不相同 。每个工厂所在的位置也 互不相同 。注意一个机器人可能一开始跟一个工厂在 相同的位置 。

+ +

所有机器人一开始都是坏的,他们会沿着设定的方向一直移动。设定的方向要么是 X 轴的正方向,要么是 X 轴的负方向。当一个机器人经过一个没达到上限的工厂时,这个工厂会维修这个机器人,且机器人停止移动。

+ +

任何时刻,你都可以设置 部分 机器人的移动方向。你的目标是最小化所有机器人总的移动距离。

+ +

请你返回所有机器人移动的最小总距离。测试数据保证所有机器人都可以被维修。

+ +

注意:

+ +
    +
  • 所有机器人移动速度相同。
  • +
  • 如果两个机器人移动方向相同,它们永远不会碰撞。
  • +
  • 如果两个机器人迎面相遇,它们也不会碰撞,它们彼此之间会擦肩而过。
  • +
  • 如果一个机器人经过了一个已经达到上限的工厂,机器人会当作工厂不存在,继续移动。
  • +
  • 机器人从位置 x 到位置 y 的移动距离为 |y - x| 。
  • +
+ +

 

+ +

示例 1:

+ +

+ +
+输入:robot = [0,4,6], factory = [[2,2],[6,2]]
+输出:4
+解释:如上图所示:
+- 第一个机器人从位置 0 沿着正方向移动,在第一个工厂处维修。
+- 第二个机器人从位置 4 沿着负方向移动,在第一个工厂处维修。
+- 第三个机器人在位置 6 被第二个工厂维修,它不需要移动。
+第一个工厂的维修上限是 2 ,它维修了 2 个机器人。
+第二个工厂的维修上限是 2 ,它维修了 1 个机器人。
+总移动距离是 |2 - 0| + |2 - 4| + |6 - 6| = 4 。没有办法得到比 4 更少的总移动距离。
+
+ +

示例 2:

+ +

+ +
+输入:robot = [1,-1], factory = [[-2,1],[2,1]]
+输出:2
+解释:如上图所示:
+- 第一个机器人从位置 1 沿着正方向移动,在第二个工厂处维修。
+- 第二个机器人在位置 -1 沿着负方向移动,在第一个工厂处维修。
+第一个工厂的维修上限是 1 ,它维修了 1 个机器人。
+第二个工厂的维修上限是 1 ,它维修了 1 个机器人。
+总移动距离是 |2 - 1| + |(-2) - (-1)| = 2 。没有办法得到比 2 更少的总移动距离。
+
+ +

 

+ +

提示:

+ +
    +
  • 1 <= robot.length, factory.length <= 100
  • +
  • factory[j].length == 2
  • +
  • -109 <= robot[i], positionj <= 109
  • +
  • 0 <= limitj <= robot.length
  • +
  • 测试数据保证所有机器人都可以被维修。
  • +
diff --git a/leetcode-cn/problem (Chinese)/最流行的视频创作者 [most-popular-video-creator].html b/leetcode-cn/problem (Chinese)/最流行的视频创作者 [most-popular-video-creator].html new file mode 100644 index 00000000..2158d73f --- /dev/null +++ b/leetcode-cn/problem (Chinese)/最流行的视频创作者 [most-popular-video-creator].html @@ -0,0 +1,48 @@ +

给你两个字符串数组 creatorsids ,和一个整数数组 views ,所有数组的长度都是 n 。平台上第 i 个视频者是 creator[i] ,视频分配的 id 是 ids[i] ,且播放量为 views[i]

+ +

视频创作者的 流行度 是该创作者的 所有 视频的播放量的 总和 。请找出流行度 最高 创作者以及该创作者播放量 最大 的视频的 id 。

+ +
    +
  • 如果存在多个创作者流行度都最高,则需要找出所有符合条件的创作者。
  • +
  • 如果某个创作者存在多个播放量最高的视频,则只需要找出字典序最小的 id
  • +
+ +

返回一个二维字符串数组 answer ,其中 answer[i] = [creatori, idi] 表示 creatori 的流行度 最高 且其最流行的视频 id 是 idi ,可以按任何顺序返回该结果

+ +

 

+ +

示例 1:

+ +
+输入:creators = ["alice","bob","alice","chris"], ids = ["one","two","three","four"], views = [5,10,5,4]
+输出:[["alice","one"],["bob","two"]]
+解释:
+alice 的流行度是 5 + 5 = 10 。
+bob 的流行度是 10 。
+chris 的流行度是 4 。
+alice 和 bob 是流行度最高的创作者。
+bob 播放量最高的视频 id 为 "two" 。
+alice 播放量最高的视频 id 是 "one" 和 "three" 。由于 "one" 的字典序比 "three" 更小,所以结果中返回的 id 是 "one" 。
+
+ +

示例 2:

+ +
+输入:creators = ["alice","alice","alice"], ids = ["a","b","c"], views = [1,2,2]
+输出:[["alice","b"]]
+解释:
+id 为 "b" 和 "c" 的视频都满足播放量最高的条件。
+由于 "b" 的字典序比 "c" 更小,所以结果中返回的 id 是 "b" 。
+
+ +

 

+ +

提示:

+ +
    +
  • n == creators.length == ids.length == views.length
  • +
  • 1 <= n <= 105
  • +
  • 1 <= creators[i].length, ids[i].length <= 5
  • +
  • creators[i]ids[i] 仅由小写英文字母组成
  • +
  • 0 <= views[i] <= 105
  • +
diff --git a/leetcode-cn/problem (Chinese)/移除子树后的二叉树高度 [height-of-binary-tree-after-subtree-removal-queries].html b/leetcode-cn/problem (Chinese)/移除子树后的二叉树高度 [height-of-binary-tree-after-subtree-removal-queries].html new file mode 100644 index 00000000..8c872b44 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/移除子树后的二叉树高度 [height-of-binary-tree-after-subtree-removal-queries].html @@ -0,0 +1,58 @@ +

给你一棵 二叉树 的根节点 root ,树中有 n 个节点。每个节点都可以被分配一个从 1n 且互不相同的值。另给你一个长度为 m 的数组 queries

+ +

你必须在树上执行 m独立 的查询,其中第 i 个查询你需要执行以下操作:

+ +
    +
  • 从树中 移除queries[i] 的值作为根节点的子树。题目所用测试用例保证 queries[i] 等于根节点的值。
  • +
+ +

返回一个长度为 m 的数组 answer ,其中 answer[i] 是执行第 i 个查询后树的高度。

+ +

注意:

+ +
    +
  • 查询之间是独立的,所以在每个查询执行后,树会回到其 初始 状态。
  • +
  • 树的高度是从根到树中某个节点的 最长简单路径中的边数
  • +
+ +

 

+ +

示例 1:

+ +

+ +
+输入:root = [1,3,4,2,null,6,5,null,null,null,null,null,7], queries = [4]
+输出:[2]
+解释:上图展示了从树中移除以 4 为根节点的子树。
+树的高度是 2(路径为 1 -> 3 -> 2)。
+
+ +

示例 2:

+ +

+ +
+输入:root = [5,8,9,2,1,3,7,4,6], queries = [3,2,4,8]
+输出:[3,2,3,2]
+解释:执行下述查询:
+- 移除以 3 为根节点的子树。树的高度变为 3(路径为 5 -> 8 -> 2 -> 4)。
+- 移除以 2 为根节点的子树。树的高度变为 2(路径为 5 -> 8 -> 1)。
+- 移除以 4 为根节点的子树。树的高度变为 3(路径为 5 -> 8 -> 2 -> 6)。
+- 移除以 8 为根节点的子树。树的高度变为 2(路径为 5 -> 9 -> 3)。
+
+ +

 

+ +

提示:

+ +
    +
  • 树中节点的数目是 n
  • +
  • 2 <= n <= 105
  • +
  • 1 <= Node.val <= n
  • +
  • 树中的所有值 互不相同
  • +
  • m == queries.length
  • +
  • 1 <= m <= min(n, 104)
  • +
  • 1 <= queries[i] <= n
  • +
  • queries[i] != root.val
  • +
diff --git a/leetcode-cn/problem (Chinese)/美丽整数的最小增量 [minimum-addition-to-make-integer-beautiful].html b/leetcode-cn/problem (Chinese)/美丽整数的最小增量 [minimum-addition-to-make-integer-beautiful].html new file mode 100644 index 00000000..f48ec4e2 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/美丽整数的最小增量 [minimum-addition-to-make-integer-beautiful].html @@ -0,0 +1,37 @@ +

给你两个正整数 ntarget

+ +

如果某个整数每一位上的数字相加小于或等于 target ,则认为这个整数是一个 美丽整数

+ +

找出并返回满足 n + x美丽整数 的最小非负整数 x 。生成的输入保证总可以使 n 变成一个美丽整数。

+ +

 

+ +

示例 1:

+ +
输入:n = 16, target = 6
+输出:4
+解释:最初,n 是 16 ,且其每一位数字的和是 1 + 6 = 7 。在加 4 之后,n 变为 20 且每一位数字的和变成 2 + 0 = 2 。可以证明无法加上一个小于 4 的非负整数使 n 变成一个美丽整数。
+
+ +

示例 2:

+ +
输入:n = 467, target = 6
+输出:33
+解释:最初,n 是 467 ,且其每一位数字的和是 4 + 6 + 7 = 17 。在加 33 之后,n 变为 500 且每一位数字的和变成 5 + 0 + 0 = 5 。可以证明无法加上一个小于 33 的非负整数使 n 变成一个美丽整数。
+ +

示例 3:

+ +
输入:n = 1, target = 1
+输出:0
+解释:最初,n 是 1 ,且其每一位数字的和是 1 ,已经小于等于 target 。
+
+ +

 

+ +

提示:

+ +
    +
  • 1 <= n <= 1012
  • +
  • 1 <= target <= 150
  • +
  • 生成的输入保证总可以使 n 变成一个美丽整数。
  • +
diff --git a/leetcode-cn/problem (Chinese)/长度为 K 子数组中的最大和 [maximum-sum-of-distinct-subarrays-with-length-k].html b/leetcode-cn/problem (Chinese)/长度为 K 子数组中的最大和 [maximum-sum-of-distinct-subarrays-with-length-k].html new file mode 100644 index 00000000..643bf0fd --- /dev/null +++ b/leetcode-cn/problem (Chinese)/长度为 K 子数组中的最大和 [maximum-sum-of-distinct-subarrays-with-length-k].html @@ -0,0 +1,43 @@ +

给你一个整数数组 nums 和一个整数 k 。请你从 nums 中满足下述条件的全部子数组中找出最大子数组和:

+ +
    +
  • 子数组的长度是 k,且
  • +
  • 子数组中的所有元素 各不相同 。
  • +
+ +

返回满足题面要求的最大子数组和。如果不存在子数组满足这些条件,返回 0

+ +

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

+ +

 

+ +

示例 1:

+ +
输入:nums = [1,5,4,2,9,9,9], k = 3
+输出:15
+解释:nums 中长度为 3 的子数组是:
+- [1,5,4] 满足全部条件,和为 10 。
+- [5,4,2] 满足全部条件,和为 11 。
+- [4,2,9] 满足全部条件,和为 15 。
+- [2,9,9] 不满足全部条件,因为元素 9 出现重复。
+- [9,9,9] 不满足全部条件,因为元素 9 出现重复。
+因为 15 是满足全部条件的所有子数组中的最大子数组和,所以返回 15 。
+
+ +

示例 2:

+ +
输入:nums = [4,4,4], k = 3
+输出:0
+解释:nums 中长度为 3 的子数组是:
+- [4,4,4] 不满足全部条件,因为元素 4 出现重复。
+因为不存在满足全部条件的子数组,所以返回 0 。
+
+ +

 

+ +

提示:

+ +
    +
  • 1 <= k <= nums.length <= 105
  • +
  • 1 <= nums[i] <= 105
  • +
diff --git a/leetcode-cn/problem (Chinese)/雇佣 K 位工人的总代价 [total-cost-to-hire-k-workers].html b/leetcode-cn/problem (Chinese)/雇佣 K 位工人的总代价 [total-cost-to-hire-k-workers].html new file mode 100644 index 00000000..c9414a2a --- /dev/null +++ b/leetcode-cn/problem (Chinese)/雇佣 K 位工人的总代价 [total-cost-to-hire-k-workers].html @@ -0,0 +1,51 @@ +

给你一个下标从 0 开始的整数数组 costs ,其中 costs[i] 是雇佣第 i 位工人的代价。

+ +

同时给你两个整数 k 和 candidates 。我们想根据以下规则恰好雇佣 k 位工人:

+ +
    +
  • 总共进行 k 轮雇佣,且每一轮恰好雇佣一位工人。
  • +
  • 在每一轮雇佣中,从最前面 candidates 和最后面 candidates 人中选出代价最小的一位工人,如果有多位代价相同且最小的工人,选择下标更小的一位工人。 +
      +
    • 比方说,costs = [3,2,7,7,1,2] 且 candidates = 2 ,第一轮雇佣中,我们选择第 4 位工人,因为他的代价最小 [3,2,7,7,1,2] 。
    • +
    • 第二轮雇佣,我们选择第 1 位工人,因为他们的代价与第 4 位工人一样都是最小代价,而且下标更小,[3,2,7,7,2] 。注意每一轮雇佣后,剩余工人的下标可能会发生变化。
    • +
    +
  • +
  • 如果剩余员工数目不足 candidates 人,那么下一轮雇佣他们中代价最小的一人,如果有多位代价相同且最小的工人,选择下标更小的一位工人。
  • +
  • 一位工人只能被选择一次。
  • +
+ +

返回雇佣恰好 k 位工人的总代价。

+ +

 

+ +

示例 1:

+ +
输入:costs = [17,12,10,2,7,2,11,20,8], k = 3, candidates = 4
+输出:11
+解释:我们总共雇佣 3 位工人。总代价一开始为 0 。
+- 第一轮雇佣,我们从 [17,12,10,2,7,2,11,20,8] 中选择。最小代价是 2 ,有两位工人,我们选择下标更小的一位工人,即第 3 位工人。总代价是 0 + 2 = 2 。
+- 第二轮雇佣,我们从 [17,12,10,7,2,11,20,8] 中选择。最小代价是 2 ,下标为 4 ,总代价是 2 + 2 = 4 。
+- 第三轮雇佣,我们从 [17,12,10,7,11,20,8] 中选择,最小代价是 7 ,下标为 3 ,总代价是 4 + 7 = 11 。注意下标为 3 的工人同时在最前面和最后面 4 位工人中。
+总雇佣代价是 11 。
+
+ +

示例 2:

+ +
输入:costs = [1,2,4,1], k = 3, candidates = 3
+输出:4
+解释:我们总共雇佣 3 位工人。总代价一开始为 0 。
+- 第一轮雇佣,我们从 [1,2,4,1] 中选择。最小代价为 1 ,有两位工人,我们选择下标更小的一位工人,即第 0 位工人,总代价是 0 + 1 = 1 。注意,下标为 1 和 2 的工人同时在最前面和最后面 3 位工人中。
+- 第二轮雇佣,我们从 [2,4,1] 中选择。最小代价为 1 ,下标为 2 ,总代价是 1 + 1 = 2 。
+- 第三轮雇佣,少于 3 位工人,我们从剩余工人 [2,4] 中选择。最小代价是 2 ,下标为 0 。总代价为 2 + 2 = 4 。
+总雇佣代价是 4 。
+
+ +

 

+ +

提示:

+ +
    +
  • 1 <= costs.length <= 105
  • +
  • 1 <= costs[i] <= 105
  • +
  • 1 <= k, candidates <= costs.length
  • +
diff --git a/leetcode-cn/problem (English)/从房屋收集雨水需要的最少水桶数(English) [minimum-number-of-food-buckets-to-feed-the-hamsters].html b/leetcode-cn/problem (English)/从房屋收集雨水需要的最少水桶数(English) [minimum-number-of-food-buckets-to-feed-the-hamsters].html new file mode 100644 index 00000000..005abb5c --- /dev/null +++ b/leetcode-cn/problem (English)/从房屋收集雨水需要的最少水桶数(English) [minimum-number-of-food-buckets-to-feed-the-hamsters].html @@ -0,0 +1,44 @@ +

You are given a 0-indexed string hamsters where hamsters[i] is either:

+ +
    +
  • 'H' indicating that there is a hamster at index i, or
  • +
  • '.' indicating that index i is empty.
  • +
+ +

You will add some number of food buckets at the empty indices in order to feed the hamsters. A hamster can be fed if there is at least one food bucket to its left or to its right. More formally, a hamster at index i can be fed if you place a food bucket at index i - 1 and/or at index i + 1.

+ +

Return the minimum number of food buckets you should place at empty indices to feed all the hamsters or -1 if it is impossible to feed all of them.

+ +

 

+

Example 1:

+ +
+Input: hamsters = "H..H"
+Output: 2
+Explanation: We place two food buckets at indices 1 and 2.
+It can be shown that if we place only one food bucket, one of the hamsters will not be fed.
+
+ +

Example 2:

+ +
+Input: hamsters = ".H.H."
+Output: 1
+Explanation: We place one food bucket at index 2.
+
+ +

Example 3:

+ +
+Input: hamsters = ".HHH."
+Output: -1
+Explanation: If we place a food bucket at every empty index as shown, the hamster at index 2 will not be able to eat.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= hamsters.length <= 105
  • +
  • hamsters[i] is either'H' or '.'.
  • +
diff --git a/leetcode-cn/problem (English)/可被三整除的偶数的平均值(English) [average-value-of-even-numbers-that-are-divisible-by-three].html b/leetcode-cn/problem (English)/可被三整除的偶数的平均值(English) [average-value-of-even-numbers-that-are-divisible-by-three].html new file mode 100644 index 00000000..a25d49f0 --- /dev/null +++ b/leetcode-cn/problem (English)/可被三整除的偶数的平均值(English) [average-value-of-even-numbers-that-are-divisible-by-three].html @@ -0,0 +1,28 @@ +

Given an integer array nums of positive integers, return the average value of all even integers that are divisible by 3.

+ +

Note that the average of n elements is the sum of the n elements divided by n and rounded down to the nearest integer.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,3,6,10,12,15]
+Output: 9
+Explanation: 6 and 12 are even numbers that are divisible by 3. (6 + 12) / 2 = 9.
+
+ +

Example 2:

+ +
+Input: nums = [1,2,4,7,10]
+Output: 0
+Explanation: There is no single number that satisfies the requirement, so return 0.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 1000
  • +
  • 1 <= nums[i] <= 1000
  • +
diff --git a/leetcode-cn/problem (English)/对数组执行操作(English) [apply-operations-to-an-array].html b/leetcode-cn/problem (English)/对数组执行操作(English) [apply-operations-to-an-array].html new file mode 100644 index 00000000..21443c21 --- /dev/null +++ b/leetcode-cn/problem (English)/对数组执行操作(English) [apply-operations-to-an-array].html @@ -0,0 +1,48 @@ +

You are given a 0-indexed array nums of size n consisting of non-negative integers.

+ +

You need to apply n - 1 operations to this array where, in the ith operation (0-indexed), you will apply the following on the ith element of nums:

+ +
    +
  • If nums[i] == nums[i + 1], then multiply nums[i] by 2 and set nums[i + 1] to 0. Otherwise, you skip this operation.
  • +
+ +

After performing all the operations, shift all the 0's to the end of the array.

+ +
    +
  • For example, the array [1,0,2,0,0,1] after shifting all its 0's to the end, is [1,2,1,0,0,0].
  • +
+ +

Return the resulting array.

+ +

Note that the operations are applied sequentially, not all at once.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,2,1,1,0]
+Output: [1,4,2,0,0,0]
+Explanation: We do the following operations:
+- i = 0: nums[0] and nums[1] are not equal, so we skip this operation.
+- i = 1: nums[1] and nums[2] are equal, we multiply nums[1] by 2 and change nums[2] to 0. The array becomes [1,4,0,1,1,0].
+- i = 2: nums[2] and nums[3] are not equal, so we skip this operation.
+- i = 3: nums[3] and nums[4] are equal, we multiply nums[3] by 2 and change nums[4] to 0. The array becomes [1,4,0,2,0,0].
+- i = 4: nums[4] and nums[5] are equal, we multiply nums[4] by 2 and change nums[5] to 0. The array becomes [1,4,0,2,0,0].
+After that, we shift the 0's to the end, which gives the array [1,4,2,0,0,0].
+
+ +

Example 2:

+ +
+Input: nums = [0,1]
+Output: [1,0]
+Explanation: No operation can be applied, we just shift the 0 to the end.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= nums.length <= 2000
  • +
  • 0 <= nums[i] <= 1000
  • +
diff --git a/leetcode-cn/problem (English)/差值数组不同的字符串(English) [odd-string-difference].html b/leetcode-cn/problem (English)/差值数组不同的字符串(English) [odd-string-difference].html new file mode 100644 index 00000000..95bb4a61 --- /dev/null +++ b/leetcode-cn/problem (English)/差值数组不同的字符串(English) [odd-string-difference].html @@ -0,0 +1,42 @@ +

You are given an array of equal-length strings words. Assume that the length of each string is n.

+ +

Each string words[i] can be converted into a difference integer array difference[i] of length n - 1 where difference[i][j] = words[i][j+1] - words[i][j] where 0 <= j <= n - 2. Note that the difference between two letters is the difference between their positions in the alphabet i.e. the position of 'a' is 0, 'b' is 1, and 'z' is 25.

+ +
    +
  • For example, for the string "acb", the difference integer array is [2 - 0, 1 - 2] = [2, -1].
  • +
+ +

All the strings in words have the same difference integer array, except one. You should find that string.

+ +

Return the string in words that has different difference integer array.

+ +

 

+

Example 1:

+ +
+Input: words = ["adc","wzy","abc"]
+Output: "abc"
+Explanation: 
+- The difference integer array of "adc" is [3 - 0, 2 - 3] = [3, -1].
+- The difference integer array of "wzy" is [25 - 22, 24 - 25]= [3, -1].
+- The difference integer array of "abc" is [1 - 0, 2 - 1] = [1, 1]. 
+The odd array out is [1, 1], so we return the corresponding string, "abc".
+
+ +

Example 2:

+ +
+Input: words = ["aaa","bob","ccc","ddd"]
+Output: "bob"
+Explanation: All the integer arrays are [0, 0] except for "bob", which corresponds to [13, -13].
+
+ +

 

+

Constraints:

+ +
    +
  • 3 <= words.length <= 100
  • +
  • n == words[i].length
  • +
  • 2 <= n <= 20
  • +
  • words[i] consists of lowercase English letters.
  • +
diff --git a/leetcode-cn/problem (English)/摧毁一系列目标(English) [destroy-sequential-targets].html b/leetcode-cn/problem (English)/摧毁一系列目标(English) [destroy-sequential-targets].html new file mode 100644 index 00000000..78e9e5f9 --- /dev/null +++ b/leetcode-cn/problem (English)/摧毁一系列目标(English) [destroy-sequential-targets].html @@ -0,0 +1,43 @@ +

You are given a 0-indexed array nums consisting of positive integers, representing targets on a number line. You are also given an integer space.

+ +

You have a machine which can destroy targets. Seeding the machine with some nums[i] allows it to destroy all targets with values that can be represented as nums[i] + c * space, where c is any non-negative integer. You want to destroy the maximum number of targets in nums.

+ +

Return the minimum value of nums[i] you can seed the machine with to destroy the maximum number of targets.

+ +

 

+

Example 1:

+ +
+Input: nums = [3,7,8,1,1,5], space = 2
+Output: 1
+Explanation: If we seed the machine with nums[3], then we destroy all targets equal to 1,3,5,7,9,... 
+In this case, we would destroy 5 total targets (all except for nums[2]). 
+It is impossible to destroy more than 5 targets, so we return nums[3].
+
+ +

Example 2:

+ +
+Input: nums = [1,3,5,2,4,6], space = 2
+Output: 1
+Explanation: Seeding the machine with nums[0], or nums[3] destroys 3 targets. 
+It is not possible to destroy more than 3 targets.
+Since nums[0] is the minimal integer that can destroy 3 targets, we return 1.
+
+ +

Example 3:

+ +
+Input: nums = [6,2,5], space = 100
+Output: 2
+Explanation: Whatever initial seed we select, we can only destroy 1 target. The minimal seed is nums[1].
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
  • +
  • 1 <= nums[i] <= 109
  • +
  • 1 <= space <= 109
  • +
diff --git a/leetcode-cn/problem (English)/最小移动总距离(English) [minimum-total-distance-traveled].html b/leetcode-cn/problem (English)/最小移动总距离(English) [minimum-total-distance-traveled].html new file mode 100644 index 00000000..29c30d8e --- /dev/null +++ b/leetcode-cn/problem (English)/最小移动总距离(English) [minimum-total-distance-traveled].html @@ -0,0 +1,58 @@ +

There are some robots and factories on the X-axis. You are given an integer array robot where robot[i] is the position of the ith robot. You are also given a 2D integer array factory where factory[j] = [positionj, limitj] indicates that positionj is the position of the jth factory and that the jth factory can repair at most limitj robots.

+ +

The positions of each robot are unique. The positions of each factory are also unique. Note that a robot can be in the same position as a factory initially.

+ +

All the robots are initially broken; they keep moving in one direction. The direction could be the negative or the positive direction of the X-axis. When a robot reaches a factory that did not reach its limit, the factory repairs the robot, and it stops moving.

+ +

At any moment, you can set the initial direction of moving for some robot. Your target is to minimize the total distance traveled by all the robots.

+ +

Return the minimum total distance traveled by all the robots. The test cases are generated such that all the robots can be repaired.

+ +

Note that

+ +
    +
  • All robots move at the same speed.
  • +
  • If two robots move in the same direction, they will never collide.
  • +
  • If two robots move in opposite directions and they meet at some point, they do not collide. They cross each other.
  • +
  • If a robot passes by a factory that reached its limits, it crosses it as if it does not exist.
  • +
  • If the robot moved from a position x to a position y, the distance it moved is |y - x|.
  • +
+ +

 

+

Example 1:

+ +
+Input: robot = [0,4,6], factory = [[2,2],[6,2]]
+Output: 4
+Explanation: As shown in the figure:
+- The first robot at position 0 moves in the positive direction. It will be repaired at the first factory.
+- The second robot at position 4 moves in the negative direction. It will be repaired at the first factory.
+- The third robot at position 6 will be repaired at the second factory. It does not need to move.
+The limit of the first factory is 2, and it fixed 2 robots.
+The limit of the second factory is 2, and it fixed 1 robot.
+The total distance is |2 - 0| + |2 - 4| + |6 - 6| = 4. It can be shown that we cannot achieve a better total distance than 4.
+
+ +

Example 2:

+ +
+Input: robot = [1,-1], factory = [[-2,1],[2,1]]
+Output: 2
+Explanation: As shown in the figure:
+- The first robot at position 1 moves in the positive direction. It will be repaired at the second factory.
+- The second robot at position -1 moves in the negative direction. It will be repaired at the first factory.
+The limit of the first factory is 1, and it fixed 1 robot.
+The limit of the second factory is 1, and it fixed 1 robot.
+The total distance is |2 - 1| + |(-2) - (-1)| = 2. It can be shown that we cannot achieve a better total distance than 2.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= robot.length, factory.length <= 100
  • +
  • factory[j].length == 2
  • +
  • -109 <= robot[i], positionj <= 109
  • +
  • 0 <= limitj <= robot.length
  • +
  • The input will be generated such that it is always possible to repair every robot.
  • +
diff --git a/leetcode-cn/problem (English)/最流行的视频创作者(English) [most-popular-video-creator].html b/leetcode-cn/problem (English)/最流行的视频创作者(English) [most-popular-video-creator].html new file mode 100644 index 00000000..6d8b567c --- /dev/null +++ b/leetcode-cn/problem (English)/最流行的视频创作者(English) [most-popular-video-creator].html @@ -0,0 +1,46 @@ +

You are given two string arrays creators and ids, and an integer array views, all of length n. The ith video on a platform was created by creator[i], has an id of ids[i], and has views[i] views.

+ +

The popularity of a creator is the sum of the number of views on all of the creator's videos. Find the creator with the highest popularity and the id of their most viewed video.

+ +
    +
  • If multiple creators have the highest popularity, find all of them.
  • +
  • If multiple videos have the highest view count for a creator, find the lexicographically smallest id.
  • +
+ +

Return a 2D array of strings answer where answer[i] = [creatori, idi] means that creatori has the highest popularity and idi is the id of their most popular video. The answer can be returned in any order.

+ +

 

+

Example 1:

+ +
+Input: creators = ["alice","bob","alice","chris"], ids = ["one","two","three","four"], views = [5,10,5,4]
+Output: [["alice","one"],["bob","two"]]
+Explanation:
+The popularity of alice is 5 + 5 = 10.
+The popularity of bob is 10.
+The popularity of chris is 4.
+alice and bob are the most popular creators.
+For bob, the video with the highest view count is "two".
+For alice, the videos with the highest view count are "one" and "three". Since "one" is lexicographically smaller than "three", it is included in the answer.
+
+ +

Example 2:

+ +
+Input: creators = ["alice","alice","alice"], ids = ["a","b","c"], views = [1,2,2]
+Output: [["alice","b"]]
+Explanation:
+The videos with id "b" and "c" have the highest view count.
+Since "b" is lexicographically smaller than "c", it is included in the answer.
+
+ +

 

+

Constraints:

+ +
    +
  • n == creators.length == ids.length == views.length
  • +
  • 1 <= n <= 105
  • +
  • 1 <= creators[i].length, ids[i].length <= 5
  • +
  • creators[i] and ids[i] consist only of lowercase English letters.
  • +
  • 0 <= views[i] <= 105
  • +
diff --git a/leetcode-cn/problem (English)/移除子树后的二叉树高度(English) [height-of-binary-tree-after-subtree-removal-queries].html b/leetcode-cn/problem (English)/移除子树后的二叉树高度(English) [height-of-binary-tree-after-subtree-removal-queries].html new file mode 100644 index 00000000..cc9b6fdb --- /dev/null +++ b/leetcode-cn/problem (English)/移除子树后的二叉树高度(English) [height-of-binary-tree-after-subtree-removal-queries].html @@ -0,0 +1,52 @@ +

You are given the root of a binary tree with n nodes. Each node is assigned a unique value from 1 to n. You are also given an array queries of size m.

+ +

You have to perform m independent queries on the tree where in the ith query you do the following:

+ +
    +
  • Remove the subtree rooted at the node with the value queries[i] from the tree. It is guaranteed that queries[i] will not be equal to the value of the root.
  • +
+ +

Return an array answer of size m where answer[i] is the height of the tree after performing the ith query.

+ +

Note:

+ +
    +
  • The queries are independent, so the tree returns to its initial state after each query.
  • +
  • The height of a tree is the number of edges in the longest simple path from the root to some node in the tree.
  • +
+ +

 

+

Example 1:

+ +
+Input: root = [1,3,4,2,null,6,5,null,null,null,null,null,7], queries = [4]
+Output: [2]
+Explanation: The diagram above shows the tree after removing the subtree rooted at node with value 4.
+The height of the tree is 2 (The path 1 -> 3 -> 2).
+
+ +

Example 2:

+ +
+Input: root = [5,8,9,2,1,3,7,4,6], queries = [3,2,4,8]
+Output: [3,2,3,2]
+Explanation: We have the following queries:
+- Removing the subtree rooted at node with value 3. The height of the tree becomes 3 (The path 5 -> 8 -> 2 -> 4).
+- Removing the subtree rooted at node with value 2. The height of the tree becomes 2 (The path 5 -> 8 -> 1).
+- Removing the subtree rooted at node with value 4. The height of the tree becomes 3 (The path 5 -> 8 -> 2 -> 6).
+- Removing the subtree rooted at node with value 8. The height of the tree becomes 2 (The path 5 -> 9 -> 3).
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree is n.
  • +
  • 2 <= n <= 105
  • +
  • 1 <= Node.val <= n
  • +
  • All the values in the tree are unique.
  • +
  • m == queries.length
  • +
  • 1 <= m <= min(n, 104)
  • +
  • 1 <= queries[i] <= n
  • +
  • queries[i] != root.val
  • +
diff --git a/leetcode-cn/problem (English)/美丽整数的最小增量(English) [minimum-addition-to-make-integer-beautiful].html b/leetcode-cn/problem (English)/美丽整数的最小增量(English) [minimum-addition-to-make-integer-beautiful].html new file mode 100644 index 00000000..4de6dbed --- /dev/null +++ b/leetcode-cn/problem (English)/美丽整数的最小增量(English) [minimum-addition-to-make-integer-beautiful].html @@ -0,0 +1,39 @@ +

You are given two positive integers n and target.

+ +

An integer is considered beautiful if the sum of its digits is less than or equal to target.

+ +

Return the minimum non-negative integer x such that n + x is beautiful. The input will be generated such that it is always possible to make n beautiful.

+ +

 

+

Example 1:

+ +
+Input: n = 16, target = 6
+Output: 4
+Explanation: Initially n is 16 and its digit sum is 1 + 6 = 7. After adding 4, n becomes 20 and digit sum becomes 2 + 0 = 2. It can be shown that we can not make n beautiful with adding non-negative integer less than 4.
+
+ +

Example 2:

+ +
+Input: n = 467, target = 6
+Output: 33
+Explanation: Initially n is 467 and its digit sum is 4 + 6 + 7 = 17. After adding 33, n becomes 500 and digit sum becomes 5 + 0 + 0 = 5. It can be shown that we can not make n beautiful with adding non-negative integer less than 33.
+
+ +

Example 3:

+ +
+Input: n = 1, target = 1
+Output: 0
+Explanation: Initially n is 1 and its digit sum is 1, which is already smaller than or equal to target.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 1012
  • +
  • 1 <= target <= 150
  • +
  • The input will be generated such that it is always possible to make n beautiful.
  • +
diff --git a/leetcode-cn/problem (English)/长度为 K 子数组中的最大和(English) [maximum-sum-of-distinct-subarrays-with-length-k].html b/leetcode-cn/problem (English)/长度为 K 子数组中的最大和(English) [maximum-sum-of-distinct-subarrays-with-length-k].html new file mode 100644 index 00000000..009e96ee --- /dev/null +++ b/leetcode-cn/problem (English)/长度为 K 子数组中的最大和(English) [maximum-sum-of-distinct-subarrays-with-length-k].html @@ -0,0 +1,43 @@ +

You are given an integer array nums and an integer k. Find the maximum subarray sum of all the subarrays of nums that meet the following conditions:

+ +
    +
  • The length of the subarray is k, and
  • +
  • All the elements of the subarray are distinct.
  • +
+ +

Return the maximum subarray sum of all the subarrays that meet the conditions. If no subarray meets the conditions, return 0.

+ +

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

+ +

 

+

Example 1:

+ +
+Input: nums = [1,5,4,2,9,9,9], k = 3
+Output: 15
+Explanation: The subarrays of nums with length 3 are:
+- [1,5,4] which meets the requirements and has a sum of 10.
+- [5,4,2] which meets the requirements and has a sum of 11.
+- [4,2,9] which meets the requirements and has a sum of 15.
+- [2,9,9] which does not meet the requirements because the element 9 is repeated.
+- [9,9,9] which does not meet the requirements because the element 9 is repeated.
+We return 15 because it is the maximum subarray sum of all the subarrays that meet the conditions
+
+ +

Example 2:

+ +
+Input: nums = [4,4,4], k = 3
+Output: 0
+Explanation: The subarrays of nums with length 3 are:
+- [4,4,4] which does not meet the requirements because the element 4 is repeated.
+We return 0 because no subarrays meet the conditions.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= k <= nums.length <= 105
  • +
  • 1 <= nums[i] <= 105
  • +
diff --git a/leetcode-cn/problem (English)/雇佣 K 位工人的总代价(English) [total-cost-to-hire-k-workers].html b/leetcode-cn/problem (English)/雇佣 K 位工人的总代价(English) [total-cost-to-hire-k-workers].html new file mode 100644 index 00000000..b70170f7 --- /dev/null +++ b/leetcode-cn/problem (English)/雇佣 K 位工人的总代价(English) [total-cost-to-hire-k-workers].html @@ -0,0 +1,51 @@ +

You are given a 0-indexed integer array costs where costs[i] is the cost of hiring the ith worker.

+ +

You are also given two integers k and candidates. We want to hire exactly k workers according to the following rules:

+ +
    +
  • You will run k sessions and hire exactly one worker in each session.
  • +
  • In each hiring session, choose the worker with the lowest cost from either the first candidates workers or the last candidates workers. Break the tie by the smallest index. +
      +
    • For example, if costs = [3,2,7,7,1,2] and candidates = 2, then in the first hiring session, we will choose the 4th worker because they have the lowest cost [3,2,7,7,1,2].
    • +
    • In the second hiring session, we will choose 1st worker because they have the same lowest cost as 4th worker but they have the smallest index [3,2,7,7,2]. Please note that the indexing may be changed in the process.
    • +
    +
  • +
  • If there are fewer than candidates workers remaining, choose the worker with the lowest cost among them. Break the tie by the smallest index.
  • +
  • A worker can only be chosen once.
  • +
+ +

Return the total cost to hire exactly k workers.

+ +

 

+

Example 1:

+ +
+Input: costs = [17,12,10,2,7,2,11,20,8], k = 3, candidates = 4
+Output: 11
+Explanation: We hire 3 workers in total. The total cost is initially 0.
+- In the first hiring round we choose the worker from [17,12,10,2,7,2,11,20,8]. The lowest cost is 2, and we break the tie by the smallest index, which is 3. The total cost = 0 + 2 = 2.
+- In the second hiring round we choose the worker from [17,12,10,7,2,11,20,8]. The lowest cost is 2 (index 4). The total cost = 2 + 2 = 4.
+- In the third hiring round we choose the worker from [17,12,10,7,11,20,8]. The lowest cost is 7 (index 3). The total cost = 4 + 7 = 11. Notice that the worker with index 3 was common in the first and last four workers.
+The total hiring cost is 11.
+
+ +

Example 2:

+ +
+Input: costs = [1,2,4,1], k = 3, candidates = 3
+Output: 4
+Explanation: We hire 3 workers in total. The total cost is initially 0.
+- In the first hiring round we choose the worker from [1,2,4,1]. The lowest cost is 1, and we break the tie by the smallest index, which is 0. The total cost = 0 + 1 = 1. Notice that workers with index 1 and 2 are common in the first and last 3 workers.
+- In the second hiring round we choose the worker from [2,4,1]. The lowest cost is 1 (index 2). The total cost = 1 + 1 = 2.
+- In the third hiring round there are less than three candidates. We choose the worker from the remaining workers [2,4]. The lowest cost is 2 (index 0). The total cost = 2 + 2 = 4.
+The total hiring cost is 4.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= costs.length <= 105
  • +
  • 1 <= costs[i] <= 105
  • +
  • 1 <= k, candidates <= costs.length
  • +
diff --git a/leetcode/origin-data.json b/leetcode/origin-data.json index cba48b3e..2a18a3b9 100644 --- a/leetcode/origin-data.json +++ b/leetcode/origin-data.json @@ -1,7 +1,7 @@ { "user_name": "", "num_solved": 0, - "num_total": 2450, + "num_total": 2463, "ac_easy": 0, "ac_medium": 0, "ac_hard": 0, @@ -15,10 +15,10 @@ "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": 110, - "total_submitted": 147, + "total_acs": 368, + "total_submitted": 499, "frontend_question_id": 2450, - "is_new_question": true + "is_new_question": false }, "status": null, "difficulty": { @@ -38,10 +38,10 @@ "question__title": "Number of Nodes With Value One", "question__title_slug": "number-of-nodes-with-value-one", "question__hide": false, - "total_acs": 612, - "total_submitted": 731, + "total_acs": 718, + "total_submitted": 900, "frontend_question_id": 2445, - "is_new_question": true + "is_new_question": false }, "status": null, "difficulty": { @@ -61,8 +61,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": 729, - "total_submitted": 883, + "total_acs": 813, + "total_submitted": 1005, "frontend_question_id": 2436, "is_new_question": false }, @@ -84,8 +84,8 @@ "question__title": "Maximize Total Tastiness of Purchased Fruits", "question__title_slug": "maximize-total-tastiness-of-purchased-fruits", "question__hide": false, - "total_acs": 919, - "total_submitted": 1212, + "total_acs": 979, + "total_submitted": 1319, "frontend_question_id": 2431, "is_new_question": false }, @@ -107,8 +107,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": 620, - "total_submitted": 842, + "total_acs": 676, + "total_submitted": 925, "frontend_question_id": 2422, "is_new_question": false }, @@ -130,8 +130,8 @@ "question__title": "Closest Fair Integer", "question__title_slug": "closest-fair-integer", "question__hide": false, - "total_acs": 518, - "total_submitted": 1077, + "total_acs": 551, + "total_submitted": 1188, "frontend_question_id": 2417, "is_new_question": false }, @@ -153,8 +153,8 @@ "question__title": "Design SQL", "question__title_slug": "design-sql", "question__hide": false, - "total_acs": 642, - "total_submitted": 737, + "total_acs": 693, + "total_submitted": 826, "frontend_question_id": 2408, "is_new_question": false }, @@ -167,6 +167,190 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2554, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Minimum Total Distance Traveled", + "question__title_slug": "minimum-total-distance-traveled", + "question__hide": false, + "total_acs": 3475, + "total_submitted": 8978, + "frontend_question_id": 2463, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2553, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Total Cost to Hire K Workers", + "question__title_slug": "total-cost-to-hire-k-workers", + "question__hide": false, + "total_acs": 10061, + "total_submitted": 27259, + "frontend_question_id": 2462, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2552, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "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": 15769, + "total_submitted": 46237, + "frontend_question_id": 2461, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2551, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Apply Operations to an Array", + "question__title_slug": "apply-operations-to-an-array", + "question__hide": false, + "total_acs": 19995, + "total_submitted": 29830, + "frontend_question_id": 2460, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2550, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Words Within Two Edits of Dictionary", + "question__title_slug": "words-within-two-edits-of-dictionary", + "question__hide": false, + "total_acs": 12618, + "total_submitted": 20981, + "frontend_question_id": 2452, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2549, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Next Greater Element IV", + "question__title_slug": "next-greater-element-iv", + "question__hide": false, + "total_acs": 4691, + "total_submitted": 11993, + "frontend_question_id": 2454, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2548, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Destroy Sequential Targets", + "question__title_slug": "destroy-sequential-targets", + "question__hide": false, + "total_acs": 8960, + "total_submitted": 24605, + "frontend_question_id": 2453, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2547, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Odd String Difference", + "question__title_slug": "odd-string-difference", + "question__hide": false, + "total_acs": 14354, + "total_submitted": 24185, + "frontend_question_id": 2451, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2546, @@ -176,8 +360,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": 13717, - "total_submitted": 29436, + "total_acs": 15756, + "total_submitted": 33380, "frontend_question_id": 2447, "is_new_question": false }, @@ -190,6 +374,98 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2545, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "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": 5757, + "total_submitted": 16509, + "frontend_question_id": 2458, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2544, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Minimum Addition to Make Integer Beautiful", + "question__title_slug": "minimum-addition-to-make-integer-beautiful", + "question__hide": false, + "total_acs": 12614, + "total_submitted": 34461, + "frontend_question_id": 2457, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2543, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Most Popular Video Creator", + "question__title_slug": "most-popular-video-creator", + "question__hide": false, + "total_acs": 15243, + "total_submitted": 34533, + "frontend_question_id": 2456, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2542, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "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": 24151, + "total_submitted": 41606, + "frontend_question_id": 2455, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2541, @@ -199,8 +475,8 @@ "question__title": "Sum of Number and Its Reverse", "question__title_slug": "sum-of-number-and-its-reverse", "question__hide": false, - "total_acs": 23167, - "total_submitted": 51248, + "total_acs": 24462, + "total_submitted": 54029, "frontend_question_id": 2443, "is_new_question": false }, @@ -222,8 +498,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": 5881, - "total_submitted": 9137, + "total_acs": 7189, + "total_submitted": 11115, "frontend_question_id": 2449, "is_new_question": false }, @@ -245,8 +521,8 @@ "question__title": "Minimum Cost to Make Array Equal", "question__title_slug": "minimum-cost-to-make-array-equal", "question__hide": false, - "total_acs": 7963, - "total_submitted": 25664, + "total_acs": 10350, + "total_submitted": 30151, "frontend_question_id": 2448, "is_new_question": false }, @@ -268,8 +544,8 @@ "question__title": "Minimum Time to Kill All Monsters", "question__title_slug": "minimum-time-to-kill-all-monsters", "question__hide": false, - "total_acs": 563, - "total_submitted": 1081, + "total_acs": 587, + "total_submitted": 1130, "frontend_question_id": 2403, "is_new_question": false }, @@ -291,8 +567,8 @@ "question__title": "Determine if Two Events Have Conflict", "question__title_slug": "determine-if-two-events-have-conflict", "question__hide": false, - "total_acs": 17383, - "total_submitted": 35617, + "total_acs": 20999, + "total_submitted": 42716, "frontend_question_id": 2446, "is_new_question": false }, @@ -314,8 +590,8 @@ "question__title": "Count Strictly Increasing Subarrays", "question__title_slug": "count-strictly-increasing-subarrays", "question__hide": false, - "total_acs": 1278, - "total_submitted": 1698, + "total_acs": 1391, + "total_submitted": 1869, "frontend_question_id": 2393, "is_new_question": false }, @@ -337,8 +613,8 @@ "question__title": "Employees With Deductions", "question__title_slug": "employees-with-deductions", "question__hide": false, - "total_acs": 830, - "total_submitted": 1666, + "total_acs": 985, + "total_submitted": 2067, "frontend_question_id": 2394, "is_new_question": false }, @@ -360,8 +636,8 @@ "question__title": "Bitwise XOR of All Pairings", "question__title_slug": "bitwise-xor-of-all-pairings", "question__hide": false, - "total_acs": 11807, - "total_submitted": 20223, + "total_acs": 12201, + "total_submitted": 20849, "frontend_question_id": 2425, "is_new_question": false }, @@ -383,8 +659,8 @@ "question__title": "Remove Letter To Equalize Frequency", "question__title_slug": "remove-letter-to-equalize-frequency", "question__hide": false, - "total_acs": 16833, - "total_submitted": 86879, + "total_acs": 17843, + "total_submitted": 92678, "frontend_question_id": 2423, "is_new_question": false }, @@ -406,8 +682,8 @@ "question__title": "Create Components With Same Value", "question__title_slug": "create-components-with-same-value", "question__hide": false, - "total_acs": 2995, - "total_submitted": 5567, + "total_acs": 3381, + "total_submitted": 6249, "frontend_question_id": 2440, "is_new_question": false }, @@ -429,8 +705,8 @@ "question__title": "Minimize Maximum of Array", "question__title_slug": "minimize-maximum-of-array", "question__hide": false, - "total_acs": 7411, - "total_submitted": 23134, + "total_acs": 8162, + "total_submitted": 25003, "frontend_question_id": 2439, "is_new_question": false }, @@ -452,8 +728,8 @@ "question__title": "Range Product Queries of Powers", "question__title_slug": "range-product-queries-of-powers", "question__hide": false, - "total_acs": 10984, - "total_submitted": 29289, + "total_acs": 11764, + "total_submitted": 30714, "frontend_question_id": 2438, "is_new_question": false }, @@ -475,8 +751,8 @@ "question__title": "Number of Valid Clock Times", "question__title_slug": "number-of-valid-clock-times", "question__hide": false, - "total_acs": 14003, - "total_submitted": 34048, + "total_acs": 14902, + "total_submitted": 35742, "frontend_question_id": 2437, "is_new_question": false }, @@ -498,8 +774,8 @@ "question__title": "Count Subarrays With Fixed Bounds", "question__title_slug": "count-subarrays-with-fixed-bounds", "question__hide": false, - "total_acs": 9205, - "total_submitted": 22105, + "total_acs": 9915, + "total_submitted": 23321, "frontend_question_id": 2444, "is_new_question": false }, @@ -521,8 +797,8 @@ "question__title": "Longest Increasing Subsequence II", "question__title_slug": "longest-increasing-subsequence-ii", "question__hide": false, - "total_acs": 6091, - "total_submitted": 29448, + "total_acs": 6276, + "total_submitted": 30247, "frontend_question_id": 2407, "is_new_question": false }, @@ -544,8 +820,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": 23381, - "total_submitted": 29693, + "total_acs": 25624, + "total_submitted": 32524, "frontend_question_id": 2442, "is_new_question": false }, @@ -567,8 +843,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": 25950, - "total_submitted": 38121, + "total_acs": 28548, + "total_submitted": 42082, "frontend_question_id": 2441, "is_new_question": false }, @@ -590,8 +866,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": 795, - "total_submitted": 1002, + "total_acs": 905, + "total_submitted": 1174, "frontend_question_id": 2388, "is_new_question": false }, @@ -613,8 +889,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": 762, - "total_submitted": 1131, + "total_acs": 832, + "total_submitted": 1224, "frontend_question_id": 2387, "is_new_question": false }, @@ -636,8 +912,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": 12201, - "total_submitted": 29913, + "total_acs": 12733, + "total_submitted": 31118, "frontend_question_id": 2435, "is_new_question": false }, @@ -659,8 +935,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": 11995, - "total_submitted": 31771, + "total_acs": 12429, + "total_submitted": 32706, "frontend_question_id": 2434, "is_new_question": false }, @@ -682,8 +958,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": 21043, - "total_submitted": 24667, + "total_acs": 22449, + "total_submitted": 26237, "frontend_question_id": 2433, "is_new_question": false }, @@ -705,8 +981,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": 22493, - "total_submitted": 46207, + "total_acs": 23319, + "total_submitted": 47761, "frontend_question_id": 2432, "is_new_question": false }, @@ -728,8 +1004,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": 590, - "total_submitted": 958, + "total_acs": 634, + "total_submitted": 1022, "frontend_question_id": 2378, "is_new_question": false }, @@ -751,8 +1027,8 @@ "question__title": "Sort the Olympic Table", "question__title_slug": "sort-the-olympic-table", "question__hide": false, - "total_acs": 1469, - "total_submitted": 1825, + "total_acs": 1632, + "total_submitted": 2030, "frontend_question_id": 2377, "is_new_question": false }, @@ -774,8 +1050,8 @@ "question__title": "Calculate the Influence of Each Salesperson", "question__title_slug": "calculate-the-influence-of-each-salesperson", "question__hide": false, - "total_acs": 1214, - "total_submitted": 1369, + "total_acs": 1366, + "total_submitted": 1544, "frontend_question_id": 2372, "is_new_question": false }, @@ -797,8 +1073,8 @@ "question__title": "Number of Pairs Satisfying Inequality", "question__title_slug": "number-of-pairs-satisfying-inequality", "question__hide": false, - "total_acs": 6178, - "total_submitted": 14939, + "total_acs": 6587, + "total_submitted": 15649, "frontend_question_id": 2426, "is_new_question": false }, @@ -820,8 +1096,8 @@ "question__title": "Longest Uploaded Prefix", "question__title_slug": "longest-uploaded-prefix", "question__hide": false, - "total_acs": 12440, - "total_submitted": 23287, + "total_acs": 12869, + "total_submitted": 24014, "frontend_question_id": 2424, "is_new_question": false }, @@ -843,8 +1119,8 @@ "question__title": "Maximum Deletions on a String", "question__title_slug": "maximum-deletions-on-a-string", "question__hide": false, - "total_acs": 8850, - "total_submitted": 27196, + "total_acs": 9113, + "total_submitted": 28114, "frontend_question_id": 2430, "is_new_question": false }, @@ -866,8 +1142,8 @@ "question__title": "Minimize XOR", "question__title_slug": "minimize-xor", "question__hide": false, - "total_acs": 15574, - "total_submitted": 37492, + "total_acs": 15929, + "total_submitted": 38191, "frontend_question_id": 2429, "is_new_question": false }, @@ -889,8 +1165,8 @@ "question__title": "Maximum Sum of an Hourglass", "question__title_slug": "maximum-sum-of-an-hourglass", "question__hide": false, - "total_acs": 21957, - "total_submitted": 29811, + "total_acs": 22692, + "total_submitted": 30759, "frontend_question_id": 2428, "is_new_question": false }, @@ -912,8 +1188,8 @@ "question__title": "Number of Common Factors", "question__title_slug": "number-of-common-factors", "question__hide": false, - "total_acs": 29957, - "total_submitted": 37322, + "total_acs": 32033, + "total_submitted": 39915, "frontend_question_id": 2427, "is_new_question": false }, @@ -935,8 +1211,8 @@ "question__title": "Minimize Maximum Value in a Grid", "question__title_slug": "minimize-maximum-value-in-a-grid", "question__hide": false, - "total_acs": 591, - "total_submitted": 840, + "total_acs": 628, + "total_submitted": 896, "frontend_question_id": 2371, "is_new_question": false }, @@ -958,8 +1234,8 @@ "question__title": "Number of Good Paths", "question__title_slug": "number-of-good-paths", "question__hide": false, - "total_acs": 6386, - "total_submitted": 16549, + "total_acs": 6870, + "total_submitted": 17530, "frontend_question_id": 2421, "is_new_question": false }, @@ -981,8 +1257,8 @@ "question__title": "Find All Good Indices", "question__title_slug": "find-all-good-indices", "question__hide": false, - "total_acs": 16110, - "total_submitted": 43657, + "total_acs": 16481, + "total_submitted": 44491, "frontend_question_id": 2420, "is_new_question": false }, @@ -1004,8 +1280,8 @@ "question__title": "Longest Subarray With Maximum Bitwise AND", "question__title_slug": "longest-subarray-with-maximum-bitwise-and", "question__hide": false, - "total_acs": 19168, - "total_submitted": 40457, + "total_acs": 19517, + "total_submitted": 41078, "frontend_question_id": 2419, "is_new_question": false }, @@ -1027,8 +1303,8 @@ "question__title": "Sort the People", "question__title_slug": "sort-the-people", "question__hide": false, - "total_acs": 37463, - "total_submitted": 45349, + "total_acs": 41399, + "total_submitted": 50177, "frontend_question_id": 2418, "is_new_question": false }, @@ -1050,8 +1326,8 @@ "question__title": "Generate the Invoice", "question__title_slug": "generate-the-invoice", "question__hide": false, - "total_acs": 856, - "total_submitted": 959, + "total_acs": 952, + "total_submitted": 1077, "frontend_question_id": 2362, "is_new_question": false }, @@ -1073,8 +1349,8 @@ "question__title": "Minimum Costs Using the Train Line", "question__title_slug": "minimum-costs-using-the-train-line", "question__hide": false, - "total_acs": 2117, - "total_submitted": 2737, + "total_acs": 2344, + "total_submitted": 3042, "frontend_question_id": 2361, "is_new_question": false }, @@ -1096,8 +1372,8 @@ "question__title": "Minimum Money Required Before Transactions", "question__title_slug": "minimum-money-required-before-transactions", "question__hide": false, - "total_acs": 7397, - "total_submitted": 19017, + "total_acs": 7528, + "total_submitted": 19315, "frontend_question_id": 2412, "is_new_question": false }, @@ -1119,8 +1395,8 @@ "question__title": "Smallest Subarrays With Maximum Bitwise OR", "question__title_slug": "smallest-subarrays-with-maximum-bitwise-or", "question__hide": false, - "total_acs": 7812, - "total_submitted": 19474, + "total_acs": 7990, + "total_submitted": 19886, "frontend_question_id": 2411, "is_new_question": false }, @@ -1142,8 +1418,8 @@ "question__title": "Maximum Matching of Players With Trainers", "question__title_slug": "maximum-matching-of-players-with-trainers", "question__hide": false, - "total_acs": 18997, - "total_submitted": 31931, + "total_acs": 19501, + "total_submitted": 32717, "frontend_question_id": 2410, "is_new_question": false }, @@ -1165,8 +1441,8 @@ "question__title": "Count Days Spent Together", "question__title_slug": "count-days-spent-together", "question__hide": false, - "total_acs": 14273, - "total_submitted": 33711, + "total_acs": 14661, + "total_submitted": 34489, "frontend_question_id": 2409, "is_new_question": false }, @@ -1188,8 +1464,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": 2513, - "total_submitted": 2737, + "total_acs": 2735, + "total_submitted": 2997, "frontend_question_id": 2356, "is_new_question": false }, @@ -1211,8 +1487,8 @@ "question__title": "Sum of Prefix Scores of Strings", "question__title_slug": "sum-of-prefix-scores-of-strings", "question__hide": false, - "total_acs": 15382, - "total_submitted": 36390, + "total_acs": 15908, + "total_submitted": 37512, "frontend_question_id": 2416, "is_new_question": false }, @@ -1234,8 +1510,8 @@ "question__title": "Reverse Odd Levels of Binary Tree", "question__title_slug": "reverse-odd-levels-of-binary-tree", "question__hide": false, - "total_acs": 23703, - "total_submitted": 31319, + "total_acs": 24726, + "total_submitted": 32707, "frontend_question_id": 2415, "is_new_question": false }, @@ -1257,8 +1533,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": 27428, - "total_submitted": 49330, + "total_acs": 28087, + "total_submitted": 50456, "frontend_question_id": 2414, "is_new_question": false }, @@ -1280,8 +1556,8 @@ "question__title": "Smallest Even Multiple", "question__title_slug": "smallest-even-multiple", "question__hide": false, - "total_acs": 42552, - "total_submitted": 48302, + "total_acs": 46411, + "total_submitted": 52700, "frontend_question_id": 2413, "is_new_question": false }, @@ -1303,8 +1579,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": 2531, - "total_submitted": 5407, + "total_acs": 2912, + "total_submitted": 6302, "frontend_question_id": 2355, "is_new_question": false }, @@ -1317,6 +1593,29 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2489, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "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": 259, + "total_submitted": 485, + "frontend_question_id": 2459, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2488, @@ -1326,8 +1625,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": 17803, - "total_submitted": 39483, + "total_acs": 18174, + "total_submitted": 40151, "frontend_question_id": 2406, "is_new_question": false }, @@ -1349,8 +1648,8 @@ "question__title": "Optimal Partition of String", "question__title_slug": "optimal-partition-of-string", "question__hide": false, - "total_acs": 25593, - "total_submitted": 34521, + "total_acs": 26527, + "total_submitted": 35699, "frontend_question_id": 2405, "is_new_question": false }, @@ -1372,8 +1671,8 @@ "question__title": "Most Frequent Even Element", "question__title_slug": "most-frequent-even-element", "question__hide": false, - "total_acs": 33329, - "total_submitted": 64673, + "total_acs": 34963, + "total_submitted": 67751, "frontend_question_id": 2404, "is_new_question": false }, @@ -1395,8 +1694,8 @@ "question__title": "Finding the Number of Visible Mountains", "question__title_slug": "finding-the-number-of-visible-mountains", "question__hide": false, - "total_acs": 1538, - "total_submitted": 3469, + "total_acs": 1700, + "total_submitted": 3870, "frontend_question_id": 2345, "is_new_question": false }, @@ -1418,8 +1717,8 @@ "question__title": "Compute the Rank as a Percentage", "question__title_slug": "compute-the-rank-as-a-percentage", "question__hide": false, - "total_acs": 1191, - "total_submitted": 3600, + "total_acs": 1347, + "total_submitted": 4071, "frontend_question_id": 2346, "is_new_question": false }, @@ -1441,8 +1740,8 @@ "question__title": "Task Scheduler II", "question__title_slug": "task-scheduler-ii", "question__hide": false, - "total_acs": 15497, - "total_submitted": 33691, + "total_acs": 15753, + "total_submitted": 34172, "frontend_question_id": 2365, "is_new_question": false }, @@ -1464,8 +1763,8 @@ "question__title": "Maximum Rows Covered by Columns", "question__title_slug": "maximum-rows-covered-by-columns", "question__hide": false, - "total_acs": 10814, - "total_submitted": 20709, + "total_acs": 10922, + "total_submitted": 20861, "frontend_question_id": 2397, "is_new_question": false }, @@ -1487,8 +1786,8 @@ "question__title": "Strictly Palindromic Number", "question__title_slug": "strictly-palindromic-number", "question__hide": false, - "total_acs": 29321, - "total_submitted": 33420, + "total_acs": 31000, + "total_submitted": 35355, "frontend_question_id": 2396, "is_new_question": false }, @@ -1510,8 +1809,8 @@ "question__title": "Find Subarrays With Equal Sum", "question__title_slug": "find-subarrays-with-equal-sum", "question__hide": false, - "total_acs": 27257, - "total_submitted": 42864, + "total_acs": 28104, + "total_submitted": 44063, "frontend_question_id": 2395, "is_new_question": false }, @@ -1533,8 +1832,8 @@ "question__title": "Meeting Rooms III", "question__title_slug": "meeting-rooms-iii", "question__hide": false, - "total_acs": 9694, - "total_submitted": 29580, + "total_acs": 10318, + "total_submitted": 31246, "frontend_question_id": 2402, "is_new_question": false }, @@ -1556,8 +1855,8 @@ "question__title": "Longest Nice Subarray", "question__title_slug": "longest-nice-subarray", "question__hide": false, - "total_acs": 16193, - "total_submitted": 33880, + "total_acs": 16614, + "total_submitted": 34702, "frontend_question_id": 2401, "is_new_question": false }, @@ -1579,8 +1878,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": 18165, - "total_submitted": 56907, + "total_acs": 18476, + "total_submitted": 57744, "frontend_question_id": 2400, "is_new_question": false }, @@ -1602,8 +1901,8 @@ "question__title": "Check Distances Between Same Letters", "question__title_slug": "check-distances-between-same-letters", "question__hide": false, - "total_acs": 27586, - "total_submitted": 39142, + "total_acs": 28354, + "total_submitted": 40193, "frontend_question_id": 2399, "is_new_question": false }, @@ -1625,8 +1924,8 @@ "question__title": "Largest Palindromic Number", "question__title_slug": "largest-palindromic-number", "question__hide": false, - "total_acs": 17675, - "total_submitted": 58207, + "total_acs": 18117, + "total_submitted": 59271, "frontend_question_id": 2384, "is_new_question": false }, @@ -1648,8 +1947,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": 3437, - "total_submitted": 4500, + "total_acs": 4038, + "total_submitted": 5289, "frontend_question_id": 2340, "is_new_question": false }, @@ -1671,8 +1970,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": 27080, - "total_submitted": 51115, + "total_acs": 27587, + "total_submitted": 52001, "frontend_question_id": 2342, "is_new_question": false }, @@ -1694,8 +1993,8 @@ "question__title": "Build a Matrix With Conditions", "question__title_slug": "build-a-matrix-with-conditions", "question__hide": false, - "total_acs": 9827, - "total_submitted": 16635, + "total_acs": 9962, + "total_submitted": 16832, "frontend_question_id": 2392, "is_new_question": false }, @@ -1717,8 +2016,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": 24398, - "total_submitted": 28588, + "total_acs": 25330, + "total_submitted": 29681, "frontend_question_id": 2391, "is_new_question": false }, @@ -1740,8 +2039,8 @@ "question__title": "Removing Stars From a String", "question__title_slug": "removing-stars-from-a-string", "question__hide": false, - "total_acs": 29106, - "total_submitted": 46148, + "total_acs": 29919, + "total_submitted": 47343, "frontend_question_id": 2390, "is_new_question": false }, @@ -1763,8 +2062,8 @@ "question__title": "Longest Subsequence With Limited Sum", "question__title_slug": "longest-subsequence-with-limited-sum", "question__hide": false, - "total_acs": 26093, - "total_submitted": 40427, + "total_acs": 26983, + "total_submitted": 41801, "frontend_question_id": 2389, "is_new_question": false }, @@ -1786,8 +2085,8 @@ "question__title": "Valid Palindrome IV", "question__title_slug": "valid-palindrome-iv", "question__hide": false, - "total_acs": 1732, - "total_submitted": 2292, + "total_acs": 1812, + "total_submitted": 2390, "frontend_question_id": 2330, "is_new_question": false }, @@ -1809,8 +2108,8 @@ "question__title": "Maximum Segment Sum After Removals", "question__title_slug": "maximum-segment-sum-after-removals", "question__hide": false, - "total_acs": 5533, - "total_submitted": 11629, + "total_acs": 5616, + "total_submitted": 11813, "frontend_question_id": 2382, "is_new_question": false }, @@ -1832,8 +2131,8 @@ "question__title": "Shifting Letters II", "question__title_slug": "shifting-letters-ii", "question__hide": false, - "total_acs": 12316, - "total_submitted": 36205, + "total_acs": 12559, + "total_submitted": 36782, "frontend_question_id": 2381, "is_new_question": false }, @@ -1855,8 +2154,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": 18615, - "total_submitted": 39019, + "total_acs": 19117, + "total_submitted": 39874, "frontend_question_id": 2380, "is_new_question": false }, @@ -1878,8 +2177,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": 24165, - "total_submitted": 42655, + "total_acs": 25001, + "total_submitted": 44085, "frontend_question_id": 2379, "is_new_question": false }, @@ -1901,8 +2200,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": 5697, - "total_submitted": 15598, + "total_acs": 5904, + "total_submitted": 15973, "frontend_question_id": 2386, "is_new_question": false }, @@ -1924,8 +2223,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": 18259, - "total_submitted": 32572, + "total_acs": 18762, + "total_submitted": 33421, "frontend_question_id": 2385, "is_new_question": false }, @@ -1947,8 +2246,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": 22390, - "total_submitted": 54719, + "total_acs": 22760, + "total_submitted": 55577, "frontend_question_id": 2383, "is_new_question": false }, @@ -1970,8 +2269,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": 1170, - "total_submitted": 1556, + "total_acs": 1214, + "total_submitted": 1609, "frontend_question_id": 2323, "is_new_question": false }, @@ -1993,8 +2292,8 @@ "question__title": "Count Special Integers", "question__title_slug": "count-special-integers", "question__hide": false, - "total_acs": 7785, - "total_submitted": 21558, + "total_acs": 7909, + "total_submitted": 21869, "frontend_question_id": 2376, "is_new_question": false }, @@ -2016,8 +2315,8 @@ "question__title": "Construct Smallest Number From DI String", "question__title_slug": "construct-smallest-number-from-di-string", "question__hide": false, - "total_acs": 18406, - "total_submitted": 24954, + "total_acs": 18743, + "total_submitted": 25386, "frontend_question_id": 2375, "is_new_question": false }, @@ -2039,8 +2338,8 @@ "question__title": "Node With Highest Edge Score", "question__title_slug": "node-with-highest-edge-score", "question__hide": false, - "total_acs": 22606, - "total_submitted": 49137, + "total_acs": 22991, + "total_submitted": 49829, "frontend_question_id": 2374, "is_new_question": false }, @@ -2062,8 +2361,8 @@ "question__title": "Largest Local Values in a Matrix", "question__title_slug": "largest-local-values-in-a-matrix", "question__hide": false, - "total_acs": 25853, - "total_submitted": 30761, + "total_acs": 26737, + "total_submitted": 31819, "frontend_question_id": 2373, "is_new_question": false }, @@ -2085,8 +2384,8 @@ "question__title": "All the Matches of the League", "question__title_slug": "all-the-matches-of-the-league", "question__hide": false, - "total_acs": 2320, - "total_submitted": 2609, + "total_acs": 2506, + "total_submitted": 2808, "frontend_question_id": 2339, "is_new_question": false }, @@ -2108,8 +2407,8 @@ "question__title": "Product Sales Analysis V", "question__title_slug": "product-sales-analysis-v", "question__hide": false, - "total_acs": 2277, - "total_submitted": 3241, + "total_acs": 2448, + "total_submitted": 3483, "frontend_question_id": 2329, "is_new_question": false }, @@ -2131,8 +2430,8 @@ "question__title": "Product Sales Analysis IV", "question__title_slug": "product-sales-analysis-iv", "question__hide": false, - "total_acs": 2118, - "total_submitted": 2501, + "total_acs": 2272, + "total_submitted": 2690, "frontend_question_id": 2324, "is_new_question": false }, @@ -2154,8 +2453,8 @@ "question__title": "Minimum Replacements to Sort the Array", "question__title_slug": "minimum-replacements-to-sort-the-array", "question__hide": false, - "total_acs": 8056, - "total_submitted": 20319, + "total_acs": 8213, + "total_submitted": 20623, "frontend_question_id": 2366, "is_new_question": false }, @@ -2177,8 +2476,8 @@ "question__title": "Maximum Number of Robots Within Budget", "question__title_slug": "maximum-number-of-robots-within-budget", "question__hide": false, - "total_acs": 11909, - "total_submitted": 37379, + "total_acs": 12410, + "total_submitted": 38675, "frontend_question_id": 2398, "is_new_question": false }, @@ -2200,8 +2499,8 @@ "question__title": "Count Number of Bad Pairs", "question__title_slug": "count-number-of-bad-pairs", "question__hide": false, - "total_acs": 18881, - "total_submitted": 46527, + "total_acs": 19286, + "total_submitted": 47412, "frontend_question_id": 2364, "is_new_question": false }, @@ -2223,8 +2522,8 @@ "question__title": "Merge Similar Items", "question__title_slug": "merge-similar-items", "question__hide": false, - "total_acs": 27233, - "total_submitted": 36252, + "total_acs": 28096, + "total_submitted": 37364, "frontend_question_id": 2363, "is_new_question": false }, @@ -2246,8 +2545,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": 1760, - "total_submitted": 2284, + "total_acs": 1902, + "total_submitted": 2481, "frontend_question_id": 2314, "is_new_question": false }, @@ -2269,8 +2568,8 @@ "question__title": "Reachable Nodes With Restrictions", "question__title_slug": "reachable-nodes-with-restrictions", "question__hide": false, - "total_acs": 25519, - "total_submitted": 44509, + "total_acs": 26228, + "total_submitted": 45698, "frontend_question_id": 2368, "is_new_question": false }, @@ -2292,8 +2591,8 @@ "question__title": "Longest Ideal Subsequence", "question__title_slug": "longest-ideal-subsequence", "question__hide": false, - "total_acs": 16936, - "total_submitted": 44776, + "total_acs": 17194, + "total_submitted": 45408, "frontend_question_id": 2370, "is_new_question": false }, @@ -2315,8 +2614,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": 17585, - "total_submitted": 43937, + "total_acs": 17738, + "total_submitted": 44314, "frontend_question_id": 2369, "is_new_question": false }, @@ -2338,8 +2637,8 @@ "question__title": "Number of Arithmetic Triplets", "question__title_slug": "number-of-arithmetic-triplets", "question__hide": false, - "total_acs": 45472, - "total_submitted": 54273, + "total_acs": 47523, + "total_submitted": 56763, "frontend_question_id": 2367, "is_new_question": false }, @@ -2361,8 +2660,8 @@ "question__title": "Arrange Table by Gender", "question__title_slug": "arrange-table-by-gender", "question__hide": false, - "total_acs": 1821, - "total_submitted": 2296, + "total_acs": 1959, + "total_submitted": 2469, "frontend_question_id": 2308, "is_new_question": false }, @@ -2384,8 +2683,8 @@ "question__title": "Tasks Count in the Weekend", "question__title_slug": "tasks-count-in-the-weekend", "question__hide": false, - "total_acs": 2157, - "total_submitted": 2459, + "total_acs": 2290, + "total_submitted": 2610, "frontend_question_id": 2298, "is_new_question": false }, @@ -2407,8 +2706,8 @@ "question__title": "Longest Cycle in a Graph", "question__title_slug": "longest-cycle-in-a-graph", "question__hide": false, - "total_acs": 14783, - "total_submitted": 38380, + "total_acs": 15050, + "total_submitted": 39043, "frontend_question_id": 2360, "is_new_question": false }, @@ -2430,8 +2729,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": 16564, - "total_submitted": 48949, + "total_acs": 16811, + "total_submitted": 49564, "frontend_question_id": 2359, "is_new_question": false }, @@ -2453,8 +2752,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": 25298, - "total_submitted": 37559, + "total_acs": 25657, + "total_submitted": 38047, "frontend_question_id": 2358, "is_new_question": false }, @@ -2476,8 +2775,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": 45227, - "total_submitted": 62345, + "total_acs": 47521, + "total_submitted": 65453, "frontend_question_id": 2357, "is_new_question": false }, @@ -2499,8 +2798,8 @@ "question__title": "Shortest Impossible Sequence of Rolls", "question__title_slug": "shortest-impossible-sequence-of-rolls", "question__hide": false, - "total_acs": 10428, - "total_submitted": 15272, + "total_acs": 10564, + "total_submitted": 15473, "frontend_question_id": 2350, "is_new_question": false }, @@ -2522,8 +2821,8 @@ "question__title": "Design a Number Container System", "question__title_slug": "design-a-number-container-system", "question__hide": false, - "total_acs": 16830, - "total_submitted": 36072, + "total_acs": 17000, + "total_submitted": 36549, "frontend_question_id": 2349, "is_new_question": false }, @@ -2545,8 +2844,8 @@ "question__title": "Best Poker Hand", "question__title_slug": "best-poker-hand", "question__hide": false, - "total_acs": 25483, - "total_submitted": 42033, + "total_acs": 25863, + "total_submitted": 42712, "frontend_question_id": 2347, "is_new_question": false }, @@ -2568,8 +2867,8 @@ "question__title": "Number of Zero-Filled Subarrays", "question__title_slug": "number-of-zero-filled-subarrays", "question__hide": false, - "total_acs": 25183, - "total_submitted": 44273, + "total_acs": 25533, + "total_submitted": 44829, "frontend_question_id": 2348, "is_new_question": false }, @@ -2591,8 +2890,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": 2374, - "total_submitted": 5946, + "total_acs": 2530, + "total_submitted": 6356, "frontend_question_id": 2292, "is_new_question": false }, @@ -2614,8 +2913,8 @@ "question__title": "Number of Excellent Pairs", "question__title_slug": "number-of-excellent-pairs", "question__hide": false, - "total_acs": 10761, - "total_submitted": 23519, + "total_acs": 10926, + "total_submitted": 23822, "frontend_question_id": 2354, "is_new_question": false }, @@ -2637,8 +2936,8 @@ "question__title": "Design a Food Rating System", "question__title_slug": "design-a-food-rating-system", "question__hide": false, - "total_acs": 14735, - "total_submitted": 42786, + "total_acs": 14902, + "total_submitted": 43200, "frontend_question_id": 2353, "is_new_question": false }, @@ -2660,8 +2959,8 @@ "question__title": "Equal Row and Column Pairs", "question__title_slug": "equal-row-and-column-pairs", "question__hide": false, - "total_acs": 28786, - "total_submitted": 40515, + "total_acs": 29348, + "total_submitted": 41302, "frontend_question_id": 2352, "is_new_question": false }, @@ -2683,8 +2982,8 @@ "question__title": "First Letter to Appear Twice", "question__title_slug": "first-letter-to-appear-twice", "question__hide": false, - "total_acs": 50646, - "total_submitted": 66245, + "total_acs": 53136, + "total_submitted": 69570, "frontend_question_id": 2351, "is_new_question": false }, @@ -2706,8 +3005,8 @@ "question__title": "Maximum Profit From Trading Stocks", "question__title_slug": "maximum-profit-from-trading-stocks", "question__hide": false, - "total_acs": 2193, - "total_submitted": 4712, + "total_acs": 2324, + "total_submitted": 4981, "frontend_question_id": 2291, "is_new_question": false }, @@ -2729,8 +3028,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": 912, - "total_submitted": 1815, + "total_acs": 922, + "total_submitted": 1844, "frontend_question_id": 2282, "is_new_question": false }, @@ -2752,8 +3051,8 @@ "question__title": "Minimum Deletions to Make Array Divisible", "question__title_slug": "minimum-deletions-to-make-array-divisible", "question__hide": false, - "total_acs": 20063, - "total_submitted": 35296, + "total_acs": 20472, + "total_submitted": 35914, "frontend_question_id": 2344, "is_new_question": false }, @@ -2775,8 +3074,8 @@ "question__title": "Query Kth Smallest Trimmed Number", "question__title_slug": "query-kth-smallest-trimmed-number", "question__hide": false, - "total_acs": 18653, - "total_submitted": 45822, + "total_acs": 18841, + "total_submitted": 46208, "frontend_question_id": 2343, "is_new_question": false }, @@ -2798,8 +3097,8 @@ "question__title": "Maximum Number of Pairs in Array", "question__title_slug": "maximum-number-of-pairs-in-array", "question__hide": false, - "total_acs": 37450, - "total_submitted": 48822, + "total_acs": 38373, + "total_submitted": 50045, "frontend_question_id": 2341, "is_new_question": false }, @@ -2821,8 +3120,8 @@ "question__title": "Closest Node to Path in Tree", "question__title_slug": "closest-node-to-path-in-tree", "question__hide": false, - "total_acs": 1972, - "total_submitted": 3079, + "total_acs": 2073, + "total_submitted": 3239, "frontend_question_id": 2277, "is_new_question": false }, @@ -2844,8 +3143,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": 5106, - "total_submitted": 12694, + "total_acs": 5193, + "total_submitted": 12864, "frontend_question_id": 2334, "is_new_question": false }, @@ -2867,8 +3166,8 @@ "question__title": "Minimum Sum of Squared Difference", "question__title_slug": "minimum-sum-of-squared-difference", "question__hide": false, - "total_acs": 9317, - "total_submitted": 37441, + "total_acs": 9790, + "total_submitted": 38366, "frontend_question_id": 2333, "is_new_question": false }, @@ -2890,8 +3189,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": 11277, - "total_submitted": 49614, + "total_acs": 11444, + "total_submitted": 50222, "frontend_question_id": 2332, "is_new_question": false }, @@ -2913,8 +3212,8 @@ "question__title": "Evaluate Boolean Binary Tree", "question__title_slug": "evaluate-boolean-binary-tree", "question__hide": false, - "total_acs": 31992, - "total_submitted": 40240, + "total_acs": 33292, + "total_submitted": 41939, "frontend_question_id": 2331, "is_new_question": false }, @@ -2936,8 +3235,8 @@ "question__title": "Count the Number of Ideal Arrays", "question__title_slug": "count-the-number-of-ideal-arrays", "question__hide": false, - "total_acs": 4128, - "total_submitted": 16297, + "total_acs": 4186, + "total_submitted": 16471, "frontend_question_id": 2338, "is_new_question": false }, @@ -2959,8 +3258,8 @@ "question__title": "Move Pieces to Obtain a String", "question__title_slug": "move-pieces-to-obtain-a-string", "question__hide": false, - "total_acs": 18459, - "total_submitted": 38474, + "total_acs": 18686, + "total_submitted": 38947, "frontend_question_id": 2337, "is_new_question": false }, @@ -2982,8 +3281,8 @@ "question__title": "Smallest Number in Infinite Set", "question__title_slug": "smallest-number-in-infinite-set", "question__hide": false, - "total_acs": 23906, - "total_submitted": 33292, + "total_acs": 24371, + "total_submitted": 33973, "frontend_question_id": 2336, "is_new_question": false }, @@ -3005,8 +3304,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": 28294, - "total_submitted": 51125, + "total_acs": 28839, + "total_submitted": 52007, "frontend_question_id": 2335, "is_new_question": false }, @@ -3028,8 +3327,8 @@ "question__title": "Spiral Matrix IV", "question__title_slug": "spiral-matrix-iv", "question__hide": false, - "total_acs": 22220, - "total_submitted": 29793, + "total_acs": 22610, + "total_submitted": 30336, "frontend_question_id": 2326, "is_new_question": false }, @@ -3051,8 +3350,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": 14248, - "total_submitted": 29865, + "total_acs": 14469, + "total_submitted": 30343, "frontend_question_id": 2328, "is_new_question": false }, @@ -3074,8 +3373,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": 14486, - "total_submitted": 32601, + "total_acs": 14715, + "total_submitted": 33087, "frontend_question_id": 2327, "is_new_question": false }, @@ -3097,8 +3396,8 @@ "question__title": "Decode the Message", "question__title_slug": "decode-the-message", "question__hide": false, - "total_acs": 39009, - "total_submitted": 45981, + "total_acs": 40498, + "total_submitted": 47675, "frontend_question_id": 2325, "is_new_question": false }, @@ -3120,8 +3419,8 @@ "question__title": "Minimum Number of Keypresses", "question__title_slug": "minimum-number-of-keypresses", "question__hide": false, - "total_acs": 7366, - "total_submitted": 9942, + "total_acs": 8140, + "total_submitted": 10981, "frontend_question_id": 2268, "is_new_question": false }, @@ -3143,8 +3442,8 @@ "question__title": "Number of Distinct Roll Sequences", "question__title_slug": "number-of-distinct-roll-sequences", "question__hide": false, - "total_acs": 7717, - "total_submitted": 13715, + "total_acs": 7771, + "total_submitted": 13839, "frontend_question_id": 2318, "is_new_question": false }, @@ -3166,8 +3465,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": 18679, - "total_submitted": 48387, + "total_acs": 19014, + "total_submitted": 49267, "frontend_question_id": 2316, "is_new_question": false }, @@ -3189,8 +3488,8 @@ "question__title": "Maximum XOR After Operations ", "question__title_slug": "maximum-xor-after-operations", "question__hide": false, - "total_acs": 13972, - "total_submitted": 17844, + "total_acs": 14261, + "total_submitted": 18188, "frontend_question_id": 2317, "is_new_question": false }, @@ -3212,8 +3511,8 @@ "question__title": "Count Asterisks", "question__title_slug": "count-asterisks", "question__hide": false, - "total_acs": 31846, - "total_submitted": 38715, + "total_acs": 32968, + "total_submitted": 40015, "frontend_question_id": 2315, "is_new_question": false }, @@ -3235,8 +3534,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": 4904, - "total_submitted": 9718, + "total_acs": 4974, + "total_submitted": 9839, "frontend_question_id": 2322, "is_new_question": false }, @@ -3258,8 +3557,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": 838, - "total_submitted": 1238, + "total_acs": 864, + "total_submitted": 1274, "frontend_question_id": 2313, "is_new_question": false }, @@ -3281,8 +3580,8 @@ "question__title": "Check if Matrix Is X-Matrix", "question__title_slug": "check-if-matrix-is-x-matrix", "question__hide": false, - "total_acs": 31144, - "total_submitted": 46246, + "total_acs": 31752, + "total_submitted": 47155, "frontend_question_id": 2319, "is_new_question": false }, @@ -3304,8 +3603,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": 19658, - "total_submitted": 49233, + "total_acs": 20004, + "total_submitted": 50022, "frontend_question_id": 2320, "is_new_question": false }, @@ -3327,8 +3626,8 @@ "question__title": "Design Video Sharing Platform", "question__title_slug": "design-video-sharing-platform", "question__hide": false, - "total_acs": 1033, - "total_submitted": 1568, + "total_acs": 1055, + "total_submitted": 1625, "frontend_question_id": 2254, "is_new_question": false }, @@ -3350,8 +3649,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": 16181, - "total_submitted": 44680, + "total_acs": 16425, + "total_submitted": 45245, "frontend_question_id": 2311, "is_new_question": false }, @@ -3373,8 +3672,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": 13943, - "total_submitted": 26828, + "total_acs": 14225, + "total_submitted": 27306, "frontend_question_id": 2302, "is_new_question": false }, @@ -3396,8 +3695,8 @@ "question__title": "Match Substring After Replacement", "question__title_slug": "match-substring-after-replacement", "question__hide": false, - "total_acs": 10368, - "total_submitted": 26418, + "total_acs": 10472, + "total_submitted": 26618, "frontend_question_id": 2301, "is_new_question": false }, @@ -3419,8 +3718,8 @@ "question__title": "Successful Pairs of Spells and Potions", "question__title_slug": "successful-pairs-of-spells-and-potions", "question__hide": false, - "total_acs": 19316, - "total_submitted": 61262, + "total_acs": 19604, + "total_submitted": 61969, "frontend_question_id": 2300, "is_new_question": false }, @@ -3442,8 +3741,8 @@ "question__title": "Strong Password Checker II", "question__title_slug": "strong-password-checker-ii", "question__hide": false, - "total_acs": 25095, - "total_submitted": 44150, + "total_acs": 25503, + "total_submitted": 44912, "frontend_question_id": 2299, "is_new_question": false }, @@ -3465,8 +3764,8 @@ "question__title": "Naming a Company", "question__title_slug": "naming-a-company", "question__hide": false, - "total_acs": 7566, - "total_submitted": 21967, + "total_acs": 7628, + "total_submitted": 22123, "frontend_question_id": 2306, "is_new_question": false }, @@ -3488,8 +3787,8 @@ "question__title": "Design a Text Editor", "question__title_slug": "design-a-text-editor", "question__hide": false, - "total_acs": 13159, - "total_submitted": 33221, + "total_acs": 13491, + "total_submitted": 33900, "frontend_question_id": 2296, "is_new_question": false }, @@ -3511,8 +3810,8 @@ "question__title": "Replace Elements in an Array", "question__title_slug": "replace-elements-in-an-array", "question__hide": false, - "total_acs": 24424, - "total_submitted": 42365, + "total_acs": 24749, + "total_submitted": 42944, "frontend_question_id": 2295, "is_new_question": false }, @@ -3534,8 +3833,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": 25929, - "total_submitted": 35786, + "total_acs": 26616, + "total_submitted": 36702, "frontend_question_id": 2294, "is_new_question": false }, @@ -3557,8 +3856,8 @@ "question__title": "Min Max Game", "question__title_slug": "min-max-game", "question__hide": false, - "total_acs": 30774, - "total_submitted": 47935, + "total_acs": 31313, + "total_submitted": 48717, "frontend_question_id": 2293, "is_new_question": false }, @@ -3580,8 +3879,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": 1549, - "total_submitted": 2263, + "total_acs": 1578, + "total_submitted": 2304, "frontend_question_id": 2237, "is_new_question": false }, @@ -3603,8 +3902,8 @@ "question__title": "Root Equals Sum of Children", "question__title_slug": "root-equals-sum-of-children", "question__hide": false, - "total_acs": 74957, - "total_submitted": 85721, + "total_acs": 79430, + "total_submitted": 91044, "frontend_question_id": 2236, "is_new_question": false }, @@ -3626,8 +3925,8 @@ "question__title": "Add Two Integers", "question__title_slug": "add-two-integers", "question__hide": false, - "total_acs": 148982, - "total_submitted": 165610, + "total_acs": 159254, + "total_submitted": 177541, "frontend_question_id": 2235, "is_new_question": false }, @@ -3649,8 +3948,8 @@ "question__title": "Dynamic Unpivoting of a Table", "question__title_slug": "dynamic-unpivoting-of-a-table", "question__hide": false, - "total_acs": 330, - "total_submitted": 496, + "total_acs": 340, + "total_submitted": 510, "frontend_question_id": 2253, "is_new_question": false }, @@ -3672,8 +3971,8 @@ "question__title": "Dynamic Pivoting of a Table", "question__title_slug": "dynamic-pivoting-of-a-table", "question__hide": false, - "total_acs": 499, - "total_submitted": 898, + "total_acs": 527, + "total_submitted": 945, "frontend_question_id": 2252, "is_new_question": false }, @@ -3695,8 +3994,8 @@ "question__title": "Booking Concert Tickets in Groups", "question__title_slug": "booking-concert-tickets-in-groups", "question__hide": false, - "total_acs": 3742, - "total_submitted": 23797, + "total_acs": 3790, + "total_submitted": 24174, "frontend_question_id": 2286, "is_new_question": false }, @@ -3718,8 +4017,8 @@ "question__title": "Maximum Total Importance of Roads", "question__title_slug": "maximum-total-importance-of-roads", "question__hide": false, - "total_acs": 20859, - "total_submitted": 34378, + "total_acs": 21266, + "total_submitted": 34989, "frontend_question_id": 2285, "is_new_question": false }, @@ -3741,8 +4040,8 @@ "question__title": "Sender With Largest Word Count", "question__title_slug": "sender-with-largest-word-count", "question__hide": false, - "total_acs": 23034, - "total_submitted": 41103, + "total_acs": 23364, + "total_submitted": 41690, "frontend_question_id": 2284, "is_new_question": false }, @@ -3764,8 +4063,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": 30484, - "total_submitted": 41441, + "total_acs": 31121, + "total_submitted": 42315, "frontend_question_id": 2283, "is_new_question": false }, @@ -3787,8 +4086,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": 3103, - "total_submitted": 4115, + "total_acs": 3253, + "total_submitted": 4309, "frontend_question_id": 2238, "is_new_question": false }, @@ -3810,8 +4109,8 @@ "question__title": "Minimum Obstacle Removal to Reach Corner", "question__title_slug": "minimum-obstacle-removal-to-reach-corner", "question__hide": false, - "total_acs": 13355, - "total_submitted": 27207, + "total_acs": 14062, + "total_submitted": 28812, "frontend_question_id": 2290, "is_new_question": false }, @@ -3833,8 +4132,8 @@ "question__title": "Steps to Make Array Non-decreasing", "question__title_slug": "steps-to-make-array-non-decreasing", "question__hide": false, - "total_acs": 12060, - "total_submitted": 56296, + "total_acs": 12320, + "total_submitted": 57584, "frontend_question_id": 2289, "is_new_question": false }, @@ -3856,8 +4155,8 @@ "question__title": "Apply Discount to Prices", "question__title_slug": "apply-discount-to-prices", "question__hide": false, - "total_acs": 15305, - "total_submitted": 56120, + "total_acs": 15518, + "total_submitted": 56744, "frontend_question_id": 2288, "is_new_question": false }, @@ -3879,8 +4178,8 @@ "question__title": "Rearrange Characters to Make Target String", "question__title_slug": "rearrange-characters-to-make-target-string", "question__hide": false, - "total_acs": 26048, - "total_submitted": 45116, + "total_acs": 26478, + "total_submitted": 45805, "frontend_question_id": 2287, "is_new_question": false }, @@ -3902,8 +4201,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": 2498, - "total_submitted": 4886, + "total_acs": 2566, + "total_submitted": 5032, "frontend_question_id": 2230, "is_new_question": false }, @@ -3925,8 +4224,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": 3569, - "total_submitted": 7965, + "total_acs": 3730, + "total_submitted": 8334, "frontend_question_id": 2228, "is_new_question": false }, @@ -3948,8 +4247,8 @@ "question__title": "Maximum Sum Score of Array", "question__title_slug": "maximum-sum-score-of-array", "question__hide": false, - "total_acs": 2257, - "total_submitted": 3732, + "total_acs": 2299, + "total_submitted": 3832, "frontend_question_id": 2219, "is_new_question": false }, @@ -3971,8 +4270,8 @@ "question__title": "Sum of Total Strength of Wizards", "question__title_slug": "sum-of-total-strength-of-wizards", "question__hide": false, - "total_acs": 11314, - "total_submitted": 40590, + "total_acs": 11891, + "total_submitted": 42496, "frontend_question_id": 2281, "is_new_question": false }, @@ -3994,8 +4293,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": 19094, - "total_submitted": 80341, + "total_acs": 19261, + "total_submitted": 80896, "frontend_question_id": 2280, "is_new_question": false }, @@ -4017,8 +4316,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": 29136, - "total_submitted": 46598, + "total_acs": 29487, + "total_submitted": 47118, "frontend_question_id": 2279, "is_new_question": false }, @@ -4040,8 +4339,8 @@ "question__title": "Percentage of Letter in String", "question__title_slug": "percentage-of-letter-in-string", "question__hide": false, - "total_acs": 36929, - "total_submitted": 49842, + "total_acs": 37823, + "total_submitted": 51043, "frontend_question_id": 2278, "is_new_question": false }, @@ -4063,8 +4362,8 @@ "question__title": "Longest Path With Different Adjacent Characters", "question__title_slug": "longest-path-with-different-adjacent-characters", "question__hide": false, - "total_acs": 12203, - "total_submitted": 27051, + "total_acs": 12572, + "total_submitted": 27860, "frontend_question_id": 2246, "is_new_question": false }, @@ -4086,8 +4385,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": 6382, - "total_submitted": 18109, + "total_acs": 6412, + "total_submitted": 18222, "frontend_question_id": 2245, "is_new_question": false }, @@ -4103,14 +4402,14 @@ { "stat": { "question_id": 2362, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "minimum-rounds-to-complete-all-tasks", + "question__article__has_video_solution": false, "question__title": "Minimum Rounds to Complete All Tasks", "question__title_slug": "minimum-rounds-to-complete-all-tasks", "question__hide": false, - "total_acs": 27508, - "total_submitted": 48106, + "total_acs": 28387, + "total_submitted": 49465, "frontend_question_id": 2244, "is_new_question": false }, @@ -4132,8 +4431,8 @@ "question__title": "Calculate Digit Sum of a String", "question__title_slug": "calculate-digit-sum-of-a-string", "question__hide": false, - "total_acs": 25255, - "total_submitted": 37769, + "total_acs": 25651, + "total_submitted": 38388, "frontend_question_id": 2243, "is_new_question": false }, @@ -4155,8 +4454,8 @@ "question__title": "Substring With Largest Variance", "question__title_slug": "substring-with-largest-variance", "question__hide": false, - "total_acs": 18954, - "total_submitted": 50870, + "total_acs": 20177, + "total_submitted": 53827, "frontend_question_id": 2272, "is_new_question": false }, @@ -4178,8 +4477,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": 11554, - "total_submitted": 35641, + "total_acs": 11814, + "total_submitted": 36270, "frontend_question_id": 2271, "is_new_question": false }, @@ -4201,8 +4500,8 @@ "question__title": "Number of Ways to Split Array", "question__title_slug": "number-of-ways-to-split-array", "question__hide": false, - "total_acs": 20191, - "total_submitted": 45608, + "total_acs": 20682, + "total_submitted": 46535, "frontend_question_id": 2270, "is_new_question": false }, @@ -4224,8 +4523,8 @@ "question__title": "Count Integers in Intervals", "question__title_slug": "count-integers-in-intervals", "question__hide": false, - "total_acs": 10976, - "total_submitted": 32328, + "total_acs": 11266, + "total_submitted": 32980, "frontend_question_id": 2276, "is_new_question": false }, @@ -4247,8 +4546,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": 18055, - "total_submitted": 24938, + "total_acs": 18312, + "total_submitted": 25286, "frontend_question_id": 2275, "is_new_question": false }, @@ -4270,8 +4569,8 @@ "question__title": "Maximum Consecutive Floors Without Special Floors", "question__title_slug": "maximum-consecutive-floors-without-special-floors", "question__hide": false, - "total_acs": 22816, - "total_submitted": 43771, + "total_acs": 23088, + "total_submitted": 44299, "frontend_question_id": 2274, "is_new_question": false }, @@ -4293,8 +4592,8 @@ "question__title": "Minimum Health to Beat Game", "question__title_slug": "minimum-health-to-beat-game", "question__hide": false, - "total_acs": 18126, - "total_submitted": 31536, + "total_acs": 19094, + "total_submitted": 33237, "frontend_question_id": 2214, "is_new_question": false }, @@ -4316,8 +4615,8 @@ "question__title": "Maximum Score of a Node Sequence", "question__title_slug": "maximum-score-of-a-node-sequence", "question__hide": false, - "total_acs": 8730, - "total_submitted": 23323, + "total_acs": 8819, + "total_submitted": 23577, "frontend_question_id": 2242, "is_new_question": false }, @@ -4339,8 +4638,8 @@ "question__title": "Design an ATM Machine", "question__title_slug": "design-an-atm-machine", "question__hide": false, - "total_acs": 11947, - "total_submitted": 30885, + "total_acs": 12096, + "total_submitted": 31262, "frontend_question_id": 2241, "is_new_question": false }, @@ -4362,8 +4661,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": 17822, - "total_submitted": 31362, + "total_acs": 18057, + "total_submitted": 31754, "frontend_question_id": 2240, "is_new_question": false }, @@ -4385,8 +4684,8 @@ "question__title": "Find Closest Number to Zero", "question__title_slug": "find-closest-number-to-zero", "question__hide": false, - "total_acs": 31022, - "total_submitted": 67693, + "total_acs": 31751, + "total_submitted": 69317, "frontend_question_id": 2239, "is_new_question": false }, @@ -4408,8 +4707,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": 11417, - "total_submitted": 30043, + "total_acs": 11542, + "total_submitted": 30392, "frontend_question_id": 2267, "is_new_question": false }, @@ -4431,8 +4730,8 @@ "question__title": "Count Number of Texts", "question__title_slug": "count-number-of-texts", "question__hide": false, - "total_acs": 13382, - "total_submitted": 28283, + "total_acs": 13569, + "total_submitted": 28725, "frontend_question_id": 2266, "is_new_question": false }, @@ -4454,8 +4753,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": 29802, - "total_submitted": 34821, + "total_acs": 30599, + "total_submitted": 35749, "frontend_question_id": 2265, "is_new_question": false }, @@ -4477,8 +4776,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": 26181, - "total_submitted": 44406, + "total_acs": 26687, + "total_submitted": 45247, "frontend_question_id": 2264, "is_new_question": false }, @@ -4500,8 +4799,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": 27829, - "total_submitted": 42611, + "total_acs": 28290, + "total_submitted": 43280, "frontend_question_id": 2224, "is_new_question": false }, @@ -4523,8 +4822,8 @@ "question__title": "Escape the Spreading Fire", "question__title_slug": "escape-the-spreading-fire", "question__hide": false, - "total_acs": 5723, - "total_submitted": 16525, + "total_acs": 5851, + "total_submitted": 16949, "frontend_question_id": 2258, "is_new_question": false }, @@ -4546,8 +4845,8 @@ "question__title": "Count Unguarded Cells in the Grid", "question__title_slug": "count-unguarded-cells-in-the-grid", "question__hide": false, - "total_acs": 11717, - "total_submitted": 22444, + "total_acs": 11858, + "total_submitted": 22676, "frontend_question_id": 2257, "is_new_question": false }, @@ -4569,8 +4868,8 @@ "question__title": "Minimum Average Difference", "question__title_slug": "minimum-average-difference", "question__hide": false, - "total_acs": 18281, - "total_submitted": 51202, + "total_acs": 18612, + "total_submitted": 51986, "frontend_question_id": 2256, "is_new_question": false }, @@ -4592,8 +4891,8 @@ "question__title": "Count Prefixes of a Given String", "question__title_slug": "count-prefixes-of-a-given-string", "question__hide": false, - "total_acs": 30427, - "total_submitted": 41501, + "total_acs": 31320, + "total_submitted": 42723, "frontend_question_id": 2255, "is_new_question": false }, @@ -4615,8 +4914,8 @@ "question__title": "Total Appeal of A String", "question__title_slug": "total-appeal-of-a-string", "question__hide": false, - "total_acs": 20039, - "total_submitted": 34412, + "total_acs": 20589, + "total_submitted": 35292, "frontend_question_id": 2262, "is_new_question": false }, @@ -4638,8 +4937,8 @@ "question__title": "K Divisible Elements Subarrays", "question__title_slug": "k-divisible-elements-subarrays", "question__hide": false, - "total_acs": 17697, - "total_submitted": 37260, + "total_acs": 18004, + "total_submitted": 37842, "frontend_question_id": 2261, "is_new_question": false }, @@ -4661,8 +4960,8 @@ "question__title": "Minimum Consecutive Cards to Pick Up", "question__title_slug": "minimum-consecutive-cards-to-pick-up", "question__hide": false, - "total_acs": 31387, - "total_submitted": 60493, + "total_acs": 32450, + "total_submitted": 62552, "frontend_question_id": 2260, "is_new_question": false }, @@ -4684,8 +4983,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": 39255, - "total_submitted": 83510, + "total_acs": 40570, + "total_submitted": 86417, "frontend_question_id": 2259, "is_new_question": false }, @@ -4707,8 +5006,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": 3079, - "total_submitted": 6117, + "total_acs": 3153, + "total_submitted": 6264, "frontend_question_id": 2205, "is_new_question": false }, @@ -4730,8 +5029,8 @@ "question__title": "Finding the Topic of Each Post", "question__title_slug": "finding-the-topic-of-each-post", "question__hide": false, - "total_acs": 1232, - "total_submitted": 2468, + "total_acs": 1268, + "total_submitted": 2538, "frontend_question_id": 2199, "is_new_question": false }, @@ -4753,8 +5052,8 @@ "question__title": "Number of Flowers in Full Bloom", "question__title_slug": "number-of-flowers-in-full-bloom", "question__hide": false, - "total_acs": 11148, - "total_submitted": 21437, + "total_acs": 11274, + "total_submitted": 21697, "frontend_question_id": 2251, "is_new_question": false }, @@ -4776,8 +5075,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": 10680, - "total_submitted": 31497, + "total_acs": 10811, + "total_submitted": 31828, "frontend_question_id": 2250, "is_new_question": false }, @@ -4799,8 +5098,8 @@ "question__title": "Count Lattice Points Inside a Circle", "question__title_slug": "count-lattice-points-inside-a-circle", "question__hide": false, - "total_acs": 16485, - "total_submitted": 32728, + "total_acs": 16684, + "total_submitted": 33136, "frontend_question_id": 2249, "is_new_question": false }, @@ -4822,8 +5121,8 @@ "question__title": "Intersection of Multiple Arrays", "question__title_slug": "intersection-of-multiple-arrays", "question__hide": false, - "total_acs": 36488, - "total_submitted": 52453, + "total_acs": 37731, + "total_submitted": 54225, "frontend_question_id": 2248, "is_new_question": false }, @@ -4845,8 +5144,8 @@ "question__title": "Maximum Total Beauty of the Gardens", "question__title_slug": "maximum-total-beauty-of-the-gardens", "question__hide": false, - "total_acs": 4772, - "total_submitted": 16944, + "total_acs": 4832, + "total_submitted": 17132, "frontend_question_id": 2234, "is_new_question": false }, @@ -4868,8 +5167,8 @@ "question__title": "Maximum Product After K Increments", "question__title_slug": "maximum-product-after-k-increments", "question__hide": false, - "total_acs": 20263, - "total_submitted": 49035, + "total_acs": 20471, + "total_submitted": 49600, "frontend_question_id": 2233, "is_new_question": false }, @@ -4891,8 +5190,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": 13211, - "total_submitted": 20403, + "total_acs": 13672, + "total_submitted": 21057, "frontend_question_id": 2232, "is_new_question": false }, @@ -4914,8 +5213,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": 26349, - "total_submitted": 43676, + "total_acs": 26762, + "total_submitted": 44264, "frontend_question_id": 2231, "is_new_question": false }, @@ -4937,8 +5236,8 @@ "question__title": "Sum of Scores of Built Strings", "question__title_slug": "sum-of-scores-of-built-strings", "question__hide": false, - "total_acs": 4670, - "total_submitted": 12761, + "total_acs": 4782, + "total_submitted": 12976, "frontend_question_id": 2223, "is_new_question": false }, @@ -4960,8 +5259,8 @@ "question__title": "Number of Ways to Select Buildings", "question__title_slug": "number-of-ways-to-select-buildings", "question__hide": false, - "total_acs": 21403, - "total_submitted": 41977, + "total_acs": 22239, + "total_submitted": 43420, "frontend_question_id": 2222, "is_new_question": false }, @@ -4983,8 +5282,8 @@ "question__title": "Find Triangular Sum of an Array", "question__title_slug": "find-triangular-sum-of-an-array", "question__hide": false, - "total_acs": 42733, - "total_submitted": 54030, + "total_acs": 44257, + "total_submitted": 55956, "frontend_question_id": 2221, "is_new_question": false }, @@ -5006,8 +5305,8 @@ "question__title": "Minimum Bit Flips to Convert Number", "question__title_slug": "minimum-bit-flips-to-convert-number", "question__hide": false, - "total_acs": 28109, - "total_submitted": 34173, + "total_acs": 28987, + "total_submitted": 35233, "frontend_question_id": 2220, "is_new_question": false }, @@ -5029,8 +5328,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": 3901, - "total_submitted": 7518, + "total_acs": 4054, + "total_submitted": 7853, "frontend_question_id": 2184, "is_new_question": false }, @@ -5052,8 +5351,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": 8097, - "total_submitted": 22728, + "total_acs": 8211, + "total_submitted": 22988, "frontend_question_id": 2203, "is_new_question": false }, @@ -5075,8 +5374,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": 28348, - "total_submitted": 43991, + "total_acs": 28631, + "total_submitted": 44358, "frontend_question_id": 2200, "is_new_question": false }, @@ -5098,8 +5397,8 @@ "question__title": "Longest Substring of One Repeating Character", "question__title_slug": "longest-substring-of-one-repeating-character", "question__hide": false, - "total_acs": 3057, - "total_submitted": 9841, + "total_acs": 3084, + "total_submitted": 9939, "frontend_question_id": 2213, "is_new_question": false }, @@ -5121,8 +5420,8 @@ "question__title": "Maximum Points in an Archery Competition", "question__title_slug": "maximum-points-in-an-archery-competition", "question__hide": false, - "total_acs": 10800, - "total_submitted": 22177, + "total_acs": 10941, + "total_submitted": 22407, "frontend_question_id": 2212, "is_new_question": false }, @@ -5144,8 +5443,8 @@ "question__title": "Count Collisions on a Road", "question__title_slug": "count-collisions-on-a-road", "question__hide": false, - "total_acs": 17182, - "total_submitted": 41182, + "total_acs": 17441, + "total_submitted": 41685, "frontend_question_id": 2211, "is_new_question": false }, @@ -5167,8 +5466,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": 26678, - "total_submitted": 46111, + "total_acs": 27135, + "total_submitted": 46789, "frontend_question_id": 2210, "is_new_question": false }, @@ -5190,8 +5489,8 @@ "question__title": "The Change in Global Rankings", "question__title_slug": "the-change-in-global-rankings", "question__hide": false, - "total_acs": 2994, - "total_submitted": 4377, + "total_acs": 3099, + "total_submitted": 4518, "frontend_question_id": 2175, "is_new_question": false }, @@ -5213,8 +5512,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": 3786, - "total_submitted": 5495, + "total_acs": 3829, + "total_submitted": 5559, "frontend_question_id": 2174, "is_new_question": false }, @@ -5236,8 +5535,8 @@ "question__title": "Longest Winning Streak", "question__title_slug": "longest-winning-streak", "question__hide": false, - "total_acs": 2133, - "total_submitted": 3560, + "total_acs": 2199, + "total_submitted": 3678, "frontend_question_id": 2173, "is_new_question": false }, @@ -5259,8 +5558,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": 22860, - "total_submitted": 37857, + "total_acs": 23223, + "total_submitted": 38451, "frontend_question_id": 2190, "is_new_question": false }, @@ -5282,8 +5581,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": 8764, - "total_submitted": 26035, + "total_acs": 8850, + "total_submitted": 26267, "frontend_question_id": 2209, "is_new_question": false }, @@ -5305,8 +5604,8 @@ "question__title": "Minimum Operations to Halve Array Sum", "question__title_slug": "minimum-operations-to-halve-array-sum", "question__hide": false, - "total_acs": 15689, - "total_submitted": 34841, + "total_acs": 15960, + "total_submitted": 35423, "frontend_question_id": 2208, "is_new_question": false }, @@ -5328,8 +5627,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": 13990, - "total_submitted": 42778, + "total_acs": 14152, + "total_submitted": 43168, "frontend_question_id": 2207, "is_new_question": false }, @@ -5351,8 +5650,8 @@ "question__title": "Divide Array Into Equal Pairs", "question__title_slug": "divide-array-into-equal-pairs", "question__hide": false, - "total_acs": 40396, - "total_submitted": 53996, + "total_acs": 41417, + "total_submitted": 55499, "frontend_question_id": 2206, "is_new_question": false }, @@ -5374,8 +5673,8 @@ "question__title": "Replace Non-Coprime Numbers in Array", "question__title_slug": "replace-non-coprime-numbers-in-array", "question__hide": false, - "total_acs": 10356, - "total_submitted": 26968, + "total_acs": 10474, + "total_submitted": 27223, "frontend_question_id": 2197, "is_new_question": false }, @@ -5397,8 +5696,8 @@ "question__title": "Create Binary Tree From Descriptions", "question__title_slug": "create-binary-tree-from-descriptions", "question__hide": false, - "total_acs": 22255, - "total_submitted": 30904, + "total_acs": 22572, + "total_submitted": 31321, "frontend_question_id": 2196, "is_new_question": false }, @@ -5420,8 +5719,8 @@ "question__title": "Append K Integers With Minimal Sum", "question__title_slug": "append-k-integers-with-minimal-sum", "question__hide": false, - "total_acs": 22404, - "total_submitted": 90036, + "total_acs": 22707, + "total_submitted": 91167, "frontend_question_id": 2195, "is_new_question": false }, @@ -5443,8 +5742,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": 36566, - "total_submitted": 42703, + "total_acs": 37636, + "total_submitted": 43983, "frontend_question_id": 2194, "is_new_question": false }, @@ -5466,8 +5765,8 @@ "question__title": "Unique Substrings With Equal Digit Frequency", "question__title_slug": "unique-substrings-with-equal-digit-frequency", "question__hide": false, - "total_acs": 1402, - "total_submitted": 2331, + "total_acs": 1450, + "total_submitted": 2424, "frontend_question_id": 2168, "is_new_question": false }, @@ -5489,8 +5788,8 @@ "question__title": "Order Two Columns Independently", "question__title_slug": "order-two-columns-independently", "question__hide": false, - "total_acs": 3471, - "total_submitted": 5466, + "total_acs": 3574, + "total_submitted": 5632, "frontend_question_id": 2159, "is_new_question": false }, @@ -5512,8 +5811,8 @@ "question__title": "Count Array Pairs Divisible by K", "question__title_slug": "count-array-pairs-divisible-by-k", "question__hide": false, - "total_acs": 10516, - "total_submitted": 36860, + "total_acs": 10757, + "total_submitted": 37531, "frontend_question_id": 2183, "is_new_question": false }, @@ -5535,8 +5834,8 @@ "question__title": "Construct String With Repeat Limit", "question__title_slug": "construct-string-with-repeat-limit", "question__hide": false, - "total_acs": 15439, - "total_submitted": 29805, + "total_acs": 15579, + "total_submitted": 30030, "frontend_question_id": 2182, "is_new_question": false }, @@ -5558,8 +5857,8 @@ "question__title": "Merge Nodes in Between Zeros", "question__title_slug": "merge-nodes-in-between-zeros", "question__hide": false, - "total_acs": 55033, - "total_submitted": 63375, + "total_acs": 56710, + "total_submitted": 65310, "frontend_question_id": 2181, "is_new_question": false }, @@ -5581,8 +5880,8 @@ "question__title": "Count Integers With Even Digit Sum", "question__title_slug": "count-integers-with-even-digit-sum", "question__hide": false, - "total_acs": 34008, - "total_submitted": 52738, + "total_acs": 34616, + "total_submitted": 53621, "frontend_question_id": 2180, "is_new_question": false }, @@ -5604,8 +5903,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": 19686, - "total_submitted": 35456, + "total_acs": 20278, + "total_submitted": 36744, "frontend_question_id": 2158, "is_new_question": false }, @@ -5627,8 +5926,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": 1327, - "total_submitted": 2643, + "total_acs": 1380, + "total_submitted": 2741, "frontend_question_id": 2153, "is_new_question": false }, @@ -5650,8 +5949,8 @@ "question__title": "Minimum Time to Finish the Race", "question__title_slug": "minimum-time-to-finish-the-race", "question__hide": false, - "total_acs": 8687, - "total_submitted": 20732, + "total_acs": 8801, + "total_submitted": 20978, "frontend_question_id": 2188, "is_new_question": false }, @@ -5673,8 +5972,8 @@ "question__title": "Minimum Time to Complete Trips", "question__title_slug": "minimum-time-to-complete-trips", "question__hide": false, - "total_acs": 27940, - "total_submitted": 87722, + "total_acs": 28356, + "total_submitted": 88781, "frontend_question_id": 2187, "is_new_question": false }, @@ -5696,8 +5995,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": 27602, - "total_submitted": 38392, + "total_acs": 27946, + "total_submitted": 38865, "frontend_question_id": 2186, "is_new_question": false }, @@ -5719,8 +6018,8 @@ "question__title": "Counting Words With a Given Prefix", "question__title_slug": "counting-words-with-a-given-prefix", "question__hide": false, - "total_acs": 47911, - "total_submitted": 62155, + "total_acs": 49247, + "total_submitted": 63915, "frontend_question_id": 2185, "is_new_question": false }, @@ -5742,8 +6041,8 @@ "question__title": "Maximum AND Sum of Array", "question__title_slug": "maximum-and-sum-of-array", "question__hide": false, - "total_acs": 8588, - "total_submitted": 18232, + "total_acs": 8859, + "total_submitted": 18732, "frontend_question_id": 2172, "is_new_question": false }, @@ -5765,8 +6064,8 @@ "question__title": "Removing Minimum Number of Magic Beans", "question__title_slug": "removing-minimum-number-of-magic-beans", "question__hide": false, - "total_acs": 19103, - "total_submitted": 45518, + "total_acs": 19312, + "total_submitted": 45988, "frontend_question_id": 2171, "is_new_question": false }, @@ -5788,8 +6087,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": 18069, - "total_submitted": 54413, + "total_acs": 18187, + "total_submitted": 54729, "frontend_question_id": 2170, "is_new_question": false }, @@ -5811,8 +6110,8 @@ "question__title": "Count Operations to Obtain Zero", "question__title_slug": "count-operations-to-obtain-zero", "question__hide": false, - "total_acs": 43812, - "total_submitted": 57995, + "total_acs": 44714, + "total_submitted": 59205, "frontend_question_id": 2169, "is_new_question": false }, @@ -5834,8 +6133,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": 1167, - "total_submitted": 2504, + "total_acs": 1194, + "total_submitted": 2548, "frontend_question_id": 2152, "is_new_question": false }, @@ -5857,8 +6156,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": 9526, - "total_submitted": 23743, + "total_acs": 9607, + "total_submitted": 23909, "frontend_question_id": 2167, "is_new_question": false }, @@ -5880,8 +6179,8 @@ "question__title": "Design Bitset", "question__title_slug": "design-bitset", "question__hide": false, - "total_acs": 17040, - "total_submitted": 54458, + "total_acs": 17344, + "total_submitted": 55097, "frontend_question_id": 2166, "is_new_question": false }, @@ -5903,8 +6202,8 @@ "question__title": "Smallest Value of the Rearranged Number", "question__title_slug": "smallest-value-of-the-rearranged-number", "question__hide": false, - "total_acs": 25204, - "total_submitted": 49249, + "total_acs": 25555, + "total_submitted": 49862, "frontend_question_id": 2165, "is_new_question": false }, @@ -5926,8 +6225,8 @@ "question__title": "Sort Even and Odd Indices Independently", "question__title_slug": "sort-even-and-odd-indices-independently", "question__hide": false, - "total_acs": 36055, - "total_submitted": 54117, + "total_acs": 36681, + "total_submitted": 55132, "frontend_question_id": 2164, "is_new_question": false }, @@ -5972,8 +6271,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": 4789, - "total_submitted": 9377, + "total_acs": 4899, + "total_submitted": 9573, "frontend_question_id": 2142, "is_new_question": false }, @@ -5995,8 +6294,8 @@ "question__title": "Count Good Triplets in an Array", "question__title_slug": "count-good-triplets-in-an-array", "question__hide": false, - "total_acs": 4823, - "total_submitted": 13126, + "total_acs": 4909, + "total_submitted": 13296, "frontend_question_id": 2179, "is_new_question": false }, @@ -6018,8 +6317,8 @@ "question__title": "Maximum Split of Positive Even Integers", "question__title_slug": "maximum-split-of-positive-even-integers", "question__hide": false, - "total_acs": 34887, - "total_submitted": 59010, + "total_acs": 35400, + "total_submitted": 59856, "frontend_question_id": 2178, "is_new_question": false }, @@ -6041,8 +6340,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": 28029, - "total_submitted": 44178, + "total_acs": 28534, + "total_submitted": 44913, "frontend_question_id": 2177, "is_new_question": false }, @@ -6064,8 +6363,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": 39670, - "total_submitted": 49390, + "total_acs": 40660, + "total_submitted": 50617, "frontend_question_id": 2176, "is_new_question": false }, @@ -6087,8 +6386,8 @@ "question__title": "Groups of Strings", "question__title_slug": "groups-of-strings", "question__hide": false, - "total_acs": 6819, - "total_submitted": 27095, + "total_acs": 6934, + "total_submitted": 27439, "frontend_question_id": 2157, "is_new_question": false }, @@ -6110,8 +6409,8 @@ "question__title": "Find Substring With Given Hash Value", "question__title_slug": "find-substring-with-given-hash-value", "question__hide": false, - "total_acs": 10577, - "total_submitted": 47971, + "total_acs": 10636, + "total_submitted": 48166, "frontend_question_id": 2156, "is_new_question": false }, @@ -6133,8 +6432,8 @@ "question__title": "Keep Multiplying Found Values by Two", "question__title_slug": "keep-multiplying-found-values-by-two", "question__hide": false, - "total_acs": 52252, - "total_submitted": 71322, + "total_acs": 53342, + "total_submitted": 72882, "frontend_question_id": 2154, "is_new_question": false }, @@ -6156,8 +6455,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": 1429, - "total_submitted": 2123, + "total_acs": 1444, + "total_submitted": 2149, "frontend_question_id": 2137, "is_new_question": false }, @@ -6179,8 +6478,8 @@ "question__title": "Maximum Good People Based on Statements", "question__title_slug": "maximum-good-people-based-on-statements", "question__hide": false, - "total_acs": 10113, - "total_submitted": 20872, + "total_acs": 10174, + "total_submitted": 20970, "frontend_question_id": 2151, "is_new_question": false }, @@ -6202,8 +6501,8 @@ "question__title": "Rearrange Array Elements by Sign", "question__title_slug": "rearrange-array-elements-by-sign", "question__hide": false, - "total_acs": 52717, - "total_submitted": 65023, + "total_acs": 54279, + "total_submitted": 66980, "frontend_question_id": 2149, "is_new_question": false }, @@ -6225,8 +6524,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": 29740, - "total_submitted": 48964, + "total_acs": 30144, + "total_submitted": 49598, "frontend_question_id": 2150, "is_new_question": false }, @@ -6248,8 +6547,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": 34937, - "total_submitted": 58271, + "total_acs": 35502, + "total_submitted": 59207, "frontend_question_id": 2148, "is_new_question": false }, @@ -6271,8 +6570,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": 28796, - "total_submitted": 37693, + "total_acs": 29084, + "total_submitted": 38076, "frontend_question_id": 2128, "is_new_question": false }, @@ -6294,8 +6593,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": 6624, - "total_submitted": 14212, + "total_acs": 6691, + "total_submitted": 14353, "frontend_question_id": 2163, "is_new_question": false }, @@ -6317,8 +6616,8 @@ "question__title": "Minimum Cost to Set Cooking Time", "question__title_slug": "minimum-cost-to-set-cooking-time", "question__hide": false, - "total_acs": 12181, - "total_submitted": 31048, + "total_acs": 12474, + "total_submitted": 31678, "frontend_question_id": 2162, "is_new_question": false }, @@ -6340,8 +6639,8 @@ "question__title": "Partition Array According to Given Pivot", "question__title_slug": "partition-array-according-to-given-pivot", "question__hide": false, - "total_acs": 36573, - "total_submitted": 43365, + "total_acs": 37597, + "total_submitted": 44550, "frontend_question_id": 2161, "is_new_question": false }, @@ -6363,8 +6662,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": 59008, - "total_submitted": 66978, + "total_acs": 61096, + "total_submitted": 69453, "frontend_question_id": 2160, "is_new_question": false }, @@ -6386,8 +6685,8 @@ "question__title": "Maximum Running Time of N Computers", "question__title_slug": "maximum-running-time-of-n-computers", "question__hide": false, - "total_acs": 10066, - "total_submitted": 25970, + "total_acs": 10167, + "total_submitted": 26195, "frontend_question_id": 2141, "is_new_question": false }, @@ -6409,8 +6708,8 @@ "question__title": "Solving Questions With Brainpower", "question__title_slug": "solving-questions-with-brainpower", "question__hide": false, - "total_acs": 22650, - "total_submitted": 49456, + "total_acs": 22846, + "total_submitted": 49844, "frontend_question_id": 2140, "is_new_question": false }, @@ -6432,8 +6731,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": 23147, - "total_submitted": 36549, + "total_acs": 23335, + "total_submitted": 36824, "frontend_question_id": 2155, "is_new_question": false }, @@ -6455,8 +6754,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": 30971, - "total_submitted": 47528, + "total_acs": 31421, + "total_submitted": 48184, "frontend_question_id": 2138, "is_new_question": false }, @@ -6478,8 +6777,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": 576, - "total_submitted": 1395, + "total_acs": 583, + "total_submitted": 1416, "frontend_question_id": 2123, "is_new_question": false }, @@ -6501,8 +6800,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": 1288, - "total_submitted": 1758, + "total_acs": 1294, + "total_submitted": 1768, "frontend_question_id": 2113, "is_new_question": false }, @@ -6524,8 +6823,8 @@ "question__title": "Earliest Possible Day of Full Bloom", "question__title_slug": "earliest-possible-day-of-full-bloom", "question__hide": false, - "total_acs": 9949, - "total_submitted": 14523, + "total_acs": 43845, + "total_submitted": 58384, "frontend_question_id": 2136, "is_new_question": false }, @@ -6547,8 +6846,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": 27345, - "total_submitted": 63890, + "total_acs": 27689, + "total_submitted": 64698, "frontend_question_id": 2135, "is_new_question": false }, @@ -6570,8 +6869,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": 18726, - "total_submitted": 37123, + "total_acs": 19084, + "total_submitted": 37754, "frontend_question_id": 2134, "is_new_question": false }, @@ -6593,8 +6892,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": 42019, - "total_submitted": 79654, + "total_acs": 42964, + "total_submitted": 81409, "frontend_question_id": 2133, "is_new_question": false }, @@ -6616,8 +6915,8 @@ "question__title": "Build the Equation", "question__title_slug": "build-the-equation", "question__hide": false, - "total_acs": 1222, - "total_submitted": 2116, + "total_acs": 1249, + "total_submitted": 2175, "frontend_question_id": 2118, "is_new_question": false }, @@ -6639,8 +6938,8 @@ "question__title": "The Airport With the Most Traffic", "question__title_slug": "the-airport-with-the-most-traffic", "question__hide": false, - "total_acs": 4339, - "total_submitted": 6089, + "total_acs": 4452, + "total_submitted": 6236, "frontend_question_id": 2112, "is_new_question": false }, @@ -6662,8 +6961,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": 8699, - "total_submitted": 21772, + "total_acs": 8797, + "total_submitted": 22057, "frontend_question_id": 2147, "is_new_question": false }, @@ -6685,8 +6984,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": 10843, - "total_submitted": 26310, + "total_acs": 10971, + "total_submitted": 26621, "frontend_question_id": 2146, "is_new_question": false }, @@ -6708,8 +7007,8 @@ "question__title": "Count the Hidden Sequences", "question__title_slug": "count-the-hidden-sequences", "question__hide": false, - "total_acs": 13687, - "total_submitted": 37690, + "total_acs": 13805, + "total_submitted": 37927, "frontend_question_id": 2145, "is_new_question": false }, @@ -6731,8 +7030,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": 30019, - "total_submitted": 49332, + "total_acs": 30501, + "total_submitted": 50161, "frontend_question_id": 2144, "is_new_question": false }, @@ -6754,8 +7053,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": 1935, - "total_submitted": 3387, + "total_acs": 1958, + "total_submitted": 3421, "frontend_question_id": 2107, "is_new_question": false }, @@ -6777,8 +7076,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": 6850, - "total_submitted": 20773, + "total_acs": 7038, + "total_submitted": 21112, "frontend_question_id": 2127, "is_new_question": false }, @@ -6800,8 +7099,8 @@ "question__title": "Destroying Asteroids", "question__title_slug": "destroying-asteroids", "question__hide": false, - "total_acs": 23312, - "total_submitted": 47165, + "total_acs": 23618, + "total_submitted": 47785, "frontend_question_id": 2126, "is_new_question": false }, @@ -6823,8 +7122,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": 37907, - "total_submitted": 45853, + "total_acs": 38605, + "total_submitted": 46724, "frontend_question_id": 2125, "is_new_question": false }, @@ -6846,8 +7145,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": 42948, - "total_submitted": 60084, + "total_acs": 43859, + "total_submitted": 61322, "frontend_question_id": 2124, "is_new_question": false }, @@ -6869,8 +7168,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": 1812, - "total_submitted": 4671, + "total_acs": 1851, + "total_submitted": 4769, "frontend_question_id": 2098, "is_new_question": false }, @@ -6892,8 +7191,8 @@ "question__title": "Recover the Original Array", "question__title_slug": "recover-the-original-array", "question__hide": false, - "total_acs": 8165, - "total_submitted": 21433, + "total_acs": 8216, + "total_submitted": 21543, "frontend_question_id": 2122, "is_new_question": false }, @@ -6915,8 +7214,8 @@ "question__title": "Intervals Between Identical Elements", "question__title_slug": "intervals-between-identical-elements", "question__hide": false, - "total_acs": 13782, - "total_submitted": 31979, + "total_acs": 14156, + "total_submitted": 32717, "frontend_question_id": 2121, "is_new_question": false }, @@ -6938,8 +7237,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": 20273, - "total_submitted": 24255, + "total_acs": 20589, + "total_submitted": 24618, "frontend_question_id": 2120, "is_new_question": false }, @@ -6961,8 +7260,8 @@ "question__title": "A Number After a Double Reversal", "question__title_slug": "a-number-after-a-double-reversal", "question__hide": false, - "total_acs": 43258, - "total_submitted": 57180, + "total_acs": 44571, + "total_submitted": 58864, "frontend_question_id": 2119, "is_new_question": false }, @@ -6984,8 +7283,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": 32722, - "total_submitted": 79023, + "total_acs": 86467, + "total_submitted": 175688, "frontend_question_id": 2131, "is_new_question": false }, @@ -7007,8 +7306,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": 70634, - "total_submitted": 86683, + "total_acs": 72451, + "total_submitted": 89013, "frontend_question_id": 2130, "is_new_question": false }, @@ -7030,8 +7329,8 @@ "question__title": "Capitalize the Title", "question__title_slug": "capitalize-the-title", "question__hide": false, - "total_acs": 33140, - "total_submitted": 55081, + "total_acs": 33896, + "total_submitted": 56351, "frontend_question_id": 2129, "is_new_question": false }, @@ -7053,8 +7352,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": 10207, - "total_submitted": 27074, + "total_acs": 10282, + "total_submitted": 27229, "frontend_question_id": 2111, "is_new_question": false }, @@ -7076,8 +7375,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": 24920, - "total_submitted": 43370, + "total_acs": 25240, + "total_submitted": 43881, "frontend_question_id": 2110, "is_new_question": false }, @@ -7099,8 +7398,8 @@ "question__title": "Adding Spaces to a String", "question__title_slug": "adding-spaces-to-a-string", "question__hide": false, - "total_acs": 26673, - "total_submitted": 47407, + "total_acs": 26992, + "total_submitted": 47969, "frontend_question_id": 2109, "is_new_question": false }, @@ -7122,8 +7421,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": 66529, - "total_submitted": 84629, + "total_acs": 67956, + "total_submitted": 86427, "frontend_question_id": 2108, "is_new_question": false }, @@ -7145,8 +7444,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": 3203, - "total_submitted": 5689, + "total_acs": 3247, + "total_submitted": 5779, "frontend_question_id": 2093, "is_new_question": false }, @@ -7168,8 +7467,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": 7882, - "total_submitted": 22453, + "total_acs": 7949, + "total_submitted": 22639, "frontend_question_id": 2106, "is_new_question": false }, @@ -7191,8 +7490,8 @@ "question__title": "Watering Plants II", "question__title_slug": "watering-plants-ii", "question__hide": false, - "total_acs": 13782, - "total_submitted": 27503, + "total_acs": 13928, + "total_submitted": 27779, "frontend_question_id": 2105, "is_new_question": false }, @@ -7214,8 +7513,8 @@ "question__title": "Sum of Subarray Ranges", "question__title_slug": "sum-of-subarray-ranges", "question__hide": false, - "total_acs": 60662, - "total_submitted": 100798, + "total_acs": 61827, + "total_submitted": 102733, "frontend_question_id": 2104, "is_new_question": false }, @@ -7237,8 +7536,8 @@ "question__title": "Rings and Rods", "question__title_slug": "rings-and-rods", "question__hide": false, - "total_acs": 44241, - "total_submitted": 54304, + "total_acs": 45001, + "total_submitted": 55253, "frontend_question_id": 2103, "is_new_question": false }, @@ -7260,8 +7559,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": 4648, - "total_submitted": 6823, + "total_acs": 4705, + "total_submitted": 6903, "frontend_question_id": 2083, "is_new_question": false }, @@ -7283,8 +7582,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": 5611, - "total_submitted": 6150, + "total_acs": 5744, + "total_submitted": 6325, "frontend_question_id": 2084, "is_new_question": false }, @@ -7306,8 +7605,8 @@ "question__title": "The Number of Rich Customers", "question__title_slug": "the-number-of-rich-customers", "question__hide": false, - "total_acs": 6574, - "total_submitted": 8158, + "total_acs": 6701, + "total_submitted": 8336, "frontend_question_id": 2082, "is_new_question": false }, @@ -7329,8 +7628,8 @@ "question__title": "Abbreviating the Product of a Range", "question__title_slug": "abbreviating-the-product-of-a-range", "question__hide": false, - "total_acs": 2343, - "total_submitted": 8310, + "total_acs": 2361, + "total_submitted": 8396, "frontend_question_id": 2117, "is_new_question": false }, @@ -7352,8 +7651,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": 13198, - "total_submitted": 42007, + "total_acs": 13443, + "total_submitted": 42713, "frontend_question_id": 2116, "is_new_question": false }, @@ -7375,8 +7674,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": 54825, - "total_submitted": 113504, + "total_acs": 56199, + "total_submitted": 116202, "frontend_question_id": 2115, "is_new_question": false }, @@ -7398,8 +7697,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": 128847, - "total_submitted": 146065, + "total_acs": 133234, + "total_submitted": 151146, "frontend_question_id": 2114, "is_new_question": false }, @@ -7421,8 +7720,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": 2454, - "total_submitted": 4342, + "total_acs": 2481, + "total_submitted": 4396, "frontend_question_id": 2077, "is_new_question": false }, @@ -7444,8 +7743,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": 70399, - "total_submitted": 144126, + "total_acs": 72069, + "total_submitted": 147563, "frontend_question_id": 2096, "is_new_question": false }, @@ -7467,8 +7766,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": 153119, - "total_submitted": 252476, + "total_acs": 156128, + "total_submitted": 257848, "frontend_question_id": 2095, "is_new_question": false }, @@ -7490,8 +7789,8 @@ "question__title": "Finding 3-Digit Even Numbers", "question__title_slug": "finding-3-digit-even-numbers", "question__hide": false, - "total_acs": 19961, - "total_submitted": 34770, + "total_acs": 20227, + "total_submitted": 35269, "frontend_question_id": 2094, "is_new_question": false }, @@ -7513,8 +7812,8 @@ "question__title": "The Winner University", "question__title_slug": "the-winner-university", "question__hide": false, - "total_acs": 6297, - "total_submitted": 8689, + "total_acs": 6425, + "total_submitted": 8875, "frontend_question_id": 2072, "is_new_question": false }, @@ -7536,8 +7835,8 @@ "question__title": "Find All People With Secret", "question__title_slug": "find-all-people-with-secret", "question__hide": false, - "total_acs": 19135, - "total_submitted": 55989, + "total_acs": 19248, + "total_submitted": 56380, "frontend_question_id": 2092, "is_new_question": false }, @@ -7559,8 +7858,8 @@ "question__title": "Removing Minimum and Maximum From Array", "question__title_slug": "removing-minimum-and-maximum-from-array", "question__hide": false, - "total_acs": 25282, - "total_submitted": 44503, + "total_acs": 25654, + "total_submitted": 45254, "frontend_question_id": 2091, "is_new_question": false }, @@ -7582,8 +7881,8 @@ "question__title": "K Radius Subarray Averages", "question__title_slug": "k-radius-subarray-averages", "question__hide": false, - "total_acs": 20199, - "total_submitted": 47509, + "total_acs": 20485, + "total_submitted": 48128, "frontend_question_id": 2090, "is_new_question": false }, @@ -7605,8 +7904,8 @@ "question__title": "Find Target Indices After Sorting Array", "question__title_slug": "find-target-indices-after-sorting-array", "question__hide": false, - "total_acs": 88595, - "total_submitted": 115299, + "total_acs": 90825, + "total_submitted": 118410, "frontend_question_id": 2089, "is_new_question": false }, @@ -7628,8 +7927,8 @@ "question__title": "Number of Equal Count Substrings", "question__title_slug": "number-of-equal-count-substrings", "question__hide": false, - "total_acs": 1617, - "total_submitted": 3285, + "total_acs": 1635, + "total_submitted": 3317, "frontend_question_id": 2067, "is_new_question": false }, @@ -7651,8 +7950,8 @@ "question__title": "Account Balance", "question__title_slug": "account-balance", "question__hide": false, - "total_acs": 5239, - "total_submitted": 6122, + "total_acs": 5360, + "total_submitted": 6257, "frontend_question_id": 2066, "is_new_question": false }, @@ -7674,8 +7973,8 @@ "question__title": "Sequentially Ordinal Rank Tracker", "question__title_slug": "sequentially-ordinal-rank-tracker", "question__hide": false, - "total_acs": 10614, - "total_submitted": 16040, + "total_acs": 10918, + "total_submitted": 16467, "frontend_question_id": 2102, "is_new_question": false }, @@ -7697,8 +7996,8 @@ "question__title": "Detonate the Maximum Bombs", "question__title_slug": "detonate-the-maximum-bombs", "question__hide": false, - "total_acs": 20504, - "total_submitted": 49926, + "total_acs": 21419, + "total_submitted": 51996, "frontend_question_id": 2101, "is_new_question": false }, @@ -7720,8 +8019,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": 17498, - "total_submitted": 35557, + "total_acs": 17822, + "total_submitted": 36152, "frontend_question_id": 2100, "is_new_question": false }, @@ -7743,8 +8042,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": 26519, - "total_submitted": 62272, + "total_acs": 27058, + "total_submitted": 63599, "frontend_question_id": 2099, "is_new_question": false }, @@ -7766,8 +8065,8 @@ "question__title": "Number of Spaces Cleaning Robot Cleaned", "question__title_slug": "number-of-spaces-cleaning-robot-cleaned", "question__hide": false, - "total_acs": 3236, - "total_submitted": 5910, + "total_acs": 3253, + "total_submitted": 5944, "frontend_question_id": 2061, "is_new_question": false }, @@ -7789,8 +8088,8 @@ "question__title": "Sum of k-Mirror Numbers", "question__title_slug": "sum-of-k-mirror-numbers", "question__hide": false, - "total_acs": 6016, - "total_submitted": 14277, + "total_acs": 6040, + "total_submitted": 14330, "frontend_question_id": 2081, "is_new_question": false }, @@ -7812,8 +8111,8 @@ "question__title": "Valid Arrangement of Pairs", "question__title_slug": "valid-arrangement-of-pairs", "question__hide": false, - "total_acs": 5960, - "total_submitted": 14544, + "total_acs": 6026, + "total_submitted": 14697, "frontend_question_id": 2097, "is_new_question": false }, @@ -7835,8 +8134,8 @@ "question__title": "Stamping the Grid", "question__title_slug": "stamping-the-grid", "question__hide": false, - "total_acs": 4794, - "total_submitted": 15648, + "total_acs": 4906, + "total_submitted": 15937, "frontend_question_id": 2132, "is_new_question": false }, @@ -7858,8 +8157,8 @@ "question__title": "Two Furthest Houses With Different Colors", "question__title_slug": "two-furthest-houses-with-different-colors", "question__hide": false, - "total_acs": 34674, - "total_submitted": 51590, + "total_acs": 35301, + "total_submitted": 52587, "frontend_question_id": 2078, "is_new_question": false }, @@ -7881,8 +8180,8 @@ "question__title": "Process Restricted Friend Requests", "question__title_slug": "process-restricted-friend-requests", "question__hide": false, - "total_acs": 12512, - "total_submitted": 23451, + "total_acs": 12579, + "total_submitted": 23602, "frontend_question_id": 2076, "is_new_question": false }, @@ -7904,8 +8203,8 @@ "question__title": "Decode the Slanted Ciphertext", "question__title_slug": "decode-the-slanted-ciphertext", "question__hide": false, - "total_acs": 9768, - "total_submitted": 19451, + "total_acs": 9882, + "total_submitted": 19682, "frontend_question_id": 2075, "is_new_question": false }, @@ -7927,8 +8226,8 @@ "question__title": "Reverse Nodes in Even Length Groups", "question__title_slug": "reverse-nodes-in-even-length-groups", "question__hide": false, - "total_acs": 13176, - "total_submitted": 25551, + "total_acs": 13382, + "total_submitted": 25831, "frontend_question_id": 2074, "is_new_question": false }, @@ -7950,8 +8249,8 @@ "question__title": "Time Needed to Buy Tickets", "question__title_slug": "time-needed-to-buy-tickets", "question__hide": false, - "total_acs": 32306, - "total_submitted": 52068, + "total_acs": 32913, + "total_submitted": 53073, "frontend_question_id": 2073, "is_new_question": false }, @@ -7973,8 +8272,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": 4507, - "total_submitted": 6121, + "total_acs": 4597, + "total_submitted": 6258, "frontend_question_id": 2051, "is_new_question": false }, @@ -7996,8 +8295,8 @@ "question__title": "Count Fertile Pyramids in a Land", "question__title_slug": "count-fertile-pyramids-in-a-land", "question__hide": false, - "total_acs": 5134, - "total_submitted": 8102, + "total_acs": 5196, + "total_submitted": 8186, "frontend_question_id": 2088, "is_new_question": false }, @@ -8019,8 +8318,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": 11878, - "total_submitted": 23154, + "total_acs": 12044, + "total_submitted": 23471, "frontend_question_id": 2087, "is_new_question": false }, @@ -8039,11 +8338,11 @@ "question__article__live": null, "question__article__slug": null, "question__article__has_video_solution": null, - "question__title": "Minimum Number of Buckets Required to Collect Rainwater from Houses", - "question__title_slug": "minimum-number-of-buckets-required-to-collect-rainwater-from-houses", + "question__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": 12920, - "total_submitted": 28668, + "total_acs": 13043, + "total_submitted": 28936, "frontend_question_id": 2086, "is_new_question": false }, @@ -8065,8 +8364,8 @@ "question__title": "Count Common Words With One Occurrence", "question__title_slug": "count-common-words-with-one-occurrence", "question__hide": false, - "total_acs": 35438, - "total_submitted": 50852, + "total_acs": 36315, + "total_submitted": 52100, "frontend_question_id": 2085, "is_new_question": false }, @@ -8088,8 +8387,8 @@ "question__title": "Maximum Path Quality of a Graph", "question__title_slug": "maximum-path-quality-of-a-graph", "question__hide": false, - "total_acs": 12978, - "total_submitted": 22465, + "total_acs": 13371, + "total_submitted": 23187, "frontend_question_id": 2065, "is_new_question": false }, @@ -8111,8 +8410,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": 16290, - "total_submitted": 32554, + "total_acs": 16529, + "total_submitted": 33099, "frontend_question_id": 2064, "is_new_question": false }, @@ -8134,8 +8433,8 @@ "question__title": "Vowels of All Substrings", "question__title_slug": "vowels-of-all-substrings", "question__hide": false, - "total_acs": 18722, - "total_submitted": 33977, + "total_acs": 19042, + "total_submitted": 34559, "frontend_question_id": 2063, "is_new_question": false }, @@ -8157,8 +8456,8 @@ "question__title": "Count Vowel Substrings of a String", "question__title_slug": "count-vowel-substrings-of-a-string", "question__hide": false, - "total_acs": 23110, - "total_submitted": 35096, + "total_acs": 23581, + "total_submitted": 35784, "frontend_question_id": 2062, "is_new_question": false }, @@ -8180,8 +8479,8 @@ "question__title": "Accepted Candidates From the Interviews", "question__title_slug": "accepted-candidates-from-the-interviews", "question__hide": false, - "total_acs": 5014, - "total_submitted": 6312, + "total_acs": 5136, + "total_submitted": 6465, "frontend_question_id": 2041, "is_new_question": false }, @@ -8203,8 +8502,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": 8549, - "total_submitted": 20932, + "total_acs": 8613, + "total_submitted": 21126, "frontend_question_id": 2060, "is_new_question": false }, @@ -8226,8 +8525,8 @@ "question__title": "Minimum Operations to Convert Number", "question__title_slug": "minimum-operations-to-convert-number", "question__hide": false, - "total_acs": 12105, - "total_submitted": 25619, + "total_acs": 12201, + "total_submitted": 25825, "frontend_question_id": 2059, "is_new_question": false }, @@ -8249,8 +8548,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": 20417, - "total_submitted": 35784, + "total_acs": 20649, + "total_submitted": 36178, "frontend_question_id": 2058, "is_new_question": false }, @@ -8272,8 +8571,8 @@ "question__title": "Smallest Index With Equal Value", "question__title_slug": "smallest-index-with-equal-value", "question__hide": false, - "total_acs": 34116, - "total_submitted": 47925, + "total_acs": 34751, + "total_submitted": 48836, "frontend_question_id": 2057, "is_new_question": false }, @@ -8295,8 +8594,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": 5992, - "total_submitted": 17225, + "total_acs": 6044, + "total_submitted": 17423, "frontend_question_id": 2071, "is_new_question": false }, @@ -8318,8 +8617,8 @@ "question__title": "Most Beautiful Item for Each Query", "question__title_slug": "most-beautiful-item-for-each-query", "question__hide": false, - "total_acs": 10740, - "total_submitted": 21644, + "total_acs": 10871, + "total_submitted": 21900, "frontend_question_id": 2070, "is_new_question": false }, @@ -8341,8 +8640,8 @@ "question__title": "Walking Robot Simulation II", "question__title_slug": "walking-robot-simulation-ii", "question__hide": false, - "total_acs": 7146, - "total_submitted": 31079, + "total_acs": 7220, + "total_submitted": 31394, "frontend_question_id": 2069, "is_new_question": false }, @@ -8364,8 +8663,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": 24310, - "total_submitted": 37617, + "total_acs": 25082, + "total_submitted": 38795, "frontend_question_id": 2068, "is_new_question": false }, @@ -8387,8 +8686,8 @@ "question__title": "Parallel Courses III", "question__title_slug": "parallel-courses-iii", "question__hide": false, - "total_acs": 15357, - "total_submitted": 25842, + "total_acs": 15627, + "total_submitted": 26290, "frontend_question_id": 2050, "is_new_question": false }, @@ -8410,8 +8709,8 @@ "question__title": "Count Nodes With the Highest Score", "question__title_slug": "count-nodes-with-the-highest-score", "question__hide": false, - "total_acs": 13751, - "total_submitted": 29190, + "total_acs": 13871, + "total_submitted": 29467, "frontend_question_id": 2049, "is_new_question": false }, @@ -8433,8 +8732,8 @@ "question__title": "Next Greater Numerically Balanced Number", "question__title_slug": "next-greater-numerically-balanced-number", "question__hide": false, - "total_acs": 10043, - "total_submitted": 21324, + "total_acs": 10099, + "total_submitted": 21445, "frontend_question_id": 2048, "is_new_question": false }, @@ -8456,8 +8755,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": 18823, - "total_submitted": 63883, + "total_acs": 19062, + "total_submitted": 64698, "frontend_question_id": 2047, "is_new_question": false }, @@ -8479,8 +8778,8 @@ "question__title": "Low-Quality Problems", "question__title_slug": "low-quality-problems", "question__hide": false, - "total_acs": 7139, - "total_submitted": 8350, + "total_acs": 7270, + "total_submitted": 8495, "frontend_question_id": 2026, "is_new_question": false }, @@ -8502,8 +8801,8 @@ "question__title": "Second Minimum Time to Reach Destination", "question__title_slug": "second-minimum-time-to-reach-destination", "question__hide": false, - "total_acs": 7866, - "total_submitted": 20406, + "total_acs": 7938, + "total_submitted": 20538, "frontend_question_id": 2045, "is_new_question": false }, @@ -8525,8 +8824,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": 17598, - "total_submitted": 23552, + "total_acs": 17828, + "total_submitted": 23828, "frontend_question_id": 2044, "is_new_question": false }, @@ -8548,8 +8847,8 @@ "question__title": "Simple Bank System", "question__title_slug": "simple-bank-system", "question__hide": false, - "total_acs": 15902, - "total_submitted": 24143, + "total_acs": 16104, + "total_submitted": 24481, "frontend_question_id": 2043, "is_new_question": false }, @@ -8571,8 +8870,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": 33945, - "total_submitted": 51483, + "total_acs": 34564, + "total_submitted": 52380, "frontend_question_id": 2042, "is_new_question": false }, @@ -8594,8 +8893,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": 6207, - "total_submitted": 8458, + "total_acs": 6387, + "total_submitted": 8671, "frontend_question_id": 2020, "is_new_question": false }, @@ -8617,8 +8916,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": 3199, - "total_submitted": 5417, + "total_acs": 3220, + "total_submitted": 5464, "frontend_question_id": 2056, "is_new_question": false }, @@ -8640,8 +8939,8 @@ "question__title": "Plates Between Candles", "question__title_slug": "plates-between-candles", "question__hide": false, - "total_acs": 24248, - "total_submitted": 54356, + "total_acs": 25142, + "total_submitted": 56604, "frontend_question_id": 2055, "is_new_question": false }, @@ -8663,8 +8962,8 @@ "question__title": "Two Best Non-Overlapping Events", "question__title_slug": "two-best-non-overlapping-events", "question__hide": false, - "total_acs": 11722, - "total_submitted": 26118, + "total_acs": 11880, + "total_submitted": 26436, "frontend_question_id": 2054, "is_new_question": false }, @@ -8686,8 +8985,8 @@ "question__title": "Kth Distinct String in an Array", "question__title_slug": "kth-distinct-string-in-an-array", "question__hide": false, - "total_acs": 34615, - "total_submitted": 48153, + "total_acs": 35496, + "total_submitted": 49442, "frontend_question_id": 2053, "is_new_question": false }, @@ -8709,8 +9008,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": 10190, - "total_submitted": 56050, + "total_acs": 10491, + "total_submitted": 57581, "frontend_question_id": 2035, "is_new_question": false }, @@ -8732,8 +9031,8 @@ "question__title": "Stock Price Fluctuation ", "question__title_slug": "stock-price-fluctuation", "question__hide": false, - "total_acs": 47947, - "total_submitted": 97246, + "total_acs": 49001, + "total_submitted": 99370, "frontend_question_id": 2034, "is_new_question": false }, @@ -8755,8 +9054,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": 17260, - "total_submitted": 33045, + "total_acs": 17569, + "total_submitted": 33541, "frontend_question_id": 2033, "is_new_question": false }, @@ -8778,8 +9077,8 @@ "question__title": "Two Out of Three", "question__title_slug": "two-out-of-three", "question__hide": false, - "total_acs": 37601, - "total_submitted": 51818, + "total_acs": 38258, + "total_submitted": 52723, "frontend_question_id": 2032, "is_new_question": false }, @@ -8801,8 +9100,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": 3107, - "total_submitted": 5419, + "total_acs": 3177, + "total_submitted": 5516, "frontend_question_id": 2010, "is_new_question": false }, @@ -8824,8 +9123,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": 5575, - "total_submitted": 14355, + "total_acs": 5635, + "total_submitted": 14527, "frontend_question_id": 2030, "is_new_question": false }, @@ -8847,8 +9146,8 @@ "question__title": "Stone Game IX", "question__title_slug": "stone-game-ix", "question__hide": false, - "total_acs": 5859, - "total_submitted": 22376, + "total_acs": 5910, + "total_submitted": 22528, "frontend_question_id": 2029, "is_new_question": false }, @@ -8870,8 +9169,8 @@ "question__title": "Find Missing Observations", "question__title_slug": "find-missing-observations", "question__hide": false, - "total_acs": 16815, - "total_submitted": 38623, + "total_acs": 17172, + "total_submitted": 39246, "frontend_question_id": 2028, "is_new_question": false }, @@ -8893,8 +9192,8 @@ "question__title": "Minimum Moves to Convert String", "question__title_slug": "minimum-moves-to-convert-string", "question__hide": false, - "total_acs": 23395, - "total_submitted": 43481, + "total_acs": 23736, + "total_submitted": 44172, "frontend_question_id": 2027, "is_new_question": false }, @@ -8916,8 +9215,8 @@ "question__title": "Subtree Removal Game with Fibonacci Tree", "question__title_slug": "subtree-removal-game-with-fibonacci-tree", "question__hide": false, - "total_acs": 378, - "total_submitted": 598, + "total_acs": 383, + "total_submitted": 610, "frontend_question_id": 2005, "is_new_question": false }, @@ -8939,8 +9238,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": 4998, - "total_submitted": 12860, + "total_acs": 5048, + "total_submitted": 12979, "frontend_question_id": 2004, "is_new_question": false }, @@ -8962,8 +9261,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": 9573, - "total_submitted": 18898, + "total_acs": 9699, + "total_submitted": 19119, "frontend_question_id": 2039, "is_new_question": false }, @@ -8985,8 +9284,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": 8368, - "total_submitted": 28790, + "total_acs": 8441, + "total_submitted": 29041, "frontend_question_id": 2040, "is_new_question": false }, @@ -9008,8 +9307,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": 18449, - "total_submitted": 31809, + "total_acs": 19132, + "total_submitted": 32924, "frontend_question_id": 2038, "is_new_question": false }, @@ -9031,8 +9330,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": 37373, - "total_submitted": 45499, + "total_acs": 38138, + "total_submitted": 46468, "frontend_question_id": 2037, "is_new_question": false }, @@ -9054,8 +9353,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": 5238, - "total_submitted": 15438, + "total_acs": 5282, + "total_submitted": 15606, "frontend_question_id": 2019, "is_new_question": false }, @@ -9077,8 +9376,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": 15146, - "total_submitted": 30726, + "total_acs": 15534, + "total_submitted": 31525, "frontend_question_id": 2018, "is_new_question": false }, @@ -9100,8 +9399,8 @@ "question__title": "Grid Game", "question__title_slug": "grid-game", "question__hide": false, - "total_acs": 12443, - "total_submitted": 29129, + "total_acs": 12724, + "total_submitted": 29677, "frontend_question_id": 2017, "is_new_question": false }, @@ -9123,8 +9422,8 @@ "question__title": "Maximum Difference Between Increasing Elements", "question__title_slug": "maximum-difference-between-increasing-elements", "question__hide": false, - "total_acs": 48179, - "total_submitted": 90232, + "total_acs": 49281, + "total_submitted": 92202, "frontend_question_id": 2016, "is_new_question": false }, @@ -9146,8 +9445,8 @@ "question__title": "Count the Number of Experiments", "question__title_slug": "count-the-number-of-experiments", "question__hide": false, - "total_acs": 4066, - "total_submitted": 7833, + "total_acs": 4151, + "total_submitted": 8009, "frontend_question_id": 1990, "is_new_question": false }, @@ -9169,8 +9468,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": 1370, - "total_submitted": 2338, + "total_acs": 1381, + "total_submitted": 2371, "frontend_question_id": 2015, "is_new_question": false }, @@ -9192,8 +9491,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": 1113, - "total_submitted": 2229, + "total_acs": 1128, + "total_submitted": 2279, "frontend_question_id": 1999, "is_new_question": false }, @@ -9215,8 +9514,8 @@ "question__title": "Longest Subsequence Repeated k Times", "question__title_slug": "longest-subsequence-repeated-k-times", "question__hide": false, - "total_acs": 5199, - "total_submitted": 9339, + "total_acs": 5258, + "total_submitted": 9445, "frontend_question_id": 2014, "is_new_question": false }, @@ -9238,8 +9537,8 @@ "question__title": "Detect Squares", "question__title_slug": "detect-squares", "question__hide": false, - "total_acs": 38199, - "total_submitted": 76220, + "total_acs": 38959, + "total_submitted": 77621, "frontend_question_id": 2013, "is_new_question": false }, @@ -9261,8 +9560,8 @@ "question__title": "Sum of Beauty in the Array", "question__title_slug": "sum-of-beauty-in-the-array", "question__hide": false, - "total_acs": 16742, - "total_submitted": 35859, + "total_acs": 16888, + "total_submitted": 36195, "frontend_question_id": 2012, "is_new_question": false }, @@ -9284,8 +9583,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": 163290, - "total_submitted": 183779, + "total_acs": 168194, + "total_submitted": 189441, "frontend_question_id": 2011, "is_new_question": false }, @@ -9307,8 +9606,8 @@ "question__title": "Find Cutoff Score for Each School", "question__title_slug": "find-cutoff-score-for-each-school", "question__hide": false, - "total_acs": 6540, - "total_submitted": 9269, + "total_acs": 6778, + "total_submitted": 9597, "frontend_question_id": 1988, "is_new_question": false }, @@ -9330,8 +9629,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": 6193, - "total_submitted": 19326, + "total_acs": 6244, + "total_submitted": 19468, "frontend_question_id": 2025, "is_new_question": false }, @@ -9353,8 +9652,8 @@ "question__title": "Maximize the Confusion of an Exam", "question__title_slug": "maximize-the-confusion-of-an-exam", "question__hide": false, - "total_acs": 20481, - "total_submitted": 34456, + "total_acs": 20998, + "total_submitted": 35187, "frontend_question_id": 2024, "is_new_question": false }, @@ -9376,8 +9675,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": 25777, - "total_submitted": 35359, + "total_acs": 26306, + "total_submitted": 36090, "frontend_question_id": 2023, "is_new_question": false }, @@ -9399,8 +9698,8 @@ "question__title": "Convert 1D Array Into 2D Array", "question__title_slug": "convert-1d-array-into-2d-array", "question__hide": false, - "total_acs": 47361, - "total_submitted": 81142, + "total_acs": 48260, + "total_submitted": 82735, "frontend_question_id": 2022, "is_new_question": false }, @@ -9422,8 +9721,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": 5958, - "total_submitted": 13469, + "total_acs": 5992, + "total_submitted": 13545, "frontend_question_id": 2003, "is_new_question": false }, @@ -9445,8 +9744,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": 14709, - "total_submitted": 27532, + "total_acs": 14944, + "total_submitted": 28060, "frontend_question_id": 2002, "is_new_question": false }, @@ -9468,8 +9767,8 @@ "question__title": "Number of Pairs of Interchangeable Rectangles", "question__title_slug": "number-of-pairs-of-interchangeable-rectangles", "question__hide": false, - "total_acs": 19826, - "total_submitted": 44345, + "total_acs": 20306, + "total_submitted": 45212, "frontend_question_id": 2001, "is_new_question": false }, @@ -9491,8 +9790,8 @@ "question__title": "Reverse Prefix of Word", "question__title_slug": "reverse-prefix-of-word", "question__hide": false, - "total_acs": 48030, - "total_submitted": 61811, + "total_acs": 49191, + "total_submitted": 63242, "frontend_question_id": 2000, "is_new_question": false }, @@ -9514,8 +9813,8 @@ "question__title": "Employees Whose Manager Left the Company", "question__title_slug": "employees-whose-manager-left-the-company", "question__hide": false, - "total_acs": 7190, - "total_submitted": 14231, + "total_acs": 7278, + "total_submitted": 14404, "frontend_question_id": 1978, "is_new_question": false }, @@ -9537,8 +9836,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": 6999, - "total_submitted": 9291, + "total_acs": 7050, + "total_submitted": 9364, "frontend_question_id": 1973, "is_new_question": false }, @@ -9560,8 +9859,8 @@ "question__title": "GCD Sort of an Array", "question__title_slug": "gcd-sort-of-an-array", "question__hide": false, - "total_acs": 6044, - "total_submitted": 13146, + "total_acs": 6124, + "total_submitted": 13340, "frontend_question_id": 1998, "is_new_question": false }, @@ -9583,8 +9882,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": 6953, - "total_submitted": 18987, + "total_acs": 7021, + "total_submitted": 19151, "frontend_question_id": 1997, "is_new_question": false }, @@ -9606,8 +9905,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": 87796, - "total_submitted": 199599, + "total_acs": 88596, + "total_submitted": 201350, "frontend_question_id": 1996, "is_new_question": false }, @@ -9629,8 +9928,8 @@ "question__title": "Count Special Quadruplets", "question__title_slug": "count-special-quadruplets", "question__hide": false, - "total_acs": 25957, - "total_submitted": 43967, + "total_acs": 26345, + "total_submitted": 44528, "frontend_question_id": 1995, "is_new_question": false }, @@ -9652,8 +9951,8 @@ "question__title": "Find if Path Exists in Graph", "question__title_slug": "find-if-path-exists-in-graph", "question__hide": false, - "total_acs": 144119, - "total_submitted": 285445, + "total_acs": 147390, + "total_submitted": 292221, "frontend_question_id": 1971, "is_new_question": false }, @@ -9675,8 +9974,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": 6003, - "total_submitted": 11079, + "total_acs": 6138, + "total_submitted": 11425, "frontend_question_id": 1972, "is_new_question": false }, @@ -9698,8 +9997,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": 9300, - "total_submitted": 20371, + "total_acs": 9619, + "total_submitted": 21014, "frontend_question_id": 2009, "is_new_question": false }, @@ -9721,8 +10020,8 @@ "question__title": "Maximum Earnings From Taxi", "question__title_slug": "maximum-earnings-from-taxi", "question__hide": false, - "total_acs": 18232, - "total_submitted": 42355, + "total_acs": 18587, + "total_submitted": 43116, "frontend_question_id": 2008, "is_new_question": false }, @@ -9744,8 +10043,8 @@ "question__title": "Find Original Array From Doubled Array", "question__title_slug": "find-original-array-from-doubled-array", "question__hide": false, - "total_acs": 113234, - "total_submitted": 276515, + "total_acs": 113724, + "total_submitted": 277884, "frontend_question_id": 2007, "is_new_question": false }, @@ -9767,8 +10066,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": 74195, - "total_submitted": 90254, + "total_acs": 75722, + "total_submitted": 92067, "frontend_question_id": 2006, "is_new_question": false }, @@ -9790,8 +10089,8 @@ "question__title": "Number of Unique Good Subsequences", "question__title_slug": "number-of-unique-good-subsequences", "question__hide": false, - "total_acs": 8543, - "total_submitted": 16321, + "total_acs": 8618, + "total_submitted": 16452, "frontend_question_id": 1987, "is_new_question": false }, @@ -9813,8 +10112,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": 16978, - "total_submitted": 51277, + "total_acs": 17267, + "total_submitted": 52210, "frontend_question_id": 1986, "is_new_question": false }, @@ -9836,8 +10135,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": 38894, - "total_submitted": 87212, + "total_acs": 39659, + "total_submitted": 88842, "frontend_question_id": 1985, "is_new_question": false }, @@ -9859,8 +10158,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": 32622, - "total_submitted": 61011, + "total_acs": 33817, + "total_submitted": 63169, "frontend_question_id": 1984, "is_new_question": false }, @@ -9882,8 +10181,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": 1985, - "total_submitted": 3032, + "total_acs": 2005, + "total_submitted": 3064, "frontend_question_id": 1966, "is_new_question": false }, @@ -9905,8 +10204,8 @@ "question__title": "Employees With Missing Information", "question__title_slug": "employees-with-missing-information", "question__hide": false, - "total_acs": 53171, - "total_submitted": 65740, + "total_acs": 55936, + "total_submitted": 69216, "frontend_question_id": 1965, "is_new_question": false }, @@ -9928,8 +10227,8 @@ "question__title": "Find Array Given Subset Sums", "question__title_slug": "find-array-given-subset-sums", "question__hide": false, - "total_acs": 3837, - "total_submitted": 7866, + "total_acs": 3867, + "total_submitted": 7930, "frontend_question_id": 1982, "is_new_question": false }, @@ -9951,8 +10250,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": 18487, - "total_submitted": 57077, + "total_acs": 18622, + "total_submitted": 57561, "frontend_question_id": 1981, "is_new_question": false }, @@ -9974,8 +10273,8 @@ "question__title": "Find Unique Binary String", "question__title_slug": "find-unique-binary-string", "question__hide": false, - "total_acs": 30301, - "total_submitted": 47214, + "total_acs": 30844, + "total_submitted": 48015, "frontend_question_id": 1980, "is_new_question": false }, @@ -9997,8 +10296,8 @@ "question__title": "Find Greatest Common Divisor of Array", "question__title_slug": "find-greatest-common-divisor-of-array", "question__hide": false, - "total_acs": 61349, - "total_submitted": 79842, + "total_acs": 62884, + "total_submitted": 81875, "frontend_question_id": 1979, "is_new_question": false }, @@ -10020,8 +10319,8 @@ "question__title": "The Number of Good Subsets", "question__title_slug": "the-number-of-good-subsets", "question__hide": false, - "total_acs": 4467, - "total_submitted": 13074, + "total_acs": 4543, + "total_submitted": 13280, "frontend_question_id": 1994, "is_new_question": false }, @@ -10043,8 +10342,8 @@ "question__title": "Operations on Tree", "question__title_slug": "operations-on-tree", "question__hide": false, - "total_acs": 8785, - "total_submitted": 20164, + "total_acs": 8922, + "total_submitted": 20439, "frontend_question_id": 1993, "is_new_question": false }, @@ -10066,8 +10365,8 @@ "question__title": "Find All Groups of Farmland", "question__title_slug": "find-all-groups-of-farmland", "question__hide": false, - "total_acs": 18707, - "total_submitted": 27311, + "total_acs": 18982, + "total_submitted": 27698, "frontend_question_id": 1992, "is_new_question": false }, @@ -10089,8 +10388,8 @@ "question__title": "Find the Middle Index in Array", "question__title_slug": "find-the-middle-index-in-array", "question__hide": false, - "total_acs": 46300, - "total_submitted": 68808, + "total_acs": 47639, + "total_submitted": 70768, "frontend_question_id": 1991, "is_new_question": false }, @@ -10112,8 +10411,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": 10537, - "total_submitted": 21289, + "total_acs": 10632, + "total_submitted": 21475, "frontend_question_id": 1970, "is_new_question": false }, @@ -10135,8 +10434,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": 8177, - "total_submitted": 24262, + "total_acs": 8244, + "total_submitted": 24419, "frontend_question_id": 1969, "is_new_question": false }, @@ -10158,8 +10457,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": 38776, - "total_submitted": 48547, + "total_acs": 39571, + "total_submitted": 49566, "frontend_question_id": 1967, "is_new_question": false }, @@ -10181,8 +10480,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": 6842, - "total_submitted": 9371, + "total_acs": 7010, + "total_submitted": 9580, "frontend_question_id": 1951, "is_new_question": false }, @@ -10204,8 +10503,8 @@ "question__title": "Strong Friendship", "question__title_slug": "strong-friendship", "question__hide": false, - "total_acs": 7468, - "total_submitted": 12740, + "total_acs": 7608, + "total_submitted": 13029, "frontend_question_id": 1949, "is_new_question": false }, @@ -10227,8 +10526,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": 9549, - "total_submitted": 20368, + "total_acs": 9605, + "total_submitted": 20471, "frontend_question_id": 1964, "is_new_question": false }, @@ -10250,8 +10549,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": 36534, - "total_submitted": 53511, + "total_acs": 37362, + "total_submitted": 54664, "frontend_question_id": 1963, "is_new_question": false }, @@ -10273,8 +10572,8 @@ "question__title": "Remove Stones to Minimize the Total", "question__title_slug": "remove-stones-to-minimize-the-total", "question__hide": false, - "total_acs": 22968, - "total_submitted": 39044, + "total_acs": 23496, + "total_submitted": 39824, "frontend_question_id": 1962, "is_new_question": false }, @@ -10296,8 +10595,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": 32014, - "total_submitted": 59089, + "total_acs": 32595, + "total_submitted": 60156, "frontend_question_id": 1961, "is_new_question": false }, @@ -10319,8 +10618,8 @@ "question__title": "Users That Actively Request Confirmation Messages", "question__title_slug": "users-that-actively-request-confirmation-messages", "question__hide": false, - "total_acs": 6908, - "total_submitted": 11205, + "total_acs": 7016, + "total_submitted": 11365, "frontend_question_id": 1939, "is_new_question": false }, @@ -10342,8 +10641,8 @@ "question__title": "Number of Ways to Separate Numbers", "question__title_slug": "number-of-ways-to-separate-numbers", "question__hide": false, - "total_acs": 3719, - "total_submitted": 17637, + "total_acs": 3777, + "total_submitted": 17992, "frontend_question_id": 1977, "is_new_question": false }, @@ -10365,8 +10664,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": 21606, - "total_submitted": 66566, + "total_acs": 22188, + "total_submitted": 68567, "frontend_question_id": 1976, "is_new_question": false }, @@ -10388,8 +10687,8 @@ "question__title": "Maximum Matrix Sum", "question__title_slug": "maximum-matrix-sum", "question__hide": false, - "total_acs": 12061, - "total_submitted": 26407, + "total_acs": 12183, + "total_submitted": 26654, "frontend_question_id": 1975, "is_new_question": false }, @@ -10411,8 +10710,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": 25722, - "total_submitted": 35992, + "total_acs": 26117, + "total_submitted": 36572, "frontend_question_id": 1974, "is_new_question": false }, @@ -10434,8 +10733,8 @@ "question__title": "Confirmation Rate", "question__title_slug": "confirmation-rate", "question__hide": false, - "total_acs": 8616, - "total_submitted": 11077, + "total_acs": 8732, + "total_submitted": 11222, "frontend_question_id": 1934, "is_new_question": false }, @@ -10457,8 +10756,8 @@ "question__title": "Count Number of Special Subsequences", "question__title_slug": "count-number-of-special-subsequences", "question__hide": false, - "total_acs": 8688, - "total_submitted": 16928, + "total_acs": 8734, + "total_submitted": 17021, "frontend_question_id": 1955, "is_new_question": false }, @@ -10480,8 +10779,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": 20017, - "total_submitted": 40447, + "total_acs": 20453, + "total_submitted": 41295, "frontend_question_id": 1968, "is_new_question": false }, @@ -10503,8 +10802,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": 17678, - "total_submitted": 45373, + "total_acs": 17873, + "total_submitted": 45771, "frontend_question_id": 1953, "is_new_question": false }, @@ -10526,8 +10825,8 @@ "question__title": "Three Divisors", "question__title_slug": "three-divisors", "question__hide": false, - "total_acs": 34286, - "total_submitted": 60064, + "total_acs": 34974, + "total_submitted": 61196, "frontend_question_id": 1952, "is_new_question": false }, @@ -10549,8 +10848,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": 1219, - "total_submitted": 2401, + "total_acs": 1231, + "total_submitted": 2439, "frontend_question_id": 2052, "is_new_question": false }, @@ -10572,8 +10871,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": 6277, - "total_submitted": 14984, + "total_acs": 6332, + "total_submitted": 15099, "frontend_question_id": 1959, "is_new_question": false }, @@ -10595,8 +10894,8 @@ "question__title": "Check if Move is Legal", "question__title_slug": "check-if-move-is-legal", "question__hide": false, - "total_acs": 7964, - "total_submitted": 17965, + "total_acs": 8042, + "total_submitted": 18088, "frontend_question_id": 1958, "is_new_question": false }, @@ -10618,8 +10917,8 @@ "question__title": "Delete Duplicate Folders in System", "question__title_slug": "delete-duplicate-folders-in-system", "question__hide": false, - "total_acs": 6489, - "total_submitted": 11200, + "total_acs": 6563, + "total_submitted": 11334, "frontend_question_id": 1948, "is_new_question": false }, @@ -10641,8 +10940,8 @@ "question__title": "Maximum Compatibility Score Sum", "question__title_slug": "maximum-compatibility-score-sum", "question__hide": false, - "total_acs": 17346, - "total_submitted": 28494, + "total_acs": 17501, + "total_submitted": 28763, "frontend_question_id": 1947, "is_new_question": false }, @@ -10664,8 +10963,8 @@ "question__title": "Largest Number After Mutating Substring", "question__title_slug": "largest-number-after-mutating-substring", "question__hide": false, - "total_acs": 15990, - "total_submitted": 46318, + "total_acs": 16080, + "total_submitted": 46539, "frontend_question_id": 1946, "is_new_question": false }, @@ -10687,8 +10986,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": 33185, - "total_submitted": 54319, + "total_acs": 33674, + "total_submitted": 55097, "frontend_question_id": 1945, "is_new_question": false }, @@ -10710,8 +11009,8 @@ "question__title": "Brightest Position on Street", "question__title_slug": "brightest-position-on-street", "question__hide": false, - "total_acs": 3423, - "total_submitted": 5432, + "total_acs": 3486, + "total_submitted": 5537, "frontend_question_id": 2021, "is_new_question": false }, @@ -10756,8 +11055,8 @@ "question__title": "Minimum Time For K Virus Variants to Spread", "question__title_slug": "minimum-time-for-k-virus-variants-to-spread", "question__hide": false, - "total_acs": 591, - "total_submitted": 1273, + "total_acs": 595, + "total_submitted": 1277, "frontend_question_id": 1956, "is_new_question": false }, @@ -10779,8 +11078,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": 2248, - "total_submitted": 4490, + "total_acs": 2264, + "total_submitted": 4521, "frontend_question_id": 1950, "is_new_question": false }, @@ -10802,8 +11101,8 @@ "question__title": "Longest Common Subsequence Between Sorted Arrays", "question__title_slug": "longest-common-subsequence-between-sorted-arrays", "question__hide": false, - "total_acs": 4471, - "total_submitted": 5634, + "total_acs": 4511, + "total_submitted": 5688, "frontend_question_id": 1940, "is_new_question": false }, @@ -10825,8 +11124,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": 2491, - "total_submitted": 4942, + "total_acs": 2516, + "total_submitted": 5003, "frontend_question_id": 1933, "is_new_question": false }, @@ -10848,8 +11147,8 @@ "question__title": "Kth Smallest Subarray Sum", "question__title_slug": "kth-smallest-subarray-sum", "question__hide": false, - "total_acs": 2815, - "total_submitted": 5304, + "total_acs": 2845, + "total_submitted": 5372, "frontend_question_id": 1918, "is_new_question": false }, @@ -10871,8 +11170,8 @@ "question__title": "Maximum Genetic Difference Query", "question__title_slug": "maximum-genetic-difference-query", "question__hide": false, - "total_acs": 3992, - "total_submitted": 10086, + "total_acs": 4019, + "total_submitted": 10157, "frontend_question_id": 1938, "is_new_question": false }, @@ -10894,8 +11193,8 @@ "question__title": "Maximum Number of Points with Cost", "question__title_slug": "maximum-number-of-points-with-cost", "question__hide": false, - "total_acs": 51316, - "total_submitted": 141816, + "total_acs": 51752, + "total_submitted": 142970, "frontend_question_id": 1937, "is_new_question": false }, @@ -10917,8 +11216,8 @@ "question__title": "Add Minimum Number of Rungs", "question__title_slug": "add-minimum-number-of-rungs", "question__hide": false, - "total_acs": 21385, - "total_submitted": 49971, + "total_acs": 21551, + "total_submitted": 50355, "frontend_question_id": 1936, "is_new_question": false }, @@ -10940,8 +11239,8 @@ "question__title": "Check for Contradictions in Equations", "question__title_slug": "check-for-contradictions-in-equations", "question__hide": false, - "total_acs": 634, - "total_submitted": 1520, + "total_acs": 658, + "total_submitted": 1574, "frontend_question_id": 2307, "is_new_question": false }, @@ -10963,8 +11262,8 @@ "question__title": "Leetcodify Similar Friends", "question__title_slug": "leetcodify-similar-friends", "question__hide": false, - "total_acs": 3536, - "total_submitted": 8173, + "total_acs": 3576, + "total_submitted": 8257, "frontend_question_id": 1919, "is_new_question": false }, @@ -10986,8 +11285,8 @@ "question__title": "Leetcodify Friends Recommendations", "question__title_slug": "leetcodify-friends-recommendations", "question__hide": false, - "total_acs": 4274, - "total_submitted": 14858, + "total_acs": 4326, + "total_submitted": 15106, "frontend_question_id": 1917, "is_new_question": false }, @@ -11009,8 +11308,8 @@ "question__title": "Game of Nim", "question__title_slug": "game-of-nim", "question__hide": false, - "total_acs": 1171, - "total_submitted": 2056, + "total_acs": 1186, + "total_submitted": 2087, "frontend_question_id": 1908, "is_new_question": false }, @@ -11032,8 +11331,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": 7175, - "total_submitted": 12555, + "total_acs": 7220, + "total_submitted": 12646, "frontend_question_id": 1931, "is_new_question": false }, @@ -11055,8 +11354,8 @@ "question__title": "Merge BSTs to Create Single BST", "question__title_slug": "merge-bsts-to-create-single-bst", "question__hide": false, - "total_acs": 5656, - "total_submitted": 16016, + "total_acs": 5714, + "total_submitted": 16188, "frontend_question_id": 1932, "is_new_question": false }, @@ -11078,8 +11377,8 @@ "question__title": "Unique Length-3 Palindromic Subsequences", "question__title_slug": "unique-length-3-palindromic-subsequences", "question__hide": false, - "total_acs": 18852, - "total_submitted": 36467, + "total_acs": 19257, + "total_submitted": 37290, "frontend_question_id": 1930, "is_new_question": false }, @@ -11101,8 +11400,8 @@ "question__title": "Concatenation of Array", "question__title_slug": "concatenation-of-array", "question__hide": false, - "total_acs": 290970, - "total_submitted": 318028, + "total_acs": 300157, + "total_submitted": 328452, "frontend_question_id": 1929, "is_new_question": false }, @@ -11124,8 +11423,8 @@ "question__title": "Count Salary Categories", "question__title_slug": "count-salary-categories", "question__hide": false, - "total_acs": 7177, - "total_submitted": 11110, + "total_acs": 7282, + "total_submitted": 11289, "frontend_question_id": 1907, "is_new_question": false }, @@ -11147,8 +11446,8 @@ "question__title": "Jump Game VIII", "question__title_slug": "jump-game-viii", "question__hide": false, - "total_acs": 958, - "total_submitted": 1697, + "total_acs": 988, + "total_submitted": 1757, "frontend_question_id": 2297, "is_new_question": false }, @@ -11170,8 +11469,8 @@ "question__title": "Describe the Painting", "question__title_slug": "describe-the-painting", "question__hide": false, - "total_acs": 9148, - "total_submitted": 19083, + "total_acs": 9231, + "total_submitted": 19252, "frontend_question_id": 1943, "is_new_question": false }, @@ -11193,8 +11492,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": 12961, - "total_submitted": 32045, + "total_acs": 13064, + "total_submitted": 32263, "frontend_question_id": 1942, "is_new_question": false }, @@ -11216,8 +11515,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": 48371, - "total_submitted": 62938, + "total_acs": 49534, + "total_submitted": 64521, "frontend_question_id": 1941, "is_new_question": false }, @@ -11239,8 +11538,8 @@ "question__title": "Depth of BST Given Insertion Order", "question__title_slug": "depth-of-bst-given-insertion-order", "question__hide": false, - "total_acs": 1672, - "total_submitted": 3719, + "total_acs": 1683, + "total_submitted": 3745, "frontend_question_id": 1902, "is_new_question": false }, @@ -11262,8 +11561,8 @@ "question__title": "Longest Common Subpath", "question__title_slug": "longest-common-subpath", "question__hide": false, - "total_acs": 5614, - "total_submitted": 20256, + "total_acs": 5664, + "total_submitted": 20444, "frontend_question_id": 1923, "is_new_question": false }, @@ -11285,8 +11584,8 @@ "question__title": "Count Good Numbers", "question__title_slug": "count-good-numbers", "question__hide": false, - "total_acs": 19730, - "total_submitted": 51299, + "total_acs": 20086, + "total_submitted": 52274, "frontend_question_id": 1922, "is_new_question": false }, @@ -11308,8 +11607,8 @@ "question__title": "Eliminate Maximum Number of Monsters", "question__title_slug": "eliminate-maximum-number-of-monsters", "question__hide": false, - "total_acs": 18921, - "total_submitted": 50006, + "total_acs": 19139, + "total_submitted": 50598, "frontend_question_id": 1921, "is_new_question": false }, @@ -11331,8 +11630,8 @@ "question__title": "Build Array from Permutation", "question__title_slug": "build-array-from-permutation", "question__hide": false, - "total_acs": 243173, - "total_submitted": 265761, + "total_acs": 250042, + "total_submitted": 273648, "frontend_question_id": 1920, "is_new_question": false }, @@ -11354,8 +11653,8 @@ "question__title": "Find a Peak Element II", "question__title_slug": "find-a-peak-element-ii", "question__hide": false, - "total_acs": 29407, - "total_submitted": 55207, + "total_acs": 30083, + "total_submitted": 56474, "frontend_question_id": 1901, "is_new_question": false }, @@ -11377,8 +11676,8 @@ "question__title": "Page Recommendations II", "question__title_slug": "page-recommendations-ii", "question__hide": false, - "total_acs": 4560, - "total_submitted": 10192, + "total_acs": 4605, + "total_submitted": 10310, "frontend_question_id": 1892, "is_new_question": false }, @@ -11400,8 +11699,8 @@ "question__title": "Cutting Ribbons", "question__title_slug": "cutting-ribbons", "question__hide": false, - "total_acs": 48819, - "total_submitted": 101497, + "total_acs": 48997, + "total_submitted": 101815, "frontend_question_id": 1891, "is_new_question": false }, @@ -11423,8 +11722,8 @@ "question__title": "Number of Wonderful Substrings", "question__title_slug": "number-of-wonderful-substrings", "question__hide": false, - "total_acs": 9990, - "total_submitted": 22276, + "total_acs": 10065, + "total_submitted": 22401, "frontend_question_id": 1915, "is_new_question": false }, @@ -11446,8 +11745,8 @@ "question__title": "Cyclically Rotating a Grid", "question__title_slug": "cyclically-rotating-a-grid", "question__hide": false, - "total_acs": 10332, - "total_submitted": 21519, + "total_acs": 10396, + "total_submitted": 21644, "frontend_question_id": 1914, "is_new_question": false }, @@ -11469,8 +11768,8 @@ "question__title": "Maximum Product Difference Between Two Pairs", "question__title_slug": "maximum-product-difference-between-two-pairs", "question__hide": false, - "total_acs": 67747, - "total_submitted": 83208, + "total_acs": 69239, + "total_submitted": 85055, "frontend_question_id": 1913, "is_new_question": false }, @@ -11492,8 +11791,8 @@ "question__title": "The Latest Login in 2020", "question__title_slug": "the-latest-login-in-2020", "question__hide": false, - "total_acs": 35999, - "total_submitted": 44023, + "total_acs": 37705, + "total_submitted": 46102, "frontend_question_id": 1890, "is_new_question": false }, @@ -11515,8 +11814,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": 12895, - "total_submitted": 34382, + "total_acs": 13029, + "total_submitted": 34776, "frontend_question_id": 1928, "is_new_question": false }, @@ -11538,8 +11837,8 @@ "question__title": "Sum Game", "question__title_slug": "sum-game", "question__hide": false, - "total_acs": 7657, - "total_submitted": 16317, + "total_acs": 7748, + "total_submitted": 16505, "frontend_question_id": 1927, "is_new_question": false }, @@ -11561,8 +11860,8 @@ "question__title": "Nearest Exit from Entrance in Maze", "question__title_slug": "nearest-exit-from-entrance-in-maze", "question__hide": false, - "total_acs": 29132, - "total_submitted": 67563, + "total_acs": 29804, + "total_submitted": 69158, "frontend_question_id": 1926, "is_new_question": false }, @@ -11584,8 +11883,8 @@ "question__title": "Count Square Sum Triples", "question__title_slug": "count-square-sum-triples", "question__hide": false, - "total_acs": 27155, - "total_submitted": 39997, + "total_acs": 27596, + "total_submitted": 40633, "frontend_question_id": 1925, "is_new_question": false }, @@ -11607,8 +11906,8 @@ "question__title": "Count Pairs in Two Arrays", "question__title_slug": "count-pairs-in-two-arrays", "question__hide": false, - "total_acs": 3511, - "total_submitted": 5922, + "total_acs": 3628, + "total_submitted": 6114, "frontend_question_id": 1885, "is_new_question": false }, @@ -11630,8 +11929,8 @@ "question__title": "Count Sub Islands", "question__title_slug": "count-sub-islands", "question__hide": false, - "total_acs": 52950, - "total_submitted": 78087, + "total_acs": 54220, + "total_submitted": 79982, "frontend_question_id": 1905, "is_new_question": false }, @@ -11653,8 +11952,8 @@ "question__title": "Minimum Absolute Difference Queries", "question__title_slug": "minimum-absolute-difference-queries", "question__hide": false, - "total_acs": 8866, - "total_submitted": 20222, + "total_acs": 8941, + "total_submitted": 20374, "frontend_question_id": 1906, "is_new_question": false }, @@ -11676,8 +11975,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": 17892, - "total_submitted": 39160, + "total_acs": 17978, + "total_submitted": 39353, "frontend_question_id": 1904, "is_new_question": false }, @@ -11699,8 +11998,8 @@ "question__title": "Largest Odd Number in String", "question__title_slug": "largest-odd-number-in-string", "question__hide": false, - "total_acs": 43869, - "total_submitted": 78674, + "total_acs": 44965, + "total_submitted": 80657, "frontend_question_id": 1903, "is_new_question": false }, @@ -11722,8 +12021,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": 29059, - "total_submitted": 41381, + "total_acs": 29472, + "total_submitted": 41994, "frontend_question_id": 1884, "is_new_question": false }, @@ -11745,8 +12044,8 @@ "question__title": "Group Employees of the Same Salary", "question__title_slug": "group-employees-of-the-same-salary", "question__hide": false, - "total_acs": 7440, - "total_submitted": 9834, + "total_acs": 7556, + "total_submitted": 9980, "frontend_question_id": 1875, "is_new_question": false }, @@ -11768,8 +12067,8 @@ "question__title": "Minimize Product Sum of Two Arrays", "question__title_slug": "minimize-product-sum-of-two-arrays", "question__hide": false, - "total_acs": 14463, - "total_submitted": 15998, + "total_acs": 14606, + "total_submitted": 16160, "frontend_question_id": 1874, "is_new_question": false }, @@ -11791,8 +12090,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": 4361, - "total_submitted": 8415, + "total_acs": 4387, + "total_submitted": 8481, "frontend_question_id": 1900, "is_new_question": false }, @@ -11814,8 +12113,8 @@ "question__title": "Maximum Number of Removable Characters", "question__title_slug": "maximum-number-of-removable-characters", "question__hide": false, - "total_acs": 17910, - "total_submitted": 45668, + "total_acs": 18198, + "total_submitted": 46351, "frontend_question_id": 1898, "is_new_question": false }, @@ -11837,8 +12136,8 @@ "question__title": "Merge Triplets to Form Target Triplet", "question__title_slug": "merge-triplets-to-form-target-triplet", "question__hide": false, - "total_acs": 23735, - "total_submitted": 36919, + "total_acs": 24255, + "total_submitted": 37714, "frontend_question_id": 1899, "is_new_question": false }, @@ -11860,8 +12159,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": 25857, - "total_submitted": 43112, + "total_acs": 26151, + "total_submitted": 43629, "frontend_question_id": 1897, "is_new_question": false }, @@ -11883,8 +12182,8 @@ "question__title": "Calculate Special Bonus", "question__title_slug": "calculate-special-bonus", "question__hide": false, - "total_acs": 96316, - "total_submitted": 149381, + "total_acs": 101711, + "total_submitted": 158773, "frontend_question_id": 1873, "is_new_question": false }, @@ -11906,8 +12205,8 @@ "question__title": "Design Movie Rental System", "question__title_slug": "design-movie-rental-system", "question__hide": false, - "total_acs": 4545, - "total_submitted": 11029, + "total_acs": 4569, + "total_submitted": 11116, "frontend_question_id": 1912, "is_new_question": false }, @@ -11929,8 +12228,8 @@ "question__title": "Maximum Alternating Subsequence Sum", "question__title_slug": "maximum-alternating-subsequence-sum", "question__hide": false, - "total_acs": 20981, - "total_submitted": 35446, + "total_acs": 21302, + "total_submitted": 35963, "frontend_question_id": 1911, "is_new_question": false }, @@ -11952,8 +12251,8 @@ "question__title": "Remove All Occurrences of a Substring", "question__title_slug": "remove-all-occurrences-of-a-substring", "question__hide": false, - "total_acs": 43585, - "total_submitted": 58833, + "total_acs": 44825, + "total_submitted": 60471, "frontend_question_id": 1910, "is_new_question": false }, @@ -11975,8 +12274,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": 38006, - "total_submitted": 146052, + "total_acs": 38801, + "total_submitted": 148894, "frontend_question_id": 1909, "is_new_question": false }, @@ -11998,8 +12297,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": 24605, - "total_submitted": 42576, + "total_acs": 24707, + "total_submitted": 42755, "frontend_question_id": 1868, "is_new_question": false }, @@ -12021,8 +12320,8 @@ "question__title": "Minimum Space Wasted From Packaging", "question__title_slug": "minimum-space-wasted-from-packaging", "question__hide": false, - "total_acs": 8950, - "total_submitted": 29203, + "total_acs": 9004, + "total_submitted": 29347, "frontend_question_id": 1889, "is_new_question": false }, @@ -12044,8 +12343,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": 15073, - "total_submitted": 39847, + "total_acs": 15364, + "total_submitted": 40490, "frontend_question_id": 1888, "is_new_question": false }, @@ -12067,8 +12366,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": 19258, - "total_submitted": 30894, + "total_acs": 19431, + "total_submitted": 31176, "frontend_question_id": 1887, "is_new_question": false }, @@ -12090,8 +12389,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": 44337, - "total_submitted": 80163, + "total_acs": 45128, + "total_submitted": 81451, "frontend_question_id": 1886, "is_new_question": false }, @@ -12113,8 +12412,8 @@ "question__title": "Orders With Maximum Quantity Above Average", "question__title_slug": "orders-with-maximum-quantity-above-average", "question__hide": false, - "total_acs": 10722, - "total_submitted": 14127, + "total_acs": 10940, + "total_submitted": 14418, "frontend_question_id": 1867, "is_new_question": false }, @@ -12136,8 +12435,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": 5243, - "total_submitted": 13591, + "total_acs": 5262, + "total_submitted": 13662, "frontend_question_id": 1883, "is_new_question": false }, @@ -12159,8 +12458,8 @@ "question__title": "Process Tasks Using Servers", "question__title_slug": "process-tasks-using-servers", "question__hide": false, - "total_acs": 22693, - "total_submitted": 57444, + "total_acs": 22929, + "total_submitted": 57944, "frontend_question_id": 1882, "is_new_question": false }, @@ -12182,8 +12481,8 @@ "question__title": "Maximum Value after Insertion", "question__title_slug": "maximum-value-after-insertion", "question__hide": false, - "total_acs": 20891, - "total_submitted": 57253, + "total_acs": 21100, + "total_submitted": 57757, "frontend_question_id": 1881, "is_new_question": false }, @@ -12205,8 +12504,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": 46039, - "total_submitted": 62488, + "total_acs": 46493, + "total_submitted": 63069, "frontend_question_id": 1880, "is_new_question": false }, @@ -12228,8 +12527,8 @@ "question__title": "Longest Word With All Prefixes", "question__title_slug": "longest-word-with-all-prefixes", "question__hide": false, - "total_acs": 5102, - "total_submitted": 7693, + "total_acs": 5204, + "total_submitted": 7830, "frontend_question_id": 1858, "is_new_question": false }, @@ -12251,8 +12550,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": 3055, - "total_submitted": 5565, + "total_acs": 3066, + "total_submitted": 5602, "frontend_question_id": 1896, "is_new_question": false }, @@ -12274,8 +12573,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": 887, - "total_submitted": 1768, + "total_acs": 897, + "total_submitted": 1806, "frontend_question_id": 2247, "is_new_question": false }, @@ -12297,8 +12596,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": 24846, - "total_submitted": 56913, + "total_acs": 25246, + "total_submitted": 57707, "frontend_question_id": 1894, "is_new_question": false }, @@ -12320,8 +12619,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": 26701, - "total_submitted": 52546, + "total_acs": 27244, + "total_submitted": 53537, "frontend_question_id": 1893, "is_new_question": false }, @@ -12343,8 +12642,8 @@ "question__title": "Convert Date Format", "question__title_slug": "convert-date-format", "question__hide": false, - "total_acs": 8820, - "total_submitted": 10032, + "total_acs": 8938, + "total_submitted": 10176, "frontend_question_id": 1853, "is_new_question": false }, @@ -12366,8 +12665,8 @@ "question__title": "Distinct Numbers in Each Subarray", "question__title_slug": "distinct-numbers-in-each-subarray", "question__hide": false, - "total_acs": 4863, - "total_submitted": 6823, + "total_acs": 4967, + "total_submitted": 6984, "frontend_question_id": 1852, "is_new_question": false }, @@ -12389,8 +12688,8 @@ "question__title": "Stone Game VIII", "question__title_slug": "stone-game-viii", "question__hide": false, - "total_acs": 6651, - "total_submitted": 12705, + "total_acs": 6711, + "total_submitted": 12809, "frontend_question_id": 1872, "is_new_question": false }, @@ -12412,8 +12711,8 @@ "question__title": "Jump Game VII", "question__title_slug": "jump-game-vii", "question__hide": false, - "total_acs": 29278, - "total_submitted": 116378, + "total_acs": 29614, + "total_submitted": 117672, "frontend_question_id": 1871, "is_new_question": false }, @@ -12435,8 +12734,8 @@ "question__title": "Minimum Speed to Arrive on Time", "question__title_slug": "minimum-speed-to-arrive-on-time", "question__hide": false, - "total_acs": 23982, - "total_submitted": 64235, + "total_acs": 24245, + "total_submitted": 64865, "frontend_question_id": 1870, "is_new_question": false }, @@ -12458,8 +12757,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": 34078, - "total_submitted": 56621, + "total_acs": 34436, + "total_submitted": 57156, "frontend_question_id": 1869, "is_new_question": false }, @@ -12481,8 +12780,8 @@ "question__title": "Suspicious Bank Accounts", "question__title_slug": "suspicious-bank-accounts", "question__hide": false, - "total_acs": 7275, - "total_submitted": 15130, + "total_acs": 7390, + "total_submitted": 15325, "frontend_question_id": 1843, "is_new_question": false }, @@ -12504,8 +12803,8 @@ "question__title": "Next Palindrome Using Same Digits", "question__title_slug": "next-palindrome-using-same-digits", "question__hide": false, - "total_acs": 4003, - "total_submitted": 7455, + "total_acs": 4099, + "total_submitted": 7664, "frontend_question_id": 1842, "is_new_question": false }, @@ -12527,8 +12826,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": 9621, - "total_submitted": 17380, + "total_acs": 9700, + "total_submitted": 17521, "frontend_question_id": 1866, "is_new_question": false }, @@ -12550,8 +12849,8 @@ "question__title": "Finding Pairs With a Certain Sum", "question__title_slug": "finding-pairs-with-a-certain-sum", "question__hide": false, - "total_acs": 18470, - "total_submitted": 36671, + "total_acs": 18594, + "total_submitted": 36899, "frontend_question_id": 1865, "is_new_question": false }, @@ -12573,8 +12872,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": 19833, - "total_submitted": 47022, + "total_acs": 20359, + "total_submitted": 48029, "frontend_question_id": 1864, "is_new_question": false }, @@ -12596,8 +12895,8 @@ "question__title": "Sum of All Subset XOR Totals", "question__title_slug": "sum-of-all-subset-xor-totals", "question__hide": false, - "total_acs": 44250, - "total_submitted": 56028, + "total_acs": 44975, + "total_submitted": 56946, "frontend_question_id": 1863, "is_new_question": false }, @@ -12619,8 +12918,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": 3890, - "total_submitted": 5655, + "total_acs": 3974, + "total_submitted": 5763, "frontend_question_id": 2046, "is_new_question": false }, @@ -12642,8 +12941,8 @@ "question__title": "League Statistics", "question__title_slug": "league-statistics", "question__hide": false, - "total_acs": 9278, - "total_submitted": 16182, + "total_acs": 9444, + "total_submitted": 16462, "frontend_question_id": 1841, "is_new_question": false }, @@ -12665,8 +12964,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": 11390, - "total_submitted": 24555, + "total_acs": 11464, + "total_submitted": 24712, "frontend_question_id": 1878, "is_new_question": false }, @@ -12688,8 +12987,8 @@ "question__title": "Minimum XOR Sum of Two Arrays", "question__title_slug": "minimum-xor-sum-of-two-arrays", "question__hide": false, - "total_acs": 9604, - "total_submitted": 21526, + "total_acs": 9695, + "total_submitted": 21697, "frontend_question_id": 1879, "is_new_question": false }, @@ -12711,8 +13010,8 @@ "question__title": "Minimize Maximum Pair Sum in Array", "question__title_slug": "minimize-maximum-pair-sum-in-array", "question__hide": false, - "total_acs": 61805, - "total_submitted": 76924, + "total_acs": 62705, + "total_submitted": 78040, "frontend_question_id": 1877, "is_new_question": false }, @@ -12734,8 +13033,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": 60335, - "total_submitted": 85929, + "total_acs": 61740, + "total_submitted": 87890, "frontend_question_id": 1876, "is_new_question": false }, @@ -12757,8 +13056,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": 13683, - "total_submitted": 33663, + "total_acs": 13825, + "total_submitted": 34011, "frontend_question_id": 1857, "is_new_question": false }, @@ -12780,8 +13079,8 @@ "question__title": "Maximum Subarray Min-Product", "question__title_slug": "maximum-subarray-min-product", "question__hide": false, - "total_acs": 18329, - "total_submitted": 48586, + "total_acs": 18529, + "total_submitted": 49101, "frontend_question_id": 1856, "is_new_question": false }, @@ -12797,14 +13096,14 @@ { "stat": { "question_id": 1984, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "maximum-distance-between-a-pair-of-values", + "question__article__has_video_solution": false, "question__title": "Maximum Distance Between a Pair of Values", "question__title_slug": "maximum-distance-between-a-pair-of-values", "question__hide": false, - "total_acs": 34584, - "total_submitted": 65756, + "total_acs": 35175, + "total_submitted": 66841, "frontend_question_id": 1855, "is_new_question": false }, @@ -12826,8 +13125,8 @@ "question__title": "Maximum Population Year", "question__title_slug": "maximum-population-year", "question__hide": false, - "total_acs": 40778, - "total_submitted": 68181, + "total_acs": 41478, + "total_submitted": 69229, "frontend_question_id": 1854, "is_new_question": false }, @@ -12849,8 +13148,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": 19709, - "total_submitted": 28419, + "total_acs": 20140, + "total_submitted": 29009, "frontend_question_id": 1836, "is_new_question": false }, @@ -12872,8 +13171,8 @@ "question__title": "Maximum Transaction Each Day", "question__title_slug": "maximum-transaction-each-day", "question__hide": false, - "total_acs": 10711, - "total_submitted": 12693, + "total_acs": 10882, + "total_submitted": 12886, "frontend_question_id": 1831, "is_new_question": false }, @@ -12895,8 +13194,8 @@ "question__title": "Faulty Sensor", "question__title_slug": "faulty-sensor", "question__hide": false, - "total_acs": 3160, - "total_submitted": 6415, + "total_acs": 3187, + "total_submitted": 6461, "frontend_question_id": 1826, "is_new_question": false }, @@ -12918,8 +13217,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": 1410, - "total_submitted": 2628, + "total_acs": 1438, + "total_submitted": 2684, "frontend_question_id": 1989, "is_new_question": false }, @@ -12941,8 +13240,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": 16291, - "total_submitted": 22636, + "total_acs": 16403, + "total_submitted": 22796, "frontend_question_id": 1850, "is_new_question": false }, @@ -12964,8 +13263,8 @@ "question__title": "Minimum Interval to Include Each Query", "question__title_slug": "minimum-interval-to-include-each-query", "question__hide": false, - "total_acs": 12570, - "total_submitted": 26299, + "total_acs": 12899, + "total_submitted": 26976, "frontend_question_id": 1851, "is_new_question": false }, @@ -12987,8 +13286,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": 16720, - "total_submitted": 51968, + "total_acs": 16911, + "total_submitted": 52440, "frontend_question_id": 1849, "is_new_question": false }, @@ -13010,8 +13309,8 @@ "question__title": "Minimum Distance to the Target Element", "question__title_slug": "minimum-distance-to-the-target-element", "question__hide": false, - "total_acs": 29819, - "total_submitted": 50858, + "total_acs": 30183, + "total_submitted": 51551, "frontend_question_id": 1848, "is_new_question": false }, @@ -13033,8 +13332,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": 12490, - "total_submitted": 13980, + "total_acs": 12639, + "total_submitted": 14140, "frontend_question_id": 1821, "is_new_question": false }, @@ -13056,8 +13355,8 @@ "question__title": "Rotating the Box", "question__title_slug": "rotating-the-box", "question__hide": false, - "total_acs": 35199, - "total_submitted": 54414, + "total_acs": 35811, + "total_submitted": 55356, "frontend_question_id": 1861, "is_new_question": false }, @@ -13079,8 +13378,8 @@ "question__title": "Incremental Memory Leak", "question__title_slug": "incremental-memory-leak", "question__hide": false, - "total_acs": 13973, - "total_submitted": 19515, + "total_acs": 14100, + "total_submitted": 19670, "frontend_question_id": 1860, "is_new_question": false }, @@ -13102,8 +13401,8 @@ "question__title": "Sorting the Sentence", "question__title_slug": "sorting-the-sentence", "question__hide": false, - "total_acs": 90271, - "total_submitted": 106873, + "total_acs": 92125, + "total_submitted": 109088, "frontend_question_id": 1859, "is_new_question": false }, @@ -13125,8 +13424,8 @@ "question__title": "Maximum Number of Accepted Invitations", "question__title_slug": "maximum-number-of-accepted-invitations", "question__hide": false, - "total_acs": 4731, - "total_submitted": 9487, + "total_acs": 4815, + "total_submitted": 9673, "frontend_question_id": 1820, "is_new_question": false }, @@ -13148,8 +13447,8 @@ "question__title": "Maximum Building Height", "question__title_slug": "maximum-building-height", "question__hide": false, - "total_acs": 5642, - "total_submitted": 15963, + "total_acs": 5668, + "total_submitted": 16048, "frontend_question_id": 1840, "is_new_question": false }, @@ -13171,8 +13470,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": 21970, - "total_submitted": 45279, + "total_acs": 22228, + "total_submitted": 45741, "frontend_question_id": 1839, "is_new_question": false }, @@ -13194,8 +13493,8 @@ "question__title": "Frequency of the Most Frequent Element", "question__title_slug": "frequency-of-the-most-frequent-element", "question__hide": false, - "total_acs": 32723, - "total_submitted": 85150, + "total_acs": 33519, + "total_submitted": 87124, "frontend_question_id": 1838, "is_new_question": false }, @@ -13217,8 +13516,8 @@ "question__title": "Sum of Digits in Base K", "question__title_slug": "sum-of-digits-in-base-k", "question__hide": false, - "total_acs": 33618, - "total_submitted": 43761, + "total_acs": 34094, + "total_submitted": 44373, "frontend_question_id": 1837, "is_new_question": false }, @@ -13240,8 +13539,8 @@ "question__title": "Find Interview Candidates", "question__title_slug": "find-interview-candidates", "question__hide": false, - "total_acs": 11215, - "total_submitted": 17172, + "total_acs": 11327, + "total_submitted": 17351, "frontend_question_id": 1811, "is_new_question": false }, @@ -13263,8 +13562,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": 12735, - "total_submitted": 21199, + "total_acs": 12850, + "total_submitted": 21377, "frontend_question_id": 1835, "is_new_question": false }, @@ -13286,8 +13585,8 @@ "question__title": "Single-Threaded CPU", "question__title_slug": "single-threaded-cpu", "question__hide": false, - "total_acs": 42630, - "total_submitted": 101677, + "total_acs": 43130, + "total_submitted": 102772, "frontend_question_id": 1834, "is_new_question": false }, @@ -13309,8 +13608,8 @@ "question__title": "Maximum Ice Cream Bars", "question__title_slug": "maximum-ice-cream-bars", "question__hide": false, - "total_acs": 38014, - "total_submitted": 58029, + "total_acs": 38419, + "total_submitted": 58626, "frontend_question_id": 1833, "is_new_question": false }, @@ -13332,8 +13631,8 @@ "question__title": "Check if the Sentence Is Pangram", "question__title_slug": "check-if-the-sentence-is-pangram", "question__hide": false, - "total_acs": 189190, - "total_submitted": 225240, + "total_acs": 193126, + "total_submitted": 230066, "frontend_question_id": 1832, "is_new_question": false }, @@ -13355,8 +13654,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": 2184, - "total_submitted": 4060, + "total_acs": 2193, + "total_submitted": 4075, "frontend_question_id": 1810, "is_new_question": false }, @@ -13378,8 +13677,8 @@ "question__title": "Ad-Free Sessions", "question__title_slug": "ad-free-sessions", "question__hide": false, - "total_acs": 11350, - "total_submitted": 18946, + "total_acs": 11486, + "total_submitted": 19192, "frontend_question_id": 1809, "is_new_question": false }, @@ -13401,8 +13700,8 @@ "question__title": "Closest Room", "question__title_slug": "closest-room", "question__hide": false, - "total_acs": 6491, - "total_submitted": 18469, + "total_acs": 6534, + "total_submitted": 18535, "frontend_question_id": 1847, "is_new_question": false }, @@ -13424,8 +13723,8 @@ "question__title": "Maximum Element After Decreasing and Rearranging", "question__title_slug": "maximum-element-after-decreasing-and-rearranging", "question__hide": false, - "total_acs": 17454, - "total_submitted": 29560, + "total_acs": 17646, + "total_submitted": 29850, "frontend_question_id": 1846, "is_new_question": false }, @@ -13447,8 +13746,8 @@ "question__title": "Seat Reservation Manager", "question__title_slug": "seat-reservation-manager", "question__hide": false, - "total_acs": 25363, - "total_submitted": 39403, + "total_acs": 25841, + "total_submitted": 40052, "frontend_question_id": 1845, "is_new_question": false }, @@ -13470,8 +13769,8 @@ "question__title": "Replace All Digits with Characters", "question__title_slug": "replace-all-digits-with-characters", "question__hide": false, - "total_acs": 50423, - "total_submitted": 63281, + "total_acs": 51460, + "total_submitted": 64498, "frontend_question_id": 1844, "is_new_question": false }, @@ -13493,8 +13792,8 @@ "question__title": "Finding MK Average", "question__title_slug": "finding-mk-average", "question__hide": false, - "total_acs": 9123, - "total_submitted": 25921, + "total_acs": 9251, + "total_submitted": 26208, "frontend_question_id": 1825, "is_new_question": false }, @@ -13516,8 +13815,8 @@ "question__title": "Minimum Sideway Jumps", "question__title_slug": "minimum-sideway-jumps", "question__hide": false, - "total_acs": 22365, - "total_submitted": 44997, + "total_acs": 22825, + "total_submitted": 45970, "frontend_question_id": 1824, "is_new_question": false }, @@ -13539,8 +13838,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": 71302, - "total_submitted": 91677, + "total_acs": 73178, + "total_submitted": 94004, "frontend_question_id": 1823, "is_new_question": false }, @@ -13562,8 +13861,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": 138137, - "total_submitted": 208429, + "total_acs": 140787, + "total_submitted": 212692, "frontend_question_id": 1822, "is_new_question": false }, @@ -13585,8 +13884,8 @@ "question__title": "Implement Trie II (Prefix Tree)", "question__title_slug": "implement-trie-ii-prefix-tree", "question__hide": false, - "total_acs": 10114, - "total_submitted": 16938, + "total_acs": 10313, + "total_submitted": 17284, "frontend_question_id": 1804, "is_new_question": false }, @@ -13608,8 +13907,8 @@ "question__title": "Rearrange Products Table", "question__title_slug": "rearrange-products-table", "question__hide": false, - "total_acs": 53922, - "total_submitted": 59705, + "total_acs": 56436, + "total_submitted": 62699, "frontend_question_id": 1795, "is_new_question": false }, @@ -13631,8 +13930,8 @@ "question__title": "Number of Different Subsequences GCDs", "question__title_slug": "number-of-different-subsequences-gcds", "question__hide": false, - "total_acs": 6718, - "total_submitted": 17447, + "total_acs": 6769, + "total_submitted": 17592, "frontend_question_id": 1819, "is_new_question": false }, @@ -13654,8 +13953,8 @@ "question__title": "Minimum Absolute Sum Difference", "question__title_slug": "minimum-absolute-sum-difference", "question__hide": false, - "total_acs": 18346, - "total_submitted": 60884, + "total_acs": 18528, + "total_submitted": 61433, "frontend_question_id": 1818, "is_new_question": false }, @@ -13677,8 +13976,8 @@ "question__title": "Finding the Users Active Minutes", "question__title_slug": "finding-the-users-active-minutes", "question__hide": false, - "total_acs": 41428, - "total_submitted": 51379, + "total_acs": 41921, + "total_submitted": 51994, "frontend_question_id": 1817, "is_new_question": false }, @@ -13700,8 +13999,8 @@ "question__title": "Truncate Sentence", "question__title_slug": "truncate-sentence", "question__hide": false, - "total_acs": 81023, - "total_submitted": 98885, + "total_acs": 82552, + "total_submitted": 100664, "frontend_question_id": 1816, "is_new_question": false }, @@ -13723,8 +14022,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": 1398, - "total_submitted": 2143, + "total_acs": 1405, + "total_submitted": 2155, "frontend_question_id": 1794, "is_new_question": false }, @@ -13746,8 +14045,8 @@ "question__title": "Primary Department for Each Employee", "question__title_slug": "primary-department-for-each-employee", "question__hide": false, - "total_acs": 13629, - "total_submitted": 17024, + "total_acs": 13769, + "total_submitted": 17194, "frontend_question_id": 1789, "is_new_question": false }, @@ -13769,8 +14068,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": 2724, - "total_submitted": 5537, + "total_acs": 2750, + "total_submitted": 5593, "frontend_question_id": 1830, "is_new_question": false }, @@ -13792,8 +14091,8 @@ "question__title": "Maximum XOR for Each Query", "question__title_slug": "maximum-xor-for-each-query", "question__hide": false, - "total_acs": 19876, - "total_submitted": 25829, + "total_acs": 20087, + "total_submitted": 26115, "frontend_question_id": 1829, "is_new_question": false }, @@ -13815,8 +14114,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": 50476, - "total_submitted": 58353, + "total_acs": 51282, + "total_submitted": 59252, "frontend_question_id": 1828, "is_new_question": false }, @@ -13838,8 +14137,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": 55362, - "total_submitted": 70808, + "total_acs": 56286, + "total_submitted": 72008, "frontend_question_id": 1827, "is_new_question": false }, @@ -13861,8 +14160,8 @@ "question__title": "Maximize the Beauty of the Garden", "question__title_slug": "maximize-the-beauty-of-the-garden", "question__hide": false, - "total_acs": 1596, - "total_submitted": 2406, + "total_acs": 1603, + "total_submitted": 2426, "frontend_question_id": 1788, "is_new_question": false }, @@ -13884,8 +14183,8 @@ "question__title": "Maximize Number of Nice Divisors", "question__title_slug": "maximize-number-of-nice-divisors", "question__hide": false, - "total_acs": 5122, - "total_submitted": 16393, + "total_acs": 5144, + "total_submitted": 16432, "frontend_question_id": 1808, "is_new_question": false }, @@ -13907,8 +14206,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": 14583, - "total_submitted": 20429, + "total_acs": 14682, + "total_submitted": 20572, "frontend_question_id": 1806, "is_new_question": false }, @@ -13930,8 +14229,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": 22135, - "total_submitted": 33187, + "total_acs": 22306, + "total_submitted": 33442, "frontend_question_id": 1807, "is_new_question": false }, @@ -13953,8 +14252,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": 31861, - "total_submitted": 88241, + "total_acs": 32254, + "total_submitted": 89190, "frontend_question_id": 1805, "is_new_question": false }, @@ -13976,8 +14275,8 @@ "question__title": "Grand Slam Titles", "question__title_slug": "grand-slam-titles", "question__hide": false, - "total_acs": 15341, - "total_submitted": 17258, + "total_acs": 15631, + "total_submitted": 17595, "frontend_question_id": 1783, "is_new_question": false }, @@ -13999,8 +14298,8 @@ "question__title": "Shortest Path in a Hidden Grid", "question__title_slug": "shortest-path-in-a-hidden-grid", "question__hide": false, - "total_acs": 4396, - "total_submitted": 11139, + "total_acs": 4413, + "total_submitted": 11213, "frontend_question_id": 1778, "is_new_question": false }, @@ -14022,8 +14321,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": 11913, - "total_submitted": 21951, + "total_acs": 12035, + "total_submitted": 22118, "frontend_question_id": 1798, "is_new_question": false }, @@ -14045,8 +14344,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": 13713, - "total_submitted": 43076, + "total_acs": 13942, + "total_submitted": 43731, "frontend_question_id": 1802, "is_new_question": false }, @@ -14068,8 +14367,8 @@ "question__title": "Number of Orders in the Backlog", "question__title_slug": "number-of-orders-in-the-backlog", "question__hide": false, - "total_acs": 14020, - "total_submitted": 29626, + "total_acs": 14216, + "total_submitted": 30018, "frontend_question_id": 1801, "is_new_question": false }, @@ -14091,8 +14390,8 @@ "question__title": "Maximum Ascending Subarray Sum", "question__title_slug": "maximum-ascending-subarray-sum", "question__hide": false, - "total_acs": 36533, - "total_submitted": 57267, + "total_acs": 36996, + "total_submitted": 57998, "frontend_question_id": 1800, "is_new_question": false }, @@ -14114,8 +14413,8 @@ "question__title": "Product's Price for Each Store", "question__title_slug": "products-price-for-each-store", "question__hide": false, - "total_acs": 14500, - "total_submitted": 16985, + "total_acs": 14692, + "total_submitted": 17197, "frontend_question_id": 1777, "is_new_question": false }, @@ -14137,8 +14436,8 @@ "question__title": "Count Nice Pairs in an Array", "question__title_slug": "count-nice-pairs-in-an-array", "question__hide": false, - "total_acs": 20403, - "total_submitted": 48602, + "total_acs": 20701, + "total_submitted": 49309, "frontend_question_id": 1814, "is_new_question": false }, @@ -14160,8 +14459,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": 4987, - "total_submitted": 12440, + "total_acs": 5033, + "total_submitted": 12513, "frontend_question_id": 1815, "is_new_question": false }, @@ -14183,8 +14482,8 @@ "question__title": "Sentence Similarity III", "question__title_slug": "sentence-similarity-iii", "question__hide": false, - "total_acs": 11695, - "total_submitted": 35385, + "total_acs": 11827, + "total_submitted": 35709, "frontend_question_id": 1813, "is_new_question": false }, @@ -14206,8 +14505,8 @@ "question__title": "Determine Color of a Chessboard Square", "question__title_slug": "determine-color-of-a-chessboard-square", "question__hide": false, - "total_acs": 47301, - "total_submitted": 61155, + "total_acs": 48070, + "total_submitted": 62117, "frontend_question_id": 1812, "is_new_question": false }, @@ -14229,8 +14528,8 @@ "question__title": "Sort Features by Popularity", "question__title_slug": "sort-features-by-popularity", "question__hide": false, - "total_acs": 4525, - "total_submitted": 6946, + "total_acs": 4557, + "total_submitted": 7007, "frontend_question_id": 1772, "is_new_question": false }, @@ -14252,8 +14551,8 @@ "question__title": "Maximum Score of a Good Subarray", "question__title_slug": "maximum-score-of-a-good-subarray", "question__hide": false, - "total_acs": 17703, - "total_submitted": 33180, + "total_acs": 17927, + "total_submitted": 33524, "frontend_question_id": 1793, "is_new_question": false }, @@ -14275,8 +14574,8 @@ "question__title": "Maximum Average Pass Ratio", "question__title_slug": "maximum-average-pass-ratio", "question__hide": false, - "total_acs": 17583, - "total_submitted": 33845, + "total_acs": 17739, + "total_submitted": 34094, "frontend_question_id": 1792, "is_new_question": false }, @@ -14298,8 +14597,8 @@ "question__title": "Find Center of Star Graph", "question__title_slug": "find-center-of-star-graph", "question__hide": false, - "total_acs": 111755, - "total_submitted": 133659, + "total_acs": 113639, + "total_submitted": 135949, "frontend_question_id": 1791, "is_new_question": false }, @@ -14321,8 +14620,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": 65345, - "total_submitted": 143112, + "total_acs": 66992, + "total_submitted": 146783, "frontend_question_id": 1790, "is_new_question": false }, @@ -14344,8 +14643,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": 6648, - "total_submitted": 7853, + "total_acs": 6750, + "total_submitted": 7999, "frontend_question_id": 1767, "is_new_question": false }, @@ -14367,8 +14666,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": 4119, - "total_submitted": 10406, + "total_acs": 4154, + "total_submitted": 10480, "frontend_question_id": 1787, "is_new_question": false }, @@ -14390,8 +14689,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": 16568, - "total_submitted": 42213, + "total_acs": 16754, + "total_submitted": 42630, "frontend_question_id": 1786, "is_new_question": false }, @@ -14413,8 +14712,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": 16163, - "total_submitted": 38138, + "total_acs": 16325, + "total_submitted": 38487, "frontend_question_id": 1785, "is_new_question": false }, @@ -14436,8 +14735,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": 28919, - "total_submitted": 71388, + "total_acs": 29291, + "total_submitted": 72398, "frontend_question_id": 1784, "is_new_question": false }, @@ -14459,8 +14758,8 @@ "question__title": "Buildings With an Ocean View", "question__title_slug": "buildings-with-an-ocean-view", "question__hide": false, - "total_acs": 133518, - "total_submitted": 168518, + "total_acs": 134374, + "total_submitted": 169639, "frontend_question_id": 1762, "is_new_question": false }, @@ -14482,8 +14781,8 @@ "question__title": "Recyclable and Low Fat Products", "question__title_slug": "recyclable-and-low-fat-products", "question__hide": false, - "total_acs": 188255, - "total_submitted": 200561, + "total_acs": 198084, + "total_submitted": 211270, "frontend_question_id": 1757, "is_new_question": false }, @@ -14505,8 +14804,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": 5457, - "total_submitted": 11648, + "total_acs": 5496, + "total_submitted": 11753, "frontend_question_id": 1803, "is_new_question": false }, @@ -14528,8 +14827,8 @@ "question__title": "Maximize Score After N Operations", "question__title_slug": "maximize-score-after-n-operations", "question__hide": false, - "total_acs": 14760, - "total_submitted": 32256, + "total_acs": 14875, + "total_submitted": 32485, "frontend_question_id": 1799, "is_new_question": false }, @@ -14551,8 +14850,8 @@ "question__title": "Design Authentication Manager", "question__title_slug": "design-authentication-manager", "question__hide": false, - "total_acs": 14165, - "total_submitted": 25231, + "total_acs": 14366, + "total_submitted": 25577, "frontend_question_id": 1797, "is_new_question": false }, @@ -14574,8 +14873,8 @@ "question__title": "Second Largest Digit in a String", "question__title_slug": "second-largest-digit-in-a-string", "question__hide": false, - "total_acs": 32930, - "total_submitted": 67148, + "total_acs": 33482, + "total_submitted": 68217, "frontend_question_id": 1796, "is_new_question": false }, @@ -14597,8 +14896,8 @@ "question__title": "Design Most Recently Used Queue", "question__title_slug": "design-most-recently-used-queue", "question__hide": false, - "total_acs": 7645, - "total_submitted": 9705, + "total_acs": 7725, + "total_submitted": 9821, "frontend_question_id": 1756, "is_new_question": false }, @@ -14620,8 +14919,8 @@ "question__title": "Car Fleet II", "question__title_slug": "car-fleet-ii", "question__hide": false, - "total_acs": 20590, - "total_submitted": 38646, + "total_acs": 20747, + "total_submitted": 38858, "frontend_question_id": 1776, "is_new_question": false }, @@ -14643,8 +14942,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": 22025, - "total_submitted": 41855, + "total_acs": 22408, + "total_submitted": 42569, "frontend_question_id": 1775, "is_new_question": false }, @@ -14666,8 +14965,8 @@ "question__title": "Closest Dessert Cost", "question__title_slug": "closest-dessert-cost", "question__hide": false, - "total_acs": 21308, - "total_submitted": 45497, + "total_acs": 21692, + "total_submitted": 46299, "frontend_question_id": 1774, "is_new_question": false }, @@ -14689,8 +14988,8 @@ "question__title": "Count Items Matching a Rule", "question__title_slug": "count-items-matching-a-rule", "question__hide": false, - "total_acs": 130551, - "total_submitted": 154904, + "total_acs": 132744, + "total_submitted": 157449, "frontend_question_id": 1773, "is_new_question": false }, @@ -14712,8 +15011,8 @@ "question__title": "Leetflex Banned Accounts", "question__title_slug": "leetflex-banned-accounts", "question__hide": false, - "total_acs": 12192, - "total_submitted": 17854, + "total_acs": 12486, + "total_submitted": 18293, "frontend_question_id": 1747, "is_new_question": false }, @@ -14735,8 +15034,8 @@ "question__title": "Maximize Palindrome Length From Subsequences", "question__title_slug": "maximize-palindrome-length-from-subsequences", "question__hide": false, - "total_acs": 8598, - "total_submitted": 24461, + "total_acs": 8648, + "total_submitted": 24587, "frontend_question_id": 1771, "is_new_question": false }, @@ -14758,8 +15057,8 @@ "question__title": "Maximum Score from Performing Multiplication Operations", "question__title_slug": "maximum-score-from-performing-multiplication-operations", "question__hide": false, - "total_acs": 86042, - "total_submitted": 236626, + "total_acs": 86774, + "total_submitted": 237804, "frontend_question_id": 1770, "is_new_question": false }, @@ -14781,8 +15080,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": 89208, - "total_submitted": 104489, + "total_acs": 90110, + "total_submitted": 105645, "frontend_question_id": 1769, "is_new_question": false }, @@ -14804,8 +15103,8 @@ "question__title": "Merge Strings Alternately", "question__title_slug": "merge-strings-alternately", "question__hide": false, - "total_acs": 78907, - "total_submitted": 103923, + "total_acs": 80427, + "total_submitted": 105857, "frontend_question_id": 1768, "is_new_question": false }, @@ -14827,8 +15126,8 @@ "question__title": "Maximum Subarray Sum After One Operation", "question__title_slug": "maximum-subarray-sum-after-one-operation", "question__hide": false, - "total_acs": 7172, - "total_submitted": 11530, + "total_acs": 7273, + "total_submitted": 11676, "frontend_question_id": 1746, "is_new_question": false }, @@ -14850,8 +15149,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": 54552, - "total_submitted": 59311, + "total_acs": 57046, + "total_submitted": 62118, "frontend_question_id": 1741, "is_new_question": false }, @@ -14873,8 +15172,8 @@ "question__title": "Count Pairs Of Nodes", "question__title_slug": "count-pairs-of-nodes", "question__hide": false, - "total_acs": 4977, - "total_submitted": 13112, + "total_acs": 5021, + "total_submitted": 13190, "frontend_question_id": 1782, "is_new_question": false }, @@ -14896,8 +15195,8 @@ "question__title": "Sum of Beauty of All Substrings", "question__title_slug": "sum-of-beauty-of-all-substrings", "question__hide": false, - "total_acs": 16440, - "total_submitted": 27195, + "total_acs": 16751, + "total_submitted": 27704, "frontend_question_id": 1781, "is_new_question": false }, @@ -14919,8 +15218,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": 28523, - "total_submitted": 43661, + "total_acs": 28806, + "total_submitted": 44075, "frontend_question_id": 1780, "is_new_question": false }, @@ -14942,8 +15241,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": 76473, - "total_submitted": 113771, + "total_acs": 78248, + "total_submitted": 116427, "frontend_question_id": 1779, "is_new_question": false }, @@ -14965,8 +15264,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": 18378, - "total_submitted": 44101, + "total_acs": 18569, + "total_submitted": 44532, "frontend_question_id": 1761, "is_new_question": false }, @@ -14988,8 +15287,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": 25515, - "total_submitted": 42338, + "total_acs": 25851, + "total_submitted": 42857, "frontend_question_id": 1760, "is_new_question": false }, @@ -15011,8 +15310,8 @@ "question__title": "Count Number of Homogenous Substrings", "question__title_slug": "count-number-of-homogenous-substrings", "question__hide": false, - "total_acs": 21948, - "total_submitted": 45888, + "total_acs": 22244, + "total_submitted": 46407, "frontend_question_id": 1759, "is_new_question": false }, @@ -15034,8 +15333,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": 31246, - "total_submitted": 53573, + "total_acs": 31535, + "total_submitted": 54062, "frontend_question_id": 1758, "is_new_question": false }, @@ -15057,8 +15356,8 @@ "question__title": "Find Distance in a Binary Tree", "question__title_slug": "find-distance-in-a-binary-tree", "question__hide": false, - "total_acs": 16021, - "total_submitted": 23345, + "total_acs": 16273, + "total_submitted": 23685, "frontend_question_id": 1740, "is_new_question": false }, @@ -15080,8 +15379,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": 15123, - "total_submitted": 29604, + "total_acs": 15417, + "total_submitted": 30303, "frontend_question_id": 1731, "is_new_question": false }, @@ -15103,8 +15402,8 @@ "question__title": "Closest Subsequence Sum", "question__title_slug": "closest-subsequence-sum", "question__hide": false, - "total_acs": 10692, - "total_submitted": 29193, + "total_acs": 10793, + "total_submitted": 29548, "frontend_question_id": 1755, "is_new_question": false }, @@ -15126,8 +15425,8 @@ "question__title": "Largest Merge Of Two Strings", "question__title_slug": "largest-merge-of-two-strings", "question__hide": false, - "total_acs": 16147, - "total_submitted": 35865, + "total_acs": 16299, + "total_submitted": 36155, "frontend_question_id": 1754, "is_new_question": false }, @@ -15149,8 +15448,8 @@ "question__title": "Maximum Score From Removing Stones", "question__title_slug": "maximum-score-from-removing-stones", "question__hide": false, - "total_acs": 26904, - "total_submitted": 40689, + "total_acs": 27254, + "total_submitted": 41194, "frontend_question_id": 1753, "is_new_question": false }, @@ -15172,8 +15471,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": 58573, - "total_submitted": 119140, + "total_acs": 60724, + "total_submitted": 123426, "frontend_question_id": 1752, "is_new_question": false }, @@ -15195,8 +15494,8 @@ "question__title": "Find Followers Count", "question__title_slug": "find-followers-count", "question__hide": false, - "total_acs": 40837, - "total_submitted": 57071, + "total_acs": 42678, + "total_submitted": 59730, "frontend_question_id": 1729, "is_new_question": false }, @@ -15218,8 +15517,8 @@ "question__title": "Map of Highest Peak", "question__title_slug": "map-of-highest-peak", "question__hide": false, - "total_acs": 19130, - "total_submitted": 31715, + "total_acs": 19356, + "total_submitted": 32068, "frontend_question_id": 1765, "is_new_question": false }, @@ -15241,8 +15540,8 @@ "question__title": "Tree of Coprimes", "question__title_slug": "tree-of-coprimes", "question__hide": false, - "total_acs": 6608, - "total_submitted": 17104, + "total_acs": 6794, + "total_submitted": 17391, "frontend_question_id": 1766, "is_new_question": false }, @@ -15264,8 +15563,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": 11671, - "total_submitted": 22127, + "total_acs": 11779, + "total_submitted": 22327, "frontend_question_id": 1764, "is_new_question": false }, @@ -15287,8 +15586,8 @@ "question__title": "Longest Nice Substring", "question__title_slug": "longest-nice-substring", "question__hide": false, - "total_acs": 31311, - "total_submitted": 50756, + "total_acs": 31953, + "total_submitted": 51786, "frontend_question_id": 1763, "is_new_question": false }, @@ -15310,8 +15609,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": 8553, - "total_submitted": 26048, + "total_acs": 8582, + "total_submitted": 26126, "frontend_question_id": 1744, "is_new_question": false }, @@ -15333,8 +15632,8 @@ "question__title": "Palindrome Partitioning IV", "question__title_slug": "palindrome-partitioning-iv", "question__hide": false, - "total_acs": 17899, - "total_submitted": 38663, + "total_acs": 18008, + "total_submitted": 39049, "frontend_question_id": 1745, "is_new_question": false }, @@ -15356,8 +15655,8 @@ "question__title": "Restore the Array From Adjacent Pairs", "question__title_slug": "restore-the-array-from-adjacent-pairs", "question__hide": false, - "total_acs": 30986, - "total_submitted": 45097, + "total_acs": 31300, + "total_submitted": 45590, "frontend_question_id": 1743, "is_new_question": false }, @@ -15379,8 +15678,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": 1918, - "total_submitted": 3735, + "total_acs": 1944, + "total_submitted": 3778, "frontend_question_id": 1724, "is_new_question": false }, @@ -15402,8 +15701,8 @@ "question__title": "Count Apples and Oranges", "question__title_slug": "count-apples-and-oranges", "question__hide": false, - "total_acs": 10968, - "total_submitted": 14106, + "total_acs": 11107, + "total_submitted": 14298, "frontend_question_id": 1715, "is_new_question": false }, @@ -15425,8 +15724,8 @@ "question__title": "Building Boxes", "question__title_slug": "building-boxes", "question__hide": false, - "total_acs": 5464, - "total_submitted": 10552, + "total_acs": 5491, + "total_submitted": 10597, "frontend_question_id": 1739, "is_new_question": false }, @@ -15448,8 +15747,8 @@ "question__title": "Find Kth Largest XOR Coordinate Value", "question__title_slug": "find-kth-largest-xor-coordinate-value", "question__hide": false, - "total_acs": 16792, - "total_submitted": 27307, + "total_acs": 16950, + "total_submitted": 27606, "frontend_question_id": 1738, "is_new_question": false }, @@ -15471,8 +15770,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": 10805, - "total_submitted": 30613, + "total_acs": 10867, + "total_submitted": 30775, "frontend_question_id": 1737, "is_new_question": false }, @@ -15494,8 +15793,8 @@ "question__title": "Latest Time by Replacing Hidden Digits", "question__title_slug": "latest-time-by-replacing-hidden-digits", "question__hide": false, - "total_acs": 25901, - "total_submitted": 61367, + "total_acs": 26166, + "total_submitted": 62082, "frontend_question_id": 1736, "is_new_question": false }, @@ -15517,8 +15816,8 @@ "question__title": "Biggest Window Between Visits", "question__title_slug": "biggest-window-between-visits", "question__hide": false, - "total_acs": 14293, - "total_submitted": 18354, + "total_acs": 14552, + "total_submitted": 18763, "frontend_question_id": 1709, "is_new_question": false }, @@ -15540,8 +15839,8 @@ "question__title": "Maximum Number of Events That Can Be Attended II", "question__title_slug": "maximum-number-of-events-that-can-be-attended-ii", "question__hide": false, - "total_acs": 18586, - "total_submitted": 33293, + "total_acs": 18817, + "total_submitted": 33656, "frontend_question_id": 1751, "is_new_question": false }, @@ -15563,8 +15862,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": 16510, - "total_submitted": 37934, + "total_acs": 16662, + "total_submitted": 38240, "frontend_question_id": 1750, "is_new_question": false }, @@ -15586,8 +15885,8 @@ "question__title": "Maximum Absolute Sum of Any Subarray", "question__title_slug": "maximum-absolute-sum-of-any-subarray", "question__hide": false, - "total_acs": 27508, - "total_submitted": 47276, + "total_acs": 27845, + "total_submitted": 47810, "frontend_question_id": 1749, "is_new_question": false }, @@ -15609,8 +15908,8 @@ "question__title": "Sum of Unique Elements", "question__title_slug": "sum-of-unique-elements", "question__hide": false, - "total_acs": 95137, - "total_submitted": 125819, + "total_acs": 96707, + "total_submitted": 127811, "frontend_question_id": 1748, "is_new_question": false }, @@ -15632,8 +15931,8 @@ "question__title": "Largest Subarray Length K", "question__title_slug": "largest-subarray-length-k", "question__hide": false, - "total_acs": 6456, - "total_submitted": 10177, + "total_acs": 6514, + "total_submitted": 10266, "frontend_question_id": 1708, "is_new_question": false }, @@ -15655,8 +15954,8 @@ "question__title": "Largest Submatrix With Rearrangements", "question__title_slug": "largest-submatrix-with-rearrangements", "question__hide": false, - "total_acs": 13957, - "total_submitted": 22952, + "total_acs": 14067, + "total_submitted": 23110, "frontend_question_id": 1727, "is_new_question": false }, @@ -15678,8 +15977,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": 45415, - "total_submitted": 61456, + "total_acs": 45893, + "total_submitted": 62102, "frontend_question_id": 1742, "is_new_question": false }, @@ -15701,8 +16000,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": 49926, - "total_submitted": 63441, + "total_acs": 50438, + "total_submitted": 64087, "frontend_question_id": 1725, "is_new_question": false }, @@ -15724,8 +16023,8 @@ "question__title": "Number of Calls Between Two Persons", "question__title_slug": "number-of-calls-between-two-persons", "question__hide": false, - "total_acs": 26950, - "total_submitted": 31396, + "total_acs": 27623, + "total_submitted": 32244, "frontend_question_id": 1699, "is_new_question": false }, @@ -15747,8 +16046,8 @@ "question__title": "Minimize Hamming Distance After Swap Operations", "question__title_slug": "minimize-hamming-distance-after-swap-operations", "question__hide": false, - "total_acs": 14290, - "total_submitted": 29388, + "total_acs": 14390, + "total_submitted": 29578, "frontend_question_id": 1722, "is_new_question": false }, @@ -15770,8 +16069,8 @@ "question__title": "Decode XORed Array", "question__title_slug": "decode-xored-array", "question__hide": false, - "total_acs": 92386, - "total_submitted": 107465, + "total_acs": 93879, + "total_submitted": 109254, "frontend_question_id": 1720, "is_new_question": false }, @@ -15793,8 +16092,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": 7007, - "total_submitted": 11100, + "total_acs": 7146, + "total_submitted": 11302, "frontend_question_id": 1698, "is_new_question": false }, @@ -15816,8 +16115,8 @@ "question__title": "Daily Leads and Partners", "question__title_slug": "daily-leads-and-partners", "question__hide": false, - "total_acs": 50345, - "total_submitted": 55762, + "total_acs": 52520, + "total_submitted": 58231, "frontend_question_id": 1693, "is_new_question": false }, @@ -15839,8 +16138,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": 3946, - "total_submitted": 7860, + "total_acs": 3985, + "total_submitted": 7954, "frontend_question_id": 1735, "is_new_question": false }, @@ -15862,8 +16161,8 @@ "question__title": "Decode XORed Permutation", "question__title_slug": "decode-xored-permutation", "question__hide": false, - "total_acs": 10854, - "total_submitted": 17424, + "total_acs": 10959, + "total_submitted": 17564, "frontend_question_id": 1734, "is_new_question": false }, @@ -15885,8 +16184,8 @@ "question__title": "Minimum Number of People to Teach", "question__title_slug": "minimum-number-of-people-to-teach", "question__hide": false, - "total_acs": 6972, - "total_submitted": 16692, + "total_acs": 7020, + "total_submitted": 16796, "frontend_question_id": 1733, "is_new_question": false }, @@ -15908,8 +16207,8 @@ "question__title": "Find the Highest Altitude", "question__title_slug": "find-the-highest-altitude", "question__hide": false, - "total_acs": 91902, - "total_submitted": 116820, + "total_acs": 93448, + "total_submitted": 118756, "frontend_question_id": 1732, "is_new_question": false }, @@ -15931,8 +16230,8 @@ "question__title": "Minimum Operations to Make a Subsequence", "question__title_slug": "minimum-operations-to-make-a-subsequence", "question__hide": false, - "total_acs": 8489, - "total_submitted": 17242, + "total_acs": 8558, + "total_submitted": 17428, "frontend_question_id": 1713, "is_new_question": false }, @@ -15954,8 +16253,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": 24350, - "total_submitted": 75082, + "total_acs": 24603, + "total_submitted": 75794, "frontend_question_id": 1712, "is_new_question": false }, @@ -15977,8 +16276,8 @@ "question__title": "Count Good Meals", "question__title_slug": "count-good-meals", "question__hide": false, - "total_acs": 29233, - "total_submitted": 100719, + "total_acs": 29495, + "total_submitted": 101539, "frontend_question_id": 1711, "is_new_question": false }, @@ -16000,8 +16299,8 @@ "question__title": "Maximum Units on a Truck", "question__title_slug": "maximum-units-on-a-truck", "question__hide": false, - "total_acs": 245978, - "total_submitted": 332497, + "total_acs": 248480, + "total_submitted": 336087, "frontend_question_id": 1710, "is_new_question": false }, @@ -16023,8 +16322,8 @@ "question__title": "Count Ways to Distribute Candies", "question__title_slug": "count-ways-to-distribute-candies", "question__hide": false, - "total_acs": 1807, - "total_submitted": 2910, + "total_acs": 1826, + "total_submitted": 2945, "frontend_question_id": 1692, "is_new_question": false }, @@ -16046,8 +16345,8 @@ "question__title": "Invalid Tweets", "question__title_slug": "invalid-tweets", "question__hide": false, - "total_acs": 20442, - "total_submitted": 22466, + "total_acs": 20620, + "total_submitted": 22668, "frontend_question_id": 1683, "is_new_question": false }, @@ -16069,8 +16368,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": 12179, - "total_submitted": 27464, + "total_acs": 12329, + "total_submitted": 27824, "frontend_question_id": 1707, "is_new_question": false }, @@ -16092,8 +16391,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": 18816, - "total_submitted": 44058, + "total_acs": 19007, + "total_submitted": 44541, "frontend_question_id": 1723, "is_new_question": false }, @@ -16115,8 +16414,8 @@ "question__title": "Maximum Number of Eaten Apples", "question__title_slug": "maximum-number-of-eaten-apples", "question__hide": false, - "total_acs": 17093, - "total_submitted": 45071, + "total_acs": 17281, + "total_submitted": 45481, "frontend_question_id": 1705, "is_new_question": false }, @@ -16138,8 +16437,8 @@ "question__title": "Determine if String Halves Are Alike", "question__title_slug": "determine-if-string-halves-are-alike", "question__hide": false, - "total_acs": 96019, - "total_submitted": 124064, + "total_acs": 96894, + "total_submitted": 125192, "frontend_question_id": 1704, "is_new_question": false }, @@ -16161,8 +16460,8 @@ "question__title": "Longest Palindromic Subsequence II", "question__title_slug": "longest-palindromic-subsequence-ii", "question__hide": false, - "total_acs": 3986, - "total_submitted": 8039, + "total_acs": 4028, + "total_submitted": 8154, "frontend_question_id": 1682, "is_new_question": false }, @@ -16184,8 +16483,8 @@ "question__title": "Product's Worth Over Invoices", "question__title_slug": "products-worth-over-invoices", "question__hide": false, - "total_acs": 12796, - "total_submitted": 32482, + "total_acs": 12915, + "total_submitted": 32835, "frontend_question_id": 1677, "is_new_question": false }, @@ -16207,8 +16506,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": 2955, - "total_submitted": 6934, + "total_acs": 2978, + "total_submitted": 6989, "frontend_question_id": 1719, "is_new_question": false }, @@ -16230,8 +16529,8 @@ "question__title": "Construct the Lexicographically Largest Valid Sequence", "question__title_slug": "construct-the-lexicographically-largest-valid-sequence", "question__hide": false, - "total_acs": 9907, - "total_submitted": 19191, + "total_acs": 9973, + "total_submitted": 19337, "frontend_question_id": 1718, "is_new_question": false }, @@ -16253,8 +16552,8 @@ "question__title": "Maximum Score From Removing Substrings", "question__title_slug": "maximum-score-from-removing-substrings", "question__hide": false, - "total_acs": 11206, - "total_submitted": 24350, + "total_acs": 11319, + "total_submitted": 24591, "frontend_question_id": 1717, "is_new_question": false }, @@ -16276,8 +16575,8 @@ "question__title": "Calculate Money in Leetcode Bank", "question__title_slug": "calculate-money-in-leetcode-bank", "question__hide": false, - "total_acs": 34580, - "total_submitted": 53182, + "total_acs": 35003, + "total_submitted": 53790, "frontend_question_id": 1716, "is_new_question": false }, @@ -16299,8 +16598,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": 26433, - "total_submitted": 33326, + "total_acs": 26615, + "total_submitted": 33543, "frontend_question_id": 1676, "is_new_question": false }, @@ -16322,8 +16621,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": 10596, - "total_submitted": 20933, + "total_acs": 10786, + "total_submitted": 21321, "frontend_question_id": 1697, "is_new_question": false }, @@ -16345,8 +16644,8 @@ "question__title": "Jump Game VI", "question__title_slug": "jump-game-vi", "question__hide": false, - "total_acs": 92803, - "total_submitted": 200323, + "total_acs": 93398, + "total_submitted": 201645, "frontend_question_id": 1696, "is_new_question": false }, @@ -16368,8 +16667,8 @@ "question__title": "Maximum Erasure Value", "question__title_slug": "maximum-erasure-value", "question__hide": false, - "total_acs": 103419, - "total_submitted": 179109, + "total_acs": 103917, + "total_submitted": 180017, "frontend_question_id": 1695, "is_new_question": false }, @@ -16391,8 +16690,8 @@ "question__title": "Reformat Phone Number", "question__title_slug": "reformat-phone-number", "question__hide": false, - "total_acs": 28037, - "total_submitted": 43307, + "total_acs": 28285, + "total_submitted": 43625, "frontend_question_id": 1694, "is_new_question": false }, @@ -16414,8 +16713,8 @@ "question__title": "Fix Names in a Table", "question__title_slug": "fix-names-in-a-table", "question__hide": false, - "total_acs": 65616, - "total_submitted": 98167, + "total_acs": 68865, + "total_submitted": 103001, "frontend_question_id": 1667, "is_new_question": false }, @@ -16437,8 +16736,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": 2657, - "total_submitted": 3829, + "total_acs": 2668, + "total_submitted": 3840, "frontend_question_id": 1666, "is_new_question": false }, @@ -16460,8 +16759,8 @@ "question__title": "Sum Of Special Evenly-Spaced Elements In Array", "question__title_slug": "sum-of-special-evenly-spaced-elements-in-array", "question__hide": false, - "total_acs": 1067, - "total_submitted": 2139, + "total_acs": 1068, + "total_submitted": 2156, "frontend_question_id": 1714, "is_new_question": false }, @@ -16483,8 +16782,8 @@ "question__title": "Stone Game VII", "question__title_slug": "stone-game-vii", "question__hide": false, - "total_acs": 28901, - "total_submitted": 49269, + "total_acs": 29021, + "total_submitted": 49547, "frontend_question_id": 1690, "is_new_question": false }, @@ -16506,8 +16805,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": 152113, - "total_submitted": 169546, + "total_acs": 153878, + "total_submitted": 171714, "frontend_question_id": 1689, "is_new_question": false }, @@ -16529,8 +16828,8 @@ "question__title": "Count of Matches in Tournament", "question__title_slug": "count-of-matches-in-tournament", "question__hide": false, - "total_acs": 81753, - "total_submitted": 98339, + "total_acs": 82945, + "total_submitted": 99719, "frontend_question_id": 1688, "is_new_question": false }, @@ -16552,8 +16851,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": 7361, - "total_submitted": 17746, + "total_acs": 7610, + "total_submitted": 18137, "frontend_question_id": 1703, "is_new_question": false }, @@ -16575,8 +16874,8 @@ "question__title": "Maximum Binary String After Change", "question__title_slug": "maximum-binary-string-after-change", "question__hide": false, - "total_acs": 9881, - "total_submitted": 21443, + "total_acs": 9964, + "total_submitted": 21596, "frontend_question_id": 1702, "is_new_question": false }, @@ -16598,8 +16897,8 @@ "question__title": "Average Waiting Time", "question__title_slug": "average-waiting-time", "question__hide": false, - "total_acs": 21933, - "total_submitted": 35182, + "total_acs": 22132, + "total_submitted": 35460, "frontend_question_id": 1701, "is_new_question": false }, @@ -16621,8 +16920,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": 51731, - "total_submitted": 76329, + "total_acs": 52663, + "total_submitted": 77678, "frontend_question_id": 1700, "is_new_question": false }, @@ -16644,8 +16943,8 @@ "question__title": "Average Time of Process per Machine", "question__title_slug": "average-time-of-process-per-machine", "question__hide": false, - "total_acs": 18636, - "total_submitted": 23470, + "total_acs": 18818, + "total_submitted": 23709, "frontend_question_id": 1661, "is_new_question": false }, @@ -16667,8 +16966,8 @@ "question__title": "Concatenation of Consecutive Binary Numbers", "question__title_slug": "concatenation-of-consecutive-binary-numbers", "question__hide": false, - "total_acs": 84502, - "total_submitted": 148157, + "total_acs": 84730, + "total_submitted": 148610, "frontend_question_id": 1680, "is_new_question": false }, @@ -16690,8 +16989,8 @@ "question__title": "Minimum Incompatibility", "question__title_slug": "minimum-incompatibility", "question__hide": false, - "total_acs": 6415, - "total_submitted": 17176, + "total_acs": 6448, + "total_submitted": 17271, "frontend_question_id": 1681, "is_new_question": false }, @@ -16713,8 +17012,8 @@ "question__title": "Max Number of K-Sum Pairs", "question__title_slug": "max-number-of-k-sum-pairs", "question__hide": false, - "total_acs": 116712, - "total_submitted": 203441, + "total_acs": 117243, + "total_submitted": 204362, "frontend_question_id": 1679, "is_new_question": false }, @@ -16736,8 +17035,8 @@ "question__title": "Goal Parser Interpretation", "question__title_slug": "goal-parser-interpretation", "question__hide": false, - "total_acs": 143705, - "total_submitted": 167157, + "total_acs": 146578, + "total_submitted": 170432, "frontend_question_id": 1678, "is_new_question": false }, @@ -16759,8 +17058,8 @@ "question__title": "Correct a Binary Tree", "question__title_slug": "correct-a-binary-tree", "question__hide": false, - "total_acs": 12763, - "total_submitted": 17602, + "total_acs": 12913, + "total_submitted": 17795, "frontend_question_id": 1660, "is_new_question": false }, @@ -16782,8 +17081,8 @@ "question__title": "Hopper Company Queries III", "question__title_slug": "hopper-company-queries-iii", "question__hide": false, - "total_acs": 4792, - "total_submitted": 7053, + "total_acs": 4839, + "total_submitted": 7128, "frontend_question_id": 1651, "is_new_question": false }, @@ -16805,8 +17104,8 @@ "question__title": "Minimize Deviation in Array", "question__title_slug": "minimize-deviation-in-array", "question__hide": false, - "total_acs": 44947, - "total_submitted": 86302, + "total_acs": 45008, + "total_submitted": 86461, "frontend_question_id": 1675, "is_new_question": false }, @@ -16828,8 +17127,8 @@ "question__title": "Minimum Moves to Make Array Complementary", "question__title_slug": "minimum-moves-to-make-array-complementary", "question__hide": false, - "total_acs": 6830, - "total_submitted": 17716, + "total_acs": 6885, + "total_submitted": 17843, "frontend_question_id": 1674, "is_new_question": false }, @@ -16851,8 +17150,8 @@ "question__title": "Find the Most Competitive Subsequence", "question__title_slug": "find-the-most-competitive-subsequence", "question__hide": false, - "total_acs": 48191, - "total_submitted": 97718, + "total_acs": 48494, + "total_submitted": 98298, "frontend_question_id": 1673, "is_new_question": false }, @@ -16874,8 +17173,8 @@ "question__title": "Richest Customer Wealth", "question__title_slug": "richest-customer-wealth", "question__hide": false, - "total_acs": 445815, - "total_submitted": 504422, + "total_acs": 458937, + "total_submitted": 519671, "frontend_question_id": 1672, "is_new_question": false }, @@ -16897,8 +17196,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": 151984, - "total_submitted": 196675, + "total_acs": 152737, + "total_submitted": 197654, "frontend_question_id": 1650, "is_new_question": false }, @@ -16920,8 +17219,8 @@ "question__title": "Delivering Boxes from Storage to Ports", "question__title_slug": "delivering-boxes-from-storage-to-ports", "question__hide": false, - "total_acs": 4522, - "total_submitted": 11803, + "total_acs": 4546, + "total_submitted": 11852, "frontend_question_id": 1687, "is_new_question": false }, @@ -16943,8 +17242,8 @@ "question__title": "Stone Game VI", "question__title_slug": "stone-game-vi", "question__hide": false, - "total_acs": 13034, - "total_submitted": 24004, + "total_acs": 13173, + "total_submitted": 24236, "frontend_question_id": 1686, "is_new_question": false }, @@ -16966,8 +17265,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": 24080, - "total_submitted": 36931, + "total_acs": 24301, + "total_submitted": 37335, "frontend_question_id": 1685, "is_new_question": false }, @@ -16989,8 +17288,8 @@ "question__title": "Count the Number of Consistent Strings", "question__title_slug": "count-the-number-of-consistent-strings", "question__hide": false, - "total_acs": 108767, - "total_submitted": 132935, + "total_acs": 110488, + "total_submitted": 134937, "frontend_question_id": 1684, "is_new_question": false }, @@ -17012,8 +17311,8 @@ "question__title": "Hopper Company Queries II", "question__title_slug": "hopper-company-queries-ii", "question__hide": false, - "total_acs": 4628, - "total_submitted": 11916, + "total_acs": 4673, + "total_submitted": 12011, "frontend_question_id": 1645, "is_new_question": false }, @@ -17035,8 +17334,8 @@ "question__title": "Minimum Initial Energy to Finish Tasks", "question__title_slug": "minimum-initial-energy-to-finish-tasks", "question__hide": false, - "total_acs": 13097, - "total_submitted": 23320, + "total_acs": 13239, + "total_submitted": 23584, "frontend_question_id": 1665, "is_new_question": false }, @@ -17058,8 +17357,8 @@ "question__title": "Ways to Make a Fair Array", "question__title_slug": "ways-to-make-a-fair-array", "question__hide": false, - "total_acs": 27727, - "total_submitted": 43685, + "total_acs": 27953, + "total_submitted": 44087, "frontend_question_id": 1664, "is_new_question": false }, @@ -17081,8 +17380,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": 84778, - "total_submitted": 126684, + "total_acs": 85001, + "total_submitted": 127029, "frontend_question_id": 1663, "is_new_question": false }, @@ -17104,8 +17403,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": 239818, - "total_submitted": 288154, + "total_acs": 245133, + "total_submitted": 294431, "frontend_question_id": 1662, "is_new_question": false }, @@ -17127,8 +17426,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": 53378, - "total_submitted": 90019, + "total_acs": 53708, + "total_submitted": 90544, "frontend_question_id": 1644, "is_new_question": false }, @@ -17150,8 +17449,8 @@ "question__title": "Hopper Company Queries I", "question__title_slug": "hopper-company-queries-i", "question__hide": false, - "total_acs": 6134, - "total_submitted": 11596, + "total_acs": 6184, + "total_submitted": 11684, "frontend_question_id": 1635, "is_new_question": false }, @@ -17173,8 +17472,8 @@ "question__title": "Maximize Grid Happiness", "question__title_slug": "maximize-grid-happiness", "question__hide": false, - "total_acs": 4052, - "total_submitted": 10553, + "total_acs": 4067, + "total_submitted": 10599, "frontend_question_id": 1659, "is_new_question": false }, @@ -17196,8 +17495,8 @@ "question__title": "Determine if Two Strings Are Close", "question__title_slug": "determine-if-two-strings-are-close", "question__hide": false, - "total_acs": 42758, - "total_submitted": 78971, + "total_acs": 43012, + "total_submitted": 79440, "frontend_question_id": 1657, "is_new_question": false }, @@ -17219,8 +17518,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": 104502, - "total_submitted": 278001, + "total_acs": 105201, + "total_submitted": 279845, "frontend_question_id": 1658, "is_new_question": false }, @@ -17242,8 +17541,8 @@ "question__title": "Design an Ordered Stream", "question__title_slug": "design-an-ordered-stream", "question__hide": false, - "total_acs": 54694, - "total_submitted": 64038, + "total_acs": 56228, + "total_submitted": 65812, "frontend_question_id": 1656, "is_new_question": false }, @@ -17265,8 +17564,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": 7604, - "total_submitted": 14233, + "total_acs": 7728, + "total_submitted": 14451, "frontend_question_id": 1634, "is_new_question": false }, @@ -17288,8 +17587,8 @@ "question__title": "Percentage of Users Attended a Contest", "question__title_slug": "percentage-of-users-attended-a-contest", "question__hide": false, - "total_acs": 18788, - "total_submitted": 27319, + "total_acs": 19181, + "total_submitted": 27966, "frontend_question_id": 1633, "is_new_question": false }, @@ -17311,8 +17610,8 @@ "question__title": "Create Sorted Array through Instructions", "question__title_slug": "create-sorted-array-through-instructions", "question__hide": false, - "total_acs": 21384, - "total_submitted": 57450, + "total_acs": 21670, + "total_submitted": 58062, "frontend_question_id": 1649, "is_new_question": false }, @@ -17334,8 +17633,8 @@ "question__title": "Sell Diminishing-Valued Colored Balls", "question__title_slug": "sell-diminishing-valued-colored-balls", "question__hide": false, - "total_acs": 33148, - "total_submitted": 108663, + "total_acs": 33328, + "total_submitted": 109265, "frontend_question_id": 1648, "is_new_question": false }, @@ -17357,8 +17656,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": 161712, - "total_submitted": 273210, + "total_acs": 162880, + "total_submitted": 275226, "frontend_question_id": 1647, "is_new_question": false }, @@ -17380,8 +17679,8 @@ "question__title": "Get Maximum in Generated Array", "question__title_slug": "get-maximum-in-generated-array", "question__hide": false, - "total_acs": 75202, - "total_submitted": 149855, + "total_acs": 76281, + "total_submitted": 151979, "frontend_question_id": 1646, "is_new_question": false }, @@ -17403,8 +17702,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": 22524, - "total_submitted": 27236, + "total_acs": 22860, + "total_submitted": 27668, "frontend_question_id": 1628, "is_new_question": false }, @@ -17426,8 +17725,8 @@ "question__title": "Design Front Middle Back Queue", "question__title_slug": "design-front-middle-back-queue", "question__hide": false, - "total_acs": 17877, - "total_submitted": 31675, + "total_acs": 18017, + "total_submitted": 31958, "frontend_question_id": 1670, "is_new_question": false }, @@ -17449,8 +17748,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": 18594, - "total_submitted": 43691, + "total_acs": 18826, + "total_submitted": 44262, "frontend_question_id": 1671, "is_new_question": false }, @@ -17472,8 +17771,8 @@ "question__title": "Merge In Between Linked Lists", "question__title_slug": "merge-in-between-linked-lists", "question__hide": false, - "total_acs": 61273, - "total_submitted": 82233, + "total_acs": 62156, + "total_submitted": 83452, "frontend_question_id": 1669, "is_new_question": false }, @@ -17495,8 +17794,8 @@ "question__title": "Maximum Repeating Substring", "question__title_slug": "maximum-repeating-substring", "question__hide": false, - "total_acs": 29840, - "total_submitted": 75368, + "total_acs": 30391, + "total_submitted": 76770, "frontend_question_id": 1668, "is_new_question": false }, @@ -17518,8 +17817,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": 15422, - "total_submitted": 17527, + "total_acs": 15543, + "total_submitted": 17668, "frontend_question_id": 1623, "is_new_question": false }, @@ -17541,8 +17840,8 @@ "question__title": "Furthest Building You Can Reach", "question__title_slug": "furthest-building-you-can-reach", "question__hide": false, - "total_acs": 106548, - "total_submitted": 220750, + "total_acs": 107359, + "total_submitted": 222471, "frontend_question_id": 1642, "is_new_question": false }, @@ -17564,8 +17863,8 @@ "question__title": "Count Sorted Vowel Strings", "question__title_slug": "count-sorted-vowel-strings", "question__hide": false, - "total_acs": 145699, - "total_submitted": 188453, + "total_acs": 146605, + "total_submitted": 189726, "frontend_question_id": 1641, "is_new_question": false }, @@ -17587,8 +17886,8 @@ "question__title": "Check Array Formation Through Concatenation", "question__title_slug": "check-array-formation-through-concatenation", "question__hide": false, - "total_acs": 71720, - "total_submitted": 127863, + "total_acs": 72008, + "total_submitted": 128332, "frontend_question_id": 1640, "is_new_question": false }, @@ -17610,8 +17909,8 @@ "question__title": "Find the Missing IDs", "question__title_slug": "find-the-missing-ids", "question__hide": false, - "total_acs": 13433, - "total_submitted": 17694, + "total_acs": 13594, + "total_submitted": 17913, "frontend_question_id": 1613, "is_new_question": false }, @@ -17633,8 +17932,8 @@ "question__title": "Distribute Repeating Integers", "question__title_slug": "distribute-repeating-integers", "question__hide": false, - "total_acs": 9266, - "total_submitted": 23388, + "total_acs": 9322, + "total_submitted": 23608, "frontend_question_id": 1655, "is_new_question": false }, @@ -17656,8 +17955,8 @@ "question__title": "Minimum Jumps to Reach Home", "question__title_slug": "minimum-jumps-to-reach-home", "question__hide": false, - "total_acs": 30258, - "total_submitted": 105837, + "total_acs": 30861, + "total_submitted": 107640, "frontend_question_id": 1654, "is_new_question": false }, @@ -17679,8 +17978,8 @@ "question__title": "Minimum Deletions to Make String Balanced", "question__title_slug": "minimum-deletions-to-make-string-balanced", "question__hide": false, - "total_acs": 29811, - "total_submitted": 50798, + "total_acs": 30229, + "total_submitted": 51477, "frontend_question_id": 1653, "is_new_question": false }, @@ -17702,8 +18001,8 @@ "question__title": "Defuse the Bomb", "question__title_slug": "defuse-the-bomb", "question__hide": false, - "total_acs": 26966, - "total_submitted": 44121, + "total_acs": 27240, + "total_submitted": 44542, "frontend_question_id": 1652, "is_new_question": false }, @@ -17725,8 +18024,8 @@ "question__title": "Path With Minimum Effort", "question__title_slug": "path-with-minimum-effort", "question__hide": false, - "total_acs": 129002, - "total_submitted": 233221, + "total_acs": 130470, + "total_submitted": 235729, "frontend_question_id": 1631, "is_new_question": false }, @@ -17748,8 +18047,8 @@ "question__title": "Arithmetic Subarrays", "question__title_slug": "arithmetic-subarrays", "question__hide": false, - "total_acs": 42546, - "total_submitted": 53261, + "total_acs": 43268, + "total_submitted": 54108, "frontend_question_id": 1630, "is_new_question": false }, @@ -17771,8 +18070,8 @@ "question__title": "Slowest Key", "question__title_slug": "slowest-key", "question__hide": false, - "total_acs": 84301, - "total_submitted": 141981, + "total_acs": 84739, + "total_submitted": 142761, "frontend_question_id": 1629, "is_new_question": false }, @@ -17794,8 +18093,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": 5736, - "total_submitted": 8204, + "total_acs": 5774, + "total_submitted": 8261, "frontend_question_id": 1612, "is_new_question": false }, @@ -17817,8 +18116,8 @@ "question__title": "Sellers With No Sales", "question__title_slug": "sellers-with-no-sales", "question__hide": false, - "total_acs": 20185, - "total_submitted": 36462, + "total_acs": 20575, + "total_submitted": 37186, "frontend_question_id": 1607, "is_new_question": false }, @@ -17840,8 +18139,8 @@ "question__title": "Best Team With No Conflicts", "question__title_slug": "best-team-with-no-conflicts", "question__hide": false, - "total_acs": 21984, - "total_submitted": 53441, + "total_acs": 22171, + "total_submitted": 53877, "frontend_question_id": 1626, "is_new_question": false }, @@ -17863,8 +18162,8 @@ "question__title": "Lexicographically Smallest String After Applying Operations", "question__title_slug": "lexicographically-smallest-string-after-applying-operations", "question__hide": false, - "total_acs": 11526, - "total_submitted": 17455, + "total_acs": 11623, + "total_submitted": 17617, "frontend_question_id": 1625, "is_new_question": false }, @@ -17886,8 +18185,8 @@ "question__title": "Largest Substring Between Two Equal Characters", "question__title_slug": "largest-substring-between-two-equal-characters", "question__hide": false, - "total_acs": 37506, - "total_submitted": 63564, + "total_acs": 37833, + "total_submitted": 64069, "frontend_question_id": 1624, "is_new_question": false }, @@ -17909,8 +18208,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": 20043, - "total_submitted": 26585, + "total_acs": 20122, + "total_submitted": 26681, "frontend_question_id": 1602, "is_new_question": false }, @@ -17932,8 +18231,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": 8894, - "total_submitted": 20733, + "total_acs": 9087, + "total_submitted": 21269, "frontend_question_id": 1639, "is_new_question": false }, @@ -17955,8 +18254,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": 21767, - "total_submitted": 30474, + "total_acs": 22020, + "total_submitted": 30832, "frontend_question_id": 1638, "is_new_question": false }, @@ -17978,8 +18277,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": 34658, - "total_submitted": 41152, + "total_acs": 35001, + "total_submitted": 41546, "frontend_question_id": 1637, "is_new_question": false }, @@ -18001,8 +18300,8 @@ "question__title": "Sort Array by Increasing Frequency", "question__title_slug": "sort-array-by-increasing-frequency", "question__hide": false, - "total_acs": 79547, - "total_submitted": 115990, + "total_acs": 80969, + "total_submitted": 117906, "frontend_question_id": 1636, "is_new_question": false }, @@ -18024,8 +18323,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": 7350, - "total_submitted": 11141, + "total_acs": 7390, + "total_submitted": 11206, "frontend_question_id": 1617, "is_new_question": false }, @@ -18047,8 +18346,8 @@ "question__title": "Split Two Strings to Make Palindrome", "question__title_slug": "split-two-strings-to-make-palindrome", "question__hide": false, - "total_acs": 18642, - "total_submitted": 59507, + "total_acs": 18819, + "total_submitted": 59969, "frontend_question_id": 1616, "is_new_question": false }, @@ -18070,8 +18369,8 @@ "question__title": "Maximal Network Rank", "question__title_slug": "maximal-network-rank", "question__hide": false, - "total_acs": 53781, - "total_submitted": 92619, + "total_acs": 54634, + "total_submitted": 94009, "frontend_question_id": 1615, "is_new_question": false }, @@ -18093,8 +18392,8 @@ "question__title": "Maximum Nesting Depth of the Parentheses", "question__title_slug": "maximum-nesting-depth-of-the-parentheses", "question__hide": false, - "total_acs": 108447, - "total_submitted": 131196, + "total_acs": 110215, + "total_submitted": 133307, "frontend_question_id": 1614, "is_new_question": false }, @@ -18116,8 +18415,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": 11127, - "total_submitted": 17892, + "total_acs": 11249, + "total_submitted": 18073, "frontend_question_id": 1597, "is_new_question": false }, @@ -18139,8 +18438,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": 23354, - "total_submitted": 27429, + "total_acs": 23611, + "total_submitted": 27720, "frontend_question_id": 1596, "is_new_question": false }, @@ -18162,8 +18461,8 @@ "question__title": "Bank Account Summary II", "question__title_slug": "bank-account-summary-ii", "question__hide": false, - "total_acs": 48419, - "total_submitted": 53808, + "total_acs": 50260, + "total_submitted": 56047, "frontend_question_id": 1587, "is_new_question": false }, @@ -18185,8 +18484,8 @@ "question__title": "Maximum Number of Visible Points", "question__title_slug": "maximum-number-of-visible-points", "question__hide": false, - "total_acs": 33374, - "total_submitted": 89226, + "total_acs": 33711, + "total_submitted": 90104, "frontend_question_id": 1610, "is_new_question": false }, @@ -18208,8 +18507,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": 11778, - "total_submitted": 18618, + "total_acs": 11858, + "total_submitted": 18738, "frontend_question_id": 1611, "is_new_question": false }, @@ -18231,8 +18530,8 @@ "question__title": "Even Odd Tree", "question__title_slug": "even-odd-tree", "question__hide": false, - "total_acs": 38924, - "total_submitted": 72507, + "total_acs": 39282, + "total_submitted": 73086, "frontend_question_id": 1609, "is_new_question": false }, @@ -18254,8 +18553,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": 54478, - "total_submitted": 90759, + "total_acs": 55396, + "total_submitted": 92276, "frontend_question_id": 1608, "is_new_question": false }, @@ -18277,8 +18576,8 @@ "question__title": "Binary Search Tree Iterator II", "question__title_slug": "binary-search-tree-iterator-ii", "question__hide": false, - "total_acs": 11871, - "total_submitted": 16763, + "total_acs": 11928, + "total_submitted": 16852, "frontend_question_id": 1586, "is_new_question": false }, @@ -18300,8 +18599,8 @@ "question__title": "Fancy Sequence", "question__title_slug": "fancy-sequence", "question__hide": false, - "total_acs": 8596, - "total_submitted": 53518, + "total_acs": 8672, + "total_submitted": 54079, "frontend_question_id": 1622, "is_new_question": false }, @@ -18323,8 +18622,8 @@ "question__title": "Cat and Mouse II", "question__title_slug": "cat-and-mouse-ii", "question__hide": false, - "total_acs": 5339, - "total_submitted": 13194, + "total_acs": 5357, + "total_submitted": 13253, "frontend_question_id": 1728, "is_new_question": false }, @@ -18346,8 +18645,8 @@ "question__title": "Coordinate With Maximum Network Quality", "question__title_slug": "coordinate-with-maximum-network-quality", "question__hide": false, - "total_acs": 6976, - "total_submitted": 18686, + "total_acs": 7153, + "total_submitted": 19013, "frontend_question_id": 1620, "is_new_question": false }, @@ -18369,8 +18668,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": 7666, - "total_submitted": 18142, + "total_acs": 7710, + "total_submitted": 18236, "frontend_question_id": 1621, "is_new_question": false }, @@ -18392,8 +18691,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": 60548, - "total_submitted": 68124, + "total_acs": 63053, + "total_submitted": 71248, "frontend_question_id": 1581, "is_new_question": false }, @@ -18415,8 +18714,8 @@ "question__title": "Maximum Number of Achievable Transfer Requests", "question__title_slug": "maximum-number-of-achievable-transfer-requests", "question__hide": false, - "total_acs": 8801, - "total_submitted": 17143, + "total_acs": 8828, + "total_submitted": 17206, "frontend_question_id": 1601, "is_new_question": false }, @@ -18438,8 +18737,8 @@ "question__title": "Throne Inheritance", "question__title_slug": "throne-inheritance", "question__hide": false, - "total_acs": 12930, - "total_submitted": 20306, + "total_acs": 13008, + "total_submitted": 20413, "frontend_question_id": 1600, "is_new_question": false }, @@ -18461,8 +18760,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": 10328, - "total_submitted": 23656, + "total_acs": 10368, + "total_submitted": 23784, "frontend_question_id": 1599, "is_new_question": false }, @@ -18484,8 +18783,8 @@ "question__title": "Crawler Log Folder", "question__title_slug": "crawler-log-folder", "question__hide": false, - "total_acs": 51188, - "total_submitted": 79572, + "total_acs": 51862, + "total_submitted": 80584, "frontend_question_id": 1598, "is_new_question": false }, @@ -18507,8 +18806,8 @@ "question__title": "Put Boxes Into the Warehouse II", "question__title_slug": "put-boxes-into-the-warehouse-ii", "question__hide": false, - "total_acs": 3693, - "total_submitted": 5813, + "total_acs": 3714, + "total_submitted": 5857, "frontend_question_id": 1580, "is_new_question": false }, @@ -18530,8 +18829,8 @@ "question__title": "Warehouse Manager", "question__title_slug": "warehouse-manager", "question__hide": false, - "total_acs": 28339, - "total_submitted": 31450, + "total_acs": 28851, + "total_submitted": 32039, "frontend_question_id": 1571, "is_new_question": false }, @@ -18553,8 +18852,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": 6843, - "total_submitted": 14789, + "total_acs": 6880, + "total_submitted": 14855, "frontend_question_id": 1595, "is_new_question": false }, @@ -18576,8 +18875,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": 18898, - "total_submitted": 57192, + "total_acs": 19055, + "total_submitted": 57690, "frontend_question_id": 1594, "is_new_question": false }, @@ -18599,8 +18898,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": 23398, - "total_submitted": 42470, + "total_acs": 23551, + "total_submitted": 42709, "frontend_question_id": 1593, "is_new_question": false }, @@ -18622,8 +18921,8 @@ "question__title": "Rearrange Spaces Between Words", "question__title_slug": "rearrange-spaces-between-words", "question__hide": false, - "total_acs": 42753, - "total_submitted": 97716, + "total_acs": 43168, + "total_submitted": 98780, "frontend_question_id": 1592, "is_new_question": false }, @@ -18645,8 +18944,8 @@ "question__title": "Dot Product of Two Sparse Vectors", "question__title_slug": "dot-product-of-two-sparse-vectors", "question__hide": false, - "total_acs": 175700, - "total_submitted": 194447, + "total_acs": 176704, + "total_submitted": 195552, "frontend_question_id": 1570, "is_new_question": false }, @@ -18668,8 +18967,8 @@ "question__title": "Unique Orders and Customers Per Month", "question__title_slug": "unique-orders-and-customers-per-month", "question__hide": false, - "total_acs": 16905, - "total_submitted": 20223, + "total_acs": 17027, + "total_submitted": 20370, "frontend_question_id": 1565, "is_new_question": false }, @@ -18691,8 +18990,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": 30376, - "total_submitted": 38893, + "total_acs": 30671, + "total_submitted": 39276, "frontend_question_id": 1605, "is_new_question": false }, @@ -18714,8 +19013,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": 11226, - "total_submitted": 26163, + "total_acs": 11460, + "total_submitted": 26737, "frontend_question_id": 1606, "is_new_question": false }, @@ -18737,8 +19036,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": 26647, - "total_submitted": 56226, + "total_acs": 27013, + "total_submitted": 57076, "frontend_question_id": 1604, "is_new_question": false }, @@ -18760,8 +19059,8 @@ "question__title": "Design Parking System", "question__title_slug": "design-parking-system", "question__hide": false, - "total_acs": 152572, - "total_submitted": 173274, + "total_acs": 154661, + "total_submitted": 175692, "frontend_question_id": 1603, "is_new_question": false }, @@ -18783,8 +19082,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": 6496, - "total_submitted": 13419, + "total_acs": 6524, + "total_submitted": 13500, "frontend_question_id": 1585, "is_new_question": false }, @@ -18806,8 +19105,8 @@ "question__title": "Min Cost to Connect All Points", "question__title_slug": "min-cost-to-connect-all-points", "question__hide": false, - "total_acs": 132360, - "total_submitted": 205981, + "total_acs": 134971, + "total_submitted": 210201, "frontend_question_id": 1584, "is_new_question": false }, @@ -18829,8 +19128,8 @@ "question__title": "Count Unhappy Friends", "question__title_slug": "count-unhappy-friends", "question__hide": false, - "total_acs": 20290, - "total_submitted": 33888, + "total_acs": 20794, + "total_submitted": 34650, "frontend_question_id": 1583, "is_new_question": false }, @@ -18852,8 +19151,8 @@ "question__title": "Special Positions in a Binary Matrix", "question__title_slug": "special-positions-in-a-binary-matrix", "question__hide": false, - "total_acs": 36051, - "total_submitted": 55162, + "total_acs": 36431, + "total_submitted": 55715, "frontend_question_id": 1582, "is_new_question": false }, @@ -18875,8 +19174,8 @@ "question__title": "Put Boxes Into the Warehouse I", "question__title_slug": "put-boxes-into-the-warehouse-i", "question__hide": false, - "total_acs": 13807, - "total_submitted": 20591, + "total_acs": 13856, + "total_submitted": 20653, "frontend_question_id": 1564, "is_new_question": false }, @@ -18898,8 +19197,8 @@ "question__title": "Bank Account Summary", "question__title_slug": "bank-account-summary", "question__hide": false, - "total_acs": 12688, - "total_submitted": 23949, + "total_acs": 12820, + "total_submitted": 24191, "frontend_question_id": 1555, "is_new_question": false }, @@ -18921,8 +19220,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": 16600, - "total_submitted": 31494, + "total_acs": 16835, + "total_submitted": 31921, "frontend_question_id": 1579, "is_new_question": false }, @@ -18944,8 +19243,8 @@ "question__title": "Minimum Time to Make Rope Colorful", "question__title_slug": "minimum-time-to-make-rope-colorful", "question__hide": false, - "total_acs": 136597, - "total_submitted": 214348, + "total_acs": 137823, + "total_submitted": 216326, "frontend_question_id": 1578, "is_new_question": false }, @@ -18967,8 +19266,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": 16925, - "total_submitted": 42441, + "total_acs": 17065, + "total_submitted": 42741, "frontend_question_id": 1577, "is_new_question": false }, @@ -18990,8 +19289,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": 48639, - "total_submitted": 98852, + "total_acs": 49009, + "total_submitted": 99659, "frontend_question_id": 1576, "is_new_question": false }, @@ -19013,8 +19312,8 @@ "question__title": "Strings Differ by One Character", "question__title_slug": "strings-differ-by-one-character", "question__hide": false, - "total_acs": 21008, - "total_submitted": 48338, + "total_acs": 21181, + "total_submitted": 48891, "frontend_question_id": 1554, "is_new_question": false }, @@ -19036,8 +19335,8 @@ "question__title": "Strange Printer II", "question__title_slug": "strange-printer-ii", "question__hide": false, - "total_acs": 7636, - "total_submitted": 13063, + "total_acs": 7693, + "total_submitted": 13155, "frontend_question_id": 1591, "is_new_question": false }, @@ -19059,8 +19358,8 @@ "question__title": "Maximum Sum Obtained of Any Permutation", "question__title_slug": "maximum-sum-obtained-of-any-permutation", "question__hide": false, - "total_acs": 14317, - "total_submitted": 38703, + "total_acs": 14446, + "total_submitted": 39081, "frontend_question_id": 1589, "is_new_question": false }, @@ -19082,8 +19381,8 @@ "question__title": "Make Sum Divisible by P", "question__title_slug": "make-sum-divisible-by-p", "question__hide": false, - "total_acs": 18798, - "total_submitted": 66966, + "total_acs": 18975, + "total_submitted": 67715, "frontend_question_id": 1590, "is_new_question": false }, @@ -19099,14 +19398,14 @@ { "stat": { "question_id": 1693, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "sum-of-all-odd-length-subarrays", + "question__article__has_video_solution": false, "question__title": "Sum of All Odd Length Subarrays", "question__title_slug": "sum-of-all-odd-length-subarrays", "question__hide": false, - "total_acs": 128275, - "total_submitted": 153422, + "total_acs": 130567, + "total_submitted": 156211, "frontend_question_id": 1588, "is_new_question": false }, @@ -19128,8 +19427,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": 10973, - "total_submitted": 22751, + "total_acs": 11040, + "total_submitted": 22894, "frontend_question_id": 1569, "is_new_question": false }, @@ -19151,8 +19450,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": 9890, - "total_submitted": 21000, + "total_acs": 9947, + "total_submitted": 21153, "frontend_question_id": 1568, "is_new_question": false }, @@ -19174,8 +19473,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": 74269, - "total_submitted": 169796, + "total_acs": 75253, + "total_submitted": 172083, "frontend_question_id": 1567, "is_new_question": false }, @@ -19197,8 +19496,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": 27112, - "total_submitted": 62225, + "total_acs": 27371, + "total_submitted": 62741, "frontend_question_id": 1566, "is_new_question": false }, @@ -19220,8 +19519,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": 18557, - "total_submitted": 27336, + "total_acs": 18910, + "total_submitted": 27851, "frontend_question_id": 1549, "is_new_question": false }, @@ -19243,8 +19542,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": 14304, - "total_submitted": 25160, + "total_acs": 14326, + "total_submitted": 25199, "frontend_question_id": 1548, "is_new_question": false }, @@ -19266,8 +19565,8 @@ "question__title": "Fix Product Name Format", "question__title_slug": "fix-product-name-format", "question__hide": false, - "total_acs": 15785, - "total_submitted": 25340, + "total_acs": 15917, + "total_submitted": 25578, "frontend_question_id": 1543, "is_new_question": false }, @@ -19289,8 +19588,8 @@ "question__title": "Stone Game V", "question__title_slug": "stone-game-v", "question__hide": false, - "total_acs": 14580, - "total_submitted": 35922, + "total_acs": 14651, + "total_submitted": 36090, "frontend_question_id": 1563, "is_new_question": false }, @@ -19312,8 +19611,8 @@ "question__title": "Find Latest Group of Size M", "question__title_slug": "find-latest-group-of-size-m", "question__hide": false, - "total_acs": 14883, - "total_submitted": 35049, + "total_acs": 14983, + "total_submitted": 35255, "frontend_question_id": 1562, "is_new_question": false }, @@ -19335,8 +19634,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": 57096, - "total_submitted": 72627, + "total_acs": 57846, + "total_submitted": 73565, "frontend_question_id": 1561, "is_new_question": false }, @@ -19358,8 +19657,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": 24109, - "total_submitted": 41307, + "total_acs": 24379, + "total_submitted": 41737, "frontend_question_id": 1560, "is_new_question": false }, @@ -19381,8 +19680,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": 1597, - "total_submitted": 2537, + "total_acs": 1620, + "total_submitted": 2564, "frontend_question_id": 1538, "is_new_question": false }, @@ -19404,8 +19703,8 @@ "question__title": "Count All Possible Routes", "question__title_slug": "count-all-possible-routes", "question__hide": false, - "total_acs": 11723, - "total_submitted": 20618, + "total_acs": 11828, + "total_submitted": 20798, "frontend_question_id": 1575, "is_new_question": false }, @@ -19427,8 +19726,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": 22464, - "total_submitted": 61529, + "total_acs": 22688, + "total_submitted": 61988, "frontend_question_id": 1574, "is_new_question": false }, @@ -19450,8 +19749,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": 22180, - "total_submitted": 68425, + "total_acs": 22365, + "total_submitted": 68876, "frontend_question_id": 1573, "is_new_question": false }, @@ -19473,8 +19772,8 @@ "question__title": "Matrix Diagonal Sum", "question__title_slug": "matrix-diagonal-sum", "question__hide": false, - "total_acs": 144264, - "total_submitted": 181003, + "total_acs": 146971, + "total_submitted": 184359, "frontend_question_id": 1572, "is_new_question": false }, @@ -19496,8 +19795,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": 27001, - "total_submitted": 78353, + "total_acs": 27301, + "total_submitted": 79068, "frontend_question_id": 1553, "is_new_question": false }, @@ -19519,8 +19818,8 @@ "question__title": "Magnetic Force Between Two Balls", "question__title_slug": "magnetic-force-between-two-balls", "question__hide": false, - "total_acs": 34689, - "total_submitted": 61055, + "total_acs": 35125, + "total_submitted": 61718, "frontend_question_id": 1552, "is_new_question": false }, @@ -19542,8 +19841,8 @@ "question__title": "Minimum Operations to Make Array Equal", "question__title_slug": "minimum-operations-to-make-array-equal", "question__hide": false, - "total_acs": 73852, - "total_submitted": 91070, + "total_acs": 74597, + "total_submitted": 91988, "frontend_question_id": 1551, "is_new_question": false }, @@ -19565,8 +19864,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": 5351, - "total_submitted": 10578, + "total_acs": 5409, + "total_submitted": 10683, "frontend_question_id": 1533, "is_new_question": false }, @@ -19588,8 +19887,8 @@ "question__title": "The Most Recent Three Orders", "question__title_slug": "the-most-recent-three-orders", "question__hide": false, - "total_acs": 19683, - "total_submitted": 27698, + "total_acs": 19921, + "total_submitted": 28084, "frontend_question_id": 1532, "is_new_question": false }, @@ -19611,8 +19910,8 @@ "question__title": "Patients With a Condition", "question__title_slug": "patients-with-a-condition", "question__hide": false, - "total_acs": 67340, - "total_submitted": 157163, + "total_acs": 70355, + "total_submitted": 164403, "frontend_question_id": 1527, "is_new_question": false }, @@ -19634,8 +19933,8 @@ "question__title": "Minimum Cost to Cut a Stick", "question__title_slug": "minimum-cost-to-cut-a-stick", "question__hide": false, - "total_acs": 38338, - "total_submitted": 67482, + "total_acs": 39157, + "total_submitted": 68818, "frontend_question_id": 1547, "is_new_question": false }, @@ -19657,8 +19956,8 @@ "question__title": "Find Longest Awesome Substring", "question__title_slug": "find-longest-awesome-substring", "question__hide": false, - "total_acs": 10247, - "total_submitted": 24672, + "total_acs": 10352, + "total_submitted": 24971, "frontend_question_id": 1542, "is_new_question": false }, @@ -19680,8 +19979,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": 28931, - "total_submitted": 49645, + "total_acs": 29632, + "total_submitted": 50868, "frontend_question_id": 1545, "is_new_question": false }, @@ -19703,8 +20002,8 @@ "question__title": "Make The String Great", "question__title_slug": "make-the-string-great", "question__hide": false, - "total_acs": 57781, - "total_submitted": 101280, + "total_acs": 120783, + "total_submitted": 190902, "frontend_question_id": 1544, "is_new_question": false }, @@ -19726,8 +20025,8 @@ "question__title": "Diameter of N-Ary Tree", "question__title_slug": "diameter-of-n-ary-tree", "question__hide": false, - "total_acs": 36087, - "total_submitted": 49152, + "total_acs": 36276, + "total_submitted": 49379, "frontend_question_id": 1522, "is_new_question": false }, @@ -19749,8 +20048,8 @@ "question__title": "Find Users With Valid E-Mails", "question__title_slug": "find-users-with-valid-e-mails", "question__hide": false, - "total_acs": 21227, - "total_submitted": 37319, + "total_acs": 21360, + "total_submitted": 37703, "frontend_question_id": 1517, "is_new_question": false }, @@ -19772,8 +20071,8 @@ "question__title": "Detect Cycles in 2D Grid", "question__title_slug": "detect-cycles-in-2d-grid", "question__hide": false, - "total_acs": 29376, - "total_submitted": 61039, + "total_acs": 29619, + "total_submitted": 61602, "frontend_question_id": 1559, "is_new_question": false }, @@ -19795,8 +20094,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": 17027, - "total_submitted": 26503, + "total_acs": 17132, + "total_submitted": 26682, "frontend_question_id": 1558, "is_new_question": false }, @@ -19818,8 +20117,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": 78421, - "total_submitted": 98511, + "total_acs": 79471, + "total_submitted": 99889, "frontend_question_id": 1557, "is_new_question": false }, @@ -19841,8 +20140,8 @@ "question__title": "Thousand Separator", "question__title_slug": "thousand-separator", "question__hide": false, - "total_acs": 37751, - "total_submitted": 68535, + "total_acs": 38139, + "total_submitted": 69318, "frontend_question_id": 1556, "is_new_question": false }, @@ -19864,8 +20163,8 @@ "question__title": "Get the Maximum Score", "question__title_slug": "get-the-maximum-score", "question__hide": false, - "total_acs": 19651, - "total_submitted": 50016, + "total_acs": 19787, + "total_submitted": 50384, "frontend_question_id": 1537, "is_new_question": false }, @@ -19887,8 +20186,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": 12285, - "total_submitted": 26467, + "total_acs": 12361, + "total_submitted": 26611, "frontend_question_id": 1536, "is_new_question": false }, @@ -19910,8 +20209,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": 26802, - "total_submitted": 54949, + "total_acs": 26931, + "total_submitted": 55230, "frontend_question_id": 1535, "is_new_question": false }, @@ -19933,8 +20232,8 @@ "question__title": "Count Good Triplets", "question__title_slug": "count-good-triplets", "question__hide": false, - "total_acs": 86466, - "total_submitted": 106981, + "total_acs": 87230, + "total_submitted": 107927, "frontend_question_id": 1534, "is_new_question": false }, @@ -19956,8 +20255,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": 1887, - "total_submitted": 2956, + "total_acs": 1893, + "total_submitted": 2966, "frontend_question_id": 1516, "is_new_question": false }, @@ -19979,8 +20278,8 @@ "question__title": "Customer Order Frequency", "question__title_slug": "customer-order-frequency", "question__hide": false, - "total_acs": 32604, - "total_submitted": 44612, + "total_acs": 32840, + "total_submitted": 44929, "frontend_question_id": 1511, "is_new_question": false }, @@ -20002,8 +20301,8 @@ "question__title": "Number of Good Leaf Nodes Pairs", "question__title_slug": "number-of-good-leaf-nodes-pairs", "question__hide": false, - "total_acs": 31364, - "total_submitted": 51754, + "total_acs": 31617, + "total_submitted": 52120, "frontend_question_id": 1530, "is_new_question": false }, @@ -20025,8 +20324,8 @@ "question__title": "Minimum Suffix Flips", "question__title_slug": "minimum-suffix-flips", "question__hide": false, - "total_acs": 35814, - "total_submitted": 49440, + "total_acs": 36055, + "total_submitted": 49779, "frontend_question_id": 1529, "is_new_question": false }, @@ -20048,8 +20347,8 @@ "question__title": "Shuffle String", "question__title_slug": "shuffle-string", "question__hide": false, - "total_acs": 250604, - "total_submitted": 292389, + "total_acs": 254213, + "total_submitted": 296705, "frontend_question_id": 1528, "is_new_question": false }, @@ -20071,8 +20370,8 @@ "question__title": "Find Root of N-Ary Tree", "question__title_slug": "find-root-of-n-ary-tree", "question__hide": false, - "total_acs": 25685, - "total_submitted": 32886, + "total_acs": 26092, + "total_submitted": 33391, "frontend_question_id": 1506, "is_new_question": false }, @@ -20094,8 +20393,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": 22925, - "total_submitted": 48522, + "total_acs": 23082, + "total_submitted": 48858, "frontend_question_id": 1546, "is_new_question": false }, @@ -20117,8 +20416,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": 35778, - "total_submitted": 71689, + "total_acs": 36003, + "total_submitted": 72159, "frontend_question_id": 1541, "is_new_question": false }, @@ -20140,8 +20439,8 @@ "question__title": "Can Convert String in K Moves", "question__title_slug": "can-convert-string-in-k-moves", "question__hide": false, - "total_acs": 14679, - "total_submitted": 44357, + "total_acs": 14769, + "total_submitted": 44579, "frontend_question_id": 1540, "is_new_question": false }, @@ -20163,8 +20462,8 @@ "question__title": "Kth Missing Positive Number", "question__title_slug": "kth-missing-positive-number", "question__hide": false, - "total_acs": 198797, - "total_submitted": 355511, + "total_acs": 200641, + "total_submitted": 358702, "frontend_question_id": 1539, "is_new_question": false }, @@ -20186,8 +20485,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": 8176, - "total_submitted": 18719, + "total_acs": 8197, + "total_submitted": 18805, "frontend_question_id": 1521, "is_new_question": false }, @@ -20209,8 +20508,8 @@ "question__title": "Maximum Number of Non-Overlapping Substrings", "question__title_slug": "maximum-number-of-non-overlapping-substrings", "question__hide": false, - "total_acs": 12232, - "total_submitted": 32263, + "total_acs": 12303, + "total_submitted": 32407, "frontend_question_id": 1520, "is_new_question": false }, @@ -20232,8 +20531,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": 19002, - "total_submitted": 46407, + "total_acs": 19110, + "total_submitted": 46647, "frontend_question_id": 1519, "is_new_question": false }, @@ -20255,8 +20554,8 @@ "question__title": "Water Bottles", "question__title_slug": "water-bottles", "question__hide": false, - "total_acs": 55626, - "total_submitted": 92338, + "total_acs": 56110, + "total_submitted": 93221, "frontend_question_id": 1518, "is_new_question": false }, @@ -20278,8 +20577,8 @@ "question__title": "Countries You Can Safely Invest In", "question__title_slug": "countries-you-can-safely-invest-in", "question__hide": false, - "total_acs": 26287, - "total_submitted": 45011, + "total_acs": 26798, + "total_submitted": 46037, "frontend_question_id": 1501, "is_new_question": false }, @@ -20301,8 +20600,8 @@ "question__title": "Design a File Sharing System", "question__title_slug": "design-a-file-sharing-system", "question__hide": false, - "total_acs": 3223, - "total_submitted": 7189, + "total_acs": 3252, + "total_submitted": 7269, "frontend_question_id": 1500, "is_new_question": false }, @@ -20324,8 +20623,8 @@ "question__title": "Friendly Movies Streamed Last Month", "question__title_slug": "friendly-movies-streamed-last-month", "question__hide": false, - "total_acs": 22407, - "total_submitted": 45012, + "total_acs": 22637, + "total_submitted": 45521, "frontend_question_id": 1495, "is_new_question": false }, @@ -20347,8 +20646,8 @@ "question__title": "Best Position for a Service Centre", "question__title_slug": "best-position-for-a-service-centre", "question__hide": false, - "total_acs": 10885, - "total_submitted": 28380, + "total_acs": 10965, + "total_submitted": 28637, "frontend_question_id": 1515, "is_new_question": false }, @@ -20370,8 +20669,8 @@ "question__title": "String Compression II", "question__title_slug": "string-compression-ii", "question__hide": false, - "total_acs": 41213, - "total_submitted": 82454, + "total_acs": 41715, + "total_submitted": 83508, "frontend_question_id": 1531, "is_new_question": false }, @@ -20393,8 +20692,8 @@ "question__title": "Number of Substrings With Only 1s", "question__title_slug": "number-of-substrings-with-only-1s", "question__hide": false, - "total_acs": 33432, - "total_submitted": 73847, + "total_acs": 33747, + "total_submitted": 74476, "frontend_question_id": 1513, "is_new_question": false }, @@ -20416,8 +20715,8 @@ "question__title": "Number of Good Pairs", "question__title_slug": "number-of-good-pairs", "question__hide": false, - "total_acs": 363131, - "total_submitted": 411737, + "total_acs": 369023, + "total_submitted": 418426, "frontend_question_id": 1512, "is_new_question": false }, @@ -20439,8 +20738,8 @@ "question__title": "Clone N-ary Tree", "question__title_slug": "clone-n-ary-tree", "question__hide": false, - "total_acs": 23445, - "total_submitted": 28032, + "total_acs": 23536, + "total_submitted": 28145, "frontend_question_id": 1490, "is_new_question": false }, @@ -20462,8 +20761,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": 28628, - "total_submitted": 41719, + "total_acs": 28862, + "total_submitted": 42059, "frontend_question_id": 1526, "is_new_question": false }, @@ -20485,8 +20784,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": 82587, - "total_submitted": 118854, + "total_acs": 83182, + "total_submitted": 119793, "frontend_question_id": 1525, "is_new_question": false }, @@ -20508,8 +20807,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": 28027, - "total_submitted": 64281, + "total_acs": 28317, + "total_submitted": 64936, "frontend_question_id": 1524, "is_new_question": false }, @@ -20531,8 +20830,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": 149754, - "total_submitted": 323236, + "total_acs": 154338, + "total_submitted": 333491, "frontend_question_id": 1523, "is_new_question": false }, @@ -20554,8 +20853,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": 8196, - "total_submitted": 21462, + "total_acs": 8231, + "total_submitted": 21535, "frontend_question_id": 1505, "is_new_question": false }, @@ -20577,8 +20876,8 @@ "question__title": "Count Submatrices With All Ones", "question__title_slug": "count-submatrices-with-all-ones", "question__hide": false, - "total_acs": 40650, - "total_submitted": 70230, + "total_acs": 40938, + "total_submitted": 70797, "frontend_question_id": 1504, "is_new_question": false }, @@ -20600,8 +20899,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": 16944, - "total_submitted": 30692, + "total_acs": 17046, + "total_submitted": 30836, "frontend_question_id": 1503, "is_new_question": false }, @@ -20623,8 +20922,8 @@ "question__title": "Can Make Arithmetic Progression From Sequence", "question__title_slug": "can-make-arithmetic-progression-from-sequence", "question__hide": false, - "total_acs": 107644, - "total_submitted": 157737, + "total_acs": 109282, + "total_submitted": 160287, "frontend_question_id": 1502, "is_new_question": false }, @@ -20646,8 +20945,8 @@ "question__title": "Group Sold Products By The Date", "question__title_slug": "group-sold-products-by-the-date", "question__hide": false, - "total_acs": 76613, - "total_submitted": 91213, + "total_acs": 79895, + "total_submitted": 95336, "frontend_question_id": 1484, "is_new_question": false }, @@ -20669,8 +20968,8 @@ "question__title": "Clone Binary Tree With Random Pointer", "question__title_slug": "clone-binary-tree-with-random-pointer", "question__hide": false, - "total_acs": 18808, - "total_submitted": 23677, + "total_acs": 18943, + "total_submitted": 23846, "frontend_question_id": 1485, "is_new_question": false }, @@ -20692,8 +20991,8 @@ "question__title": "Sales by Day of the Week", "question__title_slug": "sales-by-day-of-the-week", "question__hide": false, - "total_acs": 14331, - "total_submitted": 17400, + "total_acs": 14441, + "total_submitted": 17542, "frontend_question_id": 1479, "is_new_question": false }, @@ -20715,8 +21014,8 @@ "question__title": "Max Value of Equation", "question__title_slug": "max-value-of-equation", "question__hide": false, - "total_acs": 35061, - "total_submitted": 75487, + "total_acs": 35301, + "total_submitted": 76074, "frontend_question_id": 1499, "is_new_question": false }, @@ -20738,8 +21037,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": 35736, - "total_submitted": 93099, + "total_acs": 36202, + "total_submitted": 94679, "frontend_question_id": 1498, "is_new_question": false }, @@ -20761,8 +21060,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": 36957, - "total_submitted": 93005, + "total_acs": 37278, + "total_submitted": 93808, "frontend_question_id": 1497, "is_new_question": false }, @@ -20784,8 +21083,8 @@ "question__title": "Path Crossing", "question__title_slug": "path-crossing", "question__hide": false, - "total_acs": 40518, - "total_submitted": 72547, + "total_acs": 40837, + "total_submitted": 73149, "frontend_question_id": 1496, "is_new_question": false }, @@ -20807,8 +21106,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": 23143, - "total_submitted": 31351, + "total_acs": 23334, + "total_submitted": 31662, "frontend_question_id": 1474, "is_new_question": false }, @@ -20830,8 +21129,8 @@ "question__title": "Stone Game IV", "question__title_slug": "stone-game-iv", "question__hide": false, - "total_acs": 62587, - "total_submitted": 103376, + "total_acs": 62745, + "total_submitted": 103644, "frontend_question_id": 1510, "is_new_question": false }, @@ -20853,8 +21152,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": 71139, - "total_submitted": 130205, + "total_acs": 71687, + "total_submitted": 131202, "frontend_question_id": 1509, "is_new_question": false }, @@ -20876,8 +21175,8 @@ "question__title": "Range Sum of Sorted Subarray Sums", "question__title_slug": "range-sum-of-sorted-subarray-sums", "question__hide": false, - "total_acs": 29352, - "total_submitted": 49460, + "total_acs": 29642, + "total_submitted": 49930, "frontend_question_id": 1508, "is_new_question": false }, @@ -20899,8 +21198,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": 9545, - "total_submitted": 17882, + "total_acs": 9755, + "total_submitted": 18407, "frontend_question_id": 1489, "is_new_question": false }, @@ -20922,8 +21221,8 @@ "question__title": "Avoid Flood in The City", "question__title_slug": "avoid-flood-in-the-city", "question__hide": false, - "total_acs": 27858, - "total_submitted": 106781, + "total_acs": 28078, + "total_submitted": 107545, "frontend_question_id": 1488, "is_new_question": false }, @@ -20945,8 +21244,8 @@ "question__title": "Making File Names Unique", "question__title_slug": "making-file-names-unique", "question__hide": false, - "total_acs": 27741, - "total_submitted": 77528, + "total_acs": 27933, + "total_submitted": 78043, "frontend_question_id": 1487, "is_new_question": false }, @@ -20968,8 +21267,8 @@ "question__title": "XOR Operation in an Array", "question__title_slug": "xor-operation-in-an-array", "question__hide": false, - "total_acs": 138126, - "total_submitted": 164072, + "total_acs": 139444, + "total_submitted": 165606, "frontend_question_id": 1486, "is_new_question": false }, @@ -20991,8 +21290,8 @@ "question__title": "Find All The Lonely Nodes", "question__title_slug": "find-all-the-lonely-nodes", "question__hide": false, - "total_acs": 40099, - "total_submitted": 49065, + "total_acs": 40451, + "total_submitted": 49465, "frontend_question_id": 1469, "is_new_question": false }, @@ -21014,8 +21313,8 @@ "question__title": "Calculate Salaries", "question__title_slug": "calculate-salaries", "question__hide": false, - "total_acs": 18648, - "total_submitted": 22749, + "total_acs": 18830, + "total_submitted": 22991, "frontend_question_id": 1468, "is_new_question": false }, @@ -21037,8 +21336,8 @@ "question__title": "Rectangles Area", "question__title_slug": "rectangles-area", "question__hide": false, - "total_acs": 12403, - "total_submitted": 17738, + "total_acs": 12633, + "total_submitted": 18080, "frontend_question_id": 1459, "is_new_question": false }, @@ -21060,8 +21359,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": 49440, - "total_submitted": 87512, + "total_acs": 50639, + "total_submitted": 90445, "frontend_question_id": 1482, "is_new_question": false }, @@ -21083,8 +21382,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": 84834, - "total_submitted": 148319, + "total_acs": 86148, + "total_submitted": 150908, "frontend_question_id": 1481, "is_new_question": false }, @@ -21106,8 +21405,8 @@ "question__title": "Running Sum of 1d Array", "question__title_slug": "running-sum-of-1d-array", "question__hide": false, - "total_acs": 1016345, - "total_submitted": 1132579, + "total_acs": 1053846, + "total_submitted": 1177014, "frontend_question_id": 1480, "is_new_question": false }, @@ -21129,8 +21428,8 @@ "question__title": "Parallel Courses II", "question__title_slug": "parallel-courses-ii", "question__hide": false, - "total_acs": 12382, - "total_submitted": 39853, + "total_acs": 12489, + "total_submitted": 40183, "frontend_question_id": 1494, "is_new_question": false }, @@ -21152,8 +21451,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": 50491, - "total_submitted": 83936, + "total_acs": 51166, + "total_submitted": 85042, "frontend_question_id": 1493, "is_new_question": false }, @@ -21175,8 +21474,8 @@ "question__title": "The kth Factor of n", "question__title_slug": "the-kth-factor-of-n", "question__hide": false, - "total_acs": 105611, - "total_submitted": 169482, + "total_acs": 106333, + "total_submitted": 170550, "frontend_question_id": 1492, "is_new_question": false }, @@ -21198,8 +21497,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": 156883, - "total_submitted": 248729, + "total_acs": 160564, + "total_submitted": 255358, "frontend_question_id": 1491, "is_new_question": false }, @@ -21221,8 +21520,8 @@ "question__title": "Paint House III", "question__title_slug": "paint-house-iii", "question__hide": false, - "total_acs": 52865, - "total_submitted": 85281, + "total_acs": 53172, + "total_submitted": 85846, "frontend_question_id": 1473, "is_new_question": false }, @@ -21244,8 +21543,8 @@ "question__title": "Design Browser History", "question__title_slug": "design-browser-history", "question__hide": false, - "total_acs": 103249, - "total_submitted": 135600, + "total_acs": 105644, + "total_submitted": 138708, "frontend_question_id": 1472, "is_new_question": false }, @@ -21267,8 +21566,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": 29947, - "total_submitted": 49814, + "total_acs": 30117, + "total_submitted": 50063, "frontend_question_id": 1471, "is_new_question": false }, @@ -21290,8 +21589,8 @@ "question__title": "Shuffle the Array", "question__title_slug": "shuffle-the-array", "question__hide": false, - "total_acs": 374491, - "total_submitted": 422895, + "total_acs": 379883, + "total_submitted": 429069, "frontend_question_id": 1470, "is_new_question": false }, @@ -21313,8 +21612,8 @@ "question__title": "Active Users", "question__title_slug": "active-users", "question__hide": false, - "total_acs": 28569, - "total_submitted": 74354, + "total_acs": 28918, + "total_submitted": 75312, "frontend_question_id": 1454, "is_new_question": false }, @@ -21336,8 +21635,8 @@ "question__title": "Apples & Oranges", "question__title_slug": "apples-oranges", "question__hide": false, - "total_acs": 36000, - "total_submitted": 39420, + "total_acs": 36614, + "total_submitted": 40108, "frontend_question_id": 1445, "is_new_question": false }, @@ -21359,8 +21658,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": 6457, - "total_submitted": 10608, + "total_acs": 6501, + "total_submitted": 10709, "frontend_question_id": 1467, "is_new_question": false }, @@ -21382,8 +21681,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": 66866, - "total_submitted": 108294, + "total_acs": 67732, + "total_submitted": 109727, "frontend_question_id": 1466, "is_new_question": false }, @@ -21405,8 +21704,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": 156341, - "total_submitted": 382795, + "total_acs": 156903, + "total_submitted": 384100, "frontend_question_id": 1465, "is_new_question": false }, @@ -21428,8 +21727,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": 161446, - "total_submitted": 203676, + "total_acs": 163604, + "total_submitted": 206287, "frontend_question_id": 1464, "is_new_question": false }, @@ -21451,8 +21750,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": 41738, - "total_submitted": 112887, + "total_acs": 41901, + "total_submitted": 113398, "frontend_question_id": 1477, "is_new_question": false }, @@ -21474,8 +21773,8 @@ "question__title": "Subrectangle Queries", "question__title_slug": "subrectangle-queries", "question__hide": false, - "total_acs": 80408, - "total_submitted": 90898, + "total_acs": 81098, + "total_submitted": 91691, "frontend_question_id": 1476, "is_new_question": false }, @@ -21497,8 +21796,8 @@ "question__title": "Allocate Mailboxes", "question__title_slug": "allocate-mailboxes", "question__hide": false, - "total_acs": 18287, - "total_submitted": 33051, + "total_acs": 18679, + "total_submitted": 33620, "frontend_question_id": 1478, "is_new_question": false }, @@ -21520,8 +21819,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": 93084, - "total_submitted": 123433, + "total_acs": 94218, + "total_submitted": 124823, "frontend_question_id": 1475, "is_new_question": false }, @@ -21543,8 +21842,8 @@ "question__title": "Max Dot Product of Two Subsequences", "question__title_slug": "max-dot-product-of-two-subsequences", "question__hide": false, - "total_acs": 18483, - "total_submitted": 39975, + "total_acs": 18552, + "total_submitted": 40086, "frontend_question_id": 1458, "is_new_question": false }, @@ -21566,8 +21865,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": 110811, - "total_submitted": 162768, + "total_acs": 111094, + "total_submitted": 163220, "frontend_question_id": 1457, "is_new_question": false }, @@ -21589,8 +21888,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": 50396, - "total_submitted": 86971, + "total_acs": 50936, + "total_submitted": 87883, "frontend_question_id": 1456, "is_new_question": false }, @@ -21612,8 +21911,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": 57532, - "total_submitted": 89568, + "total_acs": 58036, + "total_submitted": 90382, "frontend_question_id": 1455, "is_new_question": false }, @@ -21635,8 +21934,8 @@ "question__title": "Evaluate Boolean Expression", "question__title_slug": "evaluate-boolean-expression", "question__hide": false, - "total_acs": 18061, - "total_submitted": 23610, + "total_acs": 18405, + "total_submitted": 24094, "frontend_question_id": 1440, "is_new_question": false }, @@ -21658,8 +21957,8 @@ "question__title": "Create a Session Bar Chart", "question__title_slug": "create-a-session-bar-chart", "question__hide": false, - "total_acs": 18391, - "total_submitted": 23500, + "total_acs": 18512, + "total_submitted": 23682, "frontend_question_id": 1435, "is_new_question": false }, @@ -21681,8 +21980,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": 4910, - "total_submitted": 13338, + "total_acs": 4926, + "total_submitted": 13379, "frontend_question_id": 1453, "is_new_question": false }, @@ -21704,8 +22003,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": 20036, - "total_submitted": 35275, + "total_acs": 20155, + "total_submitted": 35479, "frontend_question_id": 1452, "is_new_question": false }, @@ -21727,8 +22026,8 @@ "question__title": "Rearrange Words in a Sentence", "question__title_slug": "rearrange-words-in-a-sentence", "question__hide": false, - "total_acs": 41054, - "total_submitted": 65648, + "total_acs": 41318, + "total_submitted": 66017, "frontend_question_id": 1451, "is_new_question": false }, @@ -21750,8 +22049,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": 92987, - "total_submitted": 122457, + "total_acs": 93754, + "total_submitted": 123509, "frontend_question_id": 1450, "is_new_question": false }, @@ -21773,8 +22072,8 @@ "question__title": "Cherry Pickup II", "question__title_slug": "cherry-pickup-ii", "question__hide": false, - "total_acs": 71673, - "total_submitted": 102142, + "total_acs": 72359, + "total_submitted": 103166, "frontend_question_id": 1463, "is_new_question": false }, @@ -21796,8 +22095,8 @@ "question__title": "Course Schedule IV", "question__title_slug": "course-schedule-iv", "question__hide": false, - "total_acs": 38274, - "total_submitted": 78241, + "total_acs": 38704, + "total_submitted": 79048, "frontend_question_id": 1462, "is_new_question": false }, @@ -21819,8 +22118,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": 104057, - "total_submitted": 183070, + "total_acs": 104536, + "total_submitted": 183978, "frontend_question_id": 1461, "is_new_question": false }, @@ -21842,8 +22141,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": 96894, - "total_submitted": 134131, + "total_acs": 97672, + "total_submitted": 135263, "frontend_question_id": 1460, "is_new_question": false }, @@ -21865,8 +22164,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": 19855, - "total_submitted": 33888, + "total_acs": 20627, + "total_submitted": 35289, "frontend_question_id": 1444, "is_new_question": false }, @@ -21888,8 +22187,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": 32416, - "total_submitted": 57852, + "total_acs": 32560, + "total_submitted": 58143, "frontend_question_id": 1443, "is_new_question": false }, @@ -21911,8 +22210,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": 29080, - "total_submitted": 38472, + "total_acs": 29352, + "total_submitted": 38838, "frontend_question_id": 1442, "is_new_question": false }, @@ -21934,8 +22233,8 @@ "question__title": "Build an Array With Stack Operations", "question__title_slug": "build-an-array-with-stack-operations", "question__hide": false, - "total_acs": 68175, - "total_submitted": 95580, + "total_acs": 68581, + "total_submitted": 96109, "frontend_question_id": 1441, "is_new_question": false }, @@ -21957,8 +22256,8 @@ "question__title": "NPV Queries", "question__title_slug": "npv-queries", "question__hide": false, - "total_acs": 20488, - "total_submitted": 24335, + "total_acs": 20704, + "total_submitted": 24587, "frontend_question_id": 1421, "is_new_question": false }, @@ -21980,8 +22279,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": 27209, - "total_submitted": 44325, + "total_acs": 27390, + "total_submitted": 44598, "frontend_question_id": 1439, "is_new_question": false }, @@ -22003,8 +22302,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": 100994, - "total_submitted": 210445, + "total_acs": 101739, + "total_submitted": 211966, "frontend_question_id": 1438, "is_new_question": false }, @@ -22026,8 +22325,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": 62648, - "total_submitted": 105854, + "total_acs": 63050, + "total_submitted": 106607, "frontend_question_id": 1437, "is_new_question": false }, @@ -22049,8 +22348,8 @@ "question__title": "Destination City", "question__title_slug": "destination-city", "question__hide": false, - "total_acs": 112770, - "total_submitted": 145256, + "total_acs": 113720, + "total_submitted": 146482, "frontend_question_id": 1436, "is_new_question": false }, @@ -22072,8 +22371,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": 19062, - "total_submitted": 30312, + "total_acs": 19235, + "total_submitted": 30535, "frontend_question_id": 1412, "is_new_question": false }, @@ -22095,8 +22394,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": 13560, - "total_submitted": 28777, + "total_acs": 13651, + "total_submitted": 28925, "frontend_question_id": 1449, "is_new_question": false }, @@ -22118,8 +22417,8 @@ "question__title": "Count Good Nodes in Binary Tree", "question__title_slug": "count-good-nodes-in-binary-tree", "question__hide": false, - "total_acs": 284184, - "total_submitted": 380825, + "total_acs": 287084, + "total_submitted": 384872, "frontend_question_id": 1448, "is_new_question": false }, @@ -22141,8 +22440,8 @@ "question__title": "Simplified Fractions", "question__title_slug": "simplified-fractions", "question__hide": false, - "total_acs": 23872, - "total_submitted": 36899, + "total_acs": 24089, + "total_submitted": 37204, "frontend_question_id": 1447, "is_new_question": false }, @@ -22164,8 +22463,8 @@ "question__title": "Consecutive Characters", "question__title_slug": "consecutive-characters", "question__hide": false, - "total_acs": 130570, - "total_submitted": 211840, + "total_acs": 131311, + "total_submitted": 213147, "frontend_question_id": 1446, "is_new_question": false }, @@ -22187,8 +22486,8 @@ "question__title": "Top Travellers", "question__title_slug": "top-travellers", "question__hide": false, - "total_acs": 58268, - "total_submitted": 85314, + "total_acs": 60248, + "total_submitted": 88918, "frontend_question_id": 1407, "is_new_question": false }, @@ -22210,8 +22509,8 @@ "question__title": "Diagonal Traverse II", "question__title_slug": "diagonal-traverse-ii", "question__hide": false, - "total_acs": 45401, - "total_submitted": 90211, + "total_acs": 45673, + "total_submitted": 90678, "frontend_question_id": 1424, "is_new_question": false }, @@ -22233,8 +22532,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": 206157, - "total_submitted": 394286, + "total_acs": 207457, + "total_submitted": 396760, "frontend_question_id": 1423, "is_new_question": false }, @@ -22256,8 +22555,8 @@ "question__title": "Maximum Score After Splitting a String", "question__title_slug": "maximum-score-after-splitting-a-string", "question__hide": false, - "total_acs": 42532, - "total_submitted": 73591, + "total_acs": 42877, + "total_submitted": 74161, "frontend_question_id": 1422, "is_new_question": false }, @@ -22279,8 +22578,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": 35658, - "total_submitted": 45849, + "total_acs": 36107, + "total_submitted": 46444, "frontend_question_id": 1398, "is_new_question": false }, @@ -22302,8 +22601,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": 10708, - "total_submitted": 16842, + "total_acs": 10764, + "total_submitted": 16950, "frontend_question_id": 1420, "is_new_question": false }, @@ -22325,8 +22624,8 @@ "question__title": "Minimum Number of Frogs Croaking", "question__title_slug": "minimum-number-of-frogs-croaking", "question__hide": false, - "total_acs": 30289, - "total_submitted": 60595, + "total_acs": 31114, + "total_submitted": 62100, "frontend_question_id": 1419, "is_new_question": false }, @@ -22348,8 +22647,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": 21303, - "total_submitted": 28896, + "total_acs": 21502, + "total_submitted": 29135, "frontend_question_id": 1418, "is_new_question": false }, @@ -22371,8 +22670,8 @@ "question__title": "Reformat The String", "question__title_slug": "reformat-the-string", "question__hide": false, - "total_acs": 46485, - "total_submitted": 83388, + "total_acs": 46770, + "total_submitted": 83973, "frontend_question_id": 1417, "is_new_question": false }, @@ -22394,8 +22693,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": 10675, - "total_submitted": 24968, + "total_acs": 10788, + "total_submitted": 25180, "frontend_question_id": 1434, "is_new_question": false }, @@ -22417,8 +22716,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": 33064, - "total_submitted": 48000, + "total_acs": 33268, + "total_submitted": 48298, "frontend_question_id": 1433, "is_new_question": false }, @@ -22440,8 +22739,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": 13343, - "total_submitted": 31058, + "total_acs": 13441, + "total_submitted": 31275, "frontend_question_id": 1432, "is_new_question": false }, @@ -22463,8 +22762,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": 354089, - "total_submitted": 404555, + "total_acs": 357782, + "total_submitted": 408918, "frontend_question_id": 1431, "is_new_question": false }, @@ -22486,8 +22785,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": 27411, - "total_submitted": 44034, + "total_acs": 27523, + "total_submitted": 44212, "frontend_question_id": 1411, "is_new_question": false }, @@ -22509,8 +22808,8 @@ "question__title": "HTML Entity Parser", "question__title_slug": "html-entity-parser", "question__hide": false, - "total_acs": 20162, - "total_submitted": 38734, + "total_acs": 20258, + "total_submitted": 38957, "frontend_question_id": 1410, "is_new_question": false }, @@ -22532,8 +22831,8 @@ "question__title": "Queries on a Permutation With Key", "question__title_slug": "queries-on-a-permutation-with-key", "question__hide": false, - "total_acs": 40741, - "total_submitted": 48913, + "total_acs": 40953, + "total_submitted": 49157, "frontend_question_id": 1409, "is_new_question": false }, @@ -22555,8 +22854,8 @@ "question__title": "String Matching in an Array", "question__title_slug": "string-matching-in-an-array", "question__hide": false, - "total_acs": 62378, - "total_submitted": 97668, + "total_acs": 62960, + "total_submitted": 98585, "frontend_question_id": 1408, "is_new_question": false }, @@ -22578,8 +22877,8 @@ "question__title": "Capital Gain/Loss", "question__title_slug": "capital-gainloss", "question__hide": false, - "total_acs": 56181, - "total_submitted": 61738, + "total_acs": 58329, + "total_submitted": 64212, "frontend_question_id": 1393, "is_new_question": false }, @@ -22601,8 +22900,8 @@ "question__title": "Stone Game III", "question__title_slug": "stone-game-iii", "question__hide": false, - "total_acs": 40345, - "total_submitted": 67568, + "total_acs": 40559, + "total_submitted": 67981, "frontend_question_id": 1406, "is_new_question": false }, @@ -22624,8 +22923,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": 30263, - "total_submitted": 58192, + "total_acs": 30671, + "total_submitted": 58895, "frontend_question_id": 1404, "is_new_question": false }, @@ -22647,8 +22946,8 @@ "question__title": "Minimum Subsequence in Non-Increasing Order", "question__title_slug": "minimum-subsequence-in-non-increasing-order", "question__hide": false, - "total_acs": 56120, - "total_submitted": 77769, + "total_acs": 56476, + "total_submitted": 78320, "frontend_question_id": 1403, "is_new_question": false }, @@ -22670,8 +22969,8 @@ "question__title": "Total Sales Amount by Year", "question__title_slug": "total-sales-amount-by-year", "question__hide": false, - "total_acs": 12811, - "total_submitted": 18925, + "total_acs": 12997, + "total_submitted": 19211, "frontend_question_id": 1384, "is_new_question": false }, @@ -22693,8 +22992,8 @@ "question__title": "Restore The Array", "question__title_slug": "restore-the-array", "question__hide": false, - "total_acs": 13690, - "total_submitted": 35466, + "total_acs": 13912, + "total_submitted": 35854, "frontend_question_id": 1416, "is_new_question": false }, @@ -22716,8 +23015,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": 29075, - "total_submitted": 40382, + "total_acs": 29333, + "total_submitted": 40707, "frontend_question_id": 1415, "is_new_question": false }, @@ -22739,8 +23038,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": 34403, - "total_submitted": 52595, + "total_acs": 34658, + "total_submitted": 52965, "frontend_question_id": 1414, "is_new_question": false }, @@ -22762,8 +23061,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": 82073, - "total_submitted": 120210, + "total_acs": 83695, + "total_submitted": 122838, "frontend_question_id": 1413, "is_new_question": false }, @@ -22785,8 +23084,8 @@ "question__title": "Find All Good Strings", "question__title_slug": "find-all-good-strings", "question__hide": false, - "total_acs": 4821, - "total_submitted": 11444, + "total_acs": 4893, + "total_submitted": 11620, "frontend_question_id": 1397, "is_new_question": false }, @@ -22808,8 +23107,8 @@ "question__title": "Design Underground System", "question__title_slug": "design-underground-system", "question__hide": false, - "total_acs": 153884, - "total_submitted": 208791, + "total_acs": 155537, + "total_submitted": 211135, "frontend_question_id": 1396, "is_new_question": false }, @@ -22831,8 +23130,8 @@ "question__title": "Count Number of Teams", "question__title_slug": "count-number-of-teams", "question__hide": false, - "total_acs": 95730, - "total_submitted": 140306, + "total_acs": 96188, + "total_submitted": 141268, "frontend_question_id": 1395, "is_new_question": false }, @@ -22854,8 +23153,8 @@ "question__title": "Find Lucky Integer in an Array", "question__title_slug": "find-lucky-integer-in-an-array", "question__hide": false, - "total_acs": 80506, - "total_submitted": 126694, + "total_acs": 81395, + "total_submitted": 128064, "frontend_question_id": 1394, "is_new_question": false }, @@ -22877,8 +23176,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": 32683, - "total_submitted": 35751, + "total_acs": 32973, + "total_submitted": 36056, "frontend_question_id": 1378, "is_new_question": false }, @@ -22900,8 +23199,8 @@ "question__title": "Longest Happy Prefix", "question__title_slug": "longest-happy-prefix", "question__hide": false, - "total_acs": 25538, - "total_submitted": 56749, + "total_acs": 25811, + "total_submitted": 57356, "frontend_question_id": 1392, "is_new_question": false }, @@ -22923,8 +23222,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": 22915, - "total_submitted": 48613, + "total_acs": 23068, + "total_submitted": 48860, "frontend_question_id": 1391, "is_new_question": false }, @@ -22946,8 +23245,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": 166853, - "total_submitted": 194307, + "total_acs": 168869, + "total_submitted": 196637, "frontend_question_id": 1389, "is_new_question": false }, @@ -22969,8 +23268,8 @@ "question__title": "Get the Second Most Recent Activity", "question__title_slug": "get-the-second-most-recent-activity", "question__hide": false, - "total_acs": 16402, - "total_submitted": 23547, + "total_acs": 16587, + "total_submitted": 23814, "frontend_question_id": 1369, "is_new_question": false }, @@ -22992,8 +23291,8 @@ "question__title": "Reducing Dishes", "question__title_slug": "reducing-dishes", "question__hide": false, - "total_acs": 47652, - "total_submitted": 66181, + "total_acs": 48268, + "total_submitted": 67082, "frontend_question_id": 1402, "is_new_question": false }, @@ -23015,8 +23314,8 @@ "question__title": "Construct K Palindrome Strings", "question__title_slug": "construct-k-palindrome-strings", "question__hide": false, - "total_acs": 41899, - "total_submitted": 66249, + "total_acs": 42196, + "total_submitted": 66777, "frontend_question_id": 1400, "is_new_question": false }, @@ -23038,8 +23337,8 @@ "question__title": "Circle and Rectangle Overlapping", "question__title_slug": "circle-and-rectangle-overlapping", "question__hide": false, - "total_acs": 10853, - "total_submitted": 24575, + "total_acs": 10933, + "total_submitted": 24737, "frontend_question_id": 1401, "is_new_question": false }, @@ -23061,8 +23360,8 @@ "question__title": "Count Largest Group", "question__title_slug": "count-largest-group", "question__hide": false, - "total_acs": 34446, - "total_submitted": 51261, + "total_acs": 34789, + "total_submitted": 51753, "frontend_question_id": 1399, "is_new_question": false }, @@ -23084,8 +23383,8 @@ "question__title": "Maximum Performance of a Team", "question__title_slug": "maximum-performance-of-a-team", "question__hide": false, - "total_acs": 82075, - "total_submitted": 167689, + "total_acs": 82447, + "total_submitted": 168611, "frontend_question_id": 1383, "is_new_question": false }, @@ -23107,8 +23406,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": 173005, - "total_submitted": 198703, + "total_acs": 174560, + "total_submitted": 200531, "frontend_question_id": 1379, "is_new_question": false }, @@ -23130,8 +23429,8 @@ "question__title": "Design a Stack With Increment Operation", "question__title_slug": "design-a-stack-with-increment-operation", "question__hide": false, - "total_acs": 82007, - "total_submitted": 106031, + "total_acs": 83414, + "total_submitted": 107931, "frontend_question_id": 1381, "is_new_question": false }, @@ -23153,8 +23452,8 @@ "question__title": "Lucky Numbers in a Matrix", "question__title_slug": "lucky-numbers-in-a-matrix", "question__hide": false, - "total_acs": 74313, - "total_submitted": 105421, + "total_acs": 75134, + "total_submitted": 106534, "frontend_question_id": 1380, "is_new_question": false }, @@ -23176,8 +23475,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": 15284, - "total_submitted": 19351, + "total_acs": 15412, + "total_submitted": 19517, "frontend_question_id": 1364, "is_new_question": false }, @@ -23199,8 +23498,8 @@ "question__title": "Activity Participants", "question__title_slug": "activity-participants", "question__hide": false, - "total_acs": 23497, - "total_submitted": 31563, + "total_acs": 23664, + "total_submitted": 31835, "frontend_question_id": 1355, "is_new_question": false }, @@ -23222,8 +23521,8 @@ "question__title": "Frog Position After T Seconds", "question__title_slug": "frog-position-after-t-seconds", "question__hide": false, - "total_acs": 22476, - "total_submitted": 62346, + "total_acs": 22635, + "total_submitted": 62769, "frontend_question_id": 1377, "is_new_question": false }, @@ -23245,8 +23544,8 @@ "question__title": "Time Needed to Inform All Employees", "question__title_slug": "time-needed-to-inform-all-employees", "question__hide": false, - "total_acs": 118483, - "total_submitted": 202777, + "total_acs": 119492, + "total_submitted": 204547, "frontend_question_id": 1376, "is_new_question": false }, @@ -23268,8 +23567,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": 43727, - "total_submitted": 66374, + "total_acs": 43979, + "total_submitted": 66726, "frontend_question_id": 1375, "is_new_question": false }, @@ -23291,8 +23590,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": 72437, - "total_submitted": 93426, + "total_acs": 72940, + "total_submitted": 94057, "frontend_question_id": 1374, "is_new_question": false }, @@ -23314,8 +23613,8 @@ "question__title": "Pizza With 3n Slices", "question__title_slug": "pizza-with-3n-slices", "question__hide": false, - "total_acs": 11674, - "total_submitted": 23261, + "total_acs": 11882, + "total_submitted": 23676, "frontend_question_id": 1388, "is_new_question": false }, @@ -23337,8 +23636,8 @@ "question__title": "Sort Integers by The Power Value", "question__title_slug": "sort-integers-by-the-power-value", "question__hide": false, - "total_acs": 66323, - "total_submitted": 94827, + "total_acs": 67653, + "total_submitted": 96669, "frontend_question_id": 1387, "is_new_question": false }, @@ -23360,8 +23659,8 @@ "question__title": "Cinema Seat Allocation", "question__title_slug": "cinema-seat-allocation", "question__hide": false, - "total_acs": 34502, - "total_submitted": 84451, + "total_acs": 34961, + "total_submitted": 85587, "frontend_question_id": 1386, "is_new_question": false }, @@ -23383,8 +23682,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": 67080, - "total_submitted": 102647, + "total_acs": 68383, + "total_submitted": 104512, "frontend_question_id": 1385, "is_new_question": false }, @@ -23406,8 +23705,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": 36490, - "total_submitted": 59565, + "total_acs": 36764, + "total_submitted": 59983, "frontend_question_id": 1368, "is_new_question": false }, @@ -23429,8 +23728,8 @@ "question__title": "Linked List in Binary Tree", "question__title_slug": "linked-list-in-binary-tree", "question__hide": false, - "total_acs": 58545, - "total_submitted": 134840, + "total_acs": 59058, + "total_submitted": 135934, "frontend_question_id": 1367, "is_new_question": false }, @@ -23452,8 +23751,8 @@ "question__title": "Rank Teams by Votes", "question__title_slug": "rank-teams-by-votes", "question__hide": false, - "total_acs": 46189, - "total_submitted": 78740, + "total_acs": 46930, + "total_submitted": 80053, "frontend_question_id": 1366, "is_new_question": false }, @@ -23475,8 +23774,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": 370270, - "total_submitted": 427402, + "total_acs": 374810, + "total_submitted": 432533, "frontend_question_id": 1365, "is_new_question": false }, @@ -23498,8 +23797,8 @@ "question__title": "Students With Invalid Departments", "question__title_slug": "students-with-invalid-departments", "question__hide": false, - "total_acs": 44288, - "total_submitted": 48942, + "total_acs": 44592, + "total_submitted": 49264, "frontend_question_id": 1350, "is_new_question": false }, @@ -23521,8 +23820,8 @@ "question__title": "Movie Rating", "question__title_slug": "movie-rating", "question__hide": false, - "total_acs": 23545, - "total_submitted": 40325, + "total_acs": 23817, + "total_submitted": 40915, "frontend_question_id": 1341, "is_new_question": false }, @@ -23544,8 +23843,8 @@ "question__title": "Construct Target Array With Multiple Sums", "question__title_slug": "construct-target-array-with-multiple-sums", "question__hide": false, - "total_acs": 62713, - "total_submitted": 172810, + "total_acs": 62909, + "total_submitted": 173403, "frontend_question_id": 1354, "is_new_question": false }, @@ -23567,8 +23866,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": 63242, - "total_submitted": 192152, + "total_acs": 63690, + "total_submitted": 193658, "frontend_question_id": 1353, "is_new_question": false }, @@ -23590,8 +23889,8 @@ "question__title": "Product of the Last K Numbers", "question__title_slug": "product-of-the-last-k-numbers", "question__hide": false, - "total_acs": 60193, - "total_submitted": 121509, + "total_acs": 61220, + "total_submitted": 123240, "frontend_question_id": 1352, "is_new_question": false }, @@ -23613,8 +23912,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": 210652, - "total_submitted": 279925, + "total_acs": 213065, + "total_submitted": 283150, "frontend_question_id": 1351, "is_new_question": false }, @@ -23636,8 +23935,8 @@ "question__title": "Maximum Sum BST in Binary Tree", "question__title_slug": "maximum-sum-bst-in-binary-tree", "question__hide": false, - "total_acs": 44656, - "total_submitted": 114046, + "total_acs": 45130, + "total_submitted": 115126, "frontend_question_id": 1373, "is_new_question": false }, @@ -23659,8 +23958,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": 42540, - "total_submitted": 71283, + "total_acs": 42837, + "total_submitted": 71720, "frontend_question_id": 1372, "is_new_question": false }, @@ -23682,8 +23981,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": 20698, - "total_submitted": 32830, + "total_acs": 20831, + "total_submitted": 33051, "frontend_question_id": 1371, "is_new_question": false }, @@ -23705,8 +24004,8 @@ "question__title": "Increasing Decreasing String", "question__title_slug": "increasing-decreasing-string", "question__hide": false, - "total_acs": 60412, - "total_submitted": 77941, + "total_acs": 60810, + "total_submitted": 78477, "frontend_question_id": 1370, "is_new_question": false }, @@ -23728,8 +24027,8 @@ "question__title": "Maximum Students Taking Exam", "question__title_slug": "maximum-students-taking-exam", "question__hide": false, - "total_acs": 11690, - "total_submitted": 24318, + "total_acs": 11798, + "total_submitted": 24486, "frontend_question_id": 1349, "is_new_question": false }, @@ -23751,8 +24050,8 @@ "question__title": "Tweet Counts Per Frequency", "question__title_slug": "tweet-counts-per-frequency", "question__hide": false, - "total_acs": 28871, - "total_submitted": 66300, + "total_acs": 28985, + "total_submitted": 66480, "frontend_question_id": 1348, "is_new_question": false }, @@ -23774,8 +24073,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": 113148, - "total_submitted": 146382, + "total_acs": 114909, + "total_submitted": 148508, "frontend_question_id": 1347, "is_new_question": false }, @@ -23797,8 +24096,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": 244296, - "total_submitted": 676457, + "total_acs": 247246, + "total_submitted": 683633, "frontend_question_id": 1346, "is_new_question": false }, @@ -23820,8 +24119,8 @@ "question__title": "Number of Transactions per Visit", "question__title_slug": "number-of-transactions-per-visit", "question__hide": false, - "total_acs": 9974, - "total_submitted": 19397, + "total_acs": 10050, + "total_submitted": 19595, "frontend_question_id": 1336, "is_new_question": false }, @@ -23843,8 +24142,8 @@ "question__title": "Jump Game V", "question__title_slug": "jump-game-v", "question__hide": false, - "total_acs": 22335, - "total_submitted": 35699, + "total_acs": 22538, + "total_submitted": 36028, "frontend_question_id": 1340, "is_new_question": false }, @@ -23866,8 +24165,8 @@ "question__title": "Maximum Product of Splitted Binary Tree", "question__title_slug": "maximum-product-of-splitted-binary-tree", "question__hide": false, - "total_acs": 64132, - "total_submitted": 148140, + "total_acs": 64543, + "total_submitted": 148979, "frontend_question_id": 1339, "is_new_question": false }, @@ -23889,8 +24188,8 @@ "question__title": "Reduce Array Size to The Half", "question__title_slug": "reduce-array-size-to-the-half", "question__hide": false, - "total_acs": 161237, - "total_submitted": 231066, + "total_acs": 162084, + "total_submitted": 232427, "frontend_question_id": 1338, "is_new_question": false }, @@ -23912,8 +24211,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": 211003, - "total_submitted": 289050, + "total_acs": 214165, + "total_submitted": 293633, "frontend_question_id": 1337, "is_new_question": false }, @@ -23935,8 +24234,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": 32426, - "total_submitted": 42064, + "total_acs": 32700, + "total_submitted": 42403, "frontend_question_id": 1327, "is_new_question": false }, @@ -23958,8 +24257,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": 56070, - "total_submitted": 89009, + "total_acs": 56462, + "total_submitted": 89707, "frontend_question_id": 1359, "is_new_question": false }, @@ -23981,8 +24280,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": 46262, - "total_submitted": 73448, + "total_acs": 46972, + "total_submitted": 74504, "frontend_question_id": 1358, "is_new_question": false }, @@ -24004,8 +24303,8 @@ "question__title": "Apply Discount Every n Orders", "question__title_slug": "apply-discount-every-n-orders", "question__hide": false, - "total_acs": 16499, - "total_submitted": 23570, + "total_acs": 16602, + "total_submitted": 23708, "frontend_question_id": 1357, "is_new_question": false }, @@ -24027,8 +24326,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": 89891, - "total_submitted": 124914, + "total_acs": 91654, + "total_submitted": 127328, "frontend_question_id": 1356, "is_new_question": false }, @@ -24050,8 +24349,8 @@ "question__title": "Minimum Difficulty of a Job Schedule", "question__title_slug": "minimum-difficulty-of-a-job-schedule", "question__hide": false, - "total_acs": 113440, - "total_submitted": 193090, + "total_acs": 114530, + "total_submitted": 195050, "frontend_question_id": 1335, "is_new_question": false }, @@ -24073,8 +24372,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": 51230, - "total_submitted": 96684, + "total_acs": 52226, + "total_submitted": 98269, "frontend_question_id": 1334, "is_new_question": false }, @@ -24096,8 +24395,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": 24702, - "total_submitted": 41541, + "total_acs": 24880, + "total_submitted": 41789, "frontend_question_id": 1333, "is_new_question": false }, @@ -24119,8 +24418,8 @@ "question__title": "Remove Palindromic Subsequences", "question__title_slug": "remove-palindromic-subsequences", "question__hide": false, - "total_acs": 114429, - "total_submitted": 150399, + "total_acs": 115077, + "total_submitted": 151222, "frontend_question_id": 1332, "is_new_question": false }, @@ -24142,8 +24441,8 @@ "question__title": "Ads Performance", "question__title_slug": "ads-performance", "question__hide": false, - "total_acs": 32955, - "total_submitted": 54102, + "total_acs": 33264, + "total_submitted": 54585, "frontend_question_id": 1322, "is_new_question": false }, @@ -24165,8 +24464,8 @@ "question__title": "Restaurant Growth", "question__title_slug": "restaurant-growth", "question__hide": false, - "total_acs": 26916, - "total_submitted": 37328, + "total_acs": 27216, + "total_submitted": 37878, "frontend_question_id": 1321, "is_new_question": false }, @@ -24188,8 +24487,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": 64288, - "total_submitted": 134547, + "total_acs": 64662, + "total_submitted": 135443, "frontend_question_id": 1326, "is_new_question": false }, @@ -24211,8 +24510,8 @@ "question__title": "Delete Leaves With a Given Value", "question__title_slug": "delete-leaves-with-a-given-value", "question__hide": false, - "total_acs": 79188, - "total_submitted": 105914, + "total_acs": 79966, + "total_submitted": 106987, "frontend_question_id": 1325, "is_new_question": false }, @@ -24234,8 +24533,8 @@ "question__title": "Print Words Vertically", "question__title_slug": "print-words-vertically", "question__hide": false, - "total_acs": 29336, - "total_submitted": 48880, + "total_acs": 30515, + "total_submitted": 50584, "frontend_question_id": 1324, "is_new_question": false }, @@ -24257,8 +24556,8 @@ "question__title": "Maximum 69 Number", "question__title_slug": "maximum-69-number", "question__hide": false, - "total_acs": 126258, - "total_submitted": 159575, + "total_acs": 194080, + "total_submitted": 236594, "frontend_question_id": 1323, "is_new_question": false }, @@ -24280,8 +24579,8 @@ "question__title": "Jump Game IV", "question__title_slug": "jump-game-iv", "question__hide": false, - "total_acs": 80323, - "total_submitted": 182409, + "total_acs": 80729, + "total_submitted": 183412, "frontend_question_id": 1345, "is_new_question": false }, @@ -24303,8 +24602,8 @@ "question__title": "Angle Between Hands of a Clock", "question__title_slug": "angle-between-hands-of-a-clock", "question__hide": false, - "total_acs": 100366, - "total_submitted": 158259, + "total_acs": 100807, + "total_submitted": 159004, "frontend_question_id": 1344, "is_new_question": false }, @@ -24326,8 +24625,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": 44235, - "total_submitted": 65393, + "total_acs": 45157, + "total_submitted": 66773, "frontend_question_id": 1343, "is_new_question": false }, @@ -24349,8 +24648,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": 410682, - "total_submitted": 480204, + "total_acs": 419101, + "total_submitted": 490238, "frontend_question_id": 1342, "is_new_question": false }, @@ -24372,8 +24671,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": 26452, - "total_submitted": 44206, + "total_acs": 26571, + "total_submitted": 44397, "frontend_question_id": 1320, "is_new_question": false }, @@ -24395,8 +24694,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": 103338, - "total_submitted": 177105, + "total_acs": 104824, + "total_submitted": 179399, "frontend_question_id": 1319, "is_new_question": false }, @@ -24418,8 +24717,8 @@ "question__title": "Minimum Flips to Make a OR b Equal to c", "question__title_slug": "minimum-flips-to-make-a-or-b-equal-to-c", "question__hide": false, - "total_acs": 27537, - "total_submitted": 41706, + "total_acs": 27797, + "total_submitted": 42081, "frontend_question_id": 1318, "is_new_question": false }, @@ -24441,8 +24740,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": 33808, - "total_submitted": 60238, + "total_acs": 34098, + "total_submitted": 60877, "frontend_question_id": 1317, "is_new_question": false }, @@ -24464,8 +24763,8 @@ "question__title": "Running Total for Different Genders", "question__title_slug": "running-total-for-different-genders", "question__hide": false, - "total_acs": 31022, - "total_submitted": 35146, + "total_acs": 31432, + "total_submitted": 35619, "frontend_question_id": 1308, "is_new_question": false }, @@ -24487,8 +24786,8 @@ "question__title": "Find the Team Size", "question__title_slug": "find-the-team-size", "question__hide": false, - "total_acs": 52426, - "total_submitted": 57710, + "total_acs": 53148, + "total_submitted": 58512, "frontend_question_id": 1303, "is_new_question": false }, @@ -24510,8 +24809,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": 65912, - "total_submitted": 100538, + "total_acs": 66846, + "total_submitted": 101865, "frontend_question_id": 1312, "is_new_question": false }, @@ -24533,8 +24832,8 @@ "question__title": "Get Watched Videos by Your Friends", "question__title_slug": "get-watched-videos-by-your-friends", "question__hide": false, - "total_acs": 16728, - "total_submitted": 36431, + "total_acs": 16862, + "total_submitted": 36737, "frontend_question_id": 1311, "is_new_question": false }, @@ -24556,8 +24855,8 @@ "question__title": "XOR Queries of a Subarray", "question__title_slug": "xor-queries-of-a-subarray", "question__hide": false, - "total_acs": 42476, - "total_submitted": 58857, + "total_acs": 42984, + "total_submitted": 59543, "frontend_question_id": 1310, "is_new_question": false }, @@ -24579,8 +24878,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": 93696, - "total_submitted": 117979, + "total_acs": 94773, + "total_submitted": 119237, "frontend_question_id": 1309, "is_new_question": false }, @@ -24602,8 +24901,8 @@ "question__title": "Encrypt and Decrypt Strings", "question__title_slug": "encrypt-and-decrypt-strings", "question__hide": false, - "total_acs": 9005, - "total_submitted": 23008, + "total_acs": 9212, + "total_submitted": 23424, "frontend_question_id": 2227, "is_new_question": false }, @@ -24625,8 +24924,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": 41685, - "total_submitted": 90310, + "total_acs": 41836, + "total_submitted": 90537, "frontend_question_id": 1430, "is_new_question": false }, @@ -24648,8 +24947,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": 18043, - "total_submitted": 35817, + "total_acs": 18718, + "total_submitted": 37260, "frontend_question_id": 2192, "is_new_question": false }, @@ -24671,8 +24970,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": 26760, - "total_submitted": 46918, + "total_acs": 28324, + "total_submitted": 49732, "frontend_question_id": 2269, "is_new_question": false }, @@ -24694,8 +24993,8 @@ "question__title": "Verbal Arithmetic Puzzle", "question__title_slug": "verbal-arithmetic-puzzle", "question__hide": false, - "total_acs": 9228, - "total_submitted": 26660, + "total_acs": 9516, + "total_submitted": 27311, "frontend_question_id": 1307, "is_new_question": false }, @@ -24717,8 +25016,8 @@ "question__title": "Jump Game III", "question__title_slug": "jump-game-iii", "question__hide": false, - "total_acs": 169582, - "total_submitted": 269093, + "total_acs": 170919, + "total_submitted": 271110, "frontend_question_id": 1306, "is_new_question": false }, @@ -24740,8 +25039,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": 177176, - "total_submitted": 222068, + "total_acs": 178011, + "total_submitted": 223115, "frontend_question_id": 1305, "is_new_question": false }, @@ -24763,8 +25062,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": 165923, - "total_submitted": 215094, + "total_acs": 167695, + "total_submitted": 217398, "frontend_question_id": 1304, "is_new_question": false }, @@ -24786,8 +25085,8 @@ "question__title": "Weather Type in Each Country", "question__title_slug": "weather-type-in-each-country", "question__hide": false, - "total_acs": 30230, - "total_submitted": 44489, + "total_acs": 30669, + "total_submitted": 45123, "frontend_question_id": 1294, "is_new_question": false }, @@ -24809,8 +25108,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": 11658, - "total_submitted": 19109, + "total_acs": 11778, + "total_submitted": 19341, "frontend_question_id": 1298, "is_new_question": false }, @@ -24832,8 +25131,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": 37677, - "total_submitted": 72360, + "total_acs": 38050, + "total_submitted": 73039, "frontend_question_id": 1297, "is_new_question": false }, @@ -24855,8 +25154,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": 67313, - "total_submitted": 119020, + "total_acs": 67996, + "total_submitted": 120050, "frontend_question_id": 1296, "is_new_question": false }, @@ -24878,8 +25177,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": 499102, - "total_submitted": 648633, + "total_acs": 503393, + "total_submitted": 654041, "frontend_question_id": 1295, "is_new_question": false }, @@ -24901,8 +25200,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": 27278, - "total_submitted": 30939, + "total_acs": 27635, + "total_submitted": 31373, "frontend_question_id": 1285, "is_new_question": false }, @@ -24924,8 +25223,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": 811, - "total_submitted": 1191, + "total_acs": 823, + "total_submitted": 1214, "frontend_question_id": 2263, "is_new_question": false }, @@ -24947,8 +25246,8 @@ "question__title": "Fair Distribution of Cookies", "question__title_slug": "fair-distribution-of-cookies", "question__hide": false, - "total_acs": 19240, - "total_submitted": 30609, + "total_acs": 19591, + "total_submitted": 31236, "frontend_question_id": 2305, "is_new_question": false }, @@ -24970,8 +25269,8 @@ "question__title": "Check if an Array Is Consecutive", "question__title_slug": "check-if-an-array-is-consecutive", "question__hide": false, - "total_acs": 3032, - "total_submitted": 4915, + "total_acs": 3135, + "total_submitted": 5073, "frontend_question_id": 2229, "is_new_question": false }, @@ -24993,8 +25292,8 @@ "question__title": "Students and Examinations", "question__title_slug": "students-and-examinations", "question__hide": false, - "total_acs": 30504, - "total_submitted": 40924, + "total_acs": 30921, + "total_submitted": 41531, "frontend_question_id": 1280, "is_new_question": false }, @@ -25016,8 +25315,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": 131087, - "total_submitted": 300697, + "total_acs": 165278, + "total_submitted": 361843, "frontend_question_id": 1293, "is_new_question": false }, @@ -25039,8 +25338,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": 27896, - "total_submitted": 52516, + "total_acs": 28095, + "total_submitted": 52836, "frontend_question_id": 1292, "is_new_question": false }, @@ -25062,8 +25361,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": 338274, - "total_submitted": 409775, + "total_acs": 341592, + "total_submitted": 413905, "frontend_question_id": 1290, "is_new_question": false }, @@ -25085,8 +25384,8 @@ "question__title": "Traffic Light Controlled Intersection", "question__title_slug": "traffic-light-controlled-intersection", "question__hide": false, - "total_acs": 9836, - "total_submitted": 13198, + "total_acs": 9936, + "total_submitted": 13343, "frontend_question_id": 1279, "is_new_question": false }, @@ -25108,8 +25407,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": 27548, - "total_submitted": 38243, + "total_acs": 27718, + "total_submitted": 38496, "frontend_question_id": 1284, "is_new_question": false }, @@ -25131,8 +25430,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": 95792, - "total_submitted": 173262, + "total_acs": 96708, + "total_submitted": 174757, "frontend_question_id": 1283, "is_new_question": false }, @@ -25154,8 +25453,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": 90932, - "total_submitted": 106127, + "total_acs": 91938, + "total_submitted": 107270, "frontend_question_id": 1282, "is_new_question": false }, @@ -25177,8 +25476,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": 306232, - "total_submitted": 353173, + "total_acs": 311666, + "total_submitted": 359414, "frontend_question_id": 1281, "is_new_question": false }, @@ -25200,8 +25499,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": 43820, - "total_submitted": 49850, + "total_acs": 44125, + "total_submitted": 50224, "frontend_question_id": 1270, "is_new_question": false }, @@ -25223,8 +25522,8 @@ "question__title": "Print Immutable Linked List in Reverse", "question__title_slug": "print-immutable-linked-list-in-reverse", "question__hide": false, - "total_acs": 45678, - "total_submitted": 48419, + "total_acs": 45992, + "total_submitted": 48776, "frontend_question_id": 1265, "is_new_question": false }, @@ -25246,8 +25545,8 @@ "question__title": "Palindrome Partitioning III", "question__title_slug": "palindrome-partitioning-iii", "question__hide": false, - "total_acs": 21409, - "total_submitted": 35220, + "total_acs": 21528, + "total_submitted": 35394, "frontend_question_id": 1278, "is_new_question": false }, @@ -25269,8 +25568,8 @@ "question__title": "Count Square Submatrices with All Ones", "question__title_slug": "count-square-submatrices-with-all-ones", "question__hide": false, - "total_acs": 182675, - "total_submitted": 245432, + "total_acs": 183687, + "total_submitted": 246839, "frontend_question_id": 1277, "is_new_question": false }, @@ -25292,8 +25591,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": 20049, - "total_submitted": 39587, + "total_acs": 20162, + "total_submitted": 39820, "frontend_question_id": 1276, "is_new_question": false }, @@ -25315,8 +25614,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": 93438, - "total_submitted": 172024, + "total_acs": 94241, + "total_submitted": 173547, "frontend_question_id": 1275, "is_new_question": false }, @@ -25338,8 +25637,8 @@ "question__title": "Page Recommendations", "question__title_slug": "page-recommendations", "question__hide": false, - "total_acs": 29444, - "total_submitted": 43438, + "total_acs": 29792, + "total_submitted": 43980, "frontend_question_id": 1264, "is_new_question": false }, @@ -25361,8 +25660,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": 30322, - "total_submitted": 69532, + "total_acs": 30498, + "total_submitted": 69945, "frontend_question_id": 1269, "is_new_question": false }, @@ -25384,8 +25683,8 @@ "question__title": "Search Suggestions System", "question__title_slug": "search-suggestions-system", "question__hide": false, - "total_acs": 233664, - "total_submitted": 350693, + "total_acs": 235305, + "total_submitted": 353458, "frontend_question_id": 1268, "is_new_question": false }, @@ -25407,8 +25706,8 @@ "question__title": "Count Servers that Communicate", "question__title_slug": "count-servers-that-communicate", "question__hide": false, - "total_acs": 48300, - "total_submitted": 81614, + "total_acs": 48639, + "total_submitted": 82141, "frontend_question_id": 1267, "is_new_question": false }, @@ -25430,8 +25729,8 @@ "question__title": "Minimum Time Visiting All Points", "question__title_slug": "minimum-time-visiting-all-points", "question__hide": false, - "total_acs": 126687, - "total_submitted": 160130, + "total_acs": 127409, + "total_submitted": 161051, "frontend_question_id": 1266, "is_new_question": false }, @@ -25453,8 +25752,8 @@ "question__title": "Minimum Path Cost in a Grid", "question__title_slug": "minimum-path-cost-in-a-grid", "question__hide": false, - "total_acs": 18101, - "total_submitted": 27668, + "total_acs": 18413, + "total_submitted": 28112, "frontend_question_id": 2304, "is_new_question": false }, @@ -25476,8 +25775,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": 12188, - "total_submitted": 25191, + "total_acs": 12324, + "total_submitted": 25590, "frontend_question_id": 2218, "is_new_question": false }, @@ -25499,8 +25798,8 @@ "question__title": "Find the Difference of Two Arrays", "question__title_slug": "find-the-difference-of-two-arrays", "question__hide": false, - "total_acs": 39461, - "total_submitted": 57081, + "total_acs": 40515, + "total_submitted": 58556, "frontend_question_id": 2215, "is_new_question": false }, @@ -25522,8 +25821,8 @@ "question__title": "Counting Elements", "question__title_slug": "counting-elements", "question__hide": false, - "total_acs": 91860, - "total_submitted": 154192, + "total_acs": 92749, + "total_submitted": 155587, "frontend_question_id": 1426, "is_new_question": false }, @@ -25545,8 +25844,8 @@ "question__title": "Average Selling Price", "question__title_slug": "average-selling-price", "question__hide": false, - "total_acs": 44930, - "total_submitted": 53988, + "total_acs": 45614, + "total_submitted": 54810, "frontend_question_id": 1251, "is_new_question": false }, @@ -25568,8 +25867,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": 23259, - "total_submitted": 47438, + "total_acs": 23348, + "total_submitted": 47585, "frontend_question_id": 1263, "is_new_question": false }, @@ -25591,8 +25890,8 @@ "question__title": "Greatest Sum Divisible by Three", "question__title_slug": "greatest-sum-divisible-by-three", "question__hide": false, - "total_acs": 42818, - "total_submitted": 84187, + "total_acs": 43089, + "total_submitted": 84698, "frontend_question_id": 1262, "is_new_question": false }, @@ -25614,8 +25913,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": 50701, - "total_submitted": 66678, + "total_acs": 51113, + "total_submitted": 67187, "frontend_question_id": 1261, "is_new_question": false }, @@ -25637,8 +25936,8 @@ "question__title": "Shift 2D Grid", "question__title_slug": "shift-2d-grid", "question__hide": false, - "total_acs": 90367, - "total_submitted": 132899, + "total_acs": 90764, + "total_submitted": 133529, "frontend_question_id": 1260, "is_new_question": false }, @@ -25660,8 +25959,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": 1207, - "total_submitted": 1911, + "total_acs": 1224, + "total_submitted": 1937, "frontend_question_id": 2189, "is_new_question": false }, @@ -25683,8 +25982,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": 5743, - "total_submitted": 9719, + "total_acs": 5770, + "total_submitted": 9772, "frontend_question_id": 1618, "is_new_question": false }, @@ -25706,8 +26005,8 @@ "question__title": "Number of Single Divisor Triplets", "question__title_slug": "number-of-single-divisor-triplets", "question__hide": false, - "total_acs": 649, - "total_submitted": 1151, + "total_acs": 669, + "total_submitted": 1189, "frontend_question_id": 2198, "is_new_question": false }, @@ -25729,8 +26028,8 @@ "question__title": "Calculate Amount Paid in Taxes", "question__title_slug": "calculate-amount-paid-in-taxes", "question__hide": false, - "total_acs": 24788, - "total_submitted": 39268, + "total_acs": 25268, + "total_submitted": 39969, "frontend_question_id": 2303, "is_new_question": false }, @@ -25752,8 +26051,8 @@ "question__title": "Maximum Score Words Formed by Letters", "question__title_slug": "maximum-score-words-formed-by-letters", "question__hide": false, - "total_acs": 26574, - "total_submitted": 36482, + "total_acs": 26866, + "total_submitted": 36894, "frontend_question_id": 1255, "is_new_question": false }, @@ -25775,8 +26074,8 @@ "question__title": "Number of Closed Islands", "question__title_slug": "number-of-closed-islands", "question__hide": false, - "total_acs": 114660, - "total_submitted": 178626, + "total_acs": 116047, + "total_submitted": 180669, "frontend_question_id": 1254, "is_new_question": false }, @@ -25798,8 +26097,8 @@ "question__title": "Reconstruct a 2-Row Binary Matrix", "question__title_slug": "reconstruct-a-2-row-binary-matrix", "question__hide": false, - "total_acs": 21205, - "total_submitted": 48411, + "total_acs": 21326, + "total_submitted": 48699, "frontend_question_id": 1253, "is_new_question": false }, @@ -25821,8 +26120,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": 87575, - "total_submitted": 111455, + "total_acs": 88123, + "total_submitted": 112131, "frontend_question_id": 1252, "is_new_question": false }, @@ -25844,8 +26143,8 @@ "question__title": "Number of Comments per Post", "question__title_slug": "number-of-comments-per-post", "question__hide": false, - "total_acs": 28775, - "total_submitted": 42342, + "total_acs": 28927, + "total_submitted": 42646, "frontend_question_id": 1241, "is_new_question": false }, @@ -25867,8 +26166,8 @@ "question__title": "Selling Pieces of Wood", "question__title_slug": "selling-pieces-of-wood", "question__hide": false, - "total_acs": 6929, - "total_submitted": 14414, + "total_acs": 7022, + "total_submitted": 14600, "frontend_question_id": 2312, "is_new_question": false }, @@ -25890,8 +26189,8 @@ "question__title": "Find Palindrome With Fixed Length", "question__title_slug": "find-palindrome-with-fixed-length", "question__hide": false, - "total_acs": 13125, - "total_submitted": 38235, + "total_acs": 13286, + "total_submitted": 38653, "frontend_question_id": 2217, "is_new_question": false }, @@ -25913,8 +26212,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": 157954, - "total_submitted": 298076, + "total_acs": 158391, + "total_submitted": 298814, "frontend_question_id": 1428, "is_new_question": false }, @@ -25936,8 +26235,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": 15704, - "total_submitted": 26714, + "total_acs": 15902, + "total_submitted": 26993, "frontend_question_id": 1250, "is_new_question": false }, @@ -25959,8 +26258,8 @@ "question__title": "Minimum Remove to Make Valid Parentheses", "question__title_slug": "minimum-remove-to-make-valid-parentheses", "question__hide": false, - "total_acs": 474734, - "total_submitted": 723136, + "total_acs": 476761, + "total_submitted": 726027, "frontend_question_id": 1249, "is_new_question": false }, @@ -25982,8 +26281,8 @@ "question__title": "Count Number of Nice Subarrays", "question__title_slug": "count-number-of-nice-subarrays", "question__hide": false, - "total_acs": 67018, - "total_submitted": 112647, + "total_acs": 68200, + "total_submitted": 114442, "frontend_question_id": 1248, "is_new_question": false }, @@ -26005,8 +26304,8 @@ "question__title": "Minimum Swaps to Make Strings Equal", "question__title_slug": "minimum-swaps-to-make-strings-equal", "question__hide": false, - "total_acs": 30622, - "total_submitted": 48091, + "total_acs": 30812, + "total_submitted": 48344, "frontend_question_id": 1247, "is_new_question": false }, @@ -26028,8 +26327,8 @@ "question__title": "Web Crawler Multithreaded", "question__title_slug": "web-crawler-multithreaded", "question__hide": false, - "total_acs": 38242, - "total_submitted": 77967, + "total_acs": 38511, + "total_submitted": 78429, "frontend_question_id": 1242, "is_new_question": false }, @@ -26051,8 +26350,8 @@ "question__title": "Maximum Height by Stacking Cuboids ", "question__title_slug": "maximum-height-by-stacking-cuboids", "question__hide": false, - "total_acs": 15118, - "total_submitted": 27896, + "total_acs": 15314, + "total_submitted": 28295, "frontend_question_id": 1691, "is_new_question": false }, @@ -26074,8 +26373,8 @@ "question__title": "First Unique Number", "question__title_slug": "first-unique-number", "question__hide": false, - "total_acs": 75762, - "total_submitted": 143721, + "total_acs": 75994, + "total_submitted": 144134, "frontend_question_id": 1429, "is_new_question": false }, @@ -26097,8 +26396,8 @@ "question__title": "Tuple with Same Product", "question__title_slug": "tuple-with-same-product", "question__hide": false, - "total_acs": 21445, - "total_submitted": 35286, + "total_acs": 21653, + "total_submitted": 35600, "frontend_question_id": 1726, "is_new_question": false }, @@ -26120,8 +26419,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": 32414, - "total_submitted": 47349, + "total_acs": 33003, + "total_submitted": 48152, "frontend_question_id": 2309, "is_new_question": false }, @@ -26143,8 +26442,8 @@ "question__title": "Airplane Seat Assignment Probability", "question__title_slug": "airplane-seat-assignment-probability", "question__hide": false, - "total_acs": 29005, - "total_submitted": 44720, + "total_acs": 29233, + "total_submitted": 45058, "frontend_question_id": 1227, "is_new_question": false }, @@ -26166,8 +26465,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": 20530, - "total_submitted": 38050, + "total_acs": 20610, + "total_submitted": 38222, "frontend_question_id": 1240, "is_new_question": false }, @@ -26189,8 +26488,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": 161986, - "total_submitted": 310220, + "total_acs": 164324, + "total_submitted": 314590, "frontend_question_id": 1239, "is_new_question": false }, @@ -26212,8 +26511,8 @@ "question__title": "Circular Permutation in Binary Representation", "question__title_slug": "circular-permutation-in-binary-representation", "question__hide": false, - "total_acs": 13644, - "total_submitted": 19813, + "total_acs": 13734, + "total_submitted": 19956, "frontend_question_id": 1238, "is_new_question": false }, @@ -26235,8 +26534,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": 54346, - "total_submitted": 78461, + "total_acs": 54676, + "total_submitted": 78924, "frontend_question_id": 1237, "is_new_question": false }, @@ -26258,8 +26557,8 @@ "question__title": "Report Contiguous Dates", "question__title_slug": "report-contiguous-dates", "question__hide": false, - "total_acs": 16303, - "total_submitted": 25725, + "total_acs": 16444, + "total_submitted": 25946, "frontend_question_id": 1225, "is_new_question": false }, @@ -26281,8 +26580,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": 13734, - "total_submitted": 26898, + "total_acs": 14293, + "total_submitted": 27948, "frontend_question_id": 2193, "is_new_question": false }, @@ -26304,8 +26603,8 @@ "question__title": "Minimum Deletions to Make Array Beautiful", "question__title_slug": "minimum-deletions-to-make-array-beautiful", "question__hide": false, - "total_acs": 22428, - "total_submitted": 48618, + "total_acs": 22661, + "total_submitted": 49058, "frontend_question_id": 2216, "is_new_question": false }, @@ -26327,8 +26626,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": 27708, - "total_submitted": 40096, + "total_acs": 28899, + "total_submitted": 41981, "frontend_question_id": 2225, "is_new_question": false }, @@ -26350,8 +26649,8 @@ "question__title": "Find Resultant Array After Removing Anagrams", "question__title_slug": "find-resultant-array-after-removing-anagrams", "question__hide": false, - "total_acs": 30920, - "total_submitted": 53264, + "total_acs": 32531, + "total_submitted": 55854, "frontend_question_id": 2273, "is_new_question": false }, @@ -26373,8 +26672,8 @@ "question__title": "Maximum Profit in Job Scheduling", "question__title_slug": "maximum-profit-in-job-scheduling", "question__hide": false, - "total_acs": 138734, - "total_submitted": 271496, + "total_acs": 140401, + "total_submitted": 274518, "frontend_question_id": 1235, "is_new_question": false }, @@ -26396,8 +26695,8 @@ "question__title": "Replace the Substring for Balanced String", "question__title_slug": "replace-the-substring-for-balanced-string", "question__hide": false, - "total_acs": 25640, - "total_submitted": 69685, + "total_acs": 26007, + "total_submitted": 70504, "frontend_question_id": 1234, "is_new_question": false }, @@ -26419,8 +26718,8 @@ "question__title": "Remove Sub-Folders from the Filesystem", "question__title_slug": "remove-sub-folders-from-the-filesystem", "question__hide": false, - "total_acs": 45932, - "total_submitted": 70232, + "total_acs": 46101, + "total_submitted": 70460, "frontend_question_id": 1233, "is_new_question": false }, @@ -26442,8 +26741,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": 133275, - "total_submitted": 323604, + "total_acs": 134593, + "total_submitted": 327481, "frontend_question_id": 1232, "is_new_question": false }, @@ -26465,8 +26764,8 @@ "question__title": "Maximum Score Of Spliced Array", "question__title_slug": "maximum-score-of-spliced-array", "question__hide": false, - "total_acs": 14368, - "total_submitted": 26025, + "total_acs": 14511, + "total_submitted": 26213, "frontend_question_id": 2321, "is_new_question": false }, @@ -26488,8 +26787,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": 1605, - "total_submitted": 2257, + "total_acs": 1638, + "total_submitted": 2296, "frontend_question_id": 2204, "is_new_question": false }, @@ -26511,8 +26810,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": 19369, - "total_submitted": 85222, + "total_acs": 19598, + "total_submitted": 86052, "frontend_question_id": 2202, "is_new_question": false }, @@ -26534,8 +26833,8 @@ "question__title": "Perform String Shifts", "question__title_slug": "perform-string-shifts", "question__hide": false, - "total_acs": 72026, - "total_submitted": 132839, + "total_acs": 72171, + "total_submitted": 133068, "frontend_question_id": 1427, "is_new_question": false }, @@ -26557,8 +26856,8 @@ "question__title": "Maximum Equal Frequency", "question__title_slug": "maximum-equal-frequency", "question__hide": false, - "total_acs": 12009, - "total_submitted": 32636, + "total_acs": 12164, + "total_submitted": 32993, "frontend_question_id": 1224, "is_new_question": false }, @@ -26580,8 +26879,8 @@ "question__title": "Dice Roll Simulation", "question__title_slug": "dice-roll-simulation", "question__hide": false, - "total_acs": 24024, - "total_submitted": 49678, + "total_acs": 24147, + "total_submitted": 49927, "frontend_question_id": 1223, "is_new_question": false }, @@ -26603,8 +26902,8 @@ "question__title": "Queens That Can Attack the King", "question__title_slug": "queens-that-can-attack-the-king", "question__hide": false, - "total_acs": 35216, - "total_submitted": 49113, + "total_acs": 35401, + "total_submitted": 49350, "frontend_question_id": 1222, "is_new_question": false }, @@ -26626,8 +26925,8 @@ "question__title": "Split a String in Balanced Strings", "question__title_slug": "split-a-string-in-balanced-strings", "question__hide": false, - "total_acs": 221592, - "total_submitted": 261558, + "total_acs": 223495, + "total_submitted": 263646, "frontend_question_id": 1221, "is_new_question": false }, @@ -26649,8 +26948,8 @@ "question__title": "The Dining Philosophers", "question__title_slug": "the-dining-philosophers", "question__hide": false, - "total_acs": 21915, - "total_submitted": 38681, + "total_acs": 22175, + "total_submitted": 39160, "frontend_question_id": 1226, "is_new_question": false }, @@ -26672,8 +26971,8 @@ "question__title": "Team Scores in Football Tournament", "question__title_slug": "team-scores-in-football-tournament", "question__hide": false, - "total_acs": 28634, - "total_submitted": 49738, + "total_acs": 28816, + "total_submitted": 50040, "frontend_question_id": 1212, "is_new_question": false }, @@ -26695,8 +26994,8 @@ "question__title": "Queries Quality and Percentage", "question__title_slug": "queries-quality-and-percentage", "question__hide": false, - "total_acs": 31709, - "total_submitted": 44100, + "total_acs": 32136, + "total_submitted": 44687, "frontend_question_id": 1211, "is_new_question": false }, @@ -26718,8 +27017,8 @@ "question__title": "Design Skiplist", "question__title_slug": "design-skiplist", "question__hide": false, - "total_acs": 15346, - "total_submitted": 25356, + "total_acs": 15496, + "total_submitted": 25575, "frontend_question_id": 1206, "is_new_question": false }, @@ -26741,8 +27040,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": 2358, - "total_submitted": 7974, + "total_acs": 2378, + "total_submitted": 8102, "frontend_question_id": 1960, "is_new_question": false }, @@ -26764,8 +27063,8 @@ "question__title": "Maximum Candies Allocated to K Children", "question__title_slug": "maximum-candies-allocated-to-k-children", "question__hide": false, - "total_acs": 21209, - "total_submitted": 58937, + "total_acs": 21498, + "total_submitted": 59741, "frontend_question_id": 2226, "is_new_question": false }, @@ -26787,8 +27086,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": 19689, - "total_submitted": 77439, + "total_acs": 19839, + "total_submitted": 77948, "frontend_question_id": 2310, "is_new_question": false }, @@ -26810,8 +27109,8 @@ "question__title": "Sort the Jumbled Numbers", "question__title_slug": "sort-the-jumbled-numbers", "question__hide": false, - "total_acs": 14821, - "total_submitted": 32806, + "total_acs": 14962, + "total_submitted": 33060, "frontend_question_id": 2191, "is_new_question": false }, @@ -26833,8 +27132,8 @@ "question__title": "Count Vowels Permutation", "question__title_slug": "count-vowels-permutation", "question__hide": false, - "total_acs": 98874, - "total_submitted": 162970, + "total_acs": 99437, + "total_submitted": 164030, "frontend_question_id": 1220, "is_new_question": false }, @@ -26856,8 +27155,8 @@ "question__title": "Path with Maximum Gold", "question__title_slug": "path-with-maximum-gold", "question__hide": false, - "total_acs": 93189, - "total_submitted": 144962, + "total_acs": 93817, + "total_submitted": 146230, "frontend_question_id": 1219, "is_new_question": false }, @@ -26879,8 +27178,8 @@ "question__title": "Longest Arithmetic Subsequence of Given Difference", "question__title_slug": "longest-arithmetic-subsequence-of-given-difference", "question__hide": false, - "total_acs": 56223, - "total_submitted": 108604, + "total_acs": 56681, + "total_submitted": 109453, "frontend_question_id": 1218, "is_new_question": false }, @@ -26902,8 +27201,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": 104838, - "total_submitted": 145148, + "total_acs": 105423, + "total_submitted": 145990, "frontend_question_id": 1217, "is_new_question": false }, @@ -26925,8 +27224,8 @@ "question__title": "Monthly Transactions II", "question__title_slug": "monthly-transactions-ii", "question__hide": false, - "total_acs": 18074, - "total_submitted": 41280, + "total_acs": 18241, + "total_submitted": 41677, "frontend_question_id": 1205, "is_new_question": false }, @@ -26948,8 +27247,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": 33285, - "total_submitted": 44902, + "total_acs": 33547, + "total_submitted": 45234, "frontend_question_id": 1204, "is_new_question": false }, @@ -26971,8 +27270,8 @@ "question__title": "Sum of Floored Pairs", "question__title_slug": "sum-of-floored-pairs", "question__hide": false, - "total_acs": 6917, - "total_submitted": 24472, + "total_acs": 6968, + "total_submitted": 24678, "frontend_question_id": 1862, "is_new_question": false }, @@ -26994,8 +27293,8 @@ "question__title": "Path with Maximum Probability", "question__title_slug": "path-with-maximum-probability", "question__hide": false, - "total_acs": 55709, - "total_submitted": 115324, + "total_acs": 56669, + "total_submitted": 117144, "frontend_question_id": 1514, "is_new_question": false }, @@ -27017,8 +27316,8 @@ "question__title": "Where Will the Ball Fall", "question__title_slug": "where-will-the-ball-fall", "question__hide": false, - "total_acs": 54322, - "total_submitted": 82523, + "total_acs": 106232, + "total_submitted": 148305, "frontend_question_id": 1706, "is_new_question": false }, @@ -27040,8 +27339,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": 7856, - "total_submitted": 16065, + "total_acs": 7914, + "total_submitted": 16149, "frontend_question_id": 1210, "is_new_question": false }, @@ -27063,8 +27362,8 @@ "question__title": "Get Equal Substrings Within Budget", "question__title_slug": "get-equal-substrings-within-budget", "question__hide": false, - "total_acs": 33038, - "total_submitted": 69319, + "total_acs": 33368, + "total_submitted": 69943, "frontend_question_id": 1208, "is_new_question": false }, @@ -27086,8 +27385,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": 241684, - "total_submitted": 431777, + "total_acs": 244655, + "total_submitted": 437165, "frontend_question_id": 1209, "is_new_question": false }, @@ -27109,8 +27408,8 @@ "question__title": "Unique Number of Occurrences", "question__title_slug": "unique-number-of-occurrences", "question__hide": false, - "total_acs": 168861, - "total_submitted": 238131, + "total_acs": 172243, + "total_submitted": 243021, "frontend_question_id": 1207, "is_new_question": false }, @@ -27132,8 +27431,8 @@ "question__title": "Tournament Winners", "question__title_slug": "tournament-winners", "question__hide": false, - "total_acs": 15503, - "total_submitted": 30034, + "total_acs": 15639, + "total_submitted": 30328, "frontend_question_id": 1194, "is_new_question": false }, @@ -27155,8 +27454,8 @@ "question__title": "Monthly Transactions I", "question__title_slug": "monthly-transactions-i", "question__hide": false, - "total_acs": 30478, - "total_submitted": 45355, + "total_acs": 30954, + "total_submitted": 46191, "frontend_question_id": 1193, "is_new_question": false }, @@ -27178,8 +27477,8 @@ "question__title": "Fizz Buzz Multithreaded", "question__title_slug": "fizz-buzz-multithreaded", "question__hide": false, - "total_acs": 33051, - "total_submitted": 45553, + "total_acs": 33420, + "total_submitted": 46049, "frontend_question_id": 1195, "is_new_question": false }, @@ -27201,8 +27500,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": 4637, - "total_submitted": 9511, + "total_acs": 4670, + "total_submitted": 9596, "frontend_question_id": 1916, "is_new_question": false }, @@ -27224,8 +27523,8 @@ "question__title": "Count Artifacts That Can Be Extracted", "question__title_slug": "count-artifacts-that-can-be-extracted", "question__hide": false, - "total_acs": 16112, - "total_submitted": 29339, + "total_acs": 16211, + "total_submitted": 29476, "frontend_question_id": 2201, "is_new_question": false }, @@ -27247,8 +27546,8 @@ "question__title": "Largest Magic Square", "question__title_slug": "largest-magic-square", "question__hide": false, - "total_acs": 8561, - "total_submitted": 16496, + "total_acs": 8610, + "total_submitted": 16566, "frontend_question_id": 1895, "is_new_question": false }, @@ -27270,8 +27569,8 @@ "question__title": "Watering Plants", "question__title_slug": "watering-plants", "question__hide": false, - "total_acs": 28436, - "total_submitted": 35464, + "total_acs": 28999, + "total_submitted": 36180, "frontend_question_id": 2079, "is_new_question": false }, @@ -27293,8 +27592,8 @@ "question__title": "Sort Items by Groups Respecting Dependencies", "question__title_slug": "sort-items-by-groups-respecting-dependencies", "question__hide": false, - "total_acs": 13940, - "total_submitted": 27540, + "total_acs": 14026, + "total_submitted": 27695, "frontend_question_id": 1203, "is_new_question": false }, @@ -27316,8 +27615,8 @@ "question__title": "Smallest String With Swaps", "question__title_slug": "smallest-string-with-swaps", "question__hide": false, - "total_acs": 91496, - "total_submitted": 158951, + "total_acs": 92088, + "total_submitted": 159956, "frontend_question_id": 1202, "is_new_question": false }, @@ -27339,8 +27638,8 @@ "question__title": "Ugly Number III", "question__title_slug": "ugly-number-iii", "question__hide": false, - "total_acs": 23934, - "total_submitted": 83883, + "total_acs": 24117, + "total_submitted": 84479, "frontend_question_id": 1201, "is_new_question": false }, @@ -27362,8 +27661,8 @@ "question__title": "Minimum Absolute Difference", "question__title_slug": "minimum-absolute-difference", "question__hide": false, - "total_acs": 139883, - "total_submitted": 200451, + "total_acs": 141626, + "total_submitted": 202985, "frontend_question_id": 1200, "is_new_question": false }, @@ -27385,8 +27684,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": 28485, - "total_submitted": 40779, + "total_acs": 28857, + "total_submitted": 41382, "frontend_question_id": 1944, "is_new_question": false }, @@ -27408,8 +27707,8 @@ "question__title": "Longest Happy String", "question__title_slug": "longest-happy-string", "question__hide": false, - "total_acs": 58687, - "total_submitted": 102318, + "total_acs": 59387, + "total_submitted": 103499, "frontend_question_id": 1405, "is_new_question": false }, @@ -27431,8 +27730,8 @@ "question__title": "Minimum Moves to Reach Target Score", "question__title_slug": "minimum-moves-to-reach-target-score", "question__hide": false, - "total_acs": 29166, - "total_submitted": 60302, + "total_acs": 29482, + "total_submitted": 61019, "frontend_question_id": 2139, "is_new_question": false }, @@ -27454,8 +27753,8 @@ "question__title": "Delete Characters to Make Fancy String", "question__title_slug": "delete-characters-to-make-fancy-string", "question__hide": false, - "total_acs": 23583, - "total_submitted": 41712, + "total_acs": 24086, + "total_submitted": 42501, "frontend_question_id": 1957, "is_new_question": false }, @@ -27471,14 +27770,14 @@ { "stat": { "question_id": 1301, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "reformat-department-table", + "question__article__has_video_solution": false, "question__title": "Reformat Department Table", "question__title_slug": "reformat-department-table", "question__hide": false, - "total_acs": 82203, - "total_submitted": 99506, + "total_acs": 83054, + "total_submitted": 100565, "frontend_question_id": 1179, "is_new_question": false }, @@ -27500,8 +27799,8 @@ "question__title": "Critical Connections in a Network", "question__title_slug": "critical-connections-in-a-network", "question__hide": false, - "total_acs": 187389, - "total_submitted": 343982, + "total_acs": 188185, + "total_submitted": 345539, "frontend_question_id": 1192, "is_new_question": false }, @@ -27523,8 +27822,8 @@ "question__title": "K-Concatenation Maximum Sum", "question__title_slug": "k-concatenation-maximum-sum", "question__hide": false, - "total_acs": 27895, - "total_submitted": 116436, + "total_acs": 28090, + "total_submitted": 117356, "frontend_question_id": 1191, "is_new_question": false }, @@ -27546,8 +27845,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": 55767, - "total_submitted": 84655, + "total_acs": 56288, + "total_submitted": 85492, "frontend_question_id": 1190, "is_new_question": false }, @@ -27569,8 +27868,8 @@ "question__title": "Maximum Number of Balloons", "question__title_slug": "maximum-number-of-balloons", "question__hide": false, - "total_acs": 123381, - "total_submitted": 198632, + "total_acs": 125572, + "total_submitted": 202719, "frontend_question_id": 1189, "is_new_question": false }, @@ -27592,8 +27891,8 @@ "question__title": "Kth Ancestor of a Tree Node", "question__title_slug": "kth-ancestor-of-a-tree-node", "question__hide": false, - "total_acs": 24552, - "total_submitted": 72659, + "total_acs": 24789, + "total_submitted": 73215, "frontend_question_id": 1483, "is_new_question": false }, @@ -27615,8 +27914,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": 12722, - "total_submitted": 24026, + "total_acs": 12807, + "total_submitted": 24181, "frontend_question_id": 1954, "is_new_question": false }, @@ -27638,8 +27937,8 @@ "question__title": "Range Frequency Queries", "question__title_slug": "range-frequency-queries", "question__hide": false, - "total_acs": 14325, - "total_submitted": 37511, + "total_acs": 14488, + "total_submitted": 37893, "frontend_question_id": 2080, "is_new_question": false }, @@ -27661,8 +27960,8 @@ "question__title": "Three Consecutive Odds", "question__title_slug": "three-consecutive-odds", "question__hide": false, - "total_acs": 58368, - "total_submitted": 91610, + "total_acs": 58949, + "total_submitted": 92584, "frontend_question_id": 1550, "is_new_question": false }, @@ -27684,8 +27983,8 @@ "question__title": "Immediate Food Delivery II", "question__title_slug": "immediate-food-delivery-ii", "question__hide": false, - "total_acs": 26784, - "total_submitted": 41874, + "total_acs": 27032, + "total_submitted": 42303, "frontend_question_id": 1174, "is_new_question": false }, @@ -27707,8 +28006,8 @@ "question__title": "Immediate Food Delivery I", "question__title_slug": "immediate-food-delivery-i", "question__hide": false, - "total_acs": 47323, - "total_submitted": 56782, + "total_acs": 47953, + "total_submitted": 57512, "frontend_question_id": 1173, "is_new_question": false }, @@ -27730,8 +28029,8 @@ "question__title": "Make Array Strictly Increasing", "question__title_slug": "make-array-strictly-increasing", "question__hide": false, - "total_acs": 12962, - "total_submitted": 28646, + "total_acs": 13035, + "total_submitted": 28815, "frontend_question_id": 1187, "is_new_question": false }, @@ -27753,8 +28052,8 @@ "question__title": "Day of the Week", "question__title_slug": "day-of-the-week", "question__hide": false, - "total_acs": 48752, - "total_submitted": 84391, + "total_acs": 49144, + "total_submitted": 85146, "frontend_question_id": 1185, "is_new_question": false }, @@ -27776,8 +28075,8 @@ "question__title": "Maximum Subarray Sum with One Deletion", "question__title_slug": "maximum-subarray-sum-with-one-deletion", "question__hide": false, - "total_acs": 36433, - "total_submitted": 88412, + "total_acs": 36661, + "total_submitted": 88892, "frontend_question_id": 1186, "is_new_question": false }, @@ -27799,8 +28098,8 @@ "question__title": "Distance Between Bus Stops", "question__title_slug": "distance-between-bus-stops", "question__hide": false, - "total_acs": 46332, - "total_submitted": 85613, + "total_acs": 46693, + "total_submitted": 86240, "frontend_question_id": 1184, "is_new_question": false }, @@ -27822,8 +28121,8 @@ "question__title": "Constrained Subsequence Sum", "question__title_slug": "constrained-subsequence-sum", "question__hide": false, - "total_acs": 22294, - "total_submitted": 47091, + "total_acs": 22476, + "total_submitted": 47489, "frontend_question_id": 1425, "is_new_question": false }, @@ -27845,8 +28144,8 @@ "question__title": "Balance a Binary Search Tree", "question__title_slug": "balance-a-binary-search-tree", "question__hide": false, - "total_acs": 107758, - "total_submitted": 133626, + "total_acs": 108561, + "total_submitted": 134635, "frontend_question_id": 1382, "is_new_question": false }, @@ -27868,8 +28167,8 @@ "question__title": "Four Divisors", "question__title_slug": "four-divisors", "question__hide": false, - "total_acs": 23294, - "total_submitted": 56558, + "total_acs": 23513, + "total_submitted": 57003, "frontend_question_id": 1390, "is_new_question": false }, @@ -27891,8 +28190,8 @@ "question__title": "Reformat Date", "question__title_slug": "reformat-date", "question__hide": false, - "total_acs": 48173, - "total_submitted": 77150, + "total_acs": 48704, + "total_submitted": 77951, "frontend_question_id": 1507, "is_new_question": false }, @@ -27914,8 +28213,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": 27851, - "total_submitted": 59810, + "total_acs": 27907, + "total_submitted": 59943, "frontend_question_id": 1178, "is_new_question": false }, @@ -27937,8 +28236,8 @@ "question__title": "Can Make Palindrome from Substring", "question__title_slug": "can-make-palindrome-from-substring", "question__hide": false, - "total_acs": 22206, - "total_submitted": 58610, + "total_acs": 22381, + "total_submitted": 58966, "frontend_question_id": 1177, "is_new_question": false }, @@ -27960,8 +28259,8 @@ "question__title": "Diet Plan Performance", "question__title_slug": "diet-plan-performance", "question__hide": false, - "total_acs": 27714, - "total_submitted": 52891, + "total_acs": 27866, + "total_submitted": 53208, "frontend_question_id": 1176, "is_new_question": false }, @@ -27983,8 +28282,8 @@ "question__title": "Prime Arrangements", "question__title_slug": "prime-arrangements", "question__hide": false, - "total_acs": 22688, - "total_submitted": 42433, + "total_acs": 22916, + "total_submitted": 42785, "frontend_question_id": 1175, "is_new_question": false }, @@ -28006,8 +28305,8 @@ "question__title": "Product Price at a Given Date", "question__title_slug": "product-price-at-a-given-date", "question__hide": false, - "total_acs": 37383, - "total_submitted": 54607, + "total_acs": 37891, + "total_submitted": 55442, "frontend_question_id": 1164, "is_new_question": false }, @@ -28029,8 +28328,8 @@ "question__title": "Largest Multiple of Three", "question__title_slug": "largest-multiple-of-three", "question__hide": false, - "total_acs": 15592, - "total_submitted": 46641, + "total_acs": 15737, + "total_submitted": 47162, "frontend_question_id": 1363, "is_new_question": false }, @@ -28052,8 +28351,8 @@ "question__title": "Closest Divisors", "question__title_slug": "closest-divisors", "question__hide": false, - "total_acs": 17328, - "total_submitted": 28998, + "total_acs": 17461, + "total_submitted": 29190, "frontend_question_id": 1362, "is_new_question": false }, @@ -28075,8 +28374,8 @@ "question__title": "Validate Binary Tree Nodes", "question__title_slug": "validate-binary-tree-nodes", "question__hide": false, - "total_acs": 40045, - "total_submitted": 99173, + "total_acs": 40286, + "total_submitted": 99914, "frontend_question_id": 1361, "is_new_question": false }, @@ -28098,8 +28397,8 @@ "question__title": "Number of Days Between Two Dates", "question__title_slug": "number-of-days-between-two-dates", "question__hide": false, - "total_acs": 35257, - "total_submitted": 74194, + "total_acs": 35794, + "total_submitted": 75277, "frontend_question_id": 1360, "is_new_question": false }, @@ -28121,8 +28420,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": 69260, - "total_submitted": 112933, + "total_acs": 69561, + "total_submitted": 113373, "frontend_question_id": 1170, "is_new_question": false }, @@ -28144,8 +28443,8 @@ "question__title": "Invalid Transactions", "question__title_slug": "invalid-transactions", "question__hide": false, - "total_acs": 53030, - "total_submitted": 170678, + "total_acs": 54179, + "total_submitted": 173942, "frontend_question_id": 1169, "is_new_question": false }, @@ -28167,8 +28466,8 @@ "question__title": "Web Crawler", "question__title_slug": "web-crawler", "question__hide": false, - "total_acs": 26815, - "total_submitted": 40473, + "total_acs": 27303, + "total_submitted": 41205, "frontend_question_id": 1236, "is_new_question": false }, @@ -28190,8 +28489,8 @@ "question__title": "Dinner Plate Stacks", "question__title_slug": "dinner-plate-stacks", "question__hide": false, - "total_acs": 14941, - "total_submitted": 44411, + "total_acs": 15015, + "total_submitted": 44676, "frontend_question_id": 1172, "is_new_question": false }, @@ -28213,8 +28512,8 @@ "question__title": "Market Analysis II", "question__title_slug": "market-analysis-ii", "question__hide": false, - "total_acs": 15057, - "total_submitted": 25661, + "total_acs": 15148, + "total_submitted": 25837, "frontend_question_id": 1159, "is_new_question": false }, @@ -28236,8 +28535,8 @@ "question__title": "Market Analysis I", "question__title_slug": "market-analysis-i", "question__hide": false, - "total_acs": 52856, - "total_submitted": 82738, + "total_acs": 54611, + "total_submitted": 85658, "frontend_question_id": 1158, "is_new_question": false }, @@ -28259,8 +28558,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": 40911, - "total_submitted": 95393, + "total_acs": 41242, + "total_submitted": 96053, "frontend_question_id": 1171, "is_new_question": false }, @@ -28282,8 +28581,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": 36988, - "total_submitted": 52108, + "total_acs": 37519, + "total_submitted": 52841, "frontend_question_id": 1935, "is_new_question": false }, @@ -28305,8 +28604,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": 167914, - "total_submitted": 313552, + "total_acs": 169448, + "total_submitted": 316303, "frontend_question_id": 1155, "is_new_question": false }, @@ -28328,8 +28627,8 @@ "question__title": "Online Majority Element In Subarray", "question__title_slug": "online-majority-element-in-subarray", "question__hide": false, - "total_acs": 13947, - "total_submitted": 33213, + "total_acs": 14012, + "total_submitted": 33371, "frontend_question_id": 1157, "is_new_question": false }, @@ -28351,8 +28650,8 @@ "question__title": "Swap For Longest Repeated Character Substring", "question__title_slug": "swap-for-longest-repeated-character-substring", "question__hide": false, - "total_acs": 25394, - "total_submitted": 55873, + "total_acs": 25539, + "total_submitted": 56246, "frontend_question_id": 1156, "is_new_question": false }, @@ -28374,8 +28673,8 @@ "question__title": "Day of the Year", "question__title_slug": "day-of-the-year", "question__hide": false, - "total_acs": 38606, - "total_submitted": 76767, + "total_acs": 39015, + "total_submitted": 77673, "frontend_question_id": 1154, "is_new_question": false }, @@ -28397,8 +28696,8 @@ "question__title": "Article Views II", "question__title_slug": "article-views-ii", "question__hide": false, - "total_acs": 29378, - "total_submitted": 61667, + "total_acs": 29647, + "total_submitted": 62264, "frontend_question_id": 1149, "is_new_question": false }, @@ -28420,8 +28719,8 @@ "question__title": "Article Views I", "question__title_slug": "article-views-i", "question__hide": false, - "total_acs": 78011, - "total_submitted": 101272, + "total_acs": 80692, + "total_submitted": 104665, "frontend_question_id": 1148, "is_new_question": false }, @@ -28443,8 +28742,8 @@ "question__title": "Rank Transform of a Matrix", "question__title_slug": "rank-transform-of-a-matrix", "question__hide": false, - "total_acs": 19094, - "total_submitted": 46522, + "total_acs": 19177, + "total_submitted": 46771, "frontend_question_id": 1632, "is_new_question": false }, @@ -28466,8 +28765,8 @@ "question__title": "Rank Transform of an Array", "question__title_slug": "rank-transform-of-an-array", "question__hide": false, - "total_acs": 74076, - "total_submitted": 125574, + "total_acs": 75004, + "total_submitted": 127102, "frontend_question_id": 1331, "is_new_question": false }, @@ -28489,8 +28788,8 @@ "question__title": "Reverse Subarray To Maximize Array Value", "question__title_slug": "reverse-subarray-to-maximize-array-value", "question__hide": false, - "total_acs": 4324, - "total_submitted": 10836, + "total_acs": 4350, + "total_submitted": 10875, "frontend_question_id": 1330, "is_new_question": false }, @@ -28512,8 +28811,8 @@ "question__title": "Deepest Leaves Sum", "question__title_slug": "deepest-leaves-sum", "question__hide": false, - "total_acs": 247387, - "total_submitted": 284559, + "total_acs": 249731, + "total_submitted": 287371, "frontend_question_id": 1302, "is_new_question": false }, @@ -28535,8 +28834,8 @@ "question__title": "Sort the Matrix Diagonally", "question__title_slug": "sort-the-matrix-diagonally", "question__hide": false, - "total_acs": 138455, - "total_submitted": 165549, + "total_acs": 139173, + "total_submitted": 166400, "frontend_question_id": 1329, "is_new_question": false }, @@ -28558,8 +28857,8 @@ "question__title": "Break a Palindrome", "question__title_slug": "break-a-palindrome", "question__hide": false, - "total_acs": 132852, - "total_submitted": 249271, + "total_acs": 134423, + "total_submitted": 252527, "frontend_question_id": 1328, "is_new_question": false }, @@ -28581,8 +28880,8 @@ "question__title": "Longest Chunked Palindrome Decomposition", "question__title_slug": "longest-chunked-palindrome-decomposition", "question__hide": false, - "total_acs": 18471, - "total_submitted": 30792, + "total_acs": 18594, + "total_submitted": 31028, "frontend_question_id": 1147, "is_new_question": false }, @@ -28604,8 +28903,8 @@ "question__title": "Longest Common Subsequence", "question__title_slug": "longest-common-subsequence", "question__hide": false, - "total_acs": 546581, - "total_submitted": 929506, + "total_acs": 554908, + "total_submitted": 944280, "frontend_question_id": 1143, "is_new_question": false }, @@ -28627,8 +28926,8 @@ "question__title": "Snapshot Array", "question__title_slug": "snapshot-array", "question__hide": false, - "total_acs": 132681, - "total_submitted": 355258, + "total_acs": 133677, + "total_submitted": 357948, "frontend_question_id": 1146, "is_new_question": false }, @@ -28650,8 +28949,8 @@ "question__title": "Binary Tree Coloring Game", "question__title_slug": "binary-tree-coloring-game", "question__hide": false, - "total_acs": 38674, - "total_submitted": 75203, + "total_acs": 38869, + "total_submitted": 75555, "frontend_question_id": 1145, "is_new_question": false }, @@ -28673,8 +28972,8 @@ "question__title": "Decrease Elements To Make Array Zigzag", "question__title_slug": "decrease-elements-to-make-array-zigzag", "question__hide": false, - "total_acs": 16152, - "total_submitted": 34366, + "total_acs": 16248, + "total_submitted": 34563, "frontend_question_id": 1144, "is_new_question": false }, @@ -28696,8 +28995,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": 34692, - "total_submitted": 96405, + "total_acs": 34943, + "total_submitted": 97050, "frontend_question_id": 1142, "is_new_question": false }, @@ -28719,8 +29018,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": 68427, - "total_submitted": 136606, + "total_acs": 70607, + "total_submitted": 141102, "frontend_question_id": 1141, "is_new_question": false }, @@ -28742,8 +29041,8 @@ "question__title": "Distinct Echo Substrings", "question__title_slug": "distinct-echo-substrings", "question__hide": false, - "total_acs": 12919, - "total_submitted": 25951, + "total_acs": 13003, + "total_submitted": 26137, "frontend_question_id": 1316, "is_new_question": false }, @@ -28765,8 +29064,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": 116559, - "total_submitted": 136196, + "total_acs": 117649, + "total_submitted": 137430, "frontend_question_id": 1315, "is_new_question": false }, @@ -28788,8 +29087,8 @@ "question__title": "Matrix Block Sum", "question__title_slug": "matrix-block-sum", "question__hide": false, - "total_acs": 70233, - "total_submitted": 93093, + "total_acs": 70840, + "total_submitted": 93943, "frontend_question_id": 1314, "is_new_question": false }, @@ -28811,8 +29110,8 @@ "question__title": "Decompress Run-Length Encoded List", "question__title_slug": "decompress-run-length-encoded-list", "question__hide": false, - "total_acs": 204484, - "total_submitted": 238091, + "total_acs": 206326, + "total_submitted": 240293, "frontend_question_id": 1313, "is_new_question": false }, @@ -28834,8 +29133,8 @@ "question__title": "Stone Game II", "question__title_slug": "stone-game-ii", "question__hide": false, - "total_acs": 43594, - "total_submitted": 67153, + "total_acs": 43840, + "total_submitted": 67547, "frontend_question_id": 1140, "is_new_question": false }, @@ -28857,8 +29156,8 @@ "question__title": "Largest 1-Bordered Square", "question__title_slug": "largest-1-bordered-square", "question__hide": false, - "total_acs": 20607, - "total_submitted": 41218, + "total_acs": 20762, + "total_submitted": 41470, "frontend_question_id": 1139, "is_new_question": false }, @@ -28880,8 +29179,8 @@ "question__title": "Alphabet Board Path", "question__title_slug": "alphabet-board-path", "question__hide": false, - "total_acs": 43225, - "total_submitted": 82642, + "total_acs": 43459, + "total_submitted": 83093, "frontend_question_id": 1138, "is_new_question": false }, @@ -28903,8 +29202,8 @@ "question__title": "Reported Posts II", "question__title_slug": "reported-posts-ii", "question__hide": false, - "total_acs": 30924, - "total_submitted": 92018, + "total_acs": 31153, + "total_submitted": 92720, "frontend_question_id": 1132, "is_new_question": false }, @@ -28926,8 +29225,8 @@ "question__title": "N-th Tribonacci Number", "question__title_slug": "n-th-tribonacci-number", "question__hide": false, - "total_acs": 352913, - "total_submitted": 557272, + "total_acs": 358215, + "total_submitted": 565689, "frontend_question_id": 1137, "is_new_question": false }, @@ -28949,8 +29248,8 @@ "question__title": "Number of Paths with Max Score", "question__title_slug": "number-of-paths-with-max-score", "question__hide": false, - "total_acs": 10337, - "total_submitted": 26670, + "total_acs": 10398, + "total_submitted": 26833, "frontend_question_id": 1301, "is_new_question": false }, @@ -28972,8 +29271,8 @@ "question__title": "Number of Ships in a Rectangle", "question__title_slug": "number-of-ships-in-a-rectangle", "question__hide": false, - "total_acs": 22149, - "total_submitted": 31916, + "total_acs": 22532, + "total_submitted": 32481, "frontend_question_id": 1274, "is_new_question": false }, @@ -28995,8 +29294,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": 29667, - "total_submitted": 68882, + "total_acs": 29925, + "total_submitted": 69463, "frontend_question_id": 1300, "is_new_question": false }, @@ -29018,8 +29317,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": 245994, - "total_submitted": 329258, + "total_acs": 249663, + "total_submitted": 334070, "frontend_question_id": 1299, "is_new_question": false }, @@ -29041,8 +29340,8 @@ "question__title": "Maximum of Absolute Value Expression", "question__title_slug": "maximum-of-absolute-value-expression", "question__hide": false, - "total_acs": 18150, - "total_submitted": 36656, + "total_acs": 18252, + "total_submitted": 36913, "frontend_question_id": 1131, "is_new_question": false }, @@ -29064,8 +29363,8 @@ "question__title": "Shortest Path with Alternating Colors", "question__title_slug": "shortest-path-with-alternating-colors", "question__hide": false, - "total_acs": 45087, - "total_submitted": 105163, + "total_acs": 45665, + "total_submitted": 106381, "frontend_question_id": 1129, "is_new_question": false }, @@ -29087,8 +29386,8 @@ "question__title": "Minimum Cost Tree From Leaf Values", "question__title_slug": "minimum-cost-tree-from-leaf-values", "question__hide": false, - "total_acs": 79597, - "total_submitted": 116159, + "total_acs": 80009, + "total_submitted": 116790, "frontend_question_id": 1130, "is_new_question": false }, @@ -29110,8 +29409,8 @@ "question__title": "Number of Equivalent Domino Pairs", "question__title_slug": "number-of-equivalent-domino-pairs", "question__hide": false, - "total_acs": 53534, - "total_submitted": 114154, + "total_acs": 53923, + "total_submitted": 115015, "frontend_question_id": 1128, "is_new_question": false }, @@ -29133,8 +29432,8 @@ "question__title": "User Purchase Platform", "question__title_slug": "user-purchase-platform", "question__hide": false, - "total_acs": 12261, - "total_submitted": 23971, + "total_acs": 12320, + "total_submitted": 24105, "frontend_question_id": 1127, "is_new_question": false }, @@ -29156,8 +29455,8 @@ "question__title": "Active Businesses", "question__title_slug": "active-businesses", "question__hide": false, - "total_acs": 35578, - "total_submitted": 52406, + "total_acs": 35936, + "total_submitted": 53025, "frontend_question_id": 1126, "is_new_question": false }, @@ -29179,8 +29478,8 @@ "question__title": "Minimum Falling Path Sum II", "question__title_slug": "minimum-falling-path-sum-ii", "question__hide": false, - "total_acs": 35092, - "total_submitted": 58974, + "total_acs": 35440, + "total_submitted": 59663, "frontend_question_id": 1289, "is_new_question": false }, @@ -29202,8 +29501,8 @@ "question__title": "Graph Connectivity With Threshold", "question__title_slug": "graph-connectivity-with-threshold", "question__hide": false, - "total_acs": 12776, - "total_submitted": 27866, + "total_acs": 12928, + "total_submitted": 28168, "frontend_question_id": 1627, "is_new_question": false }, @@ -29225,8 +29524,8 @@ "question__title": "Remove Covered Intervals", "question__title_slug": "remove-covered-intervals", "question__hide": false, - "total_acs": 102770, - "total_submitted": 179352, + "total_acs": 103161, + "total_submitted": 180181, "frontend_question_id": 1288, "is_new_question": false }, @@ -29248,8 +29547,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": 70434, - "total_submitted": 118247, + "total_acs": 70986, + "total_submitted": 119229, "frontend_question_id": 1287, "is_new_question": false }, @@ -29271,8 +29570,8 @@ "question__title": "Smallest Sufficient Team", "question__title_slug": "smallest-sufficient-team", "question__hide": false, - "total_acs": 17762, - "total_submitted": 37704, + "total_acs": 17863, + "total_submitted": 37930, "frontend_question_id": 1125, "is_new_question": false }, @@ -29294,8 +29593,8 @@ "question__title": "Longest Well-Performing Interval", "question__title_slug": "longest-well-performing-interval", "question__hide": false, - "total_acs": 24586, - "total_submitted": 71042, + "total_acs": 24737, + "total_submitted": 71555, "frontend_question_id": 1124, "is_new_question": false }, @@ -29317,8 +29616,8 @@ "question__title": "Lowest Common Ancestor of Deepest Leaves", "question__title_slug": "lowest-common-ancestor-of-deepest-leaves", "question__hide": false, - "total_acs": 84803, - "total_submitted": 120144, + "total_acs": 85261, + "total_submitted": 120770, "frontend_question_id": 1123, "is_new_question": false }, @@ -29340,8 +29639,8 @@ "question__title": "Relative Sort Array", "question__title_slug": "relative-sort-array", "question__hide": false, - "total_acs": 142054, - "total_submitted": 207591, + "total_acs": 143206, + "total_submitted": 209288, "frontend_question_id": 1122, "is_new_question": false }, @@ -29363,8 +29662,8 @@ "question__title": "Print Zero Even Odd", "question__title_slug": "print-zero-even-odd", "question__hide": false, - "total_acs": 35717, - "total_submitted": 59411, + "total_acs": 36088, + "total_submitted": 60045, "frontend_question_id": 1116, "is_new_question": false }, @@ -29386,8 +29685,8 @@ "question__title": "Reported Posts", "question__title_slug": "reported-posts", "question__hide": false, - "total_acs": 37786, - "total_submitted": 57159, + "total_acs": 38087, + "total_submitted": 57590, "frontend_question_id": 1113, "is_new_question": false }, @@ -29409,8 +29708,8 @@ "question__title": "Highest Grade For Each Student", "question__title_slug": "highest-grade-for-each-student", "question__hide": false, - "total_acs": 42909, - "total_submitted": 58165, + "total_acs": 43509, + "total_submitted": 59112, "frontend_question_id": 1112, "is_new_question": false }, @@ -29432,8 +29731,8 @@ "question__title": "Handshakes That Don't Cross", "question__title_slug": "handshakes-that-dont-cross", "question__hide": false, - "total_acs": 5894, - "total_submitted": 10518, + "total_acs": 5956, + "total_submitted": 10616, "frontend_question_id": 1259, "is_new_question": false }, @@ -29455,8 +29754,8 @@ "question__title": "Sequential Digits", "question__title_slug": "sequential-digits", "question__hide": false, - "total_acs": 86337, - "total_submitted": 140866, + "total_acs": 86744, + "total_submitted": 141517, "frontend_question_id": 1291, "is_new_question": false }, @@ -29478,8 +29777,8 @@ "question__title": "Iterator for Combination", "question__title_slug": "iterator-for-combination", "question__hide": false, - "total_acs": 65674, - "total_submitted": 89363, + "total_acs": 65840, + "total_submitted": 89585, "frontend_question_id": 1286, "is_new_question": false }, @@ -29501,8 +29800,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": 39087, - "total_submitted": 60548, + "total_acs": 39570, + "total_submitted": 61210, "frontend_question_id": 1619, "is_new_question": false }, @@ -29524,8 +29823,8 @@ "question__title": "Design Bounded Blocking Queue", "question__title_slug": "design-bounded-blocking-queue", "question__hide": false, - "total_acs": 40342, - "total_submitted": 55339, + "total_acs": 40598, + "total_submitted": 55677, "frontend_question_id": 1188, "is_new_question": false }, @@ -29547,8 +29846,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": 21734, - "total_submitted": 29670, + "total_acs": 21844, + "total_submitted": 29815, "frontend_question_id": 1111, "is_new_question": false }, @@ -29570,8 +29869,8 @@ "question__title": "Delete Nodes And Return Forest", "question__title_slug": "delete-nodes-and-return-forest", "question__hide": false, - "total_acs": 173037, - "total_submitted": 249522, + "total_acs": 173675, + "total_submitted": 250521, "frontend_question_id": 1110, "is_new_question": false }, @@ -29593,8 +29892,8 @@ "question__title": "Corporate Flight Bookings", "question__title_slug": "corporate-flight-bookings", "question__hide": false, - "total_acs": 46387, - "total_submitted": 76846, + "total_acs": 46913, + "total_submitted": 77634, "frontend_question_id": 1109, "is_new_question": false }, @@ -29616,8 +29915,8 @@ "question__title": "Defanging an IP Address", "question__title_slug": "defanging-an-ip-address", "question__hide": false, - "total_acs": 457797, - "total_submitted": 512349, + "total_acs": 462365, + "total_submitted": 517513, "frontend_question_id": 1108, "is_new_question": false }, @@ -29639,8 +29938,8 @@ "question__title": "New Users Daily Count", "question__title_slug": "new-users-daily-count", "question__hide": false, - "total_acs": 28598, - "total_submitted": 62339, + "total_acs": 28810, + "total_submitted": 62876, "frontend_question_id": 1107, "is_new_question": false }, @@ -29662,8 +29961,8 @@ "question__title": "Print in Order", "question__title_slug": "print-in-order", "question__hide": false, - "total_acs": 117660, - "total_submitted": 172668, + "total_acs": 118565, + "total_submitted": 173978, "frontend_question_id": 1114, "is_new_question": false }, @@ -29685,8 +29984,8 @@ "question__title": "Palindrome Removal", "question__title_slug": "palindrome-removal", "question__hide": false, - "total_acs": 9467, - "total_submitted": 20610, + "total_acs": 9506, + "total_submitted": 20690, "frontend_question_id": 1246, "is_new_question": false }, @@ -29708,8 +30007,8 @@ "question__title": "Delete Tree Nodes", "question__title_slug": "delete-tree-nodes", "question__hide": false, - "total_acs": 8952, - "total_submitted": 14636, + "total_acs": 8976, + "total_submitted": 14686, "frontend_question_id": 1273, "is_new_question": false }, @@ -29731,8 +30030,8 @@ "question__title": "Remove Interval", "question__title_slug": "remove-interval", "question__hide": false, - "total_acs": 25885, - "total_submitted": 40917, + "total_acs": 26010, + "total_submitted": 41126, "frontend_question_id": 1272, "is_new_question": false }, @@ -29754,8 +30053,8 @@ "question__title": "Hexspeak", "question__title_slug": "hexspeak", "question__hide": false, - "total_acs": 8725, - "total_submitted": 15331, + "total_acs": 8799, + "total_submitted": 15448, "frontend_question_id": 1271, "is_new_question": false }, @@ -29777,8 +30076,8 @@ "question__title": "Unpopular Books", "question__title_slug": "unpopular-books", "question__hide": false, - "total_acs": 31629, - "total_submitted": 69949, + "total_acs": 31923, + "total_submitted": 70659, "frontend_question_id": 1098, "is_new_question": false }, @@ -29800,8 +30099,8 @@ "question__title": "Parsing A Boolean Expression", "question__title_slug": "parsing-a-boolean-expression", "question__hide": false, - "total_acs": 21203, - "total_submitted": 36254, + "total_acs": 21410, + "total_submitted": 36552, "frontend_question_id": 1106, "is_new_question": false }, @@ -29823,8 +30122,8 @@ "question__title": "Filling Bookcase Shelves", "question__title_slug": "filling-bookcase-shelves", "question__hide": false, - "total_acs": 39105, - "total_submitted": 66300, + "total_acs": 39769, + "total_submitted": 67333, "frontend_question_id": 1105, "is_new_question": false }, @@ -29846,8 +30145,8 @@ "question__title": "Distribute Candies to People", "question__title_slug": "distribute-candies-to-people", "question__hide": false, - "total_acs": 71634, - "total_submitted": 112019, + "total_acs": 71948, + "total_submitted": 112522, "frontend_question_id": 1103, "is_new_question": false }, @@ -29869,8 +30168,8 @@ "question__title": "Path In Zigzag Labelled Binary Tree", "question__title_slug": "path-in-zigzag-labelled-binary-tree", "question__hide": false, - "total_acs": 36767, - "total_submitted": 49058, + "total_acs": 36989, + "total_submitted": 49326, "frontend_question_id": 1104, "is_new_question": false }, @@ -29886,14 +30185,14 @@ { "stat": { "question_id": 1193, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "game-play-analysis-v", + "question__article__has_video_solution": false, "question__title": "Game Play Analysis V", "question__title_slug": "game-play-analysis-v", "question__hide": false, - "total_acs": 17788, - "total_submitted": 32194, + "total_acs": 17966, + "total_submitted": 32569, "frontend_question_id": 1097, "is_new_question": false }, @@ -29915,8 +30214,8 @@ "question__title": "Divide Chocolate", "question__title_slug": "divide-chocolate", "question__hide": false, - "total_acs": 41200, - "total_submitted": 72420, + "total_acs": 41549, + "total_submitted": 72979, "frontend_question_id": 1231, "is_new_question": false }, @@ -29938,8 +30237,8 @@ "question__title": "Synonymous Sentences", "question__title_slug": "synonymous-sentences", "question__hide": false, - "total_acs": 17245, - "total_submitted": 30555, + "total_acs": 17448, + "total_submitted": 31006, "frontend_question_id": 1258, "is_new_question": false }, @@ -29961,8 +30260,8 @@ "question__title": "Smallest Common Region", "question__title_slug": "smallest-common-region", "question__hide": false, - "total_acs": 17850, - "total_submitted": 27840, + "total_acs": 18039, + "total_submitted": 28107, "frontend_question_id": 1257, "is_new_question": false }, @@ -29984,8 +30283,8 @@ "question__title": "Encode Number", "question__title_slug": "encode-number", "question__hide": false, - "total_acs": 6826, - "total_submitted": 9759, + "total_acs": 6840, + "total_submitted": 9778, "frontend_question_id": 1256, "is_new_question": false }, @@ -30007,8 +30306,8 @@ "question__title": "Brace Expansion II", "question__title_slug": "brace-expansion-ii", "question__hide": false, - "total_acs": 21183, - "total_submitted": 33323, + "total_acs": 21243, + "total_submitted": 33436, "frontend_question_id": 1096, "is_new_question": false }, @@ -30030,8 +30329,8 @@ "question__title": "Print FooBar Alternately", "question__title_slug": "print-foobar-alternately", "question__hide": false, - "total_acs": 59445, - "total_submitted": 96318, + "total_acs": 59997, + "total_submitted": 97134, "frontend_question_id": 1115, "is_new_question": false }, @@ -30053,8 +30352,8 @@ "question__title": "Building H2O", "question__title_slug": "building-h2o", "question__hide": false, - "total_acs": 35859, - "total_submitted": 64283, + "total_acs": 36202, + "total_submitted": 64951, "frontend_question_id": 1117, "is_new_question": false }, @@ -30076,8 +30375,8 @@ "question__title": "Find in Mountain Array", "question__title_slug": "find-in-mountain-array", "question__hide": false, - "total_acs": 52938, - "total_submitted": 147914, + "total_acs": 53504, + "total_submitted": 149514, "frontend_question_id": 1095, "is_new_question": false }, @@ -30099,8 +30398,8 @@ "question__title": "Car Pooling", "question__title_slug": "car-pooling", "question__hide": false, - "total_acs": 176661, - "total_submitted": 308049, + "total_acs": 178090, + "total_submitted": 310744, "frontend_question_id": 1094, "is_new_question": false }, @@ -30122,8 +30421,8 @@ "question__title": "Statistics from a Large Sample", "question__title_slug": "statistics-from-a-large-sample", "question__hide": false, - "total_acs": 14812, - "total_submitted": 33180, + "total_acs": 14919, + "total_submitted": 33527, "frontend_question_id": 1093, "is_new_question": false }, @@ -30139,14 +30438,14 @@ { "stat": { "question_id": 1182, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "game-play-analysis-iv", + "question__article__has_video_solution": false, "question__title": "Game Play Analysis IV", "question__title_slug": "game-play-analysis-iv", "question__hide": false, - "total_acs": 48617, - "total_submitted": 110205, + "total_acs": 49232, + "total_submitted": 111617, "frontend_question_id": 550, "is_new_question": false }, @@ -30162,14 +30461,14 @@ { "stat": { "question_id": 1181, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "game-play-analysis-iii", + "question__article__has_video_solution": false, "question__title": "Game Play Analysis III", "question__title_slug": "game-play-analysis-iii", "question__hide": false, - "total_acs": 57977, - "total_submitted": 70310, + "total_acs": 58645, + "total_submitted": 71187, "frontend_question_id": 534, "is_new_question": false }, @@ -30185,14 +30484,14 @@ { "stat": { "question_id": 1180, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "game-play-analysis-ii", + "question__article__has_video_solution": false, "question__title": "Game Play Analysis II", "question__title_slug": "game-play-analysis-ii", "question__hide": false, - "total_acs": 65821, - "total_submitted": 121658, + "total_acs": 66503, + "total_submitted": 123077, "frontend_question_id": 512, "is_new_question": false }, @@ -30208,14 +30507,14 @@ { "stat": { "question_id": 1179, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "game-play-analysis-i", + "question__article__has_video_solution": false, "question__title": "Game Play Analysis I", "question__title_slug": "game-play-analysis-i", "question__hide": false, - "total_acs": 124401, - "total_submitted": 158035, + "total_acs": 128395, + "total_submitted": 163597, "frontend_question_id": 511, "is_new_question": false }, @@ -30237,8 +30536,8 @@ "question__title": "Valid Palindrome III", "question__title_slug": "valid-palindrome-iii", "question__hide": false, - "total_acs": 39617, - "total_submitted": 79122, + "total_acs": 39887, + "total_submitted": 79625, "frontend_question_id": 1216, "is_new_question": false }, @@ -30260,8 +30559,8 @@ "question__title": "Tree Diameter", "question__title_slug": "tree-diameter", "question__hide": false, - "total_acs": 28653, - "total_submitted": 46456, + "total_acs": 28847, + "total_submitted": 46793, "frontend_question_id": 1245, "is_new_question": false }, @@ -30283,8 +30582,8 @@ "question__title": "Design A Leaderboard", "question__title_slug": "design-a-leaderboard", "question__hide": false, - "total_acs": 53630, - "total_submitted": 77853, + "total_acs": 54835, + "total_submitted": 79663, "frontend_question_id": 1244, "is_new_question": false }, @@ -30306,8 +30605,8 @@ "question__title": "Array Transformation", "question__title_slug": "array-transformation", "question__hide": false, - "total_acs": 11002, - "total_submitted": 21700, + "total_acs": 11071, + "total_submitted": 21838, "frontend_question_id": 1243, "is_new_question": false }, @@ -30329,8 +30628,8 @@ "question__title": "Sales Analysis III", "question__title_slug": "sales-analysis-iii", "question__hide": false, - "total_acs": 73936, - "total_submitted": 141924, + "total_acs": 75899, + "total_submitted": 146366, "frontend_question_id": 1084, "is_new_question": false }, @@ -30352,8 +30651,8 @@ "question__title": "Sales Analysis II", "question__title_slug": "sales-analysis-ii", "question__hide": false, - "total_acs": 47861, - "total_submitted": 94875, + "total_acs": 48222, + "total_submitted": 95632, "frontend_question_id": 1083, "is_new_question": false }, @@ -30375,8 +30674,8 @@ "question__title": "Sales Analysis I", "question__title_slug": "sales-analysis-i", "question__hide": false, - "total_acs": 47584, - "total_submitted": 63104, + "total_acs": 47964, + "total_submitted": 63570, "frontend_question_id": 1082, "is_new_question": false }, @@ -30398,8 +30697,8 @@ "question__title": "Shortest Path in Binary Matrix", "question__title_slug": "shortest-path-in-binary-matrix", "question__hide": false, - "total_acs": 272082, - "total_submitted": 611776, + "total_acs": 274531, + "total_submitted": 617101, "frontend_question_id": 1091, "is_new_question": false }, @@ -30421,8 +30720,8 @@ "question__title": "Shortest Common Supersequence ", "question__title_slug": "shortest-common-supersequence", "question__hide": false, - "total_acs": 62972, - "total_submitted": 108991, + "total_acs": 63740, + "total_submitted": 110289, "frontend_question_id": 1092, "is_new_question": false }, @@ -30444,8 +30743,8 @@ "question__title": "Largest Values From Labels", "question__title_slug": "largest-values-from-labels", "question__hide": false, - "total_acs": 30884, - "total_submitted": 50744, + "total_acs": 31095, + "total_submitted": 51096, "frontend_question_id": 1090, "is_new_question": false }, @@ -30467,8 +30766,8 @@ "question__title": "Duplicate Zeros", "question__title_slug": "duplicate-zeros", "question__hide": false, - "total_acs": 314790, - "total_submitted": 611208, + "total_acs": 317614, + "total_submitted": 616572, "frontend_question_id": 1089, "is_new_question": false }, @@ -30490,8 +30789,8 @@ "question__title": "Minimum Time to Build Blocks", "question__title_slug": "minimum-time-to-build-blocks", "question__hide": false, - "total_acs": 3602, - "total_submitted": 8843, + "total_acs": 3616, + "total_submitted": 8873, "frontend_question_id": 1199, "is_new_question": false }, @@ -30513,8 +30812,8 @@ "question__title": "Toss Strange Coins", "question__title_slug": "toss-strange-coins", "question__hide": false, - "total_acs": 11608, - "total_submitted": 21738, + "total_acs": 11753, + "total_submitted": 21968, "frontend_question_id": 1230, "is_new_question": false }, @@ -30536,8 +30835,8 @@ "question__title": "Meeting Scheduler", "question__title_slug": "meeting-scheduler", "question__hide": false, - "total_acs": 65507, - "total_submitted": 118182, + "total_acs": 66095, + "total_submitted": 119326, "frontend_question_id": 1229, "is_new_question": false }, @@ -30559,8 +30858,8 @@ "question__title": "Missing Number In Arithmetic Progression", "question__title_slug": "missing-number-in-arithmetic-progression", "question__hide": false, - "total_acs": 22336, - "total_submitted": 43455, + "total_acs": 22433, + "total_submitted": 43673, "frontend_question_id": 1228, "is_new_question": false }, @@ -30582,8 +30881,8 @@ "question__title": "Project Employees III", "question__title_slug": "project-employees-iii", "question__hide": false, - "total_acs": 42338, - "total_submitted": 53819, + "total_acs": 42792, + "total_submitted": 54430, "frontend_question_id": 1077, "is_new_question": false }, @@ -30605,8 +30904,8 @@ "question__title": "Project Employees II", "question__title_slug": "project-employees-ii", "question__hide": false, - "total_acs": 46171, - "total_submitted": 90500, + "total_acs": 46551, + "total_submitted": 91276, "frontend_question_id": 1076, "is_new_question": false }, @@ -30628,8 +30927,8 @@ "question__title": "Project Employees I", "question__title_slug": "project-employees-i", "question__hide": false, - "total_acs": 43255, - "total_submitted": 64348, + "total_acs": 43601, + "total_submitted": 64850, "frontend_question_id": 1075, "is_new_question": false }, @@ -30651,8 +30950,8 @@ "question__title": "Letter Tile Possibilities", "question__title_slug": "letter-tile-possibilities", "question__hide": false, - "total_acs": 77649, - "total_submitted": 102052, + "total_acs": 78215, + "total_submitted": 102827, "frontend_question_id": 1079, "is_new_question": false }, @@ -30674,8 +30973,8 @@ "question__title": "Smallest Subsequence of Distinct Characters", "question__title_slug": "smallest-subsequence-of-distinct-characters", "question__hide": false, - "total_acs": 45340, - "total_submitted": 78807, + "total_acs": 45780, + "total_submitted": 79594, "frontend_question_id": 1081, "is_new_question": false }, @@ -30697,8 +30996,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": 29205, - "total_submitted": 55307, + "total_acs": 29440, + "total_submitted": 55676, "frontend_question_id": 1080, "is_new_question": false }, @@ -30720,8 +31019,8 @@ "question__title": "Occurrences After Bigram", "question__title_slug": "occurrences-after-bigram", "question__hide": false, - "total_acs": 57113, - "total_submitted": 89389, + "total_acs": 57537, + "total_submitted": 90089, "frontend_question_id": 1078, "is_new_question": false }, @@ -30743,8 +31042,8 @@ "question__title": "Product Sales Analysis III", "question__title_slug": "product-sales-analysis-iii", "question__hide": false, - "total_acs": 35015, - "total_submitted": 71153, + "total_acs": 35292, + "total_submitted": 71757, "frontend_question_id": 1070, "is_new_question": false }, @@ -30766,8 +31065,8 @@ "question__title": "Product Sales Analysis II", "question__title_slug": "product-sales-analysis-ii", "question__hide": false, - "total_acs": 44341, - "total_submitted": 54070, + "total_acs": 44649, + "total_submitted": 54509, "frontend_question_id": 1069, "is_new_question": false }, @@ -30789,8 +31088,8 @@ "question__title": "Product Sales Analysis I", "question__title_slug": "product-sales-analysis-i", "question__hide": false, - "total_acs": 55218, - "total_submitted": 68706, + "total_acs": 55634, + "total_submitted": 69277, "frontend_question_id": 1068, "is_new_question": false }, @@ -30812,8 +31111,8 @@ "question__title": "Maximum Number of Ones", "question__title_slug": "maximum-number-of-ones", "question__hide": false, - "total_acs": 2324, - "total_submitted": 3813, + "total_acs": 2340, + "total_submitted": 3849, "frontend_question_id": 1183, "is_new_question": false }, @@ -30835,8 +31134,8 @@ "question__title": "Stepping Numbers", "question__title_slug": "stepping-numbers", "question__hide": false, - "total_acs": 7989, - "total_submitted": 17416, + "total_acs": 8025, + "total_submitted": 17475, "frontend_question_id": 1215, "is_new_question": false }, @@ -30858,8 +31157,8 @@ "question__title": "Two Sum BSTs", "question__title_slug": "two-sum-bsts", "question__hide": false, - "total_acs": 37339, - "total_submitted": 56436, + "total_acs": 37584, + "total_submitted": 56866, "frontend_question_id": 1214, "is_new_question": false }, @@ -30881,8 +31180,8 @@ "question__title": "Intersection of Three Sorted Arrays", "question__title_slug": "intersection-of-three-sorted-arrays", "question__hide": false, - "total_acs": 73559, - "total_submitted": 91926, + "total_acs": 73917, + "total_submitted": 92415, "frontend_question_id": 1213, "is_new_question": false }, @@ -30904,8 +31203,8 @@ "question__title": "Adding Two Negabinary Numbers", "question__title_slug": "adding-two-negabinary-numbers", "question__hide": false, - "total_acs": 13964, - "total_submitted": 38375, + "total_acs": 14096, + "total_submitted": 38781, "frontend_question_id": 1073, "is_new_question": false }, @@ -30927,8 +31226,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": 18270, - "total_submitted": 28975, + "total_acs": 18395, + "total_submitted": 29191, "frontend_question_id": 1072, "is_new_question": false }, @@ -30950,8 +31249,8 @@ "question__title": "Greatest Common Divisor of Strings", "question__title_slug": "greatest-common-divisor-of-strings", "question__hide": false, - "total_acs": 83030, - "total_submitted": 162808, + "total_acs": 83991, + "total_submitted": 164426, "frontend_question_id": 1071, "is_new_question": false }, @@ -30973,8 +31272,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": 84198, - "total_submitted": 120571, + "total_acs": 84411, + "total_submitted": 120887, "frontend_question_id": 1074, "is_new_question": false }, @@ -30996,8 +31295,8 @@ "question__title": "Optimize Water Distribution in a Village", "question__title_slug": "optimize-water-distribution-in-a-village", "question__hide": false, - "total_acs": 36143, - "total_submitted": 56120, + "total_acs": 36442, + "total_submitted": 56567, "frontend_question_id": 1168, "is_new_question": false }, @@ -31019,8 +31318,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": 30298, - "total_submitted": 39840, + "total_acs": 35538, + "total_submitted": 46323, "frontend_question_id": 1198, "is_new_question": false }, @@ -31042,8 +31341,8 @@ "question__title": "Minimum Knight Moves", "question__title_slug": "minimum-knight-moves", "question__hide": false, - "total_acs": 128509, - "total_submitted": 323357, + "total_acs": 129204, + "total_submitted": 325269, "frontend_question_id": 1197, "is_new_question": false }, @@ -31065,8 +31364,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": 21723, - "total_submitted": 32441, + "total_acs": 22050, + "total_submitted": 32937, "frontend_question_id": 1196, "is_new_question": false }, @@ -31088,8 +31387,8 @@ "question__title": "Distant Barcodes", "question__title_slug": "distant-barcodes", "question__hide": false, - "total_acs": 33631, - "total_submitted": 73535, + "total_acs": 33819, + "total_submitted": 73948, "frontend_question_id": 1054, "is_new_question": false }, @@ -31111,8 +31410,8 @@ "question__title": "Previous Permutation With One Swap", "question__title_slug": "previous-permutation-with-one-swap", "question__hide": false, - "total_acs": 33942, - "total_submitted": 66789, + "total_acs": 34087, + "total_submitted": 67119, "frontend_question_id": 1053, "is_new_question": false }, @@ -31134,8 +31433,8 @@ "question__title": "Grumpy Bookstore Owner", "question__title_slug": "grumpy-bookstore-owner", "question__hide": false, - "total_acs": 58563, - "total_submitted": 102679, + "total_acs": 58882, + "total_submitted": 103226, "frontend_question_id": 1052, "is_new_question": false }, @@ -31157,8 +31456,8 @@ "question__title": "Height Checker", "question__title_slug": "height-checker", "question__hide": false, - "total_acs": 237150, - "total_submitted": 316105, + "total_acs": 239671, + "total_submitted": 319248, "frontend_question_id": 1051, "is_new_question": false }, @@ -31180,8 +31479,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": 83446, - "total_submitted": 115296, + "total_acs": 85921, + "total_submitted": 118747, "frontend_question_id": 1050, "is_new_question": false }, @@ -31203,8 +31502,8 @@ "question__title": "Customers Who Bought All Products", "question__title_slug": "customers-who-bought-all-products", "question__hide": false, - "total_acs": 44736, - "total_submitted": 66163, + "total_acs": 45254, + "total_submitted": 66965, "frontend_question_id": 1045, "is_new_question": false }, @@ -31226,8 +31525,8 @@ "question__title": "Shortest Distance to Target Color", "question__title_slug": "shortest-distance-to-target-color", "question__hide": false, - "total_acs": 31174, - "total_submitted": 56202, + "total_acs": 31392, + "total_submitted": 56601, "frontend_question_id": 1182, "is_new_question": false }, @@ -31249,8 +31548,8 @@ "question__title": "Last Substring in Lexicographical Order", "question__title_slug": "last-substring-in-lexicographical-order", "question__hide": false, - "total_acs": 30786, - "total_submitted": 87696, + "total_acs": 30872, + "total_submitted": 88070, "frontend_question_id": 1163, "is_new_question": false }, @@ -31272,8 +31571,8 @@ "question__title": "Before and After Puzzle", "question__title_slug": "before-and-after-puzzle", "question__hide": false, - "total_acs": 9111, - "total_submitted": 20204, + "total_acs": 9129, + "total_submitted": 20235, "frontend_question_id": 1181, "is_new_question": false }, @@ -31295,8 +31594,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": 22296, - "total_submitted": 28258, + "total_acs": 22431, + "total_submitted": 28414, "frontend_question_id": 1180, "is_new_question": false }, @@ -31318,8 +31617,8 @@ "question__title": "Last Stone Weight II", "question__title_slug": "last-stone-weight-ii", "question__hide": false, - "total_acs": 62825, - "total_submitted": 119889, + "total_acs": 63543, + "total_submitted": 120974, "frontend_question_id": 1049, "is_new_question": false }, @@ -31341,8 +31640,8 @@ "question__title": "Longest String Chain", "question__title_slug": "longest-string-chain", "question__hide": false, - "total_acs": 287733, - "total_submitted": 486394, + "total_acs": 290080, + "total_submitted": 490405, "frontend_question_id": 1048, "is_new_question": false }, @@ -31364,8 +31663,8 @@ "question__title": "Remove All Adjacent Duplicates In String", "question__title_slug": "remove-all-adjacent-duplicates-in-string", "question__hide": false, - "total_acs": 335750, - "total_submitted": 476256, + "total_acs": 338985, + "total_submitted": 481077, "frontend_question_id": 1047, "is_new_question": false }, @@ -31387,8 +31686,8 @@ "question__title": "Last Stone Weight", "question__title_slug": "last-stone-weight", "question__hide": false, - "total_acs": 353165, - "total_submitted": 545759, + "total_acs": 357527, + "total_submitted": 552377, "frontend_question_id": 1046, "is_new_question": false }, @@ -31410,8 +31709,8 @@ "question__title": "Minimum Cost to Connect Sticks", "question__title_slug": "minimum-cost-to-connect-sticks", "question__hide": false, - "total_acs": 95470, - "total_submitted": 141035, + "total_acs": 96076, + "total_submitted": 141854, "frontend_question_id": 1167, "is_new_question": false }, @@ -31433,8 +31732,8 @@ "question__title": "Design File System", "question__title_slug": "design-file-system", "question__hide": false, - "total_acs": 37199, - "total_submitted": 60043, + "total_acs": 38021, + "total_submitted": 61309, "frontend_question_id": 1166, "is_new_question": false }, @@ -31456,8 +31755,8 @@ "question__title": "String Transforms Into Another String", "question__title_slug": "string-transforms-into-another-string", "question__hide": false, - "total_acs": 49703, - "total_submitted": 140629, + "total_acs": 49808, + "total_submitted": 140974, "frontend_question_id": 1153, "is_new_question": false }, @@ -31479,8 +31778,8 @@ "question__title": "Single-Row Keyboard", "question__title_slug": "single-row-keyboard", "question__hide": false, - "total_acs": 63200, - "total_submitted": 73716, + "total_acs": 63440, + "total_submitted": 73983, "frontend_question_id": 1165, "is_new_question": false }, @@ -31502,8 +31801,8 @@ "question__title": "Longest Duplicate Substring", "question__title_slug": "longest-duplicate-substring", "question__hide": false, - "total_acs": 58806, - "total_submitted": 191705, + "total_acs": 59075, + "total_submitted": 192826, "frontend_question_id": 1044, "is_new_question": false }, @@ -31525,8 +31824,8 @@ "question__title": "Partition Array for Maximum Sum", "question__title_slug": "partition-array-for-maximum-sum", "question__hide": false, - "total_acs": 61693, - "total_submitted": 86676, + "total_acs": 62419, + "total_submitted": 87607, "frontend_question_id": 1043, "is_new_question": false }, @@ -31548,8 +31847,8 @@ "question__title": "Flower Planting With No Adjacent", "question__title_slug": "flower-planting-with-no-adjacent", "question__hide": false, - "total_acs": 61966, - "total_submitted": 122838, + "total_acs": 62359, + "total_submitted": 123754, "frontend_question_id": 1042, "is_new_question": false }, @@ -31571,8 +31870,8 @@ "question__title": "Robot Bounded In Circle", "question__title_slug": "robot-bounded-in-circle", "question__hide": false, - "total_acs": 203171, - "total_submitted": 367669, + "total_acs": 204046, + "total_submitted": 369285, "frontend_question_id": 1041, "is_new_question": false }, @@ -31594,8 +31893,8 @@ "question__title": "Divide Array Into Increasing Sequences", "question__title_slug": "divide-array-into-increasing-sequences", "question__hide": false, - "total_acs": 4089, - "total_submitted": 6814, + "total_acs": 4107, + "total_submitted": 6838, "frontend_question_id": 1121, "is_new_question": false }, @@ -31617,8 +31916,8 @@ "question__title": "As Far from Land as Possible", "question__title_slug": "as-far-from-land-as-possible", "question__hide": false, - "total_acs": 77478, - "total_submitted": 159596, + "total_acs": 78266, + "total_submitted": 161166, "frontend_question_id": 1162, "is_new_question": false }, @@ -31640,8 +31939,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": 117899, - "total_submitted": 178264, + "total_acs": 118633, + "total_submitted": 179399, "frontend_question_id": 1161, "is_new_question": false }, @@ -31663,8 +31962,8 @@ "question__title": "Valid Boomerang", "question__title_slug": "valid-boomerang", "question__hide": false, - "total_acs": 36450, - "total_submitted": 97309, + "total_acs": 36834, + "total_submitted": 98501, "frontend_question_id": 1037, "is_new_question": false }, @@ -31686,8 +31985,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": 138100, - "total_submitted": 161774, + "total_acs": 139074, + "total_submitted": 162863, "frontend_question_id": 1038, "is_new_question": false }, @@ -31709,8 +32008,8 @@ "question__title": "Moving Stones Until Consecutive II", "question__title_slug": "moving-stones-until-consecutive-ii", "question__hide": false, - "total_acs": 8211, - "total_submitted": 14760, + "total_acs": 8231, + "total_submitted": 14799, "frontend_question_id": 1040, "is_new_question": false }, @@ -31732,8 +32031,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": 133472, - "total_submitted": 196828, + "total_acs": 134618, + "total_submitted": 198595, "frontend_question_id": 1160, "is_new_question": false }, @@ -31755,8 +32054,8 @@ "question__title": "Minimum Score Triangulation of Polygon", "question__title_slug": "minimum-score-triangulation-of-polygon", "question__hide": false, - "total_acs": 28930, - "total_submitted": 53058, + "total_acs": 29344, + "total_submitted": 53769, "frontend_question_id": 1039, "is_new_question": false }, @@ -31778,8 +32077,8 @@ "question__title": "Analyze User Website Visit Pattern", "question__title_slug": "analyze-user-website-visit-pattern", "question__hide": false, - "total_acs": 82148, - "total_submitted": 189253, + "total_acs": 83255, + "total_submitted": 191975, "frontend_question_id": 1152, "is_new_question": false }, @@ -31801,8 +32100,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": 53026, - "total_submitted": 87101, + "total_acs": 53328, + "total_submitted": 87615, "frontend_question_id": 1151, "is_new_question": false }, @@ -31824,8 +32123,8 @@ "question__title": "Escape a Large Maze", "question__title_slug": "escape-a-large-maze", "question__hide": false, - "total_acs": 17095, - "total_submitted": 49952, + "total_acs": 17214, + "total_submitted": 50285, "frontend_question_id": 1036, "is_new_question": false }, @@ -31847,8 +32146,8 @@ "question__title": "Uncrossed Lines", "question__title_slug": "uncrossed-lines", "question__hide": false, - "total_acs": 74300, - "total_submitted": 126629, + "total_acs": 74607, + "total_submitted": 127119, "frontend_question_id": 1035, "is_new_question": false }, @@ -31870,8 +32169,8 @@ "question__title": "Coloring A Border", "question__title_slug": "coloring-a-border", "question__hide": false, - "total_acs": 27077, - "total_submitted": 55346, + "total_acs": 27281, + "total_submitted": 55798, "frontend_question_id": 1034, "is_new_question": false }, @@ -31893,8 +32192,8 @@ "question__title": "Moving Stones Until Consecutive", "question__title_slug": "moving-stones-until-consecutive", "question__hide": false, - "total_acs": 20874, - "total_submitted": 45718, + "total_acs": 20965, + "total_submitted": 45882, "frontend_question_id": 1033, "is_new_question": false }, @@ -31916,8 +32215,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": 35841, - "total_submitted": 63037, + "total_acs": 36159, + "total_submitted": 63560, "frontend_question_id": 1150, "is_new_question": false }, @@ -31939,8 +32238,8 @@ "question__title": "Parallel Courses", "question__title_slug": "parallel-courses", "question__hide": false, - "total_acs": 49916, - "total_submitted": 80513, + "total_acs": 50501, + "total_submitted": 81522, "frontend_question_id": 1136, "is_new_question": false }, @@ -31962,8 +32261,8 @@ "question__title": "Connecting Cities With Minimum Cost", "question__title_slug": "connecting-cities-with-minimum-cost", "question__hide": false, - "total_acs": 62636, - "total_submitted": 102470, + "total_acs": 63106, + "total_submitted": 103207, "frontend_question_id": 1135, "is_new_question": false }, @@ -31985,8 +32284,8 @@ "question__title": "Path With Maximum Minimum Value", "question__title_slug": "path-with-maximum-minimum-value", "question__hide": false, - "total_acs": 53057, - "total_submitted": 99605, + "total_acs": 53521, + "total_submitted": 100448, "frontend_question_id": 1102, "is_new_question": false }, @@ -32008,8 +32307,8 @@ "question__title": "Largest Unique Number", "question__title_slug": "largest-unique-number", "question__hide": false, - "total_acs": 31452, - "total_submitted": 46678, + "total_acs": 32225, + "total_submitted": 47821, "frontend_question_id": 1133, "is_new_question": false }, @@ -32031,8 +32330,8 @@ "question__title": "Stream of Characters", "question__title_slug": "stream-of-characters", "question__hide": false, - "total_acs": 79309, - "total_submitted": 153865, + "total_acs": 79608, + "total_submitted": 154443, "frontend_question_id": 1032, "is_new_question": false }, @@ -32054,8 +32353,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": 57546, - "total_submitted": 96780, + "total_acs": 58095, + "total_submitted": 97741, "frontend_question_id": 1031, "is_new_question": false }, @@ -32077,8 +32376,8 @@ "question__title": "Two City Scheduling", "question__title_slug": "two-city-scheduling", "question__hide": false, - "total_acs": 196990, - "total_submitted": 305133, + "total_acs": 198842, + "total_submitted": 307495, "frontend_question_id": 1029, "is_new_question": false }, @@ -32100,8 +32399,8 @@ "question__title": "Matrix Cells in Distance Order", "question__title_slug": "matrix-cells-in-distance-order", "question__hide": false, - "total_acs": 46434, - "total_submitted": 67016, + "total_acs": 46742, + "total_submitted": 67409, "frontend_question_id": 1030, "is_new_question": false }, @@ -32123,8 +32422,8 @@ "question__title": "Recover a Tree From Preorder Traversal", "question__title_slug": "recover-a-tree-from-preorder-traversal", "question__hide": false, - "total_acs": 39112, - "total_submitted": 53690, + "total_acs": 39401, + "total_submitted": 54043, "frontend_question_id": 1028, "is_new_question": false }, @@ -32146,8 +32445,8 @@ "question__title": "Maximum Difference Between Node and Ancestor", "question__title_slug": "maximum-difference-between-node-and-ancestor", "question__hide": false, - "total_acs": 141338, - "total_submitted": 192581, + "total_acs": 142232, + "total_submitted": 193830, "frontend_question_id": 1026, "is_new_question": false }, @@ -32169,8 +32468,8 @@ "question__title": "Maximum Average Subtree", "question__title_slug": "maximum-average-subtree", "question__hide": false, - "total_acs": 57709, - "total_submitted": 88144, + "total_acs": 57849, + "total_submitted": 88323, "frontend_question_id": 1120, "is_new_question": false }, @@ -32192,8 +32491,8 @@ "question__title": "Armstrong Number", "question__title_slug": "armstrong-number", "question__hide": false, - "total_acs": 30191, - "total_submitted": 38637, + "total_acs": 30379, + "total_submitted": 38886, "frontend_question_id": 1134, "is_new_question": false }, @@ -32215,8 +32514,8 @@ "question__title": "Remove Vowels from a String", "question__title_slug": "remove-vowels-from-a-string", "question__hide": false, - "total_acs": 89185, - "total_submitted": 98342, + "total_acs": 89786, + "total_submitted": 98974, "frontend_question_id": 1119, "is_new_question": false }, @@ -32238,8 +32537,8 @@ "question__title": "Number of Days in a Month", "question__title_slug": "number-of-days-in-a-month", "question__hide": false, - "total_acs": 6916, - "total_submitted": 12200, + "total_acs": 6956, + "total_submitted": 12256, "frontend_question_id": 1118, "is_new_question": false }, @@ -32261,8 +32560,8 @@ "question__title": "Longest Arithmetic Subsequence", "question__title_slug": "longest-arithmetic-subsequence", "question__hide": false, - "total_acs": 95177, - "total_submitted": 201880, + "total_acs": 95667, + "total_submitted": 203164, "frontend_question_id": 1027, "is_new_question": false }, @@ -32284,8 +32583,8 @@ "question__title": "Divisor Game", "question__title_slug": "divisor-game", "question__hide": false, - "total_acs": 180302, - "total_submitted": 268668, + "total_acs": 181882, + "total_submitted": 270949, "frontend_question_id": 1025, "is_new_question": false }, @@ -32307,8 +32606,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": 52487, - "total_submitted": 80769, + "total_acs": 53906, + "total_submitted": 82981, "frontend_question_id": 1101, "is_new_question": false }, @@ -32330,8 +32629,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": 32676, - "total_submitted": 43795, + "total_acs": 32844, + "total_submitted": 44012, "frontend_question_id": 1100, "is_new_question": false }, @@ -32353,8 +32652,8 @@ "question__title": "Two Sum Less Than K", "question__title_slug": "two-sum-less-than-k", "question__hide": false, - "total_acs": 102950, - "total_submitted": 170466, + "total_acs": 103933, + "total_submitted": 172059, "frontend_question_id": 1099, "is_new_question": false }, @@ -32376,8 +32675,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": 21252, - "total_submitted": 28001, + "total_acs": 21342, + "total_submitted": 28100, "frontend_question_id": 1085, "is_new_question": false }, @@ -32399,8 +32698,8 @@ "question__title": "Video Stitching", "question__title_slug": "video-stitching", "question__hide": false, - "total_acs": 53323, - "total_submitted": 105705, + "total_acs": 53738, + "total_submitted": 106494, "frontend_question_id": 1024, "is_new_question": false }, @@ -32422,8 +32721,8 @@ "question__title": "Camelcase Matching", "question__title_slug": "camelcase-matching", "question__hide": false, - "total_acs": 35922, - "total_submitted": 59792, + "total_acs": 36217, + "total_submitted": 60232, "frontend_question_id": 1023, "is_new_question": false }, @@ -32445,8 +32744,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": 177944, - "total_submitted": 241149, + "total_acs": 178899, + "total_submitted": 242519, "frontend_question_id": 1022, "is_new_question": false }, @@ -32468,8 +32767,8 @@ "question__title": "Remove Outermost Parentheses", "question__title_slug": "remove-outermost-parentheses", "question__hide": false, - "total_acs": 193841, - "total_submitted": 241856, + "total_acs": 195595, + "total_submitted": 243951, "frontend_question_id": 1021, "is_new_question": false }, @@ -32491,8 +32790,8 @@ "question__title": "Confusing Number II", "question__title_slug": "confusing-number-ii", "question__hide": false, - "total_acs": 32046, - "total_submitted": 68921, + "total_acs": 32172, + "total_submitted": 69186, "frontend_question_id": 1088, "is_new_question": false }, @@ -32514,8 +32813,8 @@ "question__title": "Brace Expansion", "question__title_slug": "brace-expansion", "question__hide": false, - "total_acs": 45910, - "total_submitted": 69468, + "total_acs": 46029, + "total_submitted": 69660, "frontend_question_id": 1087, "is_new_question": false }, @@ -32537,8 +32836,8 @@ "question__title": "Index Pairs of a String", "question__title_slug": "index-pairs-of-a-string", "question__hide": false, - "total_acs": 19374, - "total_submitted": 30733, + "total_acs": 19515, + "total_submitted": 30938, "frontend_question_id": 1065, "is_new_question": false }, @@ -32560,8 +32859,8 @@ "question__title": "High Five", "question__title_slug": "high-five", "question__hide": false, - "total_acs": 90395, - "total_submitted": 120230, + "total_acs": 90760, + "total_submitted": 120784, "frontend_question_id": 1086, "is_new_question": false }, @@ -32583,8 +32882,8 @@ "question__title": "Number of Enclaves", "question__title_slug": "number-of-enclaves", "question__hide": false, - "total_acs": 79249, - "total_submitted": 122276, + "total_acs": 80953, + "total_submitted": 124737, "frontend_question_id": 1020, "is_new_question": false }, @@ -32606,8 +32905,8 @@ "question__title": "Next Greater Node In Linked List", "question__title_slug": "next-greater-node-in-linked-list", "question__hide": false, - "total_acs": 116701, - "total_submitted": 195080, + "total_acs": 117565, + "total_submitted": 196448, "frontend_question_id": 1019, "is_new_question": false }, @@ -32629,8 +32928,8 @@ "question__title": "Binary Prefix Divisible By 5", "question__title_slug": "binary-prefix-divisible-by-5", "question__hide": false, - "total_acs": 42615, - "total_submitted": 89906, + "total_acs": 43018, + "total_submitted": 90948, "frontend_question_id": 1018, "is_new_question": false }, @@ -32652,8 +32951,8 @@ "question__title": "Convert to Base -2", "question__title_slug": "convert-to-base-2", "question__hide": false, - "total_acs": 21040, - "total_submitted": 34544, + "total_acs": 21184, + "total_submitted": 34757, "frontend_question_id": 1017, "is_new_question": false }, @@ -32675,8 +32974,8 @@ "question__title": "Confusing Number", "question__title_slug": "confusing-number", "question__hide": false, - "total_acs": 27673, - "total_submitted": 60051, + "total_acs": 27801, + "total_submitted": 60332, "frontend_question_id": 1056, "is_new_question": false }, @@ -32698,8 +32997,8 @@ "question__title": "Digit Count in Range", "question__title_slug": "digit-count-in-range", "question__hide": false, - "total_acs": 3156, - "total_submitted": 7074, + "total_acs": 3174, + "total_submitted": 7108, "frontend_question_id": 1067, "is_new_question": false }, @@ -32721,8 +33020,8 @@ "question__title": "Campus Bikes II", "question__title_slug": "campus-bikes-ii", "question__hide": false, - "total_acs": 40135, - "total_submitted": 73638, + "total_acs": 40263, + "total_submitted": 73852, "frontend_question_id": 1066, "is_new_question": false }, @@ -32744,8 +33043,8 @@ "question__title": "Fixed Point", "question__title_slug": "fixed-point", "question__hide": false, - "total_acs": 37708, - "total_submitted": 59322, + "total_acs": 37854, + "total_submitted": 59545, "frontend_question_id": 1064, "is_new_question": false }, @@ -32767,8 +33066,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": 31411, - "total_submitted": 54567, + "total_acs": 31580, + "total_submitted": 54852, "frontend_question_id": 1016, "is_new_question": false }, @@ -32790,8 +33089,8 @@ "question__title": "Smallest Integer Divisible by K", "question__title_slug": "smallest-integer-divisible-by-k", "question__hide": false, - "total_acs": 57443, - "total_submitted": 122098, + "total_acs": 57571, + "total_submitted": 122396, "frontend_question_id": 1015, "is_new_question": false }, @@ -32813,8 +33112,8 @@ "question__title": "Best Sightseeing Pair", "question__title_slug": "best-sightseeing-pair", "question__hide": false, - "total_acs": 74521, - "total_submitted": 125116, + "total_acs": 75354, + "total_submitted": 126505, "frontend_question_id": 1014, "is_new_question": false }, @@ -32836,8 +33135,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": 72241, - "total_submitted": 166330, + "total_acs": 72850, + "total_submitted": 168076, "frontend_question_id": 1013, "is_new_question": false }, @@ -32859,8 +33158,8 @@ "question__title": "Number of Valid Subarrays", "question__title_slug": "number-of-valid-subarrays", "question__hide": false, - "total_acs": 6980, - "total_submitted": 9410, + "total_acs": 7014, + "total_submitted": 9452, "frontend_question_id": 1063, "is_new_question": false }, @@ -32882,8 +33181,8 @@ "question__title": "Longest Repeating Substring", "question__title_slug": "longest-repeating-substring", "question__hide": false, - "total_acs": 30647, - "total_submitted": 51814, + "total_acs": 30837, + "total_submitted": 52115, "frontend_question_id": 1062, "is_new_question": false }, @@ -32905,8 +33204,8 @@ "question__title": "Missing Element in Sorted Array", "question__title_slug": "missing-element-in-sorted-array", "question__hide": false, - "total_acs": 108167, - "total_submitted": 198269, + "total_acs": 108698, + "total_submitted": 199193, "frontend_question_id": 1060, "is_new_question": false }, @@ -32928,8 +33227,8 @@ "question__title": "Lexicographically Smallest Equivalent String", "question__title_slug": "lexicographically-smallest-equivalent-string", "question__hide": false, - "total_acs": 11162, - "total_submitted": 15846, + "total_acs": 11328, + "total_submitted": 16038, "frontend_question_id": 1061, "is_new_question": false }, @@ -32951,8 +33250,8 @@ "question__title": "Numbers With Repeated Digits", "question__title_slug": "numbers-with-repeated-digits", "question__hide": false, - "total_acs": 11196, - "total_submitted": 27660, + "total_acs": 11264, + "total_submitted": 27801, "frontend_question_id": 1012, "is_new_question": false }, @@ -32974,8 +33273,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": 180520, - "total_submitted": 280044, + "total_acs": 182425, + "total_submitted": 282691, "frontend_question_id": 1011, "is_new_question": false }, @@ -32997,8 +33296,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": 219736, - "total_submitted": 414512, + "total_acs": 222169, + "total_submitted": 419435, "frontend_question_id": 1010, "is_new_question": false }, @@ -33020,8 +33319,8 @@ "question__title": "Complement of Base 10 Integer", "question__title_slug": "complement-of-base-10-integer", "question__hide": false, - "total_acs": 154030, - "total_submitted": 248516, + "total_acs": 155804, + "total_submitted": 251496, "frontend_question_id": 1009, "is_new_question": false }, @@ -33043,8 +33342,8 @@ "question__title": "Minimize Rounding Error to Meet Target", "question__title_slug": "minimize-rounding-error-to-meet-target", "question__hide": false, - "total_acs": 8033, - "total_submitted": 17903, + "total_acs": 8065, + "total_submitted": 17986, "frontend_question_id": 1058, "is_new_question": false }, @@ -33066,8 +33365,8 @@ "question__title": "Campus Bikes", "question__title_slug": "campus-bikes", "question__hide": false, - "total_acs": 62741, - "total_submitted": 108704, + "total_acs": 62892, + "total_submitted": 108993, "frontend_question_id": 1057, "is_new_question": false }, @@ -33089,8 +33388,8 @@ "question__title": "Shortest Way to Form String", "question__title_slug": "shortest-way-to-form-string", "question__hide": false, - "total_acs": 70329, - "total_submitted": 119005, + "total_acs": 71192, + "total_submitted": 120481, "frontend_question_id": 1055, "is_new_question": false }, @@ -33112,8 +33411,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": 269474, - "total_submitted": 333009, + "total_acs": 271481, + "total_submitted": 335372, "frontend_question_id": 1008, "is_new_question": false }, @@ -33135,8 +33434,8 @@ "question__title": "Minimum Domino Rotations For Equal Row", "question__title_slug": "minimum-domino-rotations-for-equal-row", "question__hide": false, - "total_acs": 187609, - "total_submitted": 358013, + "total_acs": 187952, + "total_submitted": 358754, "frontend_question_id": 1007, "is_new_question": false }, @@ -33158,8 +33457,8 @@ "question__title": "Clumsy Factorial", "question__title_slug": "clumsy-factorial", "question__hide": false, - "total_acs": 22566, - "total_submitted": 41183, + "total_acs": 22750, + "total_submitted": 41430, "frontend_question_id": 1006, "is_new_question": false }, @@ -33181,8 +33480,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": 63583, - "total_submitted": 124531, + "total_acs": 64162, + "total_submitted": 125802, "frontend_question_id": 1005, "is_new_question": false }, @@ -33204,8 +33503,8 @@ "question__title": "Max Consecutive Ones III", "question__title_slug": "max-consecutive-ones-iii", "question__hide": false, - "total_acs": 254168, - "total_submitted": 400283, + "total_acs": 258288, + "total_submitted": 407173, "frontend_question_id": 1004, "is_new_question": false }, @@ -33227,8 +33526,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": 45835, - "total_submitted": 78807, + "total_acs": 46091, + "total_submitted": 79280, "frontend_question_id": 1003, "is_new_question": false }, @@ -33250,8 +33549,8 @@ "question__title": "Find Common Characters", "question__title_slug": "find-common-characters", "question__hide": false, - "total_acs": 161328, - "total_submitted": 236160, + "total_acs": 162705, + "total_submitted": 238163, "frontend_question_id": 1002, "is_new_question": false }, @@ -33273,8 +33572,8 @@ "question__title": "Grid Illumination", "question__title_slug": "grid-illumination", "question__hide": false, - "total_acs": 16789, - "total_submitted": 46312, + "total_acs": 16891, + "total_submitted": 46595, "frontend_question_id": 1001, "is_new_question": false }, @@ -33296,8 +33595,8 @@ "question__title": "Minimum Cost to Merge Stones", "question__title_slug": "minimum-cost-to-merge-stones", "question__hide": false, - "total_acs": 31750, - "total_submitted": 75092, + "total_acs": 31960, + "total_submitted": 75555, "frontend_question_id": 1000, "is_new_question": false }, @@ -33319,8 +33618,8 @@ "question__title": "Available Captures for Rook", "question__title_slug": "available-captures-for-rook", "question__hide": false, - "total_acs": 54055, - "total_submitted": 79708, + "total_acs": 54272, + "total_submitted": 80004, "frontend_question_id": 999, "is_new_question": false }, @@ -33342,8 +33641,8 @@ "question__title": "Maximum Binary Tree II", "question__title_slug": "maximum-binary-tree-ii", "question__hide": false, - "total_acs": 29209, - "total_submitted": 44011, + "total_acs": 29363, + "total_submitted": 44195, "frontend_question_id": 998, "is_new_question": false }, @@ -33365,8 +33664,8 @@ "question__title": "Find the Town Judge", "question__title_slug": "find-the-town-judge", "question__hide": false, - "total_acs": 312640, - "total_submitted": 633109, + "total_acs": 314878, + "total_submitted": 638387, "frontend_question_id": 997, "is_new_question": false }, @@ -33388,8 +33687,8 @@ "question__title": "Number of Squareful Arrays", "question__title_slug": "number-of-squareful-arrays", "question__hide": false, - "total_acs": 28495, - "total_submitted": 57862, + "total_acs": 28699, + "total_submitted": 58302, "frontend_question_id": 996, "is_new_question": false }, @@ -33411,8 +33710,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": 28660, - "total_submitted": 56038, + "total_acs": 28824, + "total_submitted": 56323, "frontend_question_id": 995, "is_new_question": false }, @@ -33434,8 +33733,8 @@ "question__title": "Rotting Oranges", "question__title_slug": "rotting-oranges", "question__hide": false, - "total_acs": 507977, - "total_submitted": 968446, + "total_acs": 515808, + "total_submitted": 982547, "frontend_question_id": 994, "is_new_question": false }, @@ -33457,8 +33756,8 @@ "question__title": "Cousins in Binary Tree", "question__title_slug": "cousins-in-binary-tree", "question__hide": false, - "total_acs": 227611, - "total_submitted": 420349, + "total_acs": 228942, + "total_submitted": 422563, "frontend_question_id": 993, "is_new_question": false }, @@ -33480,8 +33779,8 @@ "question__title": "Subarrays with K Different Integers", "question__title_slug": "subarrays-with-k-different-integers", "question__hide": false, - "total_acs": 82141, - "total_submitted": 151142, + "total_acs": 83199, + "total_submitted": 152946, "frontend_question_id": 992, "is_new_question": false }, @@ -33503,8 +33802,8 @@ "question__title": "Broken Calculator", "question__title_slug": "broken-calculator", "question__hide": false, - "total_acs": 90755, - "total_submitted": 167778, + "total_acs": 90963, + "total_submitted": 168186, "frontend_question_id": 991, "is_new_question": false }, @@ -33526,8 +33825,8 @@ "question__title": "Satisfiability of Equality Equations", "question__title_slug": "satisfiability-of-equality-equations", "question__hide": false, - "total_acs": 103520, - "total_submitted": 204089, + "total_acs": 104118, + "total_submitted": 205212, "frontend_question_id": 990, "is_new_question": false }, @@ -33549,8 +33848,8 @@ "question__title": "Add to Array-Form of Integer", "question__title_slug": "add-to-array-form-of-integer", "question__hide": false, - "total_acs": 132913, - "total_submitted": 292080, + "total_acs": 134451, + "total_submitted": 295202, "frontend_question_id": 989, "is_new_question": false }, @@ -33572,8 +33871,8 @@ "question__title": "Smallest String Starting From Leaf", "question__title_slug": "smallest-string-starting-from-leaf", "question__hide": false, - "total_acs": 60988, - "total_submitted": 122836, + "total_acs": 61423, + "total_submitted": 123562, "frontend_question_id": 988, "is_new_question": false }, @@ -33595,8 +33894,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": 308461, - "total_submitted": 691270, + "total_acs": 310408, + "total_submitted": 695074, "frontend_question_id": 987, "is_new_question": false }, @@ -33618,8 +33917,8 @@ "question__title": "Interval List Intersections", "question__title_slug": "interval-list-intersections", "question__hide": false, - "total_acs": 333462, - "total_submitted": 467205, + "total_acs": 335534, + "total_submitted": 470004, "frontend_question_id": 986, "is_new_question": false }, @@ -33641,8 +33940,8 @@ "question__title": "Sum of Even Numbers After Queries", "question__title_slug": "sum-of-even-numbers-after-queries", "question__hide": false, - "total_acs": 127926, - "total_submitted": 187388, + "total_acs": 128218, + "total_submitted": 187858, "frontend_question_id": 985, "is_new_question": false }, @@ -33664,8 +33963,8 @@ "question__title": "String Without AAA or BBB", "question__title_slug": "string-without-aaa-or-bbb", "question__hide": false, - "total_acs": 37817, - "total_submitted": 88102, + "total_acs": 38033, + "total_submitted": 88547, "frontend_question_id": 984, "is_new_question": false }, @@ -33687,8 +33986,8 @@ "question__title": "Minimum Cost For Tickets", "question__title_slug": "minimum-cost-for-tickets", "question__hide": false, - "total_acs": 176163, - "total_submitted": 273661, + "total_acs": 177489, + "total_submitted": 275732, "frontend_question_id": 983, "is_new_question": false }, @@ -33710,8 +34009,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": 13746, - "total_submitted": 23844, + "total_acs": 13830, + "total_submitted": 23963, "frontend_question_id": 982, "is_new_question": false }, @@ -33733,8 +34032,8 @@ "question__title": "Time Based Key-Value Store", "question__title_slug": "time-based-key-value-store", "question__hide": false, - "total_acs": 278906, - "total_submitted": 520859, + "total_acs": 282157, + "total_submitted": 527633, "frontend_question_id": 981, "is_new_question": false }, @@ -33756,8 +34055,8 @@ "question__title": "Unique Paths III", "question__title_slug": "unique-paths-iii", "question__hide": false, - "total_acs": 129055, - "total_submitted": 162125, + "total_acs": 130040, + "total_submitted": 163280, "frontend_question_id": 980, "is_new_question": false }, @@ -33779,8 +34078,8 @@ "question__title": "Distribute Coins in Binary Tree", "question__title_slug": "distribute-coins-in-binary-tree", "question__hide": false, - "total_acs": 95663, - "total_submitted": 132801, + "total_acs": 96261, + "total_submitted": 133637, "frontend_question_id": 979, "is_new_question": false }, @@ -33802,8 +34101,8 @@ "question__title": "Longest Turbulent Subarray", "question__title_slug": "longest-turbulent-subarray", "question__hide": false, - "total_acs": 78034, - "total_submitted": 164525, + "total_acs": 78475, + "total_submitted": 165537, "frontend_question_id": 978, "is_new_question": false }, @@ -33825,8 +34124,8 @@ "question__title": "Squares of a Sorted Array", "question__title_slug": "squares-of-a-sorted-array", "question__hide": false, - "total_acs": 1214931, - "total_submitted": 1688973, + "total_acs": 1231560, + "total_submitted": 1712044, "frontend_question_id": 977, "is_new_question": false }, @@ -33848,8 +34147,8 @@ "question__title": "Largest Perimeter Triangle", "question__title_slug": "largest-perimeter-triangle", "question__hide": false, - "total_acs": 174739, - "total_submitted": 319457, + "total_acs": 177220, + "total_submitted": 324610, "frontend_question_id": 976, "is_new_question": false }, @@ -33871,8 +34170,8 @@ "question__title": "Odd Even Jump", "question__title_slug": "odd-even-jump", "question__hide": false, - "total_acs": 68418, - "total_submitted": 176122, + "total_acs": 68840, + "total_submitted": 177258, "frontend_question_id": 975, "is_new_question": false }, @@ -33894,8 +34193,8 @@ "question__title": "Subarray Sums Divisible by K", "question__title_slug": "subarray-sums-divisible-by-k", "question__hide": false, - "total_acs": 122990, - "total_submitted": 229431, + "total_acs": 124806, + "total_submitted": 232699, "frontend_question_id": 974, "is_new_question": false }, @@ -33917,8 +34216,8 @@ "question__title": "K Closest Points to Origin", "question__title_slug": "k-closest-points-to-origin", "question__hide": false, - "total_acs": 898588, - "total_submitted": 1364370, + "total_acs": 906260, + "total_submitted": 1376333, "frontend_question_id": 973, "is_new_question": false }, @@ -33940,8 +34239,8 @@ "question__title": "Fibonacci Number", "question__title_slug": "fibonacci-number", "question__hide": false, - "total_acs": 1098994, - "total_submitted": 1588662, + "total_acs": 1117068, + "total_submitted": 1614211, "frontend_question_id": 509, "is_new_question": false }, @@ -33963,8 +34262,8 @@ "question__title": "Equal Rational Numbers", "question__title_slug": "equal-rational-numbers", "question__hide": false, - "total_acs": 5817, - "total_submitted": 13513, + "total_acs": 5833, + "total_submitted": 13566, "frontend_question_id": 972, "is_new_question": false }, @@ -33986,8 +34285,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": 37171, - "total_submitted": 74474, + "total_acs": 37280, + "total_submitted": 74739, "frontend_question_id": 971, "is_new_question": false }, @@ -34009,8 +34308,8 @@ "question__title": "Powerful Integers", "question__title_slug": "powerful-integers", "question__hide": false, - "total_acs": 48572, - "total_submitted": 111443, + "total_acs": 48715, + "total_submitted": 111758, "frontend_question_id": 970, "is_new_question": false }, @@ -34032,8 +34331,8 @@ "question__title": "Pancake Sorting", "question__title_slug": "pancake-sorting", "question__hide": false, - "total_acs": 79262, - "total_submitted": 113249, + "total_acs": 79625, + "total_submitted": 113768, "frontend_question_id": 969, "is_new_question": false }, @@ -34055,8 +34354,8 @@ "question__title": "Binary Tree Cameras", "question__title_slug": "binary-tree-cameras", "question__hide": false, - "total_acs": 113184, - "total_submitted": 241817, + "total_acs": 113934, + "total_submitted": 243464, "frontend_question_id": 968, "is_new_question": false }, @@ -34078,8 +34377,8 @@ "question__title": "Numbers With Same Consecutive Differences", "question__title_slug": "numbers-with-same-consecutive-differences", "question__hide": false, - "total_acs": 111754, - "total_submitted": 196022, + "total_acs": 112586, + "total_submitted": 197340, "frontend_question_id": 967, "is_new_question": false }, @@ -34101,8 +34400,8 @@ "question__title": "Vowel Spellchecker", "question__title_slug": "vowel-spellchecker", "question__hide": false, - "total_acs": 37299, - "total_submitted": 72474, + "total_acs": 37409, + "total_submitted": 72703, "frontend_question_id": 966, "is_new_question": false }, @@ -34124,8 +34423,8 @@ "question__title": "Univalued Binary Tree", "question__title_slug": "univalued-binary-tree", "question__hide": false, - "total_acs": 177909, - "total_submitted": 256927, + "total_acs": 178932, + "total_submitted": 258272, "frontend_question_id": 965, "is_new_question": false }, @@ -34147,8 +34446,8 @@ "question__title": "Least Operators to Express Number", "question__title_slug": "least-operators-to-express-number", "question__hide": false, - "total_acs": 8451, - "total_submitted": 17657, + "total_acs": 8476, + "total_submitted": 17699, "frontend_question_id": 964, "is_new_question": false }, @@ -34170,8 +34469,8 @@ "question__title": "Minimum Area Rectangle II", "question__title_slug": "minimum-area-rectangle-ii", "question__hide": false, - "total_acs": 24416, - "total_submitted": 44609, + "total_acs": 24516, + "total_submitted": 44797, "frontend_question_id": 963, "is_new_question": false }, @@ -34193,8 +34492,8 @@ "question__title": "Maximum Width Ramp", "question__title_slug": "maximum-width-ramp", "question__hide": false, - "total_acs": 36988, - "total_submitted": 75646, + "total_acs": 37273, + "total_submitted": 76187, "frontend_question_id": 962, "is_new_question": false }, @@ -34216,8 +34515,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": 191341, - "total_submitted": 252373, + "total_acs": 192588, + "total_submitted": 253953, "frontend_question_id": 961, "is_new_question": false }, @@ -34239,8 +34538,8 @@ "question__title": "Delete Columns to Make Sorted III", "question__title_slug": "delete-columns-to-make-sorted-iii", "question__hide": false, - "total_acs": 11375, - "total_submitted": 19898, + "total_acs": 11437, + "total_submitted": 20024, "frontend_question_id": 960, "is_new_question": false }, @@ -34262,8 +34561,8 @@ "question__title": "Regions Cut By Slashes", "question__title_slug": "regions-cut-by-slashes", "question__hide": false, - "total_acs": 42023, - "total_submitted": 60842, + "total_acs": 42252, + "total_submitted": 61212, "frontend_question_id": 959, "is_new_question": false }, @@ -34285,8 +34584,8 @@ "question__title": "Check Completeness of a Binary Tree", "question__title_slug": "check-completeness-of-a-binary-tree", "question__hide": false, - "total_acs": 128100, - "total_submitted": 237947, + "total_acs": 128736, + "total_submitted": 239145, "frontend_question_id": 958, "is_new_question": false }, @@ -34308,8 +34607,8 @@ "question__title": "Prison Cells After N Days", "question__title_slug": "prison-cells-after-n-days", "question__hide": false, - "total_acs": 148894, - "total_submitted": 380486, + "total_acs": 149309, + "total_submitted": 381670, "frontend_question_id": 957, "is_new_question": false }, @@ -34331,8 +34630,8 @@ "question__title": "Tallest Billboard", "question__title_slug": "tallest-billboard", "question__hide": false, - "total_acs": 14895, - "total_submitted": 37260, + "total_acs": 14994, + "total_submitted": 37544, "frontend_question_id": 956, "is_new_question": false }, @@ -34354,8 +34653,8 @@ "question__title": "Delete Columns to Make Sorted II", "question__title_slug": "delete-columns-to-make-sorted-ii", "question__hide": false, - "total_acs": 16793, - "total_submitted": 48607, + "total_acs": 16878, + "total_submitted": 48813, "frontend_question_id": 955, "is_new_question": false }, @@ -34377,8 +34676,8 @@ "question__title": "Array of Doubled Pairs", "question__title_slug": "array-of-doubled-pairs", "question__hide": false, - "total_acs": 77376, - "total_submitted": 198128, + "total_acs": 77651, + "total_submitted": 198762, "frontend_question_id": 954, "is_new_question": false }, @@ -34400,8 +34699,8 @@ "question__title": "Verifying an Alien Dictionary", "question__title_slug": "verifying-an-alien-dictionary", "question__hide": false, - "total_acs": 373436, - "total_submitted": 709115, + "total_acs": 374982, + "total_submitted": 711766, "frontend_question_id": 953, "is_new_question": false }, @@ -34423,8 +34722,8 @@ "question__title": "Largest Component Size by Common Factor", "question__title_slug": "largest-component-size-by-common-factor", "question__hide": false, - "total_acs": 47000, - "total_submitted": 116461, + "total_acs": 47170, + "total_submitted": 116925, "frontend_question_id": 952, "is_new_question": false }, @@ -34446,8 +34745,8 @@ "question__title": "Flip Equivalent Binary Trees", "question__title_slug": "flip-equivalent-binary-trees", "question__hide": false, - "total_acs": 121380, - "total_submitted": 181688, + "total_acs": 122149, + "total_submitted": 182787, "frontend_question_id": 951, "is_new_question": false }, @@ -34469,8 +34768,8 @@ "question__title": "Reveal Cards In Increasing Order", "question__title_slug": "reveal-cards-in-increasing-order", "question__hide": false, - "total_acs": 62667, - "total_submitted": 80711, + "total_acs": 63036, + "total_submitted": 81119, "frontend_question_id": 950, "is_new_question": false }, @@ -34492,8 +34791,8 @@ "question__title": "Largest Time for Given Digits", "question__title_slug": "largest-time-for-given-digits", "question__hide": false, - "total_acs": 75483, - "total_submitted": 214282, + "total_acs": 75787, + "total_submitted": 215277, "frontend_question_id": 949, "is_new_question": false }, @@ -34515,8 +34814,8 @@ "question__title": "Bag of Tokens", "question__title_slug": "bag-of-tokens", "question__hide": false, - "total_acs": 96419, - "total_submitted": 185273, + "total_acs": 96928, + "total_submitted": 186228, "frontend_question_id": 948, "is_new_question": false }, @@ -34538,8 +34837,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": 121531, - "total_submitted": 212960, + "total_acs": 122944, + "total_submitted": 215224, "frontend_question_id": 947, "is_new_question": false }, @@ -34561,8 +34860,8 @@ "question__title": "Validate Stack Sequences", "question__title_slug": "validate-stack-sequences", "question__hide": false, - "total_acs": 189938, - "total_submitted": 280902, + "total_acs": 190880, + "total_submitted": 282325, "frontend_question_id": 946, "is_new_question": false }, @@ -34584,8 +34883,8 @@ "question__title": "Minimum Increment to Make Array Unique", "question__title_slug": "minimum-increment-to-make-array-unique", "question__hide": false, - "total_acs": 61879, - "total_submitted": 123509, + "total_acs": 63309, + "total_submitted": 125984, "frontend_question_id": 945, "is_new_question": false }, @@ -34607,8 +34906,8 @@ "question__title": "Delete Columns to Make Sorted", "question__title_slug": "delete-columns-to-make-sorted", "question__hide": false, - "total_acs": 72658, - "total_submitted": 104313, + "total_acs": 73141, + "total_submitted": 105046, "frontend_question_id": 944, "is_new_question": false }, @@ -34630,8 +34929,8 @@ "question__title": "Find the Shortest Superstring", "question__title_slug": "find-the-shortest-superstring", "question__hide": false, - "total_acs": 24993, - "total_submitted": 55622, + "total_acs": 25057, + "total_submitted": 55826, "frontend_question_id": 943, "is_new_question": false }, @@ -34653,8 +34952,8 @@ "question__title": "DI String Match", "question__title_slug": "di-string-match", "question__hide": false, - "total_acs": 119474, - "total_submitted": 155882, + "total_acs": 120340, + "total_submitted": 156880, "frontend_question_id": 942, "is_new_question": false }, @@ -34676,8 +34975,8 @@ "question__title": "Valid Mountain Array", "question__title_slug": "valid-mountain-array", "question__hide": false, - "total_acs": 332214, - "total_submitted": 990652, + "total_acs": 334558, + "total_submitted": 997902, "frontend_question_id": 941, "is_new_question": false }, @@ -34699,8 +34998,8 @@ "question__title": "Distinct Subsequences II", "question__title_slug": "distinct-subsequences-ii", "question__hide": false, - "total_acs": 30865, - "total_submitted": 69484, + "total_acs": 31110, + "total_submitted": 70044, "frontend_question_id": 940, "is_new_question": false }, @@ -34722,8 +35021,8 @@ "question__title": "Minimum Area Rectangle", "question__title_slug": "minimum-area-rectangle", "question__hide": false, - "total_acs": 117175, - "total_submitted": 220562, + "total_acs": 117596, + "total_submitted": 221562, "frontend_question_id": 939, "is_new_question": false }, @@ -34745,8 +35044,8 @@ "question__title": "Range Sum of BST", "question__title_slug": "range-sum-of-bst", "question__hide": false, - "total_acs": 675926, - "total_submitted": 792007, + "total_acs": 679829, + "total_submitted": 796412, "frontend_question_id": 938, "is_new_question": false }, @@ -34768,8 +35067,8 @@ "question__title": "Reorder Data in Log Files", "question__title_slug": "reorder-data-in-log-files", "question__hide": false, - "total_acs": 332670, - "total_submitted": 589667, + "total_acs": 334289, + "total_submitted": 592388, "frontend_question_id": 937, "is_new_question": false }, @@ -34791,8 +35090,8 @@ "question__title": "Stamping The Sequence", "question__title_slug": "stamping-the-sequence", "question__hide": false, - "total_acs": 55108, - "total_submitted": 87077, + "total_acs": 55234, + "total_submitted": 87275, "frontend_question_id": 936, "is_new_question": false }, @@ -34814,8 +35113,8 @@ "question__title": "Knight Dialer", "question__title_slug": "knight-dialer", "question__hide": false, - "total_acs": 92685, - "total_submitted": 185767, + "total_acs": 93611, + "total_submitted": 187447, "frontend_question_id": 935, "is_new_question": false }, @@ -34837,8 +35136,8 @@ "question__title": "Shortest Bridge", "question__title_slug": "shortest-bridge", "question__hide": false, - "total_acs": 114185, - "total_submitted": 211663, + "total_acs": 115419, + "total_submitted": 213809, "frontend_question_id": 934, "is_new_question": false }, @@ -34860,8 +35159,8 @@ "question__title": "Number of Recent Calls", "question__title_slug": "number-of-recent-calls", "question__hide": false, - "total_acs": 131535, - "total_submitted": 179761, + "total_acs": 132337, + "total_submitted": 180887, "frontend_question_id": 933, "is_new_question": false }, @@ -34883,8 +35182,8 @@ "question__title": "Beautiful Array", "question__title_slug": "beautiful-array", "question__hide": false, - "total_acs": 37965, - "total_submitted": 58324, + "total_acs": 38077, + "total_submitted": 58467, "frontend_question_id": 932, "is_new_question": false }, @@ -34906,8 +35205,8 @@ "question__title": "Minimum Falling Path Sum", "question__title_slug": "minimum-falling-path-sum", "question__hide": false, - "total_acs": 163836, - "total_submitted": 239404, + "total_acs": 166146, + "total_submitted": 242692, "frontend_question_id": 931, "is_new_question": false }, @@ -34929,8 +35228,8 @@ "question__title": "Binary Subarrays With Sum", "question__title_slug": "binary-subarrays-with-sum", "question__hide": false, - "total_acs": 56948, - "total_submitted": 111832, + "total_acs": 57859, + "total_submitted": 113612, "frontend_question_id": 930, "is_new_question": false }, @@ -34952,8 +35251,8 @@ "question__title": "Unique Email Addresses", "question__title_slug": "unique-email-addresses", "question__hide": false, - "total_acs": 392788, - "total_submitted": 584829, + "total_acs": 395638, + "total_submitted": 589045, "frontend_question_id": 929, "is_new_question": false }, @@ -34975,8 +35274,8 @@ "question__title": "Minimize Malware Spread II", "question__title_slug": "minimize-malware-spread-ii", "question__hide": false, - "total_acs": 17192, - "total_submitted": 40396, + "total_acs": 17300, + "total_submitted": 40674, "frontend_question_id": 928, "is_new_question": false }, @@ -34998,8 +35297,8 @@ "question__title": "Three Equal Parts", "question__title_slug": "three-equal-parts", "question__hide": false, - "total_acs": 26900, - "total_submitted": 67925, + "total_acs": 27007, + "total_submitted": 68148, "frontend_question_id": 927, "is_new_question": false }, @@ -35021,8 +35320,8 @@ "question__title": "Flip String to Monotone Increasing", "question__title_slug": "flip-string-to-monotone-increasing", "question__hide": false, - "total_acs": 108552, - "total_submitted": 182127, + "total_acs": 108952, + "total_submitted": 182738, "frontend_question_id": 926, "is_new_question": false }, @@ -35044,8 +35343,8 @@ "question__title": "Long Pressed Name", "question__title_slug": "long-pressed-name", "question__hide": false, - "total_acs": 106595, - "total_submitted": 315900, + "total_acs": 107541, + "total_submitted": 318960, "frontend_question_id": 925, "is_new_question": false }, @@ -35067,8 +35366,8 @@ "question__title": "Minimize Malware Spread", "question__title_slug": "minimize-malware-spread", "question__hide": false, - "total_acs": 41029, - "total_submitted": 97506, + "total_acs": 41246, + "total_submitted": 98025, "frontend_question_id": 924, "is_new_question": false }, @@ -35090,8 +35389,8 @@ "question__title": "3Sum With Multiplicity", "question__title_slug": "3sum-with-multiplicity", "question__hide": false, - "total_acs": 93434, - "total_submitted": 205803, + "total_acs": 93676, + "total_submitted": 206326, "frontend_question_id": 923, "is_new_question": false }, @@ -35113,8 +35412,8 @@ "question__title": "Sort Array By Parity II", "question__title_slug": "sort-array-by-parity-ii", "question__hide": false, - "total_acs": 202526, - "total_submitted": 286287, + "total_acs": 203638, + "total_submitted": 287807, "frontend_question_id": 922, "is_new_question": false }, @@ -35136,8 +35435,8 @@ "question__title": "Minimum Add to Make Parentheses Valid", "question__title_slug": "minimum-add-to-make-parentheses-valid", "question__hide": false, - "total_acs": 237942, - "total_submitted": 311621, + "total_acs": 239310, + "total_submitted": 313712, "frontend_question_id": 921, "is_new_question": false }, @@ -35159,8 +35458,8 @@ "question__title": "Number of Music Playlists", "question__title_slug": "number-of-music-playlists", "question__hide": false, - "total_acs": 21625, - "total_submitted": 42720, + "total_acs": 21695, + "total_submitted": 42851, "frontend_question_id": 920, "is_new_question": false }, @@ -35182,8 +35481,8 @@ "question__title": "Complete Binary Tree Inserter", "question__title_slug": "complete-binary-tree-inserter", "question__hide": false, - "total_acs": 42691, - "total_submitted": 65758, + "total_acs": 42860, + "total_submitted": 66005, "frontend_question_id": 919, "is_new_question": false }, @@ -35205,8 +35504,8 @@ "question__title": "Maximum Sum Circular Subarray", "question__title_slug": "maximum-sum-circular-subarray", "question__hide": false, - "total_acs": 139964, - "total_submitted": 367422, + "total_acs": 141180, + "total_submitted": 370216, "frontend_question_id": 918, "is_new_question": false }, @@ -35228,8 +35527,8 @@ "question__title": "Reverse Only Letters", "question__title_slug": "reverse-only-letters", "question__hide": false, - "total_acs": 146591, - "total_submitted": 238790, + "total_acs": 147493, + "total_submitted": 240099, "frontend_question_id": 917, "is_new_question": false }, @@ -35251,8 +35550,8 @@ "question__title": "Word Subsets", "question__title_slug": "word-subsets", "question__hide": false, - "total_acs": 104136, - "total_submitted": 192433, + "total_acs": 104578, + "total_submitted": 193360, "frontend_question_id": 916, "is_new_question": false }, @@ -35274,8 +35573,8 @@ "question__title": "Partition Array into Disjoint Intervals", "question__title_slug": "partition-array-into-disjoint-intervals", "question__hide": false, - "total_acs": 71078, - "total_submitted": 146206, + "total_acs": 71390, + "total_submitted": 146798, "frontend_question_id": 915, "is_new_question": false }, @@ -35297,8 +35596,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": 96548, - "total_submitted": 300509, + "total_acs": 97144, + "total_submitted": 303140, "frontend_question_id": 914, "is_new_question": false }, @@ -35320,8 +35619,8 @@ "question__title": "Cat and Mouse", "question__title_slug": "cat-and-mouse", "question__hide": false, - "total_acs": 16125, - "total_submitted": 45831, + "total_acs": 16209, + "total_submitted": 46129, "frontend_question_id": 913, "is_new_question": false }, @@ -35343,8 +35642,8 @@ "question__title": "Sort an Array", "question__title_slug": "sort-an-array", "question__hide": false, - "total_acs": 328375, - "total_submitted": 548199, + "total_acs": 332044, + "total_submitted": 556287, "frontend_question_id": 912, "is_new_question": false }, @@ -35366,8 +35665,8 @@ "question__title": "Online Election", "question__title_slug": "online-election", "question__hide": false, - "total_acs": 45296, - "total_submitted": 87059, + "total_acs": 45696, + "total_submitted": 87861, "frontend_question_id": 911, "is_new_question": false }, @@ -35389,8 +35688,8 @@ "question__title": "Smallest Range II", "question__title_slug": "smallest-range-ii", "question__hide": false, - "total_acs": 41498, - "total_submitted": 120409, + "total_acs": 41995, + "total_submitted": 121574, "frontend_question_id": 910, "is_new_question": false }, @@ -35412,8 +35711,8 @@ "question__title": "Snakes and Ladders", "question__title_slug": "snakes-and-ladders", "question__hide": false, - "total_acs": 86604, - "total_submitted": 211898, + "total_acs": 87259, + "total_submitted": 213338, "frontend_question_id": 909, "is_new_question": false }, @@ -35435,8 +35734,8 @@ "question__title": "Smallest Range I", "question__title_slug": "smallest-range-i", "question__hide": false, - "total_acs": 66156, - "total_submitted": 97805, + "total_acs": 66610, + "total_submitted": 98414, "frontend_question_id": 908, "is_new_question": false }, @@ -35458,8 +35757,8 @@ "question__title": "Sum of Subarray Minimums", "question__title_slug": "sum-of-subarray-minimums", "question__hide": false, - "total_acs": 102549, - "total_submitted": 298891, + "total_acs": 103557, + "total_submitted": 301801, "frontend_question_id": 907, "is_new_question": false }, @@ -35481,8 +35780,8 @@ "question__title": "Super Palindromes", "question__title_slug": "super-palindromes", "question__hide": false, - "total_acs": 22012, - "total_submitted": 56159, + "total_acs": 22054, + "total_submitted": 56258, "frontend_question_id": 906, "is_new_question": false }, @@ -35504,8 +35803,8 @@ "question__title": "Sort Array By Parity", "question__title_slug": "sort-array-by-parity", "question__hide": false, - "total_acs": 555626, - "total_submitted": 734448, + "total_acs": 559051, + "total_submitted": 738995, "frontend_question_id": 905, "is_new_question": false }, @@ -35527,8 +35826,8 @@ "question__title": "Fruit Into Baskets", "question__title_slug": "fruit-into-baskets", "question__hide": false, - "total_acs": 242094, - "total_submitted": 568381, + "total_acs": 244288, + "total_submitted": 573453, "frontend_question_id": 904, "is_new_question": false }, @@ -35550,8 +35849,8 @@ "question__title": "Valid Permutations for DI Sequence", "question__title_slug": "valid-permutations-for-di-sequence", "question__hide": false, - "total_acs": 12726, - "total_submitted": 22042, + "total_acs": 12817, + "total_submitted": 22214, "frontend_question_id": 903, "is_new_question": false }, @@ -35573,8 +35872,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": 38395, - "total_submitted": 92620, + "total_acs": 38598, + "total_submitted": 93071, "frontend_question_id": 902, "is_new_question": false }, @@ -35596,8 +35895,8 @@ "question__title": "Online Stock Span", "question__title_slug": "online-stock-span", "question__hide": false, - "total_acs": 150449, - "total_submitted": 235460, + "total_acs": 167314, + "total_submitted": 259666, "frontend_question_id": 901, "is_new_question": false }, @@ -35619,8 +35918,8 @@ "question__title": "RLE Iterator", "question__title_slug": "rle-iterator", "question__hide": false, - "total_acs": 59854, - "total_submitted": 100628, + "total_acs": 60495, + "total_submitted": 101704, "frontend_question_id": 900, "is_new_question": false }, @@ -35642,8 +35941,8 @@ "question__title": "Orderly Queue", "question__title_slug": "orderly-queue", "question__hide": false, - "total_acs": 27445, - "total_submitted": 46544, + "total_acs": 61202, + "total_submitted": 91882, "frontend_question_id": 899, "is_new_question": false }, @@ -35665,8 +35964,8 @@ "question__title": "Bitwise ORs of Subarrays", "question__title_slug": "bitwise-ors-of-subarrays", "question__hide": false, - "total_acs": 29043, - "total_submitted": 78872, + "total_acs": 29251, + "total_submitted": 79293, "frontend_question_id": 898, "is_new_question": false }, @@ -35688,8 +35987,8 @@ "question__title": "Increasing Order Search Tree", "question__title_slug": "increasing-order-search-tree", "question__hide": false, - "total_acs": 233569, - "total_submitted": 297734, + "total_acs": 234678, + "total_submitted": 299113, "frontend_question_id": 897, "is_new_question": false }, @@ -35711,8 +36010,8 @@ "question__title": "Monotonic Array", "question__title_slug": "monotonic-array", "question__hide": false, - "total_acs": 235358, - "total_submitted": 404199, + "total_acs": 237341, + "total_submitted": 407536, "frontend_question_id": 896, "is_new_question": false }, @@ -35734,8 +36033,8 @@ "question__title": "Maximum Frequency Stack", "question__title_slug": "maximum-frequency-stack", "question__hide": false, - "total_acs": 141932, - "total_submitted": 212607, + "total_acs": 142947, + "total_submitted": 214097, "frontend_question_id": 895, "is_new_question": false }, @@ -35757,8 +36056,8 @@ "question__title": "All Possible Full Binary Trees", "question__title_slug": "all-possible-full-binary-trees", "question__hide": false, - "total_acs": 98252, - "total_submitted": 122825, + "total_acs": 99051, + "total_submitted": 123844, "frontend_question_id": 894, "is_new_question": false }, @@ -35780,8 +36079,8 @@ "question__title": "Groups of Special-Equivalent Strings", "question__title_slug": "groups-of-special-equivalent-strings", "question__hide": false, - "total_acs": 43157, - "total_submitted": 60942, + "total_acs": 43308, + "total_submitted": 61120, "frontend_question_id": 893, "is_new_question": false }, @@ -35803,8 +36102,8 @@ "question__title": "Surface Area of 3D Shapes", "question__title_slug": "surface-area-of-3d-shapes", "question__hide": false, - "total_acs": 31615, - "total_submitted": 50117, + "total_acs": 31878, + "total_submitted": 50434, "frontend_question_id": 892, "is_new_question": false }, @@ -35826,8 +36125,8 @@ "question__title": "Sum of Subsequence Widths", "question__title_slug": "sum-of-subsequence-widths", "question__hide": false, - "total_acs": 17433, - "total_submitted": 47897, + "total_acs": 17502, + "total_submitted": 48058, "frontend_question_id": 891, "is_new_question": false }, @@ -35849,8 +36148,8 @@ "question__title": "Find and Replace Pattern", "question__title_slug": "find-and-replace-pattern", "question__hide": false, - "total_acs": 161534, - "total_submitted": 207357, + "total_acs": 162319, + "total_submitted": 208398, "frontend_question_id": 890, "is_new_question": false }, @@ -35872,8 +36171,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": 81812, - "total_submitted": 115612, + "total_acs": 82410, + "total_submitted": 116412, "frontend_question_id": 889, "is_new_question": false }, @@ -35895,8 +36194,8 @@ "question__title": "Fair Candy Swap", "question__title_slug": "fair-candy-swap", "question__hide": false, - "total_acs": 92047, - "total_submitted": 152171, + "total_acs": 92953, + "total_submitted": 153696, "frontend_question_id": 888, "is_new_question": false }, @@ -35918,8 +36217,8 @@ "question__title": "Super Egg Drop", "question__title_slug": "super-egg-drop", "question__hide": false, - "total_acs": 55096, - "total_submitted": 202802, + "total_acs": 55479, + "total_submitted": 204170, "frontend_question_id": 887, "is_new_question": false }, @@ -35941,8 +36240,8 @@ "question__title": "Possible Bipartition", "question__title_slug": "possible-bipartition", "question__hide": false, - "total_acs": 125784, - "total_submitted": 260089, + "total_acs": 126798, + "total_submitted": 261922, "frontend_question_id": 886, "is_new_question": false }, @@ -35964,8 +36263,8 @@ "question__title": "Spiral Matrix III", "question__title_slug": "spiral-matrix-iii", "question__hide": false, - "total_acs": 38247, - "total_submitted": 52356, + "total_acs": 38606, + "total_submitted": 52782, "frontend_question_id": 885, "is_new_question": false }, @@ -35987,8 +36286,8 @@ "question__title": "Uncommon Words from Two Sentences", "question__title_slug": "uncommon-words-from-two-sentences", "question__hide": false, - "total_acs": 107758, - "total_submitted": 163399, + "total_acs": 108702, + "total_submitted": 164709, "frontend_question_id": 884, "is_new_question": false }, @@ -36010,8 +36309,8 @@ "question__title": "Projection Area of 3D Shapes", "question__title_slug": "projection-area-of-3d-shapes", "question__hide": false, - "total_acs": 44334, - "total_submitted": 62739, + "total_acs": 44610, + "total_submitted": 63104, "frontend_question_id": 883, "is_new_question": false }, @@ -36033,8 +36332,8 @@ "question__title": "Reachable Nodes In Subdivided Graph", "question__title_slug": "reachable-nodes-in-subdivided-graph", "question__hide": false, - "total_acs": 22419, - "total_submitted": 44550, + "total_acs": 22528, + "total_submitted": 44753, "frontend_question_id": 882, "is_new_question": false }, @@ -36056,8 +36355,8 @@ "question__title": "Boats to Save People", "question__title_slug": "boats-to-save-people", "question__hide": false, - "total_acs": 161523, - "total_submitted": 306478, + "total_acs": 162923, + "total_submitted": 308971, "frontend_question_id": 881, "is_new_question": false }, @@ -36079,8 +36378,8 @@ "question__title": "Decoded String at Index", "question__title_slug": "decoded-string-at-index", "question__hide": false, - "total_acs": 35066, - "total_submitted": 123865, + "total_acs": 35172, + "total_submitted": 124236, "frontend_question_id": 880, "is_new_question": false }, @@ -36102,8 +36401,8 @@ "question__title": "Generate Random Point in a Circle", "question__title_slug": "generate-random-point-in-a-circle", "question__hide": false, - "total_acs": 35348, - "total_submitted": 89266, + "total_acs": 35500, + "total_submitted": 89603, "frontend_question_id": 478, "is_new_question": false }, @@ -36125,8 +36424,8 @@ "question__title": "Random Point in Non-overlapping Rectangles", "question__title_slug": "random-point-in-non-overlapping-rectangles", "question__hide": false, - "total_acs": 35684, - "total_submitted": 90852, + "total_acs": 35783, + "total_submitted": 91087, "frontend_question_id": 497, "is_new_question": false }, @@ -36148,8 +36447,8 @@ "question__title": "Random Flip Matrix", "question__title_slug": "random-flip-matrix", "question__hide": false, - "total_acs": 14980, - "total_submitted": 37656, + "total_acs": 15099, + "total_submitted": 37893, "frontend_question_id": 519, "is_new_question": false }, @@ -36171,8 +36470,8 @@ "question__title": "Random Pick with Weight", "question__title_slug": "random-pick-with-weight", "question__hide": false, - "total_acs": 340758, - "total_submitted": 738929, + "total_acs": 342933, + "total_submitted": 743878, "frontend_question_id": 528, "is_new_question": false }, @@ -36194,8 +36493,8 @@ "question__title": "Profitable Schemes", "question__title_slug": "profitable-schemes", "question__hide": false, - "total_acs": 16674, - "total_submitted": 41192, + "total_acs": 16751, + "total_submitted": 41425, "frontend_question_id": 879, "is_new_question": false }, @@ -36217,8 +36516,8 @@ "question__title": "Nth Magical Number", "question__title_slug": "nth-magical-number", "question__hide": false, - "total_acs": 31548, - "total_submitted": 88361, + "total_acs": 31683, + "total_submitted": 88812, "frontend_question_id": 878, "is_new_question": false }, @@ -36240,8 +36539,8 @@ "question__title": "Stone Game", "question__title_slug": "stone-game", "question__hide": false, - "total_acs": 171722, - "total_submitted": 246449, + "total_acs": 172704, + "total_submitted": 247785, "frontend_question_id": 877, "is_new_question": false }, @@ -36263,8 +36562,8 @@ "question__title": "Middle of the Linked List", "question__title_slug": "middle-of-the-linked-list", "question__hide": false, - "total_acs": 974543, - "total_submitted": 1321487, + "total_acs": 997194, + "total_submitted": 1351216, "frontend_question_id": 876, "is_new_question": false }, @@ -36286,8 +36585,8 @@ "question__title": "Koko Eating Bananas", "question__title_slug": "koko-eating-bananas", "question__hide": false, - "total_acs": 240247, - "total_submitted": 458774, + "total_acs": 244507, + "total_submitted": 467913, "frontend_question_id": 875, "is_new_question": false }, @@ -36309,8 +36608,8 @@ "question__title": "Walking Robot Simulation", "question__title_slug": "walking-robot-simulation", "question__hide": false, - "total_acs": 34409, - "total_submitted": 89634, + "total_acs": 34565, + "total_submitted": 89998, "frontend_question_id": 874, "is_new_question": false }, @@ -36332,8 +36631,8 @@ "question__title": "Length of Longest Fibonacci Subsequence", "question__title_slug": "length-of-longest-fibonacci-subsequence", "question__hide": false, - "total_acs": 52757, - "total_submitted": 108593, + "total_acs": 53019, + "total_submitted": 109136, "frontend_question_id": 873, "is_new_question": false }, @@ -36355,8 +36654,8 @@ "question__title": "Leaf-Similar Trees", "question__title_slug": "leaf-similar-trees", "question__hide": false, - "total_acs": 182469, - "total_submitted": 280028, + "total_acs": 183511, + "total_submitted": 281561, "frontend_question_id": 872, "is_new_question": false }, @@ -36378,8 +36677,8 @@ "question__title": "Implement Rand10() Using Rand7()", "question__title_slug": "implement-rand10-using-rand7", "question__hide": false, - "total_acs": 67608, - "total_submitted": 144826, + "total_acs": 67913, + "total_submitted": 145569, "frontend_question_id": 470, "is_new_question": false }, @@ -36401,8 +36700,8 @@ "question__title": "Minimum Number of Refueling Stops", "question__title_slug": "minimum-number-of-refueling-stops", "question__hide": false, - "total_acs": 117334, - "total_submitted": 294359, + "total_acs": 118041, + "total_submitted": 296106, "frontend_question_id": 871, "is_new_question": false }, @@ -36424,8 +36723,8 @@ "question__title": "Advantage Shuffle", "question__title_slug": "advantage-shuffle", "question__hide": false, - "total_acs": 57509, - "total_submitted": 111324, + "total_acs": 57792, + "total_submitted": 111779, "frontend_question_id": 870, "is_new_question": false }, @@ -36447,8 +36746,8 @@ "question__title": "Reordered Power of 2", "question__title_slug": "reordered-power-of-2", "question__hide": false, - "total_acs": 101313, - "total_submitted": 158249, + "total_acs": 101919, + "total_submitted": 159367, "frontend_question_id": 869, "is_new_question": false }, @@ -36470,8 +36769,8 @@ "question__title": "Binary Gap", "question__title_slug": "binary-gap", "question__hide": false, - "total_acs": 64205, - "total_submitted": 103707, + "total_acs": 64612, + "total_submitted": 104352, "frontend_question_id": 868, "is_new_question": false }, @@ -36493,8 +36792,8 @@ "question__title": "Transpose Matrix", "question__title_slug": "transpose-matrix", "question__hide": false, - "total_acs": 221436, - "total_submitted": 349442, + "total_acs": 223292, + "total_submitted": 352241, "frontend_question_id": 867, "is_new_question": false }, @@ -36516,8 +36815,8 @@ "question__title": "Prime Palindrome", "question__title_slug": "prime-palindrome", "question__hide": false, - "total_acs": 27001, - "total_submitted": 104680, + "total_acs": 27115, + "total_submitted": 105040, "frontend_question_id": 866, "is_new_question": false }, @@ -36539,8 +36838,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": 111351, - "total_submitted": 162426, + "total_acs": 111750, + "total_submitted": 162943, "frontend_question_id": 865, "is_new_question": false }, @@ -36562,8 +36861,8 @@ "question__title": "Shortest Path to Get All Keys", "question__title_slug": "shortest-path-to-get-all-keys", "question__hide": false, - "total_acs": 27649, - "total_submitted": 60903, + "total_acs": 28045, + "total_submitted": 61708, "frontend_question_id": 864, "is_new_question": false }, @@ -36585,8 +36884,8 @@ "question__title": "Random Pick with Blacklist", "question__title_slug": "random-pick-with-blacklist", "question__hide": false, - "total_acs": 33370, - "total_submitted": 99165, + "total_acs": 33631, + "total_submitted": 99971, "frontend_question_id": 710, "is_new_question": false }, @@ -36608,8 +36907,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": 277481, - "total_submitted": 446887, + "total_acs": 279999, + "total_submitted": 450676, "frontend_question_id": 863, "is_new_question": false }, @@ -36631,8 +36930,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": 79981, - "total_submitted": 306283, + "total_acs": 80452, + "total_submitted": 308088, "frontend_question_id": 862, "is_new_question": false }, @@ -36654,8 +36953,8 @@ "question__title": "Score After Flipping Matrix", "question__title_slug": "score-after-flipping-matrix", "question__hide": false, - "total_acs": 38578, - "total_submitted": 51358, + "total_acs": 38807, + "total_submitted": 51672, "frontend_question_id": 861, "is_new_question": false }, @@ -36677,8 +36976,8 @@ "question__title": "Lemonade Change", "question__title_slug": "lemonade-change", "question__hide": false, - "total_acs": 112667, - "total_submitted": 213473, + "total_acs": 113824, + "total_submitted": 215583, "frontend_question_id": 860, "is_new_question": false }, @@ -36700,8 +36999,8 @@ "question__title": "Buddy Strings", "question__title_slug": "buddy-strings", "question__hide": false, - "total_acs": 135088, - "total_submitted": 465371, + "total_acs": 136268, + "total_submitted": 468949, "frontend_question_id": 859, "is_new_question": false }, @@ -36723,8 +37022,8 @@ "question__title": "Mirror Reflection", "question__title_slug": "mirror-reflection", "question__hide": false, - "total_acs": 73550, - "total_submitted": 116263, + "total_acs": 73847, + "total_submitted": 116727, "frontend_question_id": 858, "is_new_question": false }, @@ -36746,8 +37045,8 @@ "question__title": "Minimum Cost to Hire K Workers", "question__title_slug": "minimum-cost-to-hire-k-workers", "question__hide": false, - "total_acs": 55576, - "total_submitted": 106845, + "total_acs": 55892, + "total_submitted": 107425, "frontend_question_id": 857, "is_new_question": false }, @@ -36769,8 +37068,8 @@ "question__title": "Score of Parentheses", "question__title_slug": "score-of-parentheses", "question__hide": false, - "total_acs": 149614, - "total_submitted": 229958, + "total_acs": 150226, + "total_submitted": 231002, "frontend_question_id": 856, "is_new_question": false }, @@ -36792,8 +37091,8 @@ "question__title": "Exam Room", "question__title_slug": "exam-room", "question__hide": false, - "total_acs": 51207, - "total_submitted": 117858, + "total_acs": 51446, + "total_submitted": 118506, "frontend_question_id": 855, "is_new_question": false }, @@ -36815,8 +37114,8 @@ "question__title": "K-Similar Strings", "question__title_slug": "k-similar-strings", "question__hide": false, - "total_acs": 38608, - "total_submitted": 96350, + "total_acs": 39059, + "total_submitted": 97313, "frontend_question_id": 854, "is_new_question": false }, @@ -36838,8 +37137,8 @@ "question__title": "Car Fleet", "question__title_slug": "car-fleet", "question__hide": false, - "total_acs": 110172, - "total_submitted": 220295, + "total_acs": 111924, + "total_submitted": 223352, "frontend_question_id": 853, "is_new_question": false }, @@ -36861,8 +37160,8 @@ "question__title": "Peak Index in a Mountain Array", "question__title_slug": "peak-index-in-a-mountain-array", "question__hide": false, - "total_acs": 474854, - "total_submitted": 683229, + "total_acs": 480786, + "total_submitted": 692154, "frontend_question_id": 852, "is_new_question": false }, @@ -36884,8 +37183,8 @@ "question__title": "Loud and Rich", "question__title_slug": "loud-and-rich", "question__hide": false, - "total_acs": 29692, - "total_submitted": 51038, + "total_acs": 30016, + "total_submitted": 51565, "frontend_question_id": 851, "is_new_question": false }, @@ -36907,8 +37206,8 @@ "question__title": "Rectangle Area II", "question__title_slug": "rectangle-area-ii", "question__hide": false, - "total_acs": 31132, - "total_submitted": 57984, + "total_acs": 31254, + "total_submitted": 58199, "frontend_question_id": 850, "is_new_question": false }, @@ -36930,8 +37229,8 @@ "question__title": "Maximize Distance to Closest Person", "question__title_slug": "maximize-distance-to-closest-person", "question__hide": false, - "total_acs": 189404, - "total_submitted": 397979, + "total_acs": 190218, + "total_submitted": 399713, "frontend_question_id": 849, "is_new_question": false }, @@ -36953,8 +37252,8 @@ "question__title": "Shifting Letters", "question__title_slug": "shifting-letters", "question__hide": false, - "total_acs": 80300, - "total_submitted": 176710, + "total_acs": 80888, + "total_submitted": 178068, "frontend_question_id": 848, "is_new_question": false }, @@ -36976,8 +37275,8 @@ "question__title": "Shortest Path Visiting All Nodes", "question__title_slug": "shortest-path-visiting-all-nodes", "question__hide": false, - "total_acs": 64665, - "total_submitted": 105526, + "total_acs": 65038, + "total_submitted": 106090, "frontend_question_id": 847, "is_new_question": false }, @@ -36999,8 +37298,8 @@ "question__title": "Hand of Straights", "question__title_slug": "hand-of-straights", "question__hide": false, - "total_acs": 104023, - "total_submitted": 184227, + "total_acs": 104970, + "total_submitted": 185967, "frontend_question_id": 846, "is_new_question": false }, @@ -37022,8 +37321,8 @@ "question__title": "Longest Mountain in Array", "question__title_slug": "longest-mountain-in-array", "question__hide": false, - "total_acs": 102053, - "total_submitted": 254049, + "total_acs": 102748, + "total_submitted": 255658, "frontend_question_id": 845, "is_new_question": false }, @@ -37045,8 +37344,8 @@ "question__title": "Backspace String Compare", "question__title_slug": "backspace-string-compare", "question__hide": false, - "total_acs": 560807, - "total_submitted": 1168866, + "total_acs": 566558, + "total_submitted": 1180607, "frontend_question_id": 844, "is_new_question": false }, @@ -37068,8 +37367,8 @@ "question__title": "Guess the Word", "question__title_slug": "guess-the-word", "question__hide": false, - "total_acs": 126915, - "total_submitted": 302454, + "total_acs": 127408, + "total_submitted": 304139, "frontend_question_id": 843, "is_new_question": false }, @@ -37091,8 +37390,8 @@ "question__title": "Split Array into Fibonacci Sequence", "question__title_slug": "split-array-into-fibonacci-sequence", "question__hide": false, - "total_acs": 33325, - "total_submitted": 87201, + "total_acs": 33458, + "total_submitted": 87518, "frontend_question_id": 842, "is_new_question": false }, @@ -37114,8 +37413,8 @@ "question__title": "Keys and Rooms", "question__title_slug": "keys-and-rooms", "question__hide": false, - "total_acs": 234802, - "total_submitted": 334955, + "total_acs": 236963, + "total_submitted": 337883, "frontend_question_id": 841, "is_new_question": false }, @@ -37137,8 +37436,8 @@ "question__title": "Magic Squares In Grid", "question__title_slug": "magic-squares-in-grid", "question__hide": false, - "total_acs": 33826, - "total_submitted": 87796, + "total_acs": 33966, + "total_submitted": 88138, "frontend_question_id": 840, "is_new_question": false }, @@ -37160,8 +37459,8 @@ "question__title": "Similar String Groups", "question__title_slug": "similar-string-groups", "question__hide": false, - "total_acs": 60803, - "total_submitted": 127795, + "total_acs": 61415, + "total_submitted": 128831, "frontend_question_id": 839, "is_new_question": false }, @@ -37183,8 +37482,8 @@ "question__title": "Push Dominoes", "question__title_slug": "push-dominoes", "question__hide": false, - "total_acs": 106647, - "total_submitted": 187131, + "total_acs": 107382, + "total_submitted": 188420, "frontend_question_id": 838, "is_new_question": false }, @@ -37206,8 +37505,8 @@ "question__title": "New 21 Game", "question__title_slug": "new-21-game", "question__hide": false, - "total_acs": 33360, - "total_submitted": 92321, + "total_acs": 33477, + "total_submitted": 92666, "frontend_question_id": 837, "is_new_question": false }, @@ -37229,8 +37528,8 @@ "question__title": "Rectangle Overlap", "question__title_slug": "rectangle-overlap", "question__hide": false, - "total_acs": 112705, - "total_submitted": 260204, + "total_acs": 113515, + "total_submitted": 261971, "frontend_question_id": 836, "is_new_question": false }, @@ -37252,8 +37551,8 @@ "question__title": "Robot Room Cleaner", "question__title_slug": "robot-room-cleaner", "question__hide": false, - "total_acs": 137214, - "total_submitted": 179305, + "total_acs": 137943, + "total_submitted": 180221, "frontend_question_id": 489, "is_new_question": false }, @@ -37275,8 +37574,8 @@ "question__title": "Image Overlap", "question__title_slug": "image-overlap", "question__hide": false, - "total_acs": 48973, - "total_submitted": 80284, + "total_acs": 85864, + "total_submitted": 134108, "frontend_question_id": 835, "is_new_question": false }, @@ -37298,8 +37597,8 @@ "question__title": "Sum of Distances in Tree", "question__title_slug": "sum-of-distances-in-tree", "question__hide": false, - "total_acs": 46839, - "total_submitted": 86465, + "total_acs": 47074, + "total_submitted": 86863, "frontend_question_id": 834, "is_new_question": false }, @@ -37321,8 +37620,8 @@ "question__title": "Find And Replace in String", "question__title_slug": "find-and-replace-in-string", "question__hide": false, - "total_acs": 127950, - "total_submitted": 236439, + "total_acs": 128802, + "total_submitted": 237988, "frontend_question_id": 833, "is_new_question": false }, @@ -37344,8 +37643,8 @@ "question__title": "Flipping an Image", "question__title_slug": "flipping-an-image", "question__hide": false, - "total_acs": 330802, - "total_submitted": 411614, + "total_acs": 333115, + "total_submitted": 414282, "frontend_question_id": 832, "is_new_question": false }, @@ -37367,8 +37666,8 @@ "question__title": "Design Circular Queue", "question__title_slug": "design-circular-queue", "question__hide": false, - "total_acs": 243836, - "total_submitted": 470759, + "total_acs": 245647, + "total_submitted": 474236, "frontend_question_id": 622, "is_new_question": false }, @@ -37390,8 +37689,8 @@ "question__title": "Design Circular Deque", "question__title_slug": "design-circular-deque", "question__hide": false, - "total_acs": 50485, - "total_submitted": 87660, + "total_acs": 50923, + "total_submitted": 88402, "frontend_question_id": 641, "is_new_question": false }, @@ -37413,8 +37712,8 @@ "question__title": "Masking Personal Information", "question__title_slug": "masking-personal-information", "question__hide": false, - "total_acs": 15549, - "total_submitted": 33189, + "total_acs": 15642, + "total_submitted": 33354, "frontend_question_id": 831, "is_new_question": false }, @@ -37436,8 +37735,8 @@ "question__title": "Positions of Large Groups", "question__title_slug": "positions-of-large-groups", "question__hide": false, - "total_acs": 77586, - "total_submitted": 150060, + "total_acs": 77995, + "total_submitted": 150784, "frontend_question_id": 830, "is_new_question": false }, @@ -37459,8 +37758,8 @@ "question__title": "Consecutive Numbers Sum", "question__title_slug": "consecutive-numbers-sum", "question__hide": false, - "total_acs": 75251, - "total_submitted": 181369, + "total_acs": 75568, + "total_submitted": 182017, "frontend_question_id": 829, "is_new_question": false }, @@ -37482,8 +37781,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": 60910, - "total_submitted": 118059, + "total_acs": 61507, + "total_submitted": 118994, "frontend_question_id": 828, "is_new_question": false }, @@ -37505,8 +37804,8 @@ "question__title": "Making A Large Island", "question__title_slug": "making-a-large-island", "question__hide": false, - "total_acs": 121653, - "total_submitted": 272259, + "total_acs": 122460, + "total_submitted": 273999, "frontend_question_id": 827, "is_new_question": false }, @@ -37528,8 +37827,8 @@ "question__title": "Most Profit Assigning Work", "question__title_slug": "most-profit-assigning-work", "question__hide": false, - "total_acs": 48120, - "total_submitted": 108392, + "total_acs": 48921, + "total_submitted": 110024, "frontend_question_id": 826, "is_new_question": false }, @@ -37551,8 +37850,8 @@ "question__title": "Friends Of Appropriate Ages", "question__title_slug": "friends-of-appropriate-ages", "question__hide": false, - "total_acs": 69120, - "total_submitted": 149059, + "total_acs": 69295, + "total_submitted": 149440, "frontend_question_id": 825, "is_new_question": false }, @@ -37574,8 +37873,8 @@ "question__title": "Goat Latin", "question__title_slug": "goat-latin", "question__hide": false, - "total_acs": 150424, - "total_submitted": 221847, + "total_acs": 150962, + "total_submitted": 222598, "frontend_question_id": 824, "is_new_question": false }, @@ -37597,8 +37896,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": 125585, - "total_submitted": 364201, + "total_acs": 126006, + "total_submitted": 365313, "frontend_question_id": 708, "is_new_question": false }, @@ -37620,8 +37919,8 @@ "question__title": "Binary Trees With Factors", "question__title_slug": "binary-trees-with-factors", "question__hide": false, - "total_acs": 86348, - "total_submitted": 172657, + "total_acs": 86781, + "total_submitted": 173598, "frontend_question_id": 823, "is_new_question": false }, @@ -37643,8 +37942,8 @@ "question__title": "Card Flipping Game", "question__title_slug": "card-flipping-game", "question__hide": false, - "total_acs": 14375, - "total_submitted": 31607, + "total_acs": 14462, + "total_submitted": 31749, "frontend_question_id": 822, "is_new_question": false }, @@ -37666,8 +37965,8 @@ "question__title": "Shortest Distance to a Character", "question__title_slug": "shortest-distance-to-a-character", "question__hide": false, - "total_acs": 145826, - "total_submitted": 204370, + "total_acs": 146858, + "total_submitted": 205727, "frontend_question_id": 821, "is_new_question": false }, @@ -37689,8 +37988,8 @@ "question__title": "Short Encoding of Words", "question__title_slug": "short-encoding-of-words", "question__hide": false, - "total_acs": 89906, - "total_submitted": 148183, + "total_acs": 90086, + "total_submitted": 148521, "frontend_question_id": 820, "is_new_question": false }, @@ -37712,8 +38011,8 @@ "question__title": "Design Linked List", "question__title_slug": "design-linked-list", "question__hide": false, - "total_acs": 228606, - "total_submitted": 831696, + "total_acs": 230804, + "total_submitted": 839113, "frontend_question_id": 707, "is_new_question": false }, @@ -37735,8 +38034,8 @@ "question__title": "Most Common Word", "question__title_slug": "most-common-word", "question__hide": false, - "total_acs": 312187, - "total_submitted": 694253, + "total_acs": 313697, + "total_submitted": 697732, "frontend_question_id": 819, "is_new_question": false }, @@ -37758,8 +38057,8 @@ "question__title": "Race Car", "question__title_slug": "race-car", "question__hide": false, - "total_acs": 65447, - "total_submitted": 150211, + "total_acs": 66841, + "total_submitted": 153411, "frontend_question_id": 818, "is_new_question": false }, @@ -37781,8 +38080,8 @@ "question__title": "Linked List Components", "question__title_slug": "linked-list-components", "question__hide": false, - "total_acs": 75768, - "total_submitted": 130441, + "total_acs": 76177, + "total_submitted": 131183, "frontend_question_id": 817, "is_new_question": false }, @@ -37804,8 +38103,8 @@ "question__title": "Ambiguous Coordinates", "question__title_slug": "ambiguous-coordinates", "question__hide": false, - "total_acs": 26652, - "total_submitted": 47548, + "total_acs": 26850, + "total_submitted": 47835, "frontend_question_id": 816, "is_new_question": false }, @@ -37827,8 +38126,8 @@ "question__title": "Bus Routes", "question__title_slug": "bus-routes", "question__hide": false, - "total_acs": 109502, - "total_submitted": 239600, + "total_acs": 110874, + "total_submitted": 242450, "frontend_question_id": 815, "is_new_question": false }, @@ -37850,8 +38149,8 @@ "question__title": "Binary Tree Pruning", "question__title_slug": "binary-tree-pruning", "question__hide": false, - "total_acs": 215795, - "total_submitted": 297253, + "total_acs": 216612, + "total_submitted": 298495, "frontend_question_id": 814, "is_new_question": false }, @@ -37873,8 +38172,8 @@ "question__title": "Largest Sum of Averages", "question__title_slug": "largest-sum-of-averages", "question__hide": false, - "total_acs": 43874, - "total_submitted": 82903, + "total_acs": 44055, + "total_submitted": 83206, "frontend_question_id": 813, "is_new_question": false }, @@ -37896,8 +38195,8 @@ "question__title": "Largest Triangle Area", "question__title_slug": "largest-triangle-area", "question__hide": false, - "total_acs": 37505, - "total_submitted": 62465, + "total_acs": 37812, + "total_submitted": 62936, "frontend_question_id": 812, "is_new_question": false }, @@ -37919,8 +38218,8 @@ "question__title": "Subdomain Visit Count", "question__title_slug": "subdomain-visit-count", "question__hide": false, - "total_acs": 196228, - "total_submitted": 261132, + "total_acs": 198075, + "total_submitted": 263390, "frontend_question_id": 811, "is_new_question": false }, @@ -37942,8 +38241,8 @@ "question__title": "Chalkboard XOR Game", "question__title_slug": "chalkboard-xor-game", "question__hide": false, - "total_acs": 7400, - "total_submitted": 13418, + "total_acs": 7452, + "total_submitted": 13488, "frontend_question_id": 810, "is_new_question": false }, @@ -37965,8 +38264,8 @@ "question__title": "Expressive Words", "question__title_slug": "expressive-words", "question__hide": false, - "total_acs": 103525, - "total_submitted": 223441, + "total_acs": 103917, + "total_submitted": 224334, "frontend_question_id": 809, "is_new_question": false }, @@ -37988,8 +38287,8 @@ "question__title": "Soup Servings", "question__title_slug": "soup-servings", "question__hide": false, - "total_acs": 16355, - "total_submitted": 37915, + "total_acs": 16434, + "total_submitted": 38101, "frontend_question_id": 808, "is_new_question": false }, @@ -38011,8 +38310,8 @@ "question__title": "Max Increase to Keep City Skyline", "question__title_slug": "max-increase-to-keep-city-skyline", "question__hide": false, - "total_acs": 136218, - "total_submitted": 158474, + "total_acs": 137078, + "total_submitted": 159471, "frontend_question_id": 807, "is_new_question": false }, @@ -38034,8 +38333,8 @@ "question__title": "Number of Lines To Write String", "question__title_slug": "number-of-lines-to-write-string", "question__hide": false, - "total_acs": 59521, - "total_submitted": 90035, + "total_acs": 59968, + "total_submitted": 90691, "frontend_question_id": 806, "is_new_question": false }, @@ -38057,8 +38356,8 @@ "question__title": "Split Array With Same Average", "question__title_slug": "split-array-with-same-average", "question__hide": false, - "total_acs": 28240, - "total_submitted": 109049, + "total_acs": 28365, + "total_submitted": 109797, "frontend_question_id": 805, "is_new_question": false }, @@ -38080,8 +38379,8 @@ "question__title": "Unique Morse Code Words", "question__title_slug": "unique-morse-code-words", "question__hide": false, - "total_acs": 296781, - "total_submitted": 359140, + "total_acs": 298197, + "total_submitted": 360737, "frontend_question_id": 804, "is_new_question": false }, @@ -38103,8 +38402,8 @@ "question__title": "Bricks Falling When Hit", "question__title_slug": "bricks-falling-when-hit", "question__hide": false, - "total_acs": 26848, - "total_submitted": 78249, + "total_acs": 26922, + "total_submitted": 78565, "frontend_question_id": 803, "is_new_question": false }, @@ -38126,8 +38425,8 @@ "question__title": "Find Eventual Safe States", "question__title_slug": "find-eventual-safe-states", "question__hide": false, - "total_acs": 102537, - "total_submitted": 186589, + "total_acs": 104255, + "total_submitted": 189047, "frontend_question_id": 802, "is_new_question": false }, @@ -38149,8 +38448,8 @@ "question__title": "Minimum Swaps To Make Sequences Increasing", "question__title_slug": "minimum-swaps-to-make-sequences-increasing", "question__hide": false, - "total_acs": 58838, - "total_submitted": 149907, + "total_acs": 59188, + "total_submitted": 150803, "frontend_question_id": 801, "is_new_question": false }, @@ -38172,8 +38471,8 @@ "question__title": "Similar RGB Color", "question__title_slug": "similar-rgb-color", "question__hide": false, - "total_acs": 15821, - "total_submitted": 23645, + "total_acs": 15929, + "total_submitted": 23813, "frontend_question_id": 800, "is_new_question": false }, @@ -38195,8 +38494,8 @@ "question__title": "Design HashMap", "question__title_slug": "design-hashmap", "question__hide": false, - "total_acs": 377040, - "total_submitted": 579490, + "total_acs": 380008, + "total_submitted": 584294, "frontend_question_id": 706, "is_new_question": false }, @@ -38218,8 +38517,8 @@ "question__title": "Design HashSet", "question__title_slug": "design-hashset", "question__hide": false, - "total_acs": 260712, - "total_submitted": 395266, + "total_acs": 262744, + "total_submitted": 398546, "frontend_question_id": 705, "is_new_question": false }, @@ -38241,8 +38540,8 @@ "question__title": "Champagne Tower", "question__title_slug": "champagne-tower", "question__hide": false, - "total_acs": 81750, - "total_submitted": 159557, + "total_acs": 81954, + "total_submitted": 159930, "frontend_question_id": 799, "is_new_question": false }, @@ -38264,8 +38563,8 @@ "question__title": "Smallest Rotation with Highest Score", "question__title_slug": "smallest-rotation-with-highest-score", "question__hide": false, - "total_acs": 10939, - "total_submitted": 22027, + "total_acs": 10999, + "total_submitted": 22118, "frontend_question_id": 798, "is_new_question": false }, @@ -38287,8 +38586,8 @@ "question__title": "All Paths From Source to Target", "question__title_slug": "all-paths-from-source-to-target", "question__hide": false, - "total_acs": 347616, - "total_submitted": 426849, + "total_acs": 351934, + "total_submitted": 432039, "frontend_question_id": 797, "is_new_question": false }, @@ -38310,8 +38609,8 @@ "question__title": "Rotate String", "question__title_slug": "rotate-string", "question__hide": false, - "total_acs": 176920, - "total_submitted": 327451, + "total_acs": 179088, + "total_submitted": 330822, "frontend_question_id": 796, "is_new_question": false }, @@ -38333,8 +38632,8 @@ "question__title": "Number of Subarrays with Bounded Maximum", "question__title_slug": "number-of-subarrays-with-bounded-maximum", "question__hide": false, - "total_acs": 57550, - "total_submitted": 109208, + "total_acs": 57860, + "total_submitted": 109742, "frontend_question_id": 795, "is_new_question": false }, @@ -38356,8 +38655,8 @@ "question__title": "Valid Tic-Tac-Toe State", "question__title_slug": "valid-tic-tac-toe-state", "question__hide": false, - "total_acs": 51914, - "total_submitted": 147479, + "total_acs": 52112, + "total_submitted": 148178, "frontend_question_id": 794, "is_new_question": false }, @@ -38379,8 +38678,8 @@ "question__title": "Preimage Size of Factorial Zeroes Function", "question__title_slug": "preimage-size-of-factorial-zeroes-function", "question__hide": false, - "total_acs": 14053, - "total_submitted": 32884, + "total_acs": 14144, + "total_submitted": 33101, "frontend_question_id": 793, "is_new_question": false }, @@ -38402,8 +38701,8 @@ "question__title": "Number of Matching Subsequences", "question__title_slug": "number-of-matching-subsequences", "question__hide": false, - "total_acs": 199646, - "total_submitted": 384514, + "total_acs": 200743, + "total_submitted": 386737, "frontend_question_id": 792, "is_new_question": false }, @@ -38425,8 +38724,8 @@ "question__title": "Custom Sort String", "question__title_slug": "custom-sort-string", "question__hide": false, - "total_acs": 200729, - "total_submitted": 289319, + "total_acs": 201656, + "total_submitted": 290747, "frontend_question_id": 791, "is_new_question": false }, @@ -38448,8 +38747,8 @@ "question__title": "Domino and Tromino Tiling", "question__title_slug": "domino-and-tromino-tiling", "question__hide": false, - "total_acs": 54521, - "total_submitted": 112761, + "total_acs": 54960, + "total_submitted": 113583, "frontend_question_id": 790, "is_new_question": false }, @@ -38471,8 +38770,8 @@ "question__title": "Escape The Ghosts", "question__title_slug": "escape-the-ghosts", "question__hide": false, - "total_acs": 23285, - "total_submitted": 38426, + "total_acs": 23394, + "total_submitted": 38605, "frontend_question_id": 789, "is_new_question": false }, @@ -38494,8 +38793,8 @@ "question__title": "Rotated Digits", "question__title_slug": "rotated-digits", "question__hide": false, - "total_acs": 91596, - "total_submitted": 160989, + "total_acs": 91967, + "total_submitted": 161725, "frontend_question_id": 788, "is_new_question": false }, @@ -38517,8 +38816,8 @@ "question__title": "Cheapest Flights Within K Stops", "question__title_slug": "cheapest-flights-within-k-stops", "question__hide": false, - "total_acs": 284296, - "total_submitted": 792238, + "total_acs": 287247, + "total_submitted": 800245, "frontend_question_id": 787, "is_new_question": false }, @@ -38540,8 +38839,8 @@ "question__title": "K-th Smallest Prime Fraction", "question__title_slug": "k-th-smallest-prime-fraction", "question__hide": false, - "total_acs": 31215, - "total_submitted": 61553, + "total_acs": 31526, + "total_submitted": 62056, "frontend_question_id": 786, "is_new_question": false }, @@ -38563,8 +38862,8 @@ "question__title": "Is Graph Bipartite?", "question__title_slug": "is-graph-bipartite", "question__hide": false, - "total_acs": 365556, - "total_submitted": 694615, + "total_acs": 368282, + "total_submitted": 699107, "frontend_question_id": 785, "is_new_question": false }, @@ -38586,8 +38885,8 @@ "question__title": "Letter Case Permutation", "question__title_slug": "letter-case-permutation", "question__hide": false, - "total_acs": 248214, - "total_submitted": 337956, + "total_acs": 250253, + "total_submitted": 340515, "frontend_question_id": 784, "is_new_question": false }, @@ -38609,8 +38908,8 @@ "question__title": "Minimum Distance Between BST Nodes", "question__title_slug": "minimum-distance-between-bst-nodes", "question__hide": false, - "total_acs": 137064, - "total_submitted": 241296, + "total_acs": 138196, + "total_submitted": 243140, "frontend_question_id": 783, "is_new_question": false }, @@ -38632,8 +38931,8 @@ "question__title": "Transform to Chessboard", "question__title_slug": "transform-to-chessboard", "question__hide": false, - "total_acs": 15523, - "total_submitted": 29939, + "total_acs": 15544, + "total_submitted": 29972, "frontend_question_id": 782, "is_new_question": false }, @@ -38655,8 +38954,8 @@ "question__title": "Rabbits in Forest", "question__title_slug": "rabbits-in-forest", "question__hide": false, - "total_acs": 42150, - "total_submitted": 76236, + "total_acs": 42478, + "total_submitted": 76869, "frontend_question_id": 781, "is_new_question": false }, @@ -38678,8 +38977,8 @@ "question__title": "Reaching Points", "question__title_slug": "reaching-points", "question__hide": false, - "total_acs": 49048, - "total_submitted": 151595, + "total_acs": 49568, + "total_submitted": 152968, "frontend_question_id": 780, "is_new_question": false }, @@ -38701,8 +39000,8 @@ "question__title": "K-th Symbol in Grammar", "question__title_slug": "k-th-symbol-in-grammar", "question__hide": false, - "total_acs": 102201, - "total_submitted": 250553, + "total_acs": 103091, + "total_submitted": 252598, "frontend_question_id": 779, "is_new_question": false }, @@ -38724,8 +39023,8 @@ "question__title": "Swim in Rising Water", "question__title_slug": "swim-in-rising-water", "question__hide": false, - "total_acs": 104563, - "total_submitted": 175322, + "total_acs": 105863, + "total_submitted": 177406, "frontend_question_id": 778, "is_new_question": false }, @@ -38747,8 +39046,8 @@ "question__title": "Swap Adjacent in LR String", "question__title_slug": "swap-adjacent-in-lr-string", "question__hide": false, - "total_acs": 65798, - "total_submitted": 177458, + "total_acs": 66273, + "total_submitted": 178699, "frontend_question_id": 777, "is_new_question": false }, @@ -38764,14 +39063,14 @@ { "stat": { "question_id": 792, - "question__article__live": false, + "question__article__live": true, "question__article__slug": "binary-search", "question__article__has_video_solution": false, "question__title": "Binary Search", "question__title_slug": "binary-search", "question__hide": false, - "total_acs": 1332424, - "total_submitted": 2419453, + "total_acs": 1361538, + "total_submitted": 2472459, "frontend_question_id": 704, "is_new_question": false }, @@ -38793,8 +39092,8 @@ "question__title": "Split BST", "question__title_slug": "split-bst", "question__hide": false, - "total_acs": 28352, - "total_submitted": 48334, + "total_acs": 28432, + "total_submitted": 48483, "frontend_question_id": 776, "is_new_question": false }, @@ -38816,8 +39115,8 @@ "question__title": "Global and Local Inversions", "question__title_slug": "global-and-local-inversions", "question__hide": false, - "total_acs": 61334, - "total_submitted": 140116, + "total_acs": 61603, + "total_submitted": 140918, "frontend_question_id": 775, "is_new_question": false }, @@ -38839,8 +39138,8 @@ "question__title": "Kth Largest Element in a Stream", "question__title_slug": "kth-largest-element-in-a-stream", "question__hide": false, - "total_acs": 309228, - "total_submitted": 556904, + "total_acs": 312940, + "total_submitted": 563393, "frontend_question_id": 703, "is_new_question": false }, @@ -38862,8 +39161,8 @@ "question__title": "Minimize Max Distance to Gas Station", "question__title_slug": "minimize-max-distance-to-gas-station", "question__hide": false, - "total_acs": 27253, - "total_submitted": 53012, + "total_acs": 27348, + "total_submitted": 53175, "frontend_question_id": 774, "is_new_question": false }, @@ -38885,8 +39184,8 @@ "question__title": "Sliding Puzzle", "question__title_slug": "sliding-puzzle", "question__hide": false, - "total_acs": 79195, - "total_submitted": 124267, + "total_acs": 79803, + "total_submitted": 125083, "frontend_question_id": 773, "is_new_question": false }, @@ -38908,8 +39207,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": 81336, - "total_submitted": 114008, + "total_acs": 81887, + "total_submitted": 114759, "frontend_question_id": 702, "is_new_question": false }, @@ -38931,8 +39230,8 @@ "question__title": "Basic Calculator III", "question__title_slug": "basic-calculator-iii", "question__hide": false, - "total_acs": 96513, - "total_submitted": 199155, + "total_acs": 97282, + "total_submitted": 200492, "frontend_question_id": 772, "is_new_question": false }, @@ -38954,8 +39253,8 @@ "question__title": "Insert into a Binary Search Tree", "question__title_slug": "insert-into-a-binary-search-tree", "question__hide": false, - "total_acs": 359810, - "total_submitted": 482237, + "total_acs": 363445, + "total_submitted": 487269, "frontend_question_id": 701, "is_new_question": false }, @@ -38977,8 +39276,8 @@ "question__title": "Search in a Binary Search Tree", "question__title_slug": "search-in-a-binary-search-tree", "question__hide": false, - "total_acs": 568750, - "total_submitted": 737812, + "total_acs": 574236, + "total_submitted": 744625, "frontend_question_id": 700, "is_new_question": false }, @@ -39000,8 +39299,8 @@ "question__title": "Jewels and Stones", "question__title_slug": "jewels-and-stones", "question__hide": false, - "total_acs": 799083, - "total_submitted": 907862, + "total_acs": 804736, + "total_submitted": 914024, "frontend_question_id": 771, "is_new_question": false }, @@ -39023,8 +39322,8 @@ "question__title": "Basic Calculator IV", "question__title_slug": "basic-calculator-iv", "question__hide": false, - "total_acs": 8664, - "total_submitted": 15467, + "total_acs": 8744, + "total_submitted": 15599, "frontend_question_id": 770, "is_new_question": false }, @@ -39046,8 +39345,8 @@ "question__title": "Max Chunks To Make Sorted", "question__title_slug": "max-chunks-to-make-sorted", "question__hide": false, - "total_acs": 82563, - "total_submitted": 141965, + "total_acs": 83176, + "total_submitted": 142981, "frontend_question_id": 769, "is_new_question": false }, @@ -39069,8 +39368,8 @@ "question__title": "Max Chunks To Make Sorted II", "question__title_slug": "max-chunks-to-make-sorted-ii", "question__hide": false, - "total_acs": 48806, - "total_submitted": 92535, + "total_acs": 49260, + "total_submitted": 93354, "frontend_question_id": 768, "is_new_question": false }, @@ -39092,8 +39391,8 @@ "question__title": "Reorganize String", "question__title_slug": "reorganize-string", "question__hide": false, - "total_acs": 244300, - "total_submitted": 463185, + "total_acs": 246672, + "total_submitted": 467536, "frontend_question_id": 767, "is_new_question": false }, @@ -39115,8 +39414,8 @@ "question__title": "Toeplitz Matrix", "question__title_slug": "toeplitz-matrix", "question__hide": false, - "total_acs": 207290, - "total_submitted": 304378, + "total_acs": 264122, + "total_submitted": 383736, "frontend_question_id": 766, "is_new_question": false }, @@ -39138,8 +39437,8 @@ "question__title": "N-ary Tree Postorder Traversal", "question__title_slug": "n-ary-tree-postorder-traversal", "question__hide": false, - "total_acs": 206565, - "total_submitted": 267896, + "total_acs": 208086, + "total_submitted": 269766, "frontend_question_id": 590, "is_new_question": false }, @@ -39161,8 +39460,8 @@ "question__title": "N-ary Tree Preorder Traversal", "question__title_slug": "n-ary-tree-preorder-traversal", "question__hide": false, - "total_acs": 316183, - "total_submitted": 414414, + "total_acs": 322156, + "total_submitted": 422453, "frontend_question_id": 589, "is_new_question": false }, @@ -39184,8 +39483,8 @@ "question__title": "Maximum Depth of N-ary Tree", "question__title_slug": "maximum-depth-of-n-ary-tree", "question__hide": false, - "total_acs": 232871, - "total_submitted": 325398, + "total_acs": 234195, + "total_submitted": 327223, "frontend_question_id": 559, "is_new_question": false }, @@ -39207,8 +39506,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": 12196, - "total_submitted": 25311, + "total_acs": 12233, + "total_submitted": 25368, "frontend_question_id": 558, "is_new_question": false }, @@ -39230,8 +39529,8 @@ "question__title": "Construct Quad Tree", "question__title_slug": "construct-quad-tree", "question__hide": false, - "total_acs": 49810, - "total_submitted": 75163, + "total_acs": 50137, + "total_submitted": 75639, "frontend_question_id": 427, "is_new_question": false }, @@ -39253,8 +39552,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": 18425, - "total_submitted": 23448, + "total_acs": 18522, + "total_submitted": 23558, "frontend_question_id": 431, "is_new_question": false }, @@ -39276,8 +39575,8 @@ "question__title": "Couples Holding Hands", "question__title_slug": "couples-holding-hands", "question__hide": false, - "total_acs": 49165, - "total_submitted": 86440, + "total_acs": 49449, + "total_submitted": 86981, "frontend_question_id": 765, "is_new_question": false }, @@ -39299,8 +39598,8 @@ "question__title": "Largest Plus Sign", "question__title_slug": "largest-plus-sign", "question__hide": false, - "total_acs": 51003, - "total_submitted": 105328, + "total_acs": 51243, + "total_submitted": 105810, "frontend_question_id": 764, "is_new_question": false }, @@ -39322,8 +39621,8 @@ "question__title": "Partition Labels", "question__title_slug": "partition-labels", "question__hide": false, - "total_acs": 432321, - "total_submitted": 541785, + "total_acs": 435156, + "total_submitted": 545331, "frontend_question_id": 763, "is_new_question": false }, @@ -39345,8 +39644,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": 76116, - "total_submitted": 112482, + "total_acs": 76649, + "total_submitted": 113198, "frontend_question_id": 762, "is_new_question": false }, @@ -39368,8 +39667,8 @@ "question__title": "Flatten a Multilevel Doubly Linked List", "question__title_slug": "flatten-a-multilevel-doubly-linked-list", "question__hide": false, - "total_acs": 267319, - "total_submitted": 449644, + "total_acs": 269759, + "total_submitted": 453394, "frontend_question_id": 430, "is_new_question": false }, @@ -39391,8 +39690,8 @@ "question__title": "Serialize and Deserialize N-ary Tree", "question__title_slug": "serialize-and-deserialize-n-ary-tree", "question__hide": false, - "total_acs": 73825, - "total_submitted": 112961, + "total_acs": 74494, + "total_submitted": 113863, "frontend_question_id": 428, "is_new_question": false }, @@ -39414,8 +39713,8 @@ "question__title": "N-ary Tree Level Order Traversal", "question__title_slug": "n-ary-tree-level-order-traversal", "question__hide": false, - "total_acs": 261588, - "total_submitted": 370673, + "total_acs": 262984, + "total_submitted": 372551, "frontend_question_id": 429, "is_new_question": false }, @@ -39437,8 +39736,8 @@ "question__title": "Special Binary String", "question__title_slug": "special-binary-string", "question__hide": false, - "total_acs": 14300, - "total_submitted": 23696, + "total_acs": 14359, + "total_submitted": 23790, "frontend_question_id": 761, "is_new_question": false }, @@ -39460,8 +39759,8 @@ "question__title": "Find Anagram Mappings", "question__title_slug": "find-anagram-mappings", "question__hide": false, - "total_acs": 85384, - "total_submitted": 103105, + "total_acs": 85654, + "total_submitted": 103418, "frontend_question_id": 760, "is_new_question": false }, @@ -39483,8 +39782,8 @@ "question__title": "Employee Free Time", "question__title_slug": "employee-free-time", "question__hide": false, - "total_acs": 124137, - "total_submitted": 173178, + "total_acs": 125117, + "total_submitted": 174434, "frontend_question_id": 759, "is_new_question": false }, @@ -39506,8 +39805,8 @@ "question__title": "Bold Words in String", "question__title_slug": "bold-words-in-string", "question__hide": false, - "total_acs": 17333, - "total_submitted": 34239, + "total_acs": 17378, + "total_submitted": 34325, "frontend_question_id": 758, "is_new_question": false }, @@ -39529,8 +39828,8 @@ "question__title": "Set Intersection Size At Least Two", "question__title_slug": "set-intersection-size-at-least-two", "question__hide": false, - "total_acs": 17446, - "total_submitted": 39812, + "total_acs": 17669, + "total_submitted": 40347, "frontend_question_id": 757, "is_new_question": false }, @@ -39552,8 +39851,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": 229151, - "total_submitted": 354546, + "total_acs": 229694, + "total_submitted": 355355, "frontend_question_id": 426, "is_new_question": false }, @@ -39575,8 +39874,8 @@ "question__title": "Pyramid Transition Matrix", "question__title_slug": "pyramid-transition-matrix", "question__hide": false, - "total_acs": 29117, - "total_submitted": 54640, + "total_acs": 29226, + "total_submitted": 54965, "frontend_question_id": 756, "is_new_question": false }, @@ -39598,8 +39897,8 @@ "question__title": "Pour Water", "question__title_slug": "pour-water", "question__hide": false, - "total_acs": 32858, - "total_submitted": 71234, + "total_acs": 33066, + "total_submitted": 71642, "frontend_question_id": 755, "is_new_question": false }, @@ -39621,8 +39920,8 @@ "question__title": "Reach a Number", "question__title_slug": "reach-a-number", "question__hide": false, - "total_acs": 42718, - "total_submitted": 100538, + "total_acs": 43156, + "total_submitted": 101347, "frontend_question_id": 754, "is_new_question": false }, @@ -39644,8 +39943,8 @@ "question__title": "Cracking the Safe", "question__title_slug": "cracking-the-safe", "question__hide": false, - "total_acs": 50466, - "total_submitted": 90956, + "total_acs": 50667, + "total_submitted": 91262, "frontend_question_id": 753, "is_new_question": false }, @@ -39667,8 +39966,8 @@ "question__title": "Open the Lock", "question__title_slug": "open-the-lock", "question__hide": false, - "total_acs": 185310, - "total_submitted": 334105, + "total_acs": 186785, + "total_submitted": 336678, "frontend_question_id": 752, "is_new_question": false }, @@ -39690,8 +39989,8 @@ "question__title": "IP to CIDR", "question__title_slug": "ip-to-cidr", "question__hide": false, - "total_acs": 16316, - "total_submitted": 29831, + "total_acs": 16485, + "total_submitted": 30168, "frontend_question_id": 751, "is_new_question": false }, @@ -39713,8 +40012,8 @@ "question__title": "Number Of Corner Rectangles", "question__title_slug": "number-of-corner-rectangles", "question__hide": false, - "total_acs": 36539, - "total_submitted": 54166, + "total_acs": 36574, + "total_submitted": 54231, "frontend_question_id": 750, "is_new_question": false }, @@ -39736,8 +40035,8 @@ "question__title": "Contain Virus", "question__title_slug": "contain-virus", "question__hide": false, - "total_acs": 9571, - "total_submitted": 18805, + "total_acs": 9662, + "total_submitted": 18994, "frontend_question_id": 749, "is_new_question": false }, @@ -39759,8 +40058,8 @@ "question__title": "Shortest Completing Word", "question__title_slug": "shortest-completing-word", "question__hide": false, - "total_acs": 55747, - "total_submitted": 94241, + "total_acs": 56146, + "total_submitted": 94963, "frontend_question_id": 748, "is_new_question": false }, @@ -39782,8 +40081,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": 182303, - "total_submitted": 393662, + "total_acs": 183769, + "total_submitted": 396367, "frontend_question_id": 747, "is_new_question": false }, @@ -39805,8 +40104,8 @@ "question__title": "Min Cost Climbing Stairs", "question__title_slug": "min-cost-climbing-stairs", "question__hide": false, - "total_acs": 681009, - "total_submitted": 1092403, + "total_acs": 691393, + "total_submitted": 1107519, "frontend_question_id": 746, "is_new_question": false }, @@ -39828,8 +40127,8 @@ "question__title": "Prefix and Suffix Search", "question__title_slug": "prefix-and-suffix-search", "question__hide": false, - "total_acs": 87123, - "total_submitted": 210758, + "total_acs": 87359, + "total_submitted": 211519, "frontend_question_id": 745, "is_new_question": false }, @@ -39851,8 +40150,8 @@ "question__title": "Find Smallest Letter Greater Than Target", "question__title_slug": "find-smallest-letter-greater-than-target", "question__hide": false, - "total_acs": 250537, - "total_submitted": 561250, + "total_acs": 254115, + "total_submitted": 568283, "frontend_question_id": 744, "is_new_question": false }, @@ -39874,8 +40173,8 @@ "question__title": "Network Delay Time", "question__title_slug": "network-delay-time", "question__hide": false, - "total_acs": 335306, - "total_submitted": 652397, + "total_acs": 338857, + "total_submitted": 658727, "frontend_question_id": 743, "is_new_question": false }, @@ -39897,8 +40196,8 @@ "question__title": "Closest Leaf in a Binary Tree", "question__title_slug": "closest-leaf-in-a-binary-tree", "question__hide": false, - "total_acs": 40716, - "total_submitted": 88791, + "total_acs": 40814, + "total_submitted": 88967, "frontend_question_id": 742, "is_new_question": false }, @@ -39920,8 +40219,8 @@ "question__title": "To Lower Case", "question__title_slug": "to-lower-case", "question__hide": false, - "total_acs": 378597, - "total_submitted": 462163, + "total_acs": 381370, + "total_submitted": 465433, "frontend_question_id": 709, "is_new_question": false }, @@ -39943,8 +40242,8 @@ "question__title": "Cherry Pickup", "question__title_slug": "cherry-pickup", "question__hide": false, - "total_acs": 60910, - "total_submitted": 167611, + "total_acs": 61330, + "total_submitted": 168789, "frontend_question_id": 741, "is_new_question": false }, @@ -39966,8 +40265,8 @@ "question__title": "Delete and Earn", "question__title_slug": "delete-and-earn", "question__hide": false, - "total_acs": 236081, - "total_submitted": 411483, + "total_acs": 238714, + "total_submitted": 416196, "frontend_question_id": 740, "is_new_question": false }, @@ -39989,8 +40288,8 @@ "question__title": "Daily Temperatures", "question__title_slug": "daily-temperatures", "question__hide": false, - "total_acs": 481495, - "total_submitted": 724059, + "total_acs": 488276, + "total_submitted": 733931, "frontend_question_id": 739, "is_new_question": false }, @@ -40012,8 +40311,8 @@ "question__title": "Monotone Increasing Digits", "question__title_slug": "monotone-increasing-digits", "question__hide": false, - "total_acs": 41826, - "total_submitted": 88904, + "total_acs": 42087, + "total_submitted": 89442, "frontend_question_id": 738, "is_new_question": false }, @@ -40035,8 +40334,8 @@ "question__title": "Sentence Similarity II", "question__title_slug": "sentence-similarity-ii", "question__hide": false, - "total_acs": 63205, - "total_submitted": 129727, + "total_acs": 63364, + "total_submitted": 130034, "frontend_question_id": 737, "is_new_question": false }, @@ -40058,8 +40357,8 @@ "question__title": "Parse Lisp Expression", "question__title_slug": "parse-lisp-expression", "question__hide": false, - "total_acs": 19483, - "total_submitted": 37791, + "total_acs": 19527, + "total_submitted": 37896, "frontend_question_id": 736, "is_new_question": false }, @@ -40081,8 +40380,8 @@ "question__title": "Asteroid Collision", "question__title_slug": "asteroid-collision", "question__hide": false, - "total_acs": 236742, - "total_submitted": 533671, + "total_acs": 239788, + "total_submitted": 540491, "frontend_question_id": 735, "is_new_question": false }, @@ -40104,8 +40403,8 @@ "question__title": "Sentence Similarity", "question__title_slug": "sentence-similarity", "question__hide": false, - "total_acs": 53446, - "total_submitted": 124071, + "total_acs": 53574, + "total_submitted": 124445, "frontend_question_id": 734, "is_new_question": false }, @@ -40127,8 +40426,8 @@ "question__title": "Flood Fill", "question__title_slug": "flood-fill", "question__hide": false, - "total_acs": 582747, - "total_submitted": 964844, + "total_acs": 594050, + "total_submitted": 981226, "frontend_question_id": 733, "is_new_question": false }, @@ -40150,8 +40449,8 @@ "question__title": "My Calendar III", "question__title_slug": "my-calendar-iii", "question__hide": false, - "total_acs": 80259, - "total_submitted": 112097, + "total_acs": 80731, + "total_submitted": 112760, "frontend_question_id": 732, "is_new_question": false }, @@ -40173,8 +40472,8 @@ "question__title": "My Calendar II", "question__title_slug": "my-calendar-ii", "question__hide": false, - "total_acs": 84922, - "total_submitted": 155150, + "total_acs": 85513, + "total_submitted": 156084, "frontend_question_id": 731, "is_new_question": false }, @@ -40196,8 +40495,8 @@ "question__title": "Count Different Palindromic Subsequences", "question__title_slug": "count-different-palindromic-subsequences", "question__hide": false, - "total_acs": 30425, - "total_submitted": 68502, + "total_acs": 30687, + "total_submitted": 68958, "frontend_question_id": 730, "is_new_question": false }, @@ -40219,8 +40518,8 @@ "question__title": "My Calendar I", "question__title_slug": "my-calendar-i", "question__hide": false, - "total_acs": 236689, - "total_submitted": 413671, + "total_acs": 238889, + "total_submitted": 417704, "frontend_question_id": 729, "is_new_question": false }, @@ -40242,8 +40541,8 @@ "question__title": "Self Dividing Numbers", "question__title_slug": "self-dividing-numbers", "question__hide": false, - "total_acs": 189370, - "total_submitted": 244170, + "total_acs": 190539, + "total_submitted": 245535, "frontend_question_id": 728, "is_new_question": false }, @@ -40265,8 +40564,8 @@ "question__title": "Minimum Window Subsequence", "question__title_slug": "minimum-window-subsequence", "question__hide": false, - "total_acs": 80757, - "total_submitted": 188487, + "total_acs": 80974, + "total_submitted": 189027, "frontend_question_id": 727, "is_new_question": false }, @@ -40288,8 +40587,8 @@ "question__title": "Number of Atoms", "question__title_slug": "number-of-atoms", "question__hide": false, - "total_acs": 49538, - "total_submitted": 94972, + "total_acs": 49913, + "total_submitted": 95632, "frontend_question_id": 726, "is_new_question": false }, @@ -40311,8 +40610,8 @@ "question__title": "Split Linked List in Parts", "question__title_slug": "split-linked-list-in-parts", "question__hide": false, - "total_acs": 104718, - "total_submitted": 183018, + "total_acs": 105338, + "total_submitted": 183983, "frontend_question_id": 725, "is_new_question": false }, @@ -40334,8 +40633,8 @@ "question__title": "Find Pivot Index", "question__title_slug": "find-pivot-index", "question__hide": false, - "total_acs": 572256, - "total_submitted": 1072616, + "total_acs": 593221, + "total_submitted": 1110854, "frontend_question_id": 724, "is_new_question": false }, @@ -40357,8 +40656,8 @@ "question__title": "Candy Crush", "question__title_slug": "candy-crush", "question__hide": false, - "total_acs": 59081, - "total_submitted": 77410, + "total_acs": 59819, + "total_submitted": 78276, "frontend_question_id": 723, "is_new_question": false }, @@ -40380,8 +40679,8 @@ "question__title": "Remove Comments", "question__title_slug": "remove-comments", "question__hide": false, - "total_acs": 60292, - "total_submitted": 158725, + "total_acs": 60755, + "total_submitted": 159837, "frontend_question_id": 722, "is_new_question": false }, @@ -40403,8 +40702,8 @@ "question__title": "Accounts Merge", "question__title_slug": "accounts-merge", "question__hide": false, - "total_acs": 283450, - "total_submitted": 503105, + "total_acs": 285564, + "total_submitted": 506750, "frontend_question_id": 721, "is_new_question": false }, @@ -40426,8 +40725,8 @@ "question__title": "Longest Word in Dictionary", "question__title_slug": "longest-word-in-dictionary", "question__hide": false, - "total_acs": 128654, - "total_submitted": 248520, + "total_acs": 129626, + "total_submitted": 250220, "frontend_question_id": 720, "is_new_question": false }, @@ -40449,8 +40748,8 @@ "question__title": "Find K-th Smallest Pair Distance", "question__title_slug": "find-k-th-smallest-pair-distance", "question__hide": false, - "total_acs": 69571, - "total_submitted": 191490, + "total_acs": 70241, + "total_submitted": 193100, "frontend_question_id": 719, "is_new_question": false }, @@ -40472,8 +40771,8 @@ "question__title": "Maximum Length of Repeated Subarray", "question__title_slug": "maximum-length-of-repeated-subarray", "question__hide": false, - "total_acs": 244880, - "total_submitted": 474650, + "total_acs": 246585, + "total_submitted": 478394, "frontend_question_id": 718, "is_new_question": false }, @@ -40495,8 +40794,8 @@ "question__title": "1-bit and 2-bit Characters", "question__title_slug": "1-bit-and-2-bit-characters", "question__hide": false, - "total_acs": 110785, - "total_submitted": 240922, + "total_acs": 111400, + "total_submitted": 242234, "frontend_question_id": 717, "is_new_question": false }, @@ -40518,8 +40817,8 @@ "question__title": "Max Stack", "question__title_slug": "max-stack", "question__hide": false, - "total_acs": 136856, - "total_submitted": 302056, + "total_acs": 137472, + "total_submitted": 303388, "frontend_question_id": 716, "is_new_question": false }, @@ -40541,8 +40840,8 @@ "question__title": "Range Module", "question__title_slug": "range-module", "question__hide": false, - "total_acs": 53160, - "total_submitted": 119087, + "total_acs": 53638, + "total_submitted": 120098, "frontend_question_id": 715, "is_new_question": false }, @@ -40564,8 +40863,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": 200477, - "total_submitted": 311912, + "total_acs": 202609, + "total_submitted": 314817, "frontend_question_id": 714, "is_new_question": false }, @@ -40587,8 +40886,8 @@ "question__title": "Subarray Product Less Than K", "question__title_slug": "subarray-product-less-than-k", "question__hide": false, - "total_acs": 202079, - "total_submitted": 448471, + "total_acs": 204204, + "total_submitted": 452531, "frontend_question_id": 713, "is_new_question": false }, @@ -40610,8 +40909,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": 70910, - "total_submitted": 114004, + "total_acs": 71296, + "total_submitted": 114529, "frontend_question_id": 712, "is_new_question": false }, @@ -40633,8 +40932,8 @@ "question__title": "Number of Distinct Islands II", "question__title_slug": "number-of-distinct-islands-ii", "question__hide": false, - "total_acs": 8889, - "total_submitted": 17163, + "total_acs": 8921, + "total_submitted": 17199, "frontend_question_id": 711, "is_new_question": false }, @@ -40656,8 +40955,8 @@ "question__title": "Falling Squares", "question__title_slug": "falling-squares", "question__hide": false, - "total_acs": 21643, - "total_submitted": 48763, + "total_acs": 21765, + "total_submitted": 49034, "frontend_question_id": 699, "is_new_question": false }, @@ -40679,8 +40978,8 @@ "question__title": "Partition to K Equal Sum Subsets", "question__title_slug": "partition-to-k-equal-sum-subsets", "question__hide": false, - "total_acs": 222096, - "total_submitted": 541687, + "total_acs": 223363, + "total_submitted": 546007, "frontend_question_id": 698, "is_new_question": false }, @@ -40702,8 +41001,8 @@ "question__title": "Degree of an Array", "question__title_slug": "degree-of-an-array", "question__hide": false, - "total_acs": 167123, - "total_submitted": 299355, + "total_acs": 168358, + "total_submitted": 301488, "frontend_question_id": 697, "is_new_question": false }, @@ -40725,8 +41024,8 @@ "question__title": "Count Binary Substrings", "question__title_slug": "count-binary-substrings", "question__hide": false, - "total_acs": 172609, - "total_submitted": 263455, + "total_acs": 173723, + "total_submitted": 265090, "frontend_question_id": 696, "is_new_question": false }, @@ -40748,8 +41047,8 @@ "question__title": "Max Area of Island", "question__title_slug": "max-area-of-island", "question__hide": false, - "total_acs": 632206, - "total_submitted": 882293, + "total_acs": 639232, + "total_submitted": 891769, "frontend_question_id": 695, "is_new_question": false }, @@ -40771,8 +41070,8 @@ "question__title": "Number of Distinct Islands", "question__title_slug": "number-of-distinct-islands", "question__hide": false, - "total_acs": 139169, - "total_submitted": 229744, + "total_acs": 140331, + "total_submitted": 231629, "frontend_question_id": 694, "is_new_question": false }, @@ -40794,8 +41093,8 @@ "question__title": "Binary Number with Alternating Bits", "question__title_slug": "binary-number-with-alternating-bits", "question__hide": false, - "total_acs": 103192, - "total_submitted": 168472, + "total_acs": 104014, + "total_submitted": 169751, "frontend_question_id": 693, "is_new_question": false }, @@ -40817,8 +41116,8 @@ "question__title": "Top K Frequent Words", "question__title_slug": "top-k-frequent-words", "question__hide": false, - "total_acs": 497500, - "total_submitted": 875432, + "total_acs": 502080, + "total_submitted": 883032, "frontend_question_id": 692, "is_new_question": false }, @@ -40840,8 +41139,8 @@ "question__title": "Stickers to Spell Word", "question__title_slug": "stickers-to-spell-word", "question__hide": false, - "total_acs": 35002, - "total_submitted": 75604, + "total_acs": 35302, + "total_submitted": 76237, "frontend_question_id": 691, "is_new_question": false }, @@ -40863,8 +41162,8 @@ "question__title": "Employee Importance", "question__title_slug": "employee-importance", "question__hide": false, - "total_acs": 186448, - "total_submitted": 286303, + "total_acs": 187186, + "total_submitted": 287185, "frontend_question_id": 690, "is_new_question": false }, @@ -40886,8 +41185,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": 65297, - "total_submitted": 133641, + "total_acs": 65499, + "total_submitted": 133984, "frontend_question_id": 689, "is_new_question": false }, @@ -40909,8 +41208,8 @@ "question__title": "Knight Probability in Chessboard", "question__title_slug": "knight-probability-in-chessboard", "question__hide": false, - "total_acs": 89291, - "total_submitted": 171596, + "total_acs": 89756, + "total_submitted": 172446, "frontend_question_id": 688, "is_new_question": false }, @@ -40932,8 +41231,8 @@ "question__title": "Longest Univalue Path", "question__title_slug": "longest-univalue-path", "question__hide": false, - "total_acs": 154828, - "total_submitted": 386084, + "total_acs": 155564, + "total_submitted": 387537, "frontend_question_id": 687, "is_new_question": false }, @@ -40955,8 +41254,8 @@ "question__title": "Repeated String Match", "question__title_slug": "repeated-string-match", "question__hide": false, - "total_acs": 131759, - "total_submitted": 387234, + "total_acs": 132216, + "total_submitted": 388603, "frontend_question_id": 686, "is_new_question": false }, @@ -40978,8 +41277,8 @@ "question__title": "Redundant Connection II", "question__title_slug": "redundant-connection-ii", "question__hide": false, - "total_acs": 57685, - "total_submitted": 169265, + "total_acs": 57946, + "total_submitted": 169938, "frontend_question_id": 685, "is_new_question": false }, @@ -41001,8 +41300,8 @@ "question__title": "Redundant Connection", "question__title_slug": "redundant-connection", "question__hide": false, - "total_acs": 244572, - "total_submitted": 394424, + "total_acs": 246928, + "total_submitted": 398248, "frontend_question_id": 684, "is_new_question": false }, @@ -41024,8 +41323,8 @@ "question__title": "K Empty Slots", "question__title_slug": "k-empty-slots", "question__hide": false, - "total_acs": 58148, - "total_submitted": 157638, + "total_acs": 58235, + "total_submitted": 157841, "frontend_question_id": 683, "is_new_question": false }, @@ -41047,8 +41346,8 @@ "question__title": "Baseball Game", "question__title_slug": "baseball-game", "question__hide": false, - "total_acs": 218906, - "total_submitted": 297454, + "total_acs": 221136, + "total_submitted": 300275, "frontend_question_id": 682, "is_new_question": false }, @@ -41070,8 +41369,8 @@ "question__title": "Next Closest Time", "question__title_slug": "next-closest-time", "question__hide": false, - "total_acs": 99524, - "total_submitted": 214615, + "total_acs": 99761, + "total_submitted": 215112, "frontend_question_id": 681, "is_new_question": false }, @@ -41093,8 +41392,8 @@ "question__title": "Valid Palindrome II", "question__title_slug": "valid-palindrome-ii", "question__hide": false, - "total_acs": 552630, - "total_submitted": 1405213, + "total_acs": 555880, + "total_submitted": 1413440, "frontend_question_id": 680, "is_new_question": false }, @@ -41116,8 +41415,8 @@ "question__title": "24 Game", "question__title_slug": "24-game", "question__hide": false, - "total_acs": 68313, - "total_submitted": 139015, + "total_acs": 68570, + "total_submitted": 139529, "frontend_question_id": 679, "is_new_question": false }, @@ -41139,8 +41438,8 @@ "question__title": "Valid Parenthesis String", "question__title_slug": "valid-parenthesis-string", "question__hide": false, - "total_acs": 190122, - "total_submitted": 560708, + "total_acs": 191224, + "total_submitted": 563656, "frontend_question_id": 678, "is_new_question": false }, @@ -41162,8 +41461,8 @@ "question__title": "Map Sum Pairs", "question__title_slug": "map-sum-pairs", "question__hide": false, - "total_acs": 97163, - "total_submitted": 170529, + "total_acs": 97761, + "total_submitted": 171639, "frontend_question_id": 677, "is_new_question": false }, @@ -41185,8 +41484,8 @@ "question__title": "Implement Magic Dictionary", "question__title_slug": "implement-magic-dictionary", "question__hide": false, - "total_acs": 68383, - "total_submitted": 120204, + "total_acs": 68724, + "total_submitted": 120779, "frontend_question_id": 676, "is_new_question": false }, @@ -41208,8 +41507,8 @@ "question__title": "Cut Off Trees for Golf Event", "question__title_slug": "cut-off-trees-for-golf-event", "question__hide": false, - "total_acs": 60055, - "total_submitted": 175063, + "total_acs": 60270, + "total_submitted": 175970, "frontend_question_id": 675, "is_new_question": false }, @@ -41231,8 +41530,8 @@ "question__title": "Longest Continuous Increasing Subsequence", "question__title_slug": "longest-continuous-increasing-subsequence", "question__hide": false, - "total_acs": 212133, - "total_submitted": 432443, + "total_acs": 213230, + "total_submitted": 434411, "frontend_question_id": 674, "is_new_question": false }, @@ -41254,8 +41553,8 @@ "question__title": "Number of Longest Increasing Subsequence", "question__title_slug": "number-of-longest-increasing-subsequence", "question__hide": false, - "total_acs": 130956, - "total_submitted": 310545, + "total_acs": 131993, + "total_submitted": 312462, "frontend_question_id": 673, "is_new_question": false }, @@ -41277,8 +41576,8 @@ "question__title": "Bulb Switcher II", "question__title_slug": "bulb-switcher-ii", "question__hide": false, - "total_acs": 18359, - "total_submitted": 36077, + "total_acs": 18498, + "total_submitted": 36329, "frontend_question_id": 672, "is_new_question": false }, @@ -41300,8 +41599,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": 157929, - "total_submitted": 359087, + "total_acs": 158790, + "total_submitted": 360922, "frontend_question_id": 671, "is_new_question": false }, @@ -41323,8 +41622,8 @@ "question__title": "Maximum Swap", "question__title_slug": "maximum-swap", "question__hide": false, - "total_acs": 185480, - "total_submitted": 387571, + "total_acs": 186356, + "total_submitted": 389355, "frontend_question_id": 670, "is_new_question": false }, @@ -41346,8 +41645,8 @@ "question__title": "Trim a Binary Search Tree", "question__title_slug": "trim-a-binary-search-tree", "question__hide": false, - "total_acs": 252122, - "total_submitted": 380097, + "total_acs": 253158, + "total_submitted": 381684, "frontend_question_id": 669, "is_new_question": false }, @@ -41369,8 +41668,8 @@ "question__title": "Kth Smallest Number in Multiplication Table", "question__title_slug": "kth-smallest-number-in-multiplication-table", "question__hide": false, - "total_acs": 52965, - "total_submitted": 102812, + "total_acs": 53188, + "total_submitted": 103233, "frontend_question_id": 668, "is_new_question": false }, @@ -41392,8 +41691,8 @@ "question__title": "Beautiful Arrangement II", "question__title_slug": "beautiful-arrangement-ii", "question__hide": false, - "total_acs": 49233, - "total_submitted": 82504, + "total_acs": 49352, + "total_submitted": 82666, "frontend_question_id": 667, "is_new_question": false }, @@ -41415,8 +41714,8 @@ "question__title": "Path Sum IV", "question__title_slug": "path-sum-iv", "question__hide": false, - "total_acs": 20661, - "total_submitted": 34968, + "total_acs": 20721, + "total_submitted": 35055, "frontend_question_id": 666, "is_new_question": false }, @@ -41438,8 +41737,8 @@ "question__title": "Non-decreasing Array", "question__title_slug": "non-decreasing-array", "question__hide": false, - "total_acs": 230600, - "total_submitted": 956044, + "total_acs": 231579, + "total_submitted": 959185, "frontend_question_id": 665, "is_new_question": false }, @@ -41461,8 +41760,8 @@ "question__title": "Strange Printer", "question__title_slug": "strange-printer", "question__hide": false, - "total_acs": 30378, - "total_submitted": 64940, + "total_acs": 30495, + "total_submitted": 65151, "frontend_question_id": 664, "is_new_question": false }, @@ -41484,8 +41783,8 @@ "question__title": "Equal Tree Partition", "question__title_slug": "equal-tree-partition", "question__hide": false, - "total_acs": 28624, - "total_submitted": 69150, + "total_acs": 28688, + "total_submitted": 69316, "frontend_question_id": 663, "is_new_question": false }, @@ -41507,8 +41806,8 @@ "question__title": "Maximum Width of Binary Tree", "question__title_slug": "maximum-width-of-binary-tree", "question__hide": false, - "total_acs": 223743, - "total_submitted": 551223, + "total_acs": 225955, + "total_submitted": 556300, "frontend_question_id": 662, "is_new_question": false }, @@ -41530,8 +41829,8 @@ "question__title": "Image Smoother", "question__title_slug": "image-smoother", "question__hide": false, - "total_acs": 68886, - "total_submitted": 125315, + "total_acs": 69257, + "total_submitted": 125846, "frontend_question_id": 661, "is_new_question": false }, @@ -41553,8 +41852,8 @@ "question__title": "Remove 9", "question__title_slug": "remove-9", "question__hide": false, - "total_acs": 9825, - "total_submitted": 17292, + "total_acs": 9851, + "total_submitted": 17328, "frontend_question_id": 660, "is_new_question": false }, @@ -41576,8 +41875,8 @@ "question__title": "Split Array into Consecutive Subsequences", "question__title_slug": "split-array-into-consecutive-subsequences", "question__hide": false, - "total_acs": 118140, - "total_submitted": 233399, + "total_acs": 118567, + "total_submitted": 234241, "frontend_question_id": 659, "is_new_question": false }, @@ -41599,8 +41898,8 @@ "question__title": "Find K Closest Elements", "question__title_slug": "find-k-closest-elements", "question__hide": false, - "total_acs": 391518, - "total_submitted": 837710, + "total_acs": 394748, + "total_submitted": 844362, "frontend_question_id": 658, "is_new_question": false }, @@ -41622,8 +41921,8 @@ "question__title": "Robot Return to Origin", "question__title_slug": "robot-return-to-origin", "question__hide": false, - "total_acs": 350676, - "total_submitted": 465959, + "total_acs": 352305, + "total_submitted": 468004, "frontend_question_id": 657, "is_new_question": false }, @@ -41645,8 +41944,8 @@ "question__title": "Coin Path", "question__title_slug": "coin-path", "question__hide": false, - "total_acs": 12983, - "total_submitted": 41124, + "total_acs": 13011, + "total_submitted": 41228, "frontend_question_id": 656, "is_new_question": false }, @@ -41668,8 +41967,8 @@ "question__title": "Print Binary Tree", "question__title_slug": "print-binary-tree", "question__hide": false, - "total_acs": 56345, - "total_submitted": 91921, + "total_acs": 56641, + "total_submitted": 92299, "frontend_question_id": 655, "is_new_question": false }, @@ -41691,8 +41990,8 @@ "question__title": "Maximum Binary Tree", "question__title_slug": "maximum-binary-tree", "question__hide": false, - "total_acs": 237207, - "total_submitted": 280898, + "total_acs": 238575, + "total_submitted": 282436, "frontend_question_id": 654, "is_new_question": false }, @@ -41714,8 +42013,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": 416153, - "total_submitted": 682849, + "total_acs": 419880, + "total_submitted": 688562, "frontend_question_id": 653, "is_new_question": false }, @@ -41737,8 +42036,8 @@ "question__title": "Find Duplicate Subtrees", "question__title_slug": "find-duplicate-subtrees", "question__hide": false, - "total_acs": 174385, - "total_submitted": 308814, + "total_acs": 175368, + "total_submitted": 310482, "frontend_question_id": 652, "is_new_question": false }, @@ -41760,8 +42059,8 @@ "question__title": "4 Keys Keyboard", "question__title_slug": "4-keys-keyboard", "question__hide": false, - "total_acs": 22983, - "total_submitted": 42224, + "total_acs": 23070, + "total_submitted": 42366, "frontend_question_id": 651, "is_new_question": false }, @@ -41783,8 +42082,8 @@ "question__title": "2 Keys Keyboard", "question__title_slug": "2-keys-keyboard", "question__hide": false, - "total_acs": 109538, - "total_submitted": 206160, + "total_acs": 110067, + "total_submitted": 207040, "frontend_question_id": 650, "is_new_question": false }, @@ -41806,8 +42105,8 @@ "question__title": "Dota2 Senate", "question__title_slug": "dota2-senate", "question__hide": false, - "total_acs": 21129, - "total_submitted": 52343, + "total_acs": 21288, + "total_submitted": 52697, "frontend_question_id": 649, "is_new_question": false }, @@ -41829,8 +42128,8 @@ "question__title": "Replace Words", "question__title_slug": "replace-words", "question__hide": false, - "total_acs": 109511, - "total_submitted": 174687, + "total_acs": 110461, + "total_submitted": 176159, "frontend_question_id": 648, "is_new_question": false }, @@ -41852,8 +42151,8 @@ "question__title": "Palindromic Substrings", "question__title_slug": "palindromic-substrings", "question__hide": false, - "total_acs": 518700, - "total_submitted": 782040, + "total_acs": 523314, + "total_submitted": 788499, "frontend_question_id": 647, "is_new_question": false }, @@ -41875,8 +42174,8 @@ "question__title": "Maximum Length of Pair Chain", "question__title_slug": "maximum-length-of-pair-chain", "question__hide": false, - "total_acs": 124170, - "total_submitted": 220297, + "total_acs": 124901, + "total_submitted": 221490, "frontend_question_id": 646, "is_new_question": false }, @@ -41898,8 +42197,8 @@ "question__title": "Set Mismatch", "question__title_slug": "set-mismatch", "question__hide": false, - "total_acs": 247022, - "total_submitted": 574804, + "total_acs": 249794, + "total_submitted": 581162, "frontend_question_id": 645, "is_new_question": false }, @@ -41921,8 +42220,8 @@ "question__title": "Maximum Average Subarray II", "question__title_slug": "maximum-average-subarray-ii", "question__hide": false, - "total_acs": 18172, - "total_submitted": 50852, + "total_acs": 18226, + "total_submitted": 50950, "frontend_question_id": 644, "is_new_question": false }, @@ -41944,8 +42243,8 @@ "question__title": "Maximum Average Subarray I", "question__title_slug": "maximum-average-subarray-i", "question__hide": false, - "total_acs": 172688, - "total_submitted": 393862, + "total_acs": 175544, + "total_submitted": 400593, "frontend_question_id": 643, "is_new_question": false }, @@ -41967,8 +42266,8 @@ "question__title": "Design Search Autocomplete System", "question__title_slug": "design-search-autocomplete-system", "question__hide": false, - "total_acs": 124552, - "total_submitted": 255790, + "total_acs": 125146, + "total_submitted": 256939, "frontend_question_id": 642, "is_new_question": false }, @@ -41990,8 +42289,8 @@ "question__title": "Solve the Equation", "question__title_slug": "solve-the-equation", "question__hide": false, - "total_acs": 34318, - "total_submitted": 79175, + "total_acs": 34466, + "total_submitted": 79435, "frontend_question_id": 640, "is_new_question": false }, @@ -42013,8 +42312,8 @@ "question__title": "Decode Ways II", "question__title_slug": "decode-ways-ii", "question__hide": false, - "total_acs": 64876, - "total_submitted": 213255, + "total_acs": 65061, + "total_submitted": 213886, "frontend_question_id": 639, "is_new_question": false }, @@ -42036,8 +42335,8 @@ "question__title": "Shopping Offers", "question__title_slug": "shopping-offers", "question__hide": false, - "total_acs": 50056, - "total_submitted": 92295, + "total_acs": 50255, + "total_submitted": 92784, "frontend_question_id": 638, "is_new_question": false }, @@ -42059,8 +42358,8 @@ "question__title": "Average of Levels in Binary Tree", "question__title_slug": "average-of-levels-in-binary-tree", "question__hide": false, - "total_acs": 366377, - "total_submitted": 511530, + "total_acs": 368412, + "total_submitted": 514144, "frontend_question_id": 637, "is_new_question": false }, @@ -42082,8 +42381,8 @@ "question__title": "Exclusive Time of Functions", "question__title_slug": "exclusive-time-of-functions", "question__hide": false, - "total_acs": 184214, - "total_submitted": 301832, + "total_acs": 184733, + "total_submitted": 302531, "frontend_question_id": 636, "is_new_question": false }, @@ -42105,8 +42404,8 @@ "question__title": "Design Log Storage System", "question__title_slug": "design-log-storage-system", "question__hide": false, - "total_acs": 32217, - "total_submitted": 51368, + "total_acs": 32284, + "total_submitted": 51468, "frontend_question_id": 635, "is_new_question": false }, @@ -42128,8 +42427,8 @@ "question__title": "Find the Derangement of An Array", "question__title_slug": "find-the-derangement-of-an-array", "question__hide": false, - "total_acs": 9748, - "total_submitted": 23287, + "total_acs": 9840, + "total_submitted": 23473, "frontend_question_id": 634, "is_new_question": false }, @@ -42151,8 +42450,8 @@ "question__title": "Sum of Square Numbers", "question__title_slug": "sum-of-square-numbers", "question__hide": false, - "total_acs": 155249, - "total_submitted": 448051, + "total_acs": 156449, + "total_submitted": 451794, "frontend_question_id": 633, "is_new_question": false }, @@ -42174,8 +42473,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": 77325, - "total_submitted": 127989, + "total_acs": 77995, + "total_submitted": 128960, "frontend_question_id": 632, "is_new_question": false }, @@ -42197,8 +42496,8 @@ "question__title": "Design Excel Sum Formula", "question__title_slug": "design-excel-sum-formula", "question__hide": false, - "total_acs": 12846, - "total_submitted": 29668, + "total_acs": 12937, + "total_submitted": 29835, "frontend_question_id": 631, "is_new_question": false }, @@ -42220,8 +42519,8 @@ "question__title": "Course Schedule III", "question__title_slug": "course-schedule-iii", "question__hide": false, - "total_acs": 98109, - "total_submitted": 244292, + "total_acs": 98425, + "total_submitted": 245137, "frontend_question_id": 630, "is_new_question": false }, @@ -42243,8 +42542,8 @@ "question__title": "K Inverse Pairs Array", "question__title_slug": "k-inverse-pairs-array", "question__hide": false, - "total_acs": 56758, - "total_submitted": 132151, + "total_acs": 56934, + "total_submitted": 132667, "frontend_question_id": 629, "is_new_question": false }, @@ -42266,8 +42565,8 @@ "question__title": "Maximum Product of Three Numbers", "question__title_slug": "maximum-product-of-three-numbers", "question__hide": false, - "total_acs": 238376, - "total_submitted": 513451, + "total_acs": 240380, + "total_submitted": 518180, "frontend_question_id": 628, "is_new_question": false }, @@ -42289,8 +42588,8 @@ "question__title": "Swap Salary", "question__title_slug": "swap-salary", "question__hide": false, - "total_acs": 270570, - "total_submitted": 326480, + "total_acs": 276078, + "total_submitted": 332654, "frontend_question_id": 627, "is_new_question": false }, @@ -42312,8 +42611,8 @@ "question__title": "Exchange Seats", "question__title_slug": "exchange-seats", "question__hide": false, - "total_acs": 119198, - "total_submitted": 168899, + "total_acs": 120482, + "total_submitted": 170780, "frontend_question_id": 626, "is_new_question": false }, @@ -42335,8 +42634,8 @@ "question__title": "Minimum Factorization", "question__title_slug": "minimum-factorization", "question__hide": false, - "total_acs": 10410, - "total_submitted": 31135, + "total_acs": 10424, + "total_submitted": 31168, "frontend_question_id": 625, "is_new_question": false }, @@ -42358,8 +42657,8 @@ "question__title": "Maximum Distance in Arrays", "question__title_slug": "maximum-distance-in-arrays", "question__hide": false, - "total_acs": 36319, - "total_submitted": 87089, + "total_acs": 36368, + "total_submitted": 87193, "frontend_question_id": 624, "is_new_question": false }, @@ -42381,8 +42680,8 @@ "question__title": "Add One Row to Tree", "question__title_slug": "add-one-row-to-tree", "question__hide": false, - "total_acs": 143650, - "total_submitted": 241696, + "total_acs": 144314, + "total_submitted": 242739, "frontend_question_id": 623, "is_new_question": false }, @@ -42404,8 +42703,8 @@ "question__title": "Task Scheduler", "question__title_slug": "task-scheduler", "question__hide": false, - "total_acs": 388411, - "total_submitted": 697787, + "total_acs": 391720, + "total_submitted": 702896, "frontend_question_id": 621, "is_new_question": false }, @@ -42427,8 +42726,8 @@ "question__title": "Not Boring Movies", "question__title_slug": "not-boring-movies", "question__hide": false, - "total_acs": 209423, - "total_submitted": 285755, + "total_acs": 211205, + "total_submitted": 288349, "frontend_question_id": 620, "is_new_question": false }, @@ -42450,8 +42749,8 @@ "question__title": "Biggest Single Number", "question__title_slug": "biggest-single-number", "question__hide": false, - "total_acs": 54435, - "total_submitted": 111558, + "total_acs": 54970, + "total_submitted": 112483, "frontend_question_id": 619, "is_new_question": false }, @@ -42473,8 +42772,8 @@ "question__title": "Students Report By Geography", "question__title_slug": "students-report-by-geography", "question__hide": false, - "total_acs": 18888, - "total_submitted": 29407, + "total_acs": 19060, + "total_submitted": 29646, "frontend_question_id": 618, "is_new_question": false }, @@ -42496,8 +42795,8 @@ "question__title": "Merge Two Binary Trees", "question__title_slug": "merge-two-binary-trees", "question__hide": false, - "total_acs": 631192, - "total_submitted": 803914, + "total_acs": 635427, + "total_submitted": 809139, "frontend_question_id": 617, "is_new_question": false }, @@ -42519,8 +42818,8 @@ "question__title": "Add Bold Tag in String", "question__title_slug": "add-bold-tag-in-string", "question__hide": false, - "total_acs": 80471, - "total_submitted": 165437, + "total_acs": 80661, + "total_submitted": 165786, "frontend_question_id": 616, "is_new_question": false }, @@ -42542,8 +42841,8 @@ "question__title": "Average Salary: Departments VS Company", "question__title_slug": "average-salary-departments-vs-company", "question__hide": false, - "total_acs": 29865, - "total_submitted": 52114, + "total_acs": 30058, + "total_submitted": 52481, "frontend_question_id": 615, "is_new_question": false }, @@ -42565,8 +42864,8 @@ "question__title": "Second Degree Follower", "question__title_slug": "second-degree-follower", "question__hide": false, - "total_acs": 44483, - "total_submitted": 120377, + "total_acs": 44764, + "total_submitted": 120912, "frontend_question_id": 614, "is_new_question": false }, @@ -42588,8 +42887,8 @@ "question__title": "Shortest Distance in a Line", "question__title_slug": "shortest-distance-in-a-line", "question__hide": false, - "total_acs": 57836, - "total_submitted": 70944, + "total_acs": 58333, + "total_submitted": 71506, "frontend_question_id": 613, "is_new_question": false }, @@ -42611,8 +42910,8 @@ "question__title": "Shortest Distance in a Plane", "question__title_slug": "shortest-distance-in-a-plane", "question__hide": false, - "total_acs": 34013, - "total_submitted": 53596, + "total_acs": 34262, + "total_submitted": 53970, "frontend_question_id": 612, "is_new_question": false }, @@ -42634,8 +42933,8 @@ "question__title": "Valid Triangle Number", "question__title_slug": "valid-triangle-number", "question__hide": false, - "total_acs": 156064, - "total_submitted": 309918, + "total_acs": 157363, + "total_submitted": 312398, "frontend_question_id": 611, "is_new_question": false }, @@ -42657,8 +42956,8 @@ "question__title": "Triangle Judgement", "question__title_slug": "triangle-judgement", "question__hide": false, - "total_acs": 56551, - "total_submitted": 79579, + "total_acs": 56957, + "total_submitted": 80158, "frontend_question_id": 610, "is_new_question": false }, @@ -42680,8 +42979,8 @@ "question__title": "Find Duplicate File in System", "question__title_slug": "find-duplicate-file-in-system", "question__hide": false, - "total_acs": 140628, - "total_submitted": 207345, + "total_acs": 141009, + "total_submitted": 207920, "frontend_question_id": 609, "is_new_question": false }, @@ -42703,8 +43002,8 @@ "question__title": "Tree Node", "question__title_slug": "tree-node", "question__hide": false, - "total_acs": 89326, - "total_submitted": 119521, + "total_acs": 91710, + "total_submitted": 123228, "frontend_question_id": 608, "is_new_question": false }, @@ -42726,8 +43025,8 @@ "question__title": "Sales Person", "question__title_slug": "sales-person", "question__hide": false, - "total_acs": 103379, - "total_submitted": 143252, + "total_acs": 106520, + "total_submitted": 147673, "frontend_question_id": 607, "is_new_question": false }, @@ -42749,8 +43048,8 @@ "question__title": "Construct String from Binary Tree", "question__title_slug": "construct-string-from-binary-tree", "question__hide": false, - "total_acs": 204225, - "total_submitted": 321245, + "total_acs": 205284, + "total_submitted": 322771, "frontend_question_id": 606, "is_new_question": false }, @@ -42772,8 +43071,8 @@ "question__title": "Can Place Flowers", "question__title_slug": "can-place-flowers", "question__hide": false, - "total_acs": 326612, - "total_submitted": 990607, + "total_acs": 328996, + "total_submitted": 999306, "frontend_question_id": 605, "is_new_question": false }, @@ -42795,8 +43094,8 @@ "question__title": "Design Compressed String Iterator", "question__title_slug": "design-compressed-string-iterator", "question__hide": false, - "total_acs": 28082, - "total_submitted": 71236, + "total_acs": 28187, + "total_submitted": 71505, "frontend_question_id": 604, "is_new_question": false }, @@ -42818,8 +43117,8 @@ "question__title": "Consecutive Available Seats", "question__title_slug": "consecutive-available-seats", "question__hide": false, - "total_acs": 67250, - "total_submitted": 98551, + "total_acs": 67937, + "total_submitted": 99538, "frontend_question_id": 603, "is_new_question": false }, @@ -42841,8 +43140,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": 53907, - "total_submitted": 87863, + "total_acs": 54213, + "total_submitted": 88300, "frontend_question_id": 602, "is_new_question": false }, @@ -42864,8 +43163,8 @@ "question__title": "Human Traffic of Stadium", "question__title_slug": "human-traffic-of-stadium", "question__hide": false, - "total_acs": 71005, - "total_submitted": 140168, + "total_acs": 71769, + "total_submitted": 141590, "frontend_question_id": 601, "is_new_question": false }, @@ -42887,8 +43186,8 @@ "question__title": "Non-negative Integers without Consecutive Ones", "question__title_slug": "non-negative-integers-without-consecutive-ones", "question__hide": false, - "total_acs": 32660, - "total_submitted": 83749, + "total_acs": 32791, + "total_submitted": 83999, "frontend_question_id": 600, "is_new_question": false }, @@ -42910,8 +43209,8 @@ "question__title": "Minimum Index Sum of Two Lists", "question__title_slug": "minimum-index-sum-of-two-lists", "question__hide": false, - "total_acs": 172434, - "total_submitted": 326697, + "total_acs": 173900, + "total_submitted": 329003, "frontend_question_id": 599, "is_new_question": false }, @@ -42933,8 +43232,8 @@ "question__title": "Range Addition II", "question__title_slug": "range-addition-ii", "question__hide": false, - "total_acs": 83667, - "total_submitted": 152112, + "total_acs": 84089, + "total_submitted": 152810, "frontend_question_id": 598, "is_new_question": false }, @@ -42956,8 +43255,8 @@ "question__title": "Friend Requests I: Overall Acceptance Rate", "question__title_slug": "friend-requests-i-overall-acceptance-rate", "question__hide": false, - "total_acs": 64571, - "total_submitted": 150526, + "total_acs": 64945, + "total_submitted": 151462, "frontend_question_id": 597, "is_new_question": false }, @@ -42979,8 +43278,8 @@ "question__title": "Classes More Than 5 Students", "question__title_slug": "classes-more-than-5-students", "question__hide": false, - "total_acs": 209208, - "total_submitted": 449230, + "total_acs": 212570, + "total_submitted": 454541, "frontend_question_id": 596, "is_new_question": false }, @@ -43002,8 +43301,8 @@ "question__title": "Big Countries", "question__title_slug": "big-countries", "question__hide": false, - "total_acs": 456955, - "total_submitted": 620619, + "total_acs": 469035, + "total_submitted": 638793, "frontend_question_id": 595, "is_new_question": false }, @@ -43025,8 +43324,8 @@ "question__title": "Longest Harmonious Subsequence", "question__title_slug": "longest-harmonious-subsequence", "question__hide": false, - "total_acs": 125639, - "total_submitted": 236396, + "total_acs": 126358, + "total_submitted": 237597, "frontend_question_id": 594, "is_new_question": false }, @@ -43048,8 +43347,8 @@ "question__title": "Valid Square", "question__title_slug": "valid-square", "question__hide": false, - "total_acs": 91459, - "total_submitted": 207594, + "total_acs": 92072, + "total_submitted": 208965, "frontend_question_id": 593, "is_new_question": false }, @@ -43071,8 +43370,8 @@ "question__title": "Fraction Addition and Subtraction", "question__title_slug": "fraction-addition-and-subtraction", "question__hide": false, - "total_acs": 30843, - "total_submitted": 59222, + "total_acs": 31040, + "total_submitted": 59625, "frontend_question_id": 592, "is_new_question": false }, @@ -43094,8 +43393,8 @@ "question__title": "Tag Validator", "question__title_slug": "tag-validator", "question__hide": false, - "total_acs": 12405, - "total_submitted": 33413, + "total_acs": 12440, + "total_submitted": 33496, "frontend_question_id": 591, "is_new_question": false }, @@ -43117,8 +43416,8 @@ "question__title": "Design In-Memory File System", "question__title_slug": "design-in-memory-file-system", "question__hide": false, - "total_acs": 80045, - "total_submitted": 163930, + "total_acs": 80727, + "total_submitted": 165389, "frontend_question_id": 588, "is_new_question": false }, @@ -43140,8 +43439,8 @@ "question__title": "Erect the Fence", "question__title_slug": "erect-the-fence", "question__hide": false, - "total_acs": 25227, - "total_submitted": 58464, + "total_acs": 25291, + "total_submitted": 58620, "frontend_question_id": 587, "is_new_question": false }, @@ -43163,8 +43462,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": 124113, - "total_submitted": 171398, + "total_acs": 127736, + "total_submitted": 176733, "frontend_question_id": 586, "is_new_question": false }, @@ -43186,8 +43485,8 @@ "question__title": "Investments in 2016", "question__title_slug": "investments-in-2016", "question__hide": false, - "total_acs": 36551, - "total_submitted": 68346, + "total_acs": 36806, + "total_submitted": 68929, "frontend_question_id": 585, "is_new_question": false }, @@ -43209,8 +43508,8 @@ "question__title": "Find Customer Referee", "question__title_slug": "find-customer-referee", "question__hide": false, - "total_acs": 196128, - "total_submitted": 259571, + "total_acs": 204808, + "total_submitted": 275703, "frontend_question_id": 584, "is_new_question": false }, @@ -43232,8 +43531,8 @@ "question__title": "Delete Operation for Two Strings", "question__title_slug": "delete-operation-for-two-strings", "question__hide": false, - "total_acs": 186990, - "total_submitted": 315429, + "total_acs": 188638, + "total_submitted": 317904, "frontend_question_id": 583, "is_new_question": false }, @@ -43255,8 +43554,8 @@ "question__title": "Kill Process", "question__title_slug": "kill-process", "question__hide": false, - "total_acs": 75844, - "total_submitted": 110794, + "total_acs": 76182, + "total_submitted": 111238, "frontend_question_id": 582, "is_new_question": false }, @@ -43278,8 +43577,8 @@ "question__title": "Shortest Unsorted Continuous Subarray", "question__title_slug": "shortest-unsorted-continuous-subarray", "question__hide": false, - "total_acs": 288274, - "total_submitted": 795571, + "total_acs": 289449, + "total_submitted": 798457, "frontend_question_id": 581, "is_new_question": false }, @@ -43301,8 +43600,8 @@ "question__title": "Count Student Number in Departments", "question__title_slug": "count-student-number-in-departments", "question__hide": false, - "total_acs": 53843, - "total_submitted": 92382, + "total_acs": 54388, + "total_submitted": 93170, "frontend_question_id": 580, "is_new_question": false }, @@ -43324,8 +43623,8 @@ "question__title": "Find Cumulative Salary of an Employee", "question__title_slug": "find-cumulative-salary-of-an-employee", "question__hide": false, - "total_acs": 28811, - "total_submitted": 63868, + "total_acs": 28978, + "total_submitted": 64115, "frontend_question_id": 579, "is_new_question": false }, @@ -43347,8 +43646,8 @@ "question__title": "Get Highest Answer Rate Question", "question__title_slug": "get-highest-answer-rate-question", "question__hide": false, - "total_acs": 45040, - "total_submitted": 108283, + "total_acs": 45361, + "total_submitted": 109105, "frontend_question_id": 578, "is_new_question": false }, @@ -43370,8 +43669,8 @@ "question__title": "Employee Bonus", "question__title_slug": "employee-bonus", "question__hide": false, - "total_acs": 66442, - "total_submitted": 88199, + "total_acs": 66911, + "total_submitted": 88792, "frontend_question_id": 577, "is_new_question": false }, @@ -43393,8 +43692,8 @@ "question__title": "Out of Boundary Paths", "question__title_slug": "out-of-boundary-paths", "question__hide": false, - "total_acs": 112065, - "total_submitted": 253085, + "total_acs": 112453, + "total_submitted": 253891, "frontend_question_id": 576, "is_new_question": false }, @@ -43416,8 +43715,8 @@ "question__title": "Distribute Candies", "question__title_slug": "distribute-candies", "question__hide": false, - "total_acs": 224412, - "total_submitted": 339678, + "total_acs": 225776, + "total_submitted": 341616, "frontend_question_id": 575, "is_new_question": false }, @@ -43439,8 +43738,8 @@ "question__title": "Winning Candidate", "question__title_slug": "winning-candidate", "question__hide": false, - "total_acs": 52394, - "total_submitted": 87691, + "total_acs": 52789, + "total_submitted": 88263, "frontend_question_id": 574, "is_new_question": false }, @@ -43462,8 +43761,8 @@ "question__title": "Squirrel Simulation", "question__title_slug": "squirrel-simulation", "question__hide": false, - "total_acs": 17553, - "total_submitted": 31945, + "total_acs": 17589, + "total_submitted": 32005, "frontend_question_id": 573, "is_new_question": false }, @@ -43485,8 +43784,8 @@ "question__title": "Subtree of Another Tree", "question__title_slug": "subtree-of-another-tree", "question__hide": false, - "total_acs": 579879, - "total_submitted": 1261871, + "total_acs": 586294, + "total_submitted": 1274827, "frontend_question_id": 572, "is_new_question": false }, @@ -43508,8 +43807,8 @@ "question__title": "Find Median Given Frequency of Numbers", "question__title_slug": "find-median-given-frequency-of-numbers", "question__hide": false, - "total_acs": 22420, - "total_submitted": 50230, + "total_acs": 22598, + "total_submitted": 50697, "frontend_question_id": 571, "is_new_question": false }, @@ -43531,8 +43830,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": 70551, - "total_submitted": 105079, + "total_acs": 71326, + "total_submitted": 106329, "frontend_question_id": 570, "is_new_question": false }, @@ -43554,8 +43853,8 @@ "question__title": "Median Employee Salary", "question__title_slug": "median-employee-salary", "question__hide": false, - "total_acs": 31654, - "total_submitted": 46370, + "total_acs": 31892, + "total_submitted": 46806, "frontend_question_id": 569, "is_new_question": false }, @@ -43577,8 +43876,8 @@ "question__title": "Maximum Vacation Days", "question__title_slug": "maximum-vacation-days", "question__hide": false, - "total_acs": 35152, - "total_submitted": 78456, + "total_acs": 35225, + "total_submitted": 78576, "frontend_question_id": 568, "is_new_question": false }, @@ -43600,8 +43899,8 @@ "question__title": "Permutation in String", "question__title_slug": "permutation-in-string", "question__hide": false, - "total_acs": 500201, - "total_submitted": 1142698, + "total_acs": 507033, + "total_submitted": 1159568, "frontend_question_id": 567, "is_new_question": false }, @@ -43623,8 +43922,8 @@ "question__title": "Reshape the Matrix", "question__title_slug": "reshape-the-matrix", "question__hide": false, - "total_acs": 297117, - "total_submitted": 474133, + "total_acs": 300546, + "total_submitted": 479340, "frontend_question_id": 566, "is_new_question": false }, @@ -43646,8 +43945,8 @@ "question__title": "Array Nesting", "question__title_slug": "array-nesting", "question__hide": false, - "total_acs": 118631, - "total_submitted": 210063, + "total_acs": 118971, + "total_submitted": 210640, "frontend_question_id": 565, "is_new_question": false }, @@ -43669,8 +43968,8 @@ "question__title": "Find the Closest Palindrome", "question__title_slug": "find-the-closest-palindrome", "question__hide": false, - "total_acs": 35639, - "total_submitted": 162479, + "total_acs": 35894, + "total_submitted": 163418, "frontend_question_id": 564, "is_new_question": false }, @@ -43692,8 +43991,8 @@ "question__title": "Binary Tree Tilt", "question__title_slug": "binary-tree-tilt", "question__hide": false, - "total_acs": 179730, - "total_submitted": 302724, + "total_acs": 180411, + "total_submitted": 303656, "frontend_question_id": 563, "is_new_question": false }, @@ -43715,8 +44014,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": 68128, - "total_submitted": 136267, + "total_acs": 68697, + "total_submitted": 137324, "frontend_question_id": 562, "is_new_question": false }, @@ -43738,8 +44037,8 @@ "question__title": "Array Partition", "question__title_slug": "array-partition", "question__hide": false, - "total_acs": 363633, - "total_submitted": 474862, + "total_acs": 366254, + "total_submitted": 477925, "frontend_question_id": 561, "is_new_question": false }, @@ -43761,8 +44060,8 @@ "question__title": "Subarray Sum Equals K", "question__title_slug": "subarray-sum-equals-k", "question__hide": false, - "total_acs": 883921, - "total_submitted": 2007489, + "total_acs": 891139, + "total_submitted": 2025167, "frontend_question_id": 560, "is_new_question": false }, @@ -43784,8 +44083,8 @@ "question__title": "Reverse Words in a String III", "question__title_slug": "reverse-words-in-a-string-iii", "question__hide": false, - "total_acs": 606860, - "total_submitted": 744626, + "total_acs": 613155, + "total_submitted": 751924, "frontend_question_id": 557, "is_new_question": false }, @@ -43807,8 +44106,8 @@ "question__title": "Next Greater Element III", "question__title_slug": "next-greater-element-iii", "question__hide": false, - "total_acs": 116074, - "total_submitted": 340405, + "total_acs": 117208, + "total_submitted": 343683, "frontend_question_id": 556, "is_new_question": false }, @@ -43830,8 +44129,8 @@ "question__title": "Split Concatenated Strings", "question__title_slug": "split-concatenated-strings", "question__hide": false, - "total_acs": 6164, - "total_submitted": 14178, + "total_acs": 6183, + "total_submitted": 14206, "frontend_question_id": 555, "is_new_question": false }, @@ -43853,8 +44152,8 @@ "question__title": "Brick Wall", "question__title_slug": "brick-wall", "question__hide": false, - "total_acs": 107759, - "total_submitted": 202868, + "total_acs": 108482, + "total_submitted": 204094, "frontend_question_id": 554, "is_new_question": false }, @@ -43876,8 +44175,8 @@ "question__title": "Optimal Division", "question__title_slug": "optimal-division", "question__hide": false, - "total_acs": 33872, - "total_submitted": 56709, + "total_acs": 33992, + "total_submitted": 56906, "frontend_question_id": 553, "is_new_question": false }, @@ -43899,8 +44198,8 @@ "question__title": "Student Attendance Record II", "question__title_slug": "student-attendance-record-ii", "question__hide": false, - "total_acs": 55853, - "total_submitted": 135727, + "total_acs": 56250, + "total_submitted": 136682, "frontend_question_id": 552, "is_new_question": false }, @@ -43922,8 +44221,8 @@ "question__title": "Student Attendance Record I", "question__title_slug": "student-attendance-record-i", "question__hide": false, - "total_acs": 161859, - "total_submitted": 337099, + "total_acs": 163180, + "total_submitted": 339588, "frontend_question_id": 551, "is_new_question": false }, @@ -43945,8 +44244,8 @@ "question__title": "Shortest Path to Get Food", "question__title_slug": "shortest-path-to-get-food", "question__hide": false, - "total_acs": 48455, - "total_submitted": 89679, + "total_acs": 49314, + "total_submitted": 91167, "frontend_question_id": 1730, "is_new_question": false }, @@ -43968,8 +44267,8 @@ "question__title": "Binary Tree Longest Consecutive Sequence II", "question__title_slug": "binary-tree-longest-consecutive-sequence-ii", "question__hide": false, - "total_acs": 48567, - "total_submitted": 98162, + "total_acs": 48713, + "total_submitted": 98441, "frontend_question_id": 549, "is_new_question": false }, @@ -43991,8 +44290,8 @@ "question__title": "Split Array with Equal Sum", "question__title_slug": "split-array-with-equal-sum", "question__hide": false, - "total_acs": 22923, - "total_submitted": 45734, + "total_acs": 22943, + "total_submitted": 45794, "frontend_question_id": 548, "is_new_question": false }, @@ -44014,8 +44313,8 @@ "question__title": "Number of Provinces", "question__title_slug": "number-of-provinces", "question__hide": false, - "total_acs": 550382, - "total_submitted": 869976, + "total_acs": 556364, + "total_submitted": 878873, "frontend_question_id": 547, "is_new_question": false }, @@ -44037,8 +44336,8 @@ "question__title": "Remove Boxes", "question__title_slug": "remove-boxes", "question__hide": false, - "total_acs": 36970, - "total_submitted": 77607, + "total_acs": 37678, + "total_submitted": 78766, "frontend_question_id": 546, "is_new_question": false }, @@ -44060,8 +44359,8 @@ "question__title": "Boundary of Binary Tree", "question__title_slug": "boundary-of-binary-tree", "question__hide": false, - "total_acs": 115285, - "total_submitted": 260443, + "total_acs": 115903, + "total_submitted": 261649, "frontend_question_id": 545, "is_new_question": false }, @@ -44083,8 +44382,8 @@ "question__title": "Output Contest Matches", "question__title_slug": "output-contest-matches", "question__hide": false, - "total_acs": 25489, - "total_submitted": 33214, + "total_acs": 25543, + "total_submitted": 33273, "frontend_question_id": 544, "is_new_question": false }, @@ -44106,8 +44405,8 @@ "question__title": "Diameter of Binary Tree", "question__title_slug": "diameter-of-binary-tree", "question__hide": false, - "total_acs": 907828, - "total_submitted": 1622847, + "total_acs": 918603, + "total_submitted": 1640195, "frontend_question_id": 543, "is_new_question": false }, @@ -44129,8 +44428,8 @@ "question__title": "01 Matrix", "question__title_slug": "01-matrix", "question__hide": false, - "total_acs": 319706, - "total_submitted": 724034, + "total_acs": 325037, + "total_submitted": 735486, "frontend_question_id": 542, "is_new_question": false }, @@ -44152,8 +44451,8 @@ "question__title": "Reverse String II", "question__title_slug": "reverse-string-ii", "question__hide": false, - "total_acs": 175304, - "total_submitted": 347053, + "total_acs": 177110, + "total_submitted": 350668, "frontend_question_id": 541, "is_new_question": false }, @@ -44175,8 +44474,8 @@ "question__title": "Single Element in a Sorted Array", "question__title_slug": "single-element-in-a-sorted-array", "question__hide": false, - "total_acs": 340553, - "total_submitted": 582253, + "total_acs": 343698, + "total_submitted": 587634, "frontend_question_id": 540, "is_new_question": false }, @@ -44198,8 +44497,8 @@ "question__title": "Minimum Time Difference", "question__title_slug": "minimum-time-difference", "question__hide": false, - "total_acs": 112943, - "total_submitted": 200542, + "total_acs": 113869, + "total_submitted": 202287, "frontend_question_id": 539, "is_new_question": false }, @@ -44221,8 +44520,8 @@ "question__title": "Convert BST to Greater Tree", "question__title_slug": "convert-bst-to-greater-tree", "question__hide": false, - "total_acs": 255671, - "total_submitted": 379881, + "total_acs": 256554, + "total_submitted": 380947, "frontend_question_id": 538, "is_new_question": false }, @@ -44244,8 +44543,8 @@ "question__title": "Complex Number Multiplication", "question__title_slug": "complex-number-multiplication", "question__hide": false, - "total_acs": 84704, - "total_submitted": 118733, + "total_acs": 84957, + "total_submitted": 119069, "frontend_question_id": 537, "is_new_question": false }, @@ -44267,8 +44566,8 @@ "question__title": "Construct Binary Tree from String", "question__title_slug": "construct-binary-tree-from-string", "question__hide": false, - "total_acs": 81525, - "total_submitted": 145233, + "total_acs": 81651, + "total_submitted": 145432, "frontend_question_id": 536, "is_new_question": false }, @@ -44290,8 +44589,8 @@ "question__title": "Encode and Decode TinyURL", "question__title_slug": "encode-and-decode-tinyurl", "question__hide": false, - "total_acs": 216061, - "total_submitted": 251945, + "total_acs": 217181, + "total_submitted": 253158, "frontend_question_id": 535, "is_new_question": false }, @@ -44313,8 +44612,8 @@ "question__title": "Lonely Pixel II", "question__title_slug": "lonely-pixel-ii", "question__hide": false, - "total_acs": 12459, - "total_submitted": 25712, + "total_acs": 12484, + "total_submitted": 25770, "frontend_question_id": 533, "is_new_question": false }, @@ -44336,8 +44635,8 @@ "question__title": "K-diff Pairs in an Array", "question__title_slug": "k-diff-pairs-in-an-array", "question__hide": false, - "total_acs": 275621, - "total_submitted": 677030, + "total_acs": 276963, + "total_submitted": 679646, "frontend_question_id": 532, "is_new_question": false }, @@ -44359,8 +44658,8 @@ "question__title": "Lonely Pixel I", "question__title_slug": "lonely-pixel-i", "question__hide": false, - "total_acs": 37461, - "total_submitted": 60366, + "total_acs": 37751, + "total_submitted": 60814, "frontend_question_id": 531, "is_new_question": false }, @@ -44382,8 +44681,8 @@ "question__title": "Minimum Absolute Difference in BST", "question__title_slug": "minimum-absolute-difference-in-bst", "question__hide": false, - "total_acs": 181517, - "total_submitted": 319845, + "total_acs": 182992, + "total_submitted": 322448, "frontend_question_id": 530, "is_new_question": false }, @@ -44405,8 +44704,8 @@ "question__title": "Minesweeper", "question__title_slug": "minesweeper", "question__hide": false, - "total_acs": 128631, - "total_submitted": 196436, + "total_acs": 129359, + "total_submitted": 197464, "frontend_question_id": 529, "is_new_question": false }, @@ -44428,8 +44727,8 @@ "question__title": "Swapping Nodes in a Linked List", "question__title_slug": "swapping-nodes-in-a-linked-list", "question__hide": false, - "total_acs": 188591, - "total_submitted": 278206, + "total_acs": 190361, + "total_submitted": 281022, "frontend_question_id": 1721, "is_new_question": false }, @@ -44451,8 +44750,8 @@ "question__title": "Word Abbreviation", "question__title_slug": "word-abbreviation", "question__hide": false, - "total_acs": 25225, - "total_submitted": 41845, + "total_acs": 25300, + "total_submitted": 41946, "frontend_question_id": 527, "is_new_question": false }, @@ -44474,8 +44773,8 @@ "question__title": "Beautiful Arrangement", "question__title_slug": "beautiful-arrangement", "question__hide": false, - "total_acs": 143066, - "total_submitted": 221409, + "total_acs": 144047, + "total_submitted": 222968, "frontend_question_id": 526, "is_new_question": false }, @@ -44497,8 +44796,8 @@ "question__title": "Contiguous Array", "question__title_slug": "contiguous-array", "question__hide": false, - "total_acs": 282034, - "total_submitted": 602592, + "total_acs": 283336, + "total_submitted": 605310, "frontend_question_id": 525, "is_new_question": false }, @@ -44520,8 +44819,8 @@ "question__title": "Longest Word in Dictionary through Deleting", "question__title_slug": "longest-word-in-dictionary-through-deleting", "question__hide": false, - "total_acs": 135329, - "total_submitted": 264553, + "total_acs": 135906, + "total_submitted": 265686, "frontend_question_id": 524, "is_new_question": false }, @@ -44543,8 +44842,8 @@ "question__title": "Continuous Subarray Sum", "question__title_slug": "continuous-subarray-sum", "question__hide": false, - "total_acs": 347558, - "total_submitted": 1234257, + "total_acs": 372713, + "total_submitted": 1306135, "frontend_question_id": 523, "is_new_question": false }, @@ -44566,8 +44865,8 @@ "question__title": "Longest Uncommon Subsequence II", "question__title_slug": "longest-uncommon-subsequence-ii", "question__hide": false, - "total_acs": 45377, - "total_submitted": 112355, + "total_acs": 45519, + "total_submitted": 112799, "frontend_question_id": 522, "is_new_question": false }, @@ -44589,8 +44888,8 @@ "question__title": "Longest Uncommon Subsequence I", "question__title_slug": "longest-uncommon-subsequence-i", "question__hide": false, - "total_acs": 89891, - "total_submitted": 149059, + "total_acs": 90332, + "total_submitted": 149723, "frontend_question_id": 521, "is_new_question": false }, @@ -44612,8 +44911,8 @@ "question__title": "Detect Capital", "question__title_slug": "detect-capital", "question__hide": false, - "total_acs": 279258, - "total_submitted": 502521, + "total_acs": 280573, + "total_submitted": 504979, "frontend_question_id": 520, "is_new_question": false }, @@ -44635,8 +44934,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": 1494, - "total_submitted": 2810, + "total_acs": 1514, + "total_submitted": 2849, "frontend_question_id": 1983, "is_new_question": false }, @@ -44658,8 +44957,8 @@ "question__title": "Coin Change II", "question__title_slug": "coin-change-ii", "question__hide": false, - "total_acs": 362767, - "total_submitted": 606795, + "total_acs": 366664, + "total_submitted": 612595, "frontend_question_id": 518, "is_new_question": false }, @@ -44681,8 +44980,8 @@ "question__title": "Super Washing Machines", "question__title_slug": "super-washing-machines", "question__hide": false, - "total_acs": 23920, - "total_submitted": 59917, + "total_acs": 24219, + "total_submitted": 60347, "frontend_question_id": 517, "is_new_question": false }, @@ -44704,8 +45003,8 @@ "question__title": "Longest Palindromic Subsequence", "question__title_slug": "longest-palindromic-subsequence", "question__hide": false, - "total_acs": 301654, - "total_submitted": 497402, + "total_acs": 304300, + "total_submitted": 501544, "frontend_question_id": 516, "is_new_question": false }, @@ -44727,8 +45026,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": 212364, - "total_submitted": 328642, + "total_acs": 213564, + "total_submitted": 330453, "frontend_question_id": 515, "is_new_question": false }, @@ -44750,8 +45049,8 @@ "question__title": "Freedom Trail", "question__title_slug": "freedom-trail", "question__hide": false, - "total_acs": 30074, - "total_submitted": 64353, + "total_acs": 30200, + "total_submitted": 64666, "frontend_question_id": 514, "is_new_question": false }, @@ -44773,8 +45072,8 @@ "question__title": "Find Bottom Left Tree Value", "question__title_slug": "find-bottom-left-tree-value", "question__hide": false, - "total_acs": 195111, - "total_submitted": 293988, + "total_acs": 196406, + "total_submitted": 295729, "frontend_question_id": 513, "is_new_question": false }, @@ -44796,8 +45095,8 @@ "question__title": "Maximum Alternating Subarray Sum", "question__title_slug": "maximum-alternating-subarray-sum", "question__hide": false, - "total_acs": 1801, - "total_submitted": 4376, + "total_acs": 1832, + "total_submitted": 4488, "frontend_question_id": 2036, "is_new_question": false }, @@ -44819,8 +45118,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": 47748, - "total_submitted": 118070, + "total_acs": 48038, + "total_submitted": 119293, "frontend_question_id": 1059, "is_new_question": false }, @@ -44842,8 +45141,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": 2371, - "total_submitted": 4461, + "total_acs": 2403, + "total_submitted": 4555, "frontend_question_id": 2031, "is_new_question": false }, @@ -44865,8 +45164,8 @@ "question__title": "Inorder Successor in BST II", "question__title_slug": "inorder-successor-in-bst-ii", "question__hide": false, - "total_acs": 58014, - "total_submitted": 94916, + "total_acs": 58378, + "total_submitted": 95501, "frontend_question_id": 510, "is_new_question": false }, @@ -44882,14 +45181,14 @@ { "stat": { "question_id": 508, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "most-frequent-subtree-sum", + "question__article__has_video_solution": false, "question__title": "Most Frequent Subtree Sum", "question__title_slug": "most-frequent-subtree-sum", "question__hide": false, - "total_acs": 119593, - "total_submitted": 186094, + "total_acs": 120142, + "total_submitted": 186735, "frontend_question_id": 508, "is_new_question": false }, @@ -44911,8 +45210,8 @@ "question__title": "Perfect Number", "question__title_slug": "perfect-number", "question__hide": false, - "total_acs": 117071, - "total_submitted": 310116, + "total_acs": 118256, + "total_submitted": 313191, "frontend_question_id": 507, "is_new_question": false }, @@ -44934,8 +45233,8 @@ "question__title": "Relative Ranks", "question__title_slug": "relative-ranks", "question__hide": false, - "total_acs": 106635, - "total_submitted": 181114, + "total_acs": 107937, + "total_submitted": 182962, "frontend_question_id": 506, "is_new_question": false }, @@ -44957,8 +45256,8 @@ "question__title": "The Maze II", "question__title_slug": "the-maze-ii", "question__hide": false, - "total_acs": 91248, - "total_submitted": 174253, + "total_acs": 91662, + "total_submitted": 174892, "frontend_question_id": 505, "is_new_question": false }, @@ -44980,8 +45279,8 @@ "question__title": "Base 7", "question__title_slug": "base-7", "question__hide": false, - "total_acs": 95354, - "total_submitted": 198834, + "total_acs": 96281, + "total_submitted": 200591, "frontend_question_id": 504, "is_new_question": false }, @@ -45003,8 +45302,8 @@ "question__title": "Next Greater Element II", "question__title_slug": "next-greater-element-ii", "question__hide": false, - "total_acs": 264295, - "total_submitted": 419183, + "total_acs": 267672, + "total_submitted": 424337, "frontend_question_id": 503, "is_new_question": false }, @@ -45026,8 +45325,8 @@ "question__title": "IPO", "question__title_slug": "ipo", "question__hide": false, - "total_acs": 37863, - "total_submitted": 84251, + "total_acs": 38293, + "total_submitted": 85158, "frontend_question_id": 502, "is_new_question": false }, @@ -45049,8 +45348,8 @@ "question__title": "Find Mode in Binary Search Tree", "question__title_slug": "find-mode-in-binary-search-tree", "question__hide": false, - "total_acs": 173991, - "total_submitted": 358075, + "total_acs": 175263, + "total_submitted": 360293, "frontend_question_id": 501, "is_new_question": false }, @@ -45072,8 +45371,8 @@ "question__title": "Keyboard Row", "question__title_slug": "keyboard-row", "question__hide": false, - "total_acs": 168059, - "total_submitted": 243389, + "total_acs": 169323, + "total_submitted": 244917, "frontend_question_id": 500, "is_new_question": false }, @@ -45095,8 +45394,8 @@ "question__title": "The Maze III", "question__title_slug": "the-maze-iii", "question__hide": false, - "total_acs": 25739, - "total_submitted": 54944, + "total_acs": 25871, + "total_submitted": 55168, "frontend_question_id": 499, "is_new_question": false }, @@ -45118,8 +45417,8 @@ "question__title": "Diagonal Traverse", "question__title_slug": "diagonal-traverse", "question__hide": false, - "total_acs": 228381, - "total_submitted": 393691, + "total_acs": 229844, + "total_submitted": 395926, "frontend_question_id": 498, "is_new_question": false }, @@ -45141,8 +45440,8 @@ "question__title": "Next Greater Element I", "question__title_slug": "next-greater-element-i", "question__hide": false, - "total_acs": 446923, - "total_submitted": 626784, + "total_acs": 453091, + "total_submitted": 635009, "frontend_question_id": 496, "is_new_question": false }, @@ -45164,8 +45463,8 @@ "question__title": "Teemo Attacking", "question__title_slug": "teemo-attacking", "question__hide": false, - "total_acs": 111832, - "total_submitted": 196314, + "total_acs": 112700, + "total_submitted": 197781, "frontend_question_id": 495, "is_new_question": false }, @@ -45187,8 +45486,8 @@ "question__title": "Target Sum", "question__title_slug": "target-sum", "question__hide": false, - "total_acs": 414318, - "total_submitted": 909236, + "total_acs": 417830, + "total_submitted": 916472, "frontend_question_id": 494, "is_new_question": false }, @@ -45210,8 +45509,8 @@ "question__title": "Reverse Pairs", "question__title_slug": "reverse-pairs", "question__hide": false, - "total_acs": 107295, - "total_submitted": 348053, + "total_acs": 108606, + "total_submitted": 351591, "frontend_question_id": 493, "is_new_question": false }, @@ -45233,8 +45532,8 @@ "question__title": "Construct the Rectangle", "question__title_slug": "construct-the-rectangle", "question__hide": false, - "total_acs": 87224, - "total_submitted": 162646, + "total_acs": 87805, + "total_submitted": 163526, "frontend_question_id": 492, "is_new_question": false }, @@ -45256,8 +45555,8 @@ "question__title": "Increasing Subsequences", "question__title_slug": "increasing-subsequences", "question__hide": false, - "total_acs": 84280, - "total_submitted": 162058, + "total_acs": 84877, + "total_submitted": 163091, "frontend_question_id": 491, "is_new_question": false }, @@ -45279,8 +45578,8 @@ "question__title": "The Maze", "question__title_slug": "the-maze", "question__hide": false, - "total_acs": 132028, - "total_submitted": 238354, + "total_acs": 132905, + "total_submitted": 239792, "frontend_question_id": 490, "is_new_question": false }, @@ -45302,8 +45601,8 @@ "question__title": "Kth Smallest Instructions", "question__title_slug": "kth-smallest-instructions", "question__hide": false, - "total_acs": 8925, - "total_submitted": 19238, + "total_acs": 8998, + "total_submitted": 19386, "frontend_question_id": 1643, "is_new_question": false }, @@ -45325,8 +45624,8 @@ "question__title": "Zuma Game", "question__title_slug": "zuma-game", "question__hide": false, - "total_acs": 20869, - "total_submitted": 59947, + "total_acs": 20903, + "total_submitted": 60274, "frontend_question_id": 488, "is_new_question": false }, @@ -45348,8 +45647,8 @@ "question__title": "Max Consecutive Ones II", "question__title_slug": "max-consecutive-ones-ii", "question__hide": false, - "total_acs": 108418, - "total_submitted": 220090, + "total_acs": 112288, + "total_submitted": 226304, "frontend_question_id": 487, "is_new_question": false }, @@ -45371,8 +45670,8 @@ "question__title": "Predict the Winner", "question__title_slug": "predict-the-winner", "question__hide": false, - "total_acs": 126407, - "total_submitted": 248805, + "total_acs": 127187, + "total_submitted": 250254, "frontend_question_id": 486, "is_new_question": false }, @@ -45394,8 +45693,8 @@ "question__title": "Max Consecutive Ones", "question__title_slug": "max-consecutive-ones", "question__hide": false, - "total_acs": 767055, - "total_submitted": 1369412, + "total_acs": 774255, + "total_submitted": 1380745, "frontend_question_id": 485, "is_new_question": false }, @@ -45417,8 +45716,8 @@ "question__title": "Find Permutation", "question__title_slug": "find-permutation", "question__hide": false, - "total_acs": 35238, - "total_submitted": 52596, + "total_acs": 35288, + "total_submitted": 52673, "frontend_question_id": 484, "is_new_question": false }, @@ -45440,8 +45739,8 @@ "question__title": "Smallest Good Base", "question__title_slug": "smallest-good-base", "question__hide": false, - "total_acs": 18082, - "total_submitted": 47091, + "total_acs": 18165, + "total_submitted": 47324, "frontend_question_id": 483, "is_new_question": false }, @@ -45457,14 +45756,14 @@ { "stat": { "question_id": 482, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "license-key-formatting", + "question__article__has_video_solution": false, "question__title": "License Key Formatting", "question__title_slug": "license-key-formatting", "question__hide": false, - "total_acs": 234336, - "total_submitted": 542887, + "total_acs": 235794, + "total_submitted": 545871, "frontend_question_id": 482, "is_new_question": false }, @@ -45486,8 +45785,8 @@ "question__title": "Magical String", "question__title_slug": "magical-string", "question__hide": false, - "total_acs": 29649, - "total_submitted": 58853, + "total_acs": 29907, + "total_submitted": 59227, "frontend_question_id": 481, "is_new_question": false }, @@ -45509,8 +45808,8 @@ "question__title": "Sliding Window Median", "question__title_slug": "sliding-window-median", "question__hide": false, - "total_acs": 118341, - "total_submitted": 285837, + "total_acs": 119297, + "total_submitted": 287895, "frontend_question_id": 480, "is_new_question": false }, @@ -45532,8 +45831,8 @@ "question__title": "Largest Palindrome Product", "question__title_slug": "largest-palindrome-product", "question__hide": false, - "total_acs": 21248, - "total_submitted": 67125, + "total_acs": 21325, + "total_submitted": 67296, "frontend_question_id": 479, "is_new_question": false }, @@ -45555,8 +45854,8 @@ "question__title": "Total Hamming Distance", "question__title_slug": "total-hamming-distance", "question__hide": false, - "total_acs": 93579, - "total_submitted": 179353, + "total_acs": 93919, + "total_submitted": 179979, "frontend_question_id": 477, "is_new_question": false }, @@ -45578,8 +45877,8 @@ "question__title": "Number Complement", "question__title_slug": "number-complement", "question__hide": false, - "total_acs": 280022, - "total_submitted": 417017, + "total_acs": 281291, + "total_submitted": 418666, "frontend_question_id": 476, "is_new_question": false }, @@ -45601,8 +45900,8 @@ "question__title": "Heaters", "question__title_slug": "heaters", "question__hide": false, - "total_acs": 95887, - "total_submitted": 265847, + "total_acs": 96279, + "total_submitted": 266796, "frontend_question_id": 475, "is_new_question": false }, @@ -45624,8 +45923,8 @@ "question__title": "Ones and Zeroes", "question__title_slug": "ones-and-zeroes", "question__hide": false, - "total_acs": 159736, - "total_submitted": 341969, + "total_acs": 160532, + "total_submitted": 343761, "frontend_question_id": 474, "is_new_question": false }, @@ -45647,8 +45946,8 @@ "question__title": "Matchsticks to Square", "question__title_slug": "matchsticks-to-square", "question__hide": false, - "total_acs": 133203, - "total_submitted": 329409, + "total_acs": 133867, + "total_submitted": 331276, "frontend_question_id": 473, "is_new_question": false }, @@ -45670,8 +45969,8 @@ "question__title": "Concatenated Words", "question__title_slug": "concatenated-words", "question__hide": false, - "total_acs": 155307, - "total_submitted": 340676, + "total_acs": 156402, + "total_submitted": 342229, "frontend_question_id": 472, "is_new_question": false }, @@ -45693,8 +45992,8 @@ "question__title": "Encode String with Shortest Length", "question__title_slug": "encode-string-with-shortest-length", "question__hide": false, - "total_acs": 29327, - "total_submitted": 57866, + "total_acs": 29377, + "total_submitted": 57959, "frontend_question_id": 471, "is_new_question": false }, @@ -45716,8 +46015,8 @@ "question__title": "Convex Polygon", "question__title_slug": "convex-polygon", "question__hide": false, - "total_acs": 9799, - "total_submitted": 25456, + "total_acs": 9822, + "total_submitted": 25504, "frontend_question_id": 469, "is_new_question": false }, @@ -45739,8 +46038,8 @@ "question__title": "Validate IP Address", "question__title_slug": "validate-ip-address", "question__hide": false, - "total_acs": 135759, - "total_submitted": 511905, + "total_acs": 136440, + "total_submitted": 514318, "frontend_question_id": 468, "is_new_question": false }, @@ -45762,8 +46061,8 @@ "question__title": "Unique Substrings in Wraparound String", "question__title_slug": "unique-substrings-in-wraparound-string", "question__hide": false, - "total_acs": 37838, - "total_submitted": 98973, + "total_acs": 37976, + "total_submitted": 99284, "frontend_question_id": 467, "is_new_question": false }, @@ -45785,8 +46084,8 @@ "question__title": "Count The Repetitions", "question__title_slug": "count-the-repetitions", "question__hide": false, - "total_acs": 15076, - "total_submitted": 51657, + "total_acs": 15161, + "total_submitted": 51865, "frontend_question_id": 466, "is_new_question": false }, @@ -45808,8 +46107,8 @@ "question__title": "Optimal Account Balancing", "question__title_slug": "optimal-account-balancing", "question__hide": false, - "total_acs": 75998, - "total_submitted": 154252, + "total_acs": 76289, + "total_submitted": 154839, "frontend_question_id": 465, "is_new_question": false }, @@ -45831,8 +46130,8 @@ "question__title": "Can I Win", "question__title_slug": "can-i-win", "question__hide": false, - "total_acs": 80624, - "total_submitted": 270837, + "total_acs": 81041, + "total_submitted": 272259, "frontend_question_id": 464, "is_new_question": false }, @@ -45854,8 +46153,8 @@ "question__title": "Island Perimeter", "question__title_slug": "island-perimeter", "question__hide": false, - "total_acs": 401285, - "total_submitted": 577742, + "total_acs": 404055, + "total_submitted": 581349, "frontend_question_id": 463, "is_new_question": false }, @@ -45877,8 +46176,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": 152785, - "total_submitted": 254027, + "total_acs": 153737, + "total_submitted": 255460, "frontend_question_id": 462, "is_new_question": false }, @@ -45900,8 +46199,8 @@ "question__title": "Hamming Distance", "question__title_slug": "hamming-distance", "question__hide": false, - "total_acs": 498583, - "total_submitted": 666593, + "total_acs": 500442, + "total_submitted": 668878, "frontend_question_id": 461, "is_new_question": false }, @@ -45923,8 +46222,8 @@ "question__title": "LFU Cache", "question__title_slug": "lfu-cache", "question__hide": false, - "total_acs": 171180, - "total_submitted": 424237, + "total_acs": 172362, + "total_submitted": 426719, "frontend_question_id": 460, "is_new_question": false }, @@ -45946,8 +46245,8 @@ "question__title": "Repeated Substring Pattern", "question__title_slug": "repeated-substring-pattern", "question__hide": false, - "total_acs": 270044, - "total_submitted": 618012, + "total_acs": 271955, + "total_submitted": 622114, "frontend_question_id": 459, "is_new_question": false }, @@ -45969,8 +46268,8 @@ "question__title": "Poor Pigs", "question__title_slug": "poor-pigs", "question__hide": false, - "total_acs": 71340, - "total_submitted": 109886, + "total_acs": 71612, + "total_submitted": 110777, "frontend_question_id": 458, "is_new_question": false }, @@ -45992,8 +46291,8 @@ "question__title": "Circular Array Loop", "question__title_slug": "circular-array-loop", "question__hide": false, - "total_acs": 64700, - "total_submitted": 201155, + "total_acs": 65135, + "total_submitted": 202095, "frontend_question_id": 457, "is_new_question": false }, @@ -46015,8 +46314,8 @@ "question__title": "132 Pattern", "question__title_slug": "132-pattern", "question__hide": false, - "total_acs": 158568, - "total_submitted": 488667, + "total_acs": 159496, + "total_submitted": 491386, "frontend_question_id": 456, "is_new_question": false }, @@ -46038,8 +46337,8 @@ "question__title": "Assign Cookies", "question__title_slug": "assign-cookies", "question__hide": false, - "total_acs": 192711, - "total_submitted": 381030, + "total_acs": 194837, + "total_submitted": 385378, "frontend_question_id": 455, "is_new_question": false }, @@ -46061,8 +46360,8 @@ "question__title": "4Sum II", "question__title_slug": "4sum-ii", "question__hide": false, - "total_acs": 275348, - "total_submitted": 480526, + "total_acs": 276825, + "total_submitted": 483051, "frontend_question_id": 454, "is_new_question": false }, @@ -46084,8 +46383,8 @@ "question__title": "Minimum Moves to Equal Array Elements", "question__title_slug": "minimum-moves-to-equal-array-elements", "question__hide": false, - "total_acs": 140949, - "total_submitted": 253510, + "total_acs": 141921, + "total_submitted": 254957, "frontend_question_id": 453, "is_new_question": false }, @@ -46107,8 +46406,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": 208365, - "total_submitted": 391793, + "total_acs": 209508, + "total_submitted": 393864, "frontend_question_id": 452, "is_new_question": false }, @@ -46130,8 +46429,8 @@ "question__title": "Sort Characters By Frequency", "question__title_slug": "sort-characters-by-frequency", "question__hide": false, - "total_acs": 406483, - "total_submitted": 592932, + "total_acs": 409893, + "total_submitted": 597430, "frontend_question_id": 451, "is_new_question": false }, @@ -46153,8 +46452,8 @@ "question__title": "Delete Node in a BST", "question__title_slug": "delete-node-in-a-bst", "question__hide": false, - "total_acs": 320884, - "total_submitted": 642871, + "total_acs": 323614, + "total_submitted": 648001, "frontend_question_id": 450, "is_new_question": false }, @@ -46176,8 +46475,8 @@ "question__title": "Serialize and Deserialize BST", "question__title_slug": "serialize-and-deserialize-bst", "question__hide": false, - "total_acs": 209238, - "total_submitted": 368725, + "total_acs": 210113, + "total_submitted": 370061, "frontend_question_id": 449, "is_new_question": false }, @@ -46199,8 +46498,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": 653101, - "total_submitted": 1096024, + "total_acs": 658524, + "total_submitted": 1104391, "frontend_question_id": 448, "is_new_question": false }, @@ -46222,8 +46521,8 @@ "question__title": "Number of Boomerangs", "question__title_slug": "number-of-boomerangs", "question__hide": false, - "total_acs": 89317, - "total_submitted": 163493, + "total_acs": 89514, + "total_submitted": 163808, "frontend_question_id": 447, "is_new_question": false }, @@ -46245,8 +46544,8 @@ "question__title": "Arithmetic Slices II - Subsequence", "question__title_slug": "arithmetic-slices-ii-subsequence", "question__hide": false, - "total_acs": 46605, - "total_submitted": 117066, + "total_acs": 46758, + "total_submitted": 117357, "frontend_question_id": 446, "is_new_question": false }, @@ -46268,8 +46567,8 @@ "question__title": "Add Two Numbers II", "question__title_slug": "add-two-numbers-ii", "question__hide": false, - "total_acs": 345094, - "total_submitted": 580713, + "total_acs": 347311, + "total_submitted": 584032, "frontend_question_id": 445, "is_new_question": false }, @@ -46291,8 +46590,8 @@ "question__title": "Sequence Reconstruction", "question__title_slug": "sequence-reconstruction", "question__hide": false, - "total_acs": 48380, - "total_submitted": 184102, + "total_acs": 48567, + "total_submitted": 184392, "frontend_question_id": 444, "is_new_question": false }, @@ -46314,8 +46613,8 @@ "question__title": "String Compression", "question__title_slug": "string-compression", "question__hide": false, - "total_acs": 286095, - "total_submitted": 586797, + "total_acs": 288643, + "total_submitted": 591090, "frontend_question_id": 443, "is_new_question": false }, @@ -46337,8 +46636,8 @@ "question__title": "Find All Duplicates in an Array", "question__title_slug": "find-all-duplicates-in-an-array", "question__hide": false, - "total_acs": 464719, - "total_submitted": 633435, + "total_acs": 468723, + "total_submitted": 638615, "frontend_question_id": 442, "is_new_question": false }, @@ -46360,8 +46659,8 @@ "question__title": "Arranging Coins", "question__title_slug": "arranging-coins", "question__hide": false, - "total_acs": 317588, - "total_submitted": 689330, + "total_acs": 320971, + "total_submitted": 695733, "frontend_question_id": 441, "is_new_question": false }, @@ -46383,8 +46682,8 @@ "question__title": "K-th Smallest in Lexicographical Order", "question__title_slug": "k-th-smallest-in-lexicographical-order", "question__hide": false, - "total_acs": 18623, - "total_submitted": 60583, + "total_acs": 18706, + "total_submitted": 60856, "frontend_question_id": 440, "is_new_question": false }, @@ -46406,8 +46705,8 @@ "question__title": "Ternary Expression Parser", "question__title_slug": "ternary-expression-parser", "question__hide": false, - "total_acs": 25644, - "total_submitted": 44092, + "total_acs": 25679, + "total_submitted": 44147, "frontend_question_id": 439, "is_new_question": false }, @@ -46429,8 +46728,8 @@ "question__title": "Find All Anagrams in a String", "question__title_slug": "find-all-anagrams-in-a-string", "question__hide": false, - "total_acs": 626656, - "total_submitted": 1280343, + "total_acs": 633338, + "total_submitted": 1293509, "frontend_question_id": 438, "is_new_question": false }, @@ -46452,8 +46751,8 @@ "question__title": "Path Sum III", "question__title_slug": "path-sum-iii", "question__hide": false, - "total_acs": 417452, - "total_submitted": 855620, + "total_acs": 420470, + "total_submitted": 863194, "frontend_question_id": 437, "is_new_question": false }, @@ -46475,8 +46774,8 @@ "question__title": "Find Right Interval", "question__title_slug": "find-right-interval", "question__hide": false, - "total_acs": 86395, - "total_submitted": 171837, + "total_acs": 86980, + "total_submitted": 172879, "frontend_question_id": 436, "is_new_question": false }, @@ -46498,8 +46797,8 @@ "question__title": "Non-overlapping Intervals", "question__title_slug": "non-overlapping-intervals", "question__hide": false, - "total_acs": 313263, - "total_submitted": 628939, + "total_acs": 317491, + "total_submitted": 636620, "frontend_question_id": 435, "is_new_question": false }, @@ -46521,8 +46820,8 @@ "question__title": "Number of Segments in a String", "question__title_slug": "number-of-segments-in-a-string", "question__hide": false, - "total_acs": 129034, - "total_submitted": 342434, + "total_acs": 130316, + "total_submitted": 346044, "frontend_question_id": 434, "is_new_question": false }, @@ -46544,8 +46843,8 @@ "question__title": "Minimum Genetic Mutation", "question__title_slug": "minimum-genetic-mutation", "question__hide": false, - "total_acs": 62161, - "total_submitted": 129229, + "total_acs": 107123, + "total_submitted": 205745, "frontend_question_id": 433, "is_new_question": false }, @@ -46567,8 +46866,8 @@ "question__title": "All O`one Data Structure", "question__title_slug": "all-oone-data-structure", "question__hide": false, - "total_acs": 65085, - "total_submitted": 177532, + "total_acs": 65420, + "total_submitted": 178529, "frontend_question_id": 432, "is_new_question": false }, @@ -46590,8 +46889,8 @@ "question__title": "Word Squares", "question__title_slug": "word-squares", "question__hide": false, - "total_acs": 67283, - "total_submitted": 127884, + "total_acs": 67548, + "total_submitted": 128318, "frontend_question_id": 425, "is_new_question": false }, @@ -46613,8 +46912,8 @@ "question__title": "Longest Repeating Character Replacement", "question__title_slug": "longest-repeating-character-replacement", "question__hide": false, - "total_acs": 352029, - "total_submitted": 685099, + "total_acs": 360310, + "total_submitted": 700607, "frontend_question_id": 424, "is_new_question": false }, @@ -46636,8 +46935,8 @@ "question__title": "Reconstruct Original Digits from English", "question__title_slug": "reconstruct-original-digits-from-english", "question__hide": false, - "total_acs": 68528, - "total_submitted": 133571, + "total_acs": 68912, + "total_submitted": 134288, "frontend_question_id": 423, "is_new_question": false }, @@ -46659,8 +46958,8 @@ "question__title": "Valid Word Square", "question__title_slug": "valid-word-square", "question__hide": false, - "total_acs": 42777, - "total_submitted": 110243, + "total_acs": 43064, + "total_submitted": 110963, "frontend_question_id": 422, "is_new_question": false }, @@ -46682,8 +46981,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": 133817, - "total_submitted": 245273, + "total_acs": 134391, + "total_submitted": 246442, "frontend_question_id": 421, "is_new_question": false }, @@ -46705,8 +47004,8 @@ "question__title": "Strong Password Checker", "question__title_slug": "strong-password-checker", "question__hide": false, - "total_acs": 28594, - "total_submitted": 199374, + "total_acs": 28797, + "total_submitted": 200981, "frontend_question_id": 420, "is_new_question": false }, @@ -46728,8 +47027,8 @@ "question__title": "Battleships in a Board", "question__title_slug": "battleships-in-a-board", "question__hide": false, - "total_acs": 169981, - "total_submitted": 227713, + "total_acs": 171376, + "total_submitted": 229521, "frontend_question_id": 419, "is_new_question": false }, @@ -46751,8 +47050,8 @@ "question__title": "Sentence Screen Fitting", "question__title_slug": "sentence-screen-fitting", "question__hide": false, - "total_acs": 89503, - "total_submitted": 251680, + "total_acs": 89927, + "total_submitted": 252871, "frontend_question_id": 418, "is_new_question": false }, @@ -46774,8 +47073,8 @@ "question__title": "Pacific Atlantic Water Flow", "question__title_slug": "pacific-atlantic-water-flow", "question__hide": false, - "total_acs": 310468, - "total_submitted": 575566, + "total_acs": 314759, + "total_submitted": 582778, "frontend_question_id": 417, "is_new_question": false }, @@ -46797,8 +47096,8 @@ "question__title": "Partition Equal Subset Sum", "question__title_slug": "partition-equal-subset-sum", "question__hide": false, - "total_acs": 546695, - "total_submitted": 1171825, + "total_acs": 553123, + "total_submitted": 1186514, "frontend_question_id": 416, "is_new_question": false }, @@ -46820,8 +47119,8 @@ "question__title": "Add Strings", "question__title_slug": "add-strings", "question__hide": false, - "total_acs": 523499, - "total_submitted": 995833, + "total_acs": 526683, + "total_submitted": 1001904, "frontend_question_id": 415, "is_new_question": false }, @@ -46843,8 +47142,8 @@ "question__title": "Third Maximum Number", "question__title_slug": "third-maximum-number", "question__hide": false, - "total_acs": 379770, - "total_submitted": 1168365, + "total_acs": 383591, + "total_submitted": 1177963, "frontend_question_id": 414, "is_new_question": false }, @@ -46866,8 +47165,8 @@ "question__title": "Arithmetic Slices", "question__title_slug": "arithmetic-slices", "question__hide": false, - "total_acs": 254239, - "total_submitted": 390755, + "total_acs": 255763, + "total_submitted": 393002, "frontend_question_id": 413, "is_new_question": false }, @@ -46889,8 +47188,8 @@ "question__title": "Fizz Buzz", "question__title_slug": "fizz-buzz", "question__hide": false, - "total_acs": 790533, - "total_submitted": 1151258, + "total_acs": 806320, + "total_submitted": 1171447, "frontend_question_id": 412, "is_new_question": false }, @@ -46912,8 +47211,8 @@ "question__title": "Minimum Unique Word Abbreviation", "question__title_slug": "minimum-unique-word-abbreviation", "question__hide": false, - "total_acs": 14021, - "total_submitted": 35725, + "total_acs": 14027, + "total_submitted": 35742, "frontend_question_id": 411, "is_new_question": false }, @@ -46935,8 +47234,8 @@ "question__title": "Split Array Largest Sum", "question__title_slug": "split-array-largest-sum", "question__hide": false, - "total_acs": 238387, - "total_submitted": 448114, + "total_acs": 240184, + "total_submitted": 451194, "frontend_question_id": 410, "is_new_question": false }, @@ -46958,8 +47257,8 @@ "question__title": "Longest Palindrome", "question__title_slug": "longest-palindrome", "question__hide": false, - "total_acs": 401250, - "total_submitted": 734774, + "total_acs": 411333, + "total_submitted": 752754, "frontend_question_id": 409, "is_new_question": false }, @@ -46981,8 +47280,8 @@ "question__title": "Valid Word Abbreviation", "question__title_slug": "valid-word-abbreviation", "question__hide": false, - "total_acs": 113954, - "total_submitted": 327020, + "total_acs": 114427, + "total_submitted": 328373, "frontend_question_id": 408, "is_new_question": false }, @@ -47004,8 +47303,8 @@ "question__title": "Trapping Rain Water II", "question__title_slug": "trapping-rain-water-ii", "question__hide": false, - "total_acs": 74855, - "total_submitted": 157830, + "total_acs": 75164, + "total_submitted": 158396, "frontend_question_id": 407, "is_new_question": false }, @@ -47027,8 +47326,8 @@ "question__title": "Queue Reconstruction by Height", "question__title_slug": "queue-reconstruction-by-height", "question__hide": false, - "total_acs": 273879, - "total_submitted": 376345, + "total_acs": 274620, + "total_submitted": 377226, "frontend_question_id": 406, "is_new_question": false }, @@ -47050,8 +47349,8 @@ "question__title": "Convert a Number to Hexadecimal", "question__title_slug": "convert-a-number-to-hexadecimal", "question__hide": false, - "total_acs": 108468, - "total_submitted": 235327, + "total_acs": 109364, + "total_submitted": 237153, "frontend_question_id": 405, "is_new_question": false }, @@ -47073,8 +47372,8 @@ "question__title": "Sum of Left Leaves", "question__title_slug": "sum-of-left-leaves", "question__hide": false, - "total_acs": 396388, - "total_submitted": 705655, + "total_acs": 399421, + "total_submitted": 710409, "frontend_question_id": 404, "is_new_question": false }, @@ -47096,8 +47395,8 @@ "question__title": "Frog Jump", "question__title_slug": "frog-jump", "question__hide": false, - "total_acs": 170204, - "total_submitted": 394464, + "total_acs": 171005, + "total_submitted": 396316, "frontend_question_id": 403, "is_new_question": false }, @@ -47119,8 +47418,8 @@ "question__title": "Remove K Digits", "question__title_slug": "remove-k-digits", "question__hide": false, - "total_acs": 287869, - "total_submitted": 944511, + "total_acs": 289357, + "total_submitted": 949147, "frontend_question_id": 402, "is_new_question": false }, @@ -47142,8 +47441,8 @@ "question__title": "Binary Watch", "question__title_slug": "binary-watch", "question__hide": false, - "total_acs": 117207, - "total_submitted": 227684, + "total_acs": 117940, + "total_submitted": 228667, "frontend_question_id": 401, "is_new_question": false }, @@ -47165,8 +47464,8 @@ "question__title": "Nth Digit", "question__title_slug": "nth-digit", "question__hide": false, - "total_acs": 81046, - "total_submitted": 238235, + "total_acs": 81365, + "total_submitted": 238977, "frontend_question_id": 400, "is_new_question": false }, @@ -47188,8 +47487,8 @@ "question__title": "Evaluate Division", "question__title_slug": "evaluate-division", "question__hide": false, - "total_acs": 313140, - "total_submitted": 526254, + "total_acs": 315228, + "total_submitted": 529480, "frontend_question_id": 399, "is_new_question": false }, @@ -47211,8 +47510,8 @@ "question__title": "Random Pick Index", "question__title_slug": "random-pick-index", "question__hide": false, - "total_acs": 181549, - "total_submitted": 288605, + "total_acs": 182037, + "total_submitted": 289518, "frontend_question_id": 398, "is_new_question": false }, @@ -47234,8 +47533,8 @@ "question__title": "Integer Replacement", "question__title_slug": "integer-replacement", "question__hide": false, - "total_acs": 91251, - "total_submitted": 259772, + "total_acs": 91853, + "total_submitted": 261466, "frontend_question_id": 397, "is_new_question": false }, @@ -47257,8 +47556,8 @@ "question__title": "Rotate Function", "question__title_slug": "rotate-function", "question__hide": false, - "total_acs": 66761, - "total_submitted": 165420, + "total_acs": 67107, + "total_submitted": 166068, "frontend_question_id": 396, "is_new_question": false }, @@ -47280,8 +47579,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": 173809, - "total_submitted": 387895, + "total_acs": 174981, + "total_submitted": 390476, "frontend_question_id": 395, "is_new_question": false }, @@ -47303,8 +47602,8 @@ "question__title": "Decode String", "question__title_slug": "decode-string", "question__hide": false, - "total_acs": 576195, - "total_submitted": 1002122, + "total_acs": 582335, + "total_submitted": 1011424, "frontend_question_id": 394, "is_new_question": false }, @@ -47326,8 +47625,8 @@ "question__title": "UTF-8 Validation", "question__title_slug": "utf-8-validation", "question__hide": false, - "total_acs": 113513, - "total_submitted": 251257, + "total_acs": 113847, + "total_submitted": 252055, "frontend_question_id": 393, "is_new_question": false }, @@ -47349,8 +47648,8 @@ "question__title": "Is Subsequence", "question__title_slug": "is-subsequence", "question__hide": false, - "total_acs": 645868, - "total_submitted": 1311351, + "total_acs": 661241, + "total_submitted": 1346677, "frontend_question_id": 392, "is_new_question": false }, @@ -47372,8 +47671,8 @@ "question__title": "Perfect Rectangle", "question__title_slug": "perfect-rectangle", "question__hide": false, - "total_acs": 36436, - "total_submitted": 112212, + "total_acs": 36567, + "total_submitted": 112606, "frontend_question_id": 391, "is_new_question": false }, @@ -47395,8 +47694,8 @@ "question__title": "Elimination Game", "question__title_slug": "elimination-game", "question__hide": false, - "total_acs": 51843, - "total_submitted": 111367, + "total_acs": 52393, + "total_submitted": 112565, "frontend_question_id": 390, "is_new_question": false }, @@ -47418,8 +47717,8 @@ "question__title": "Find the Difference", "question__title_slug": "find-the-difference", "question__hide": false, - "total_acs": 445049, - "total_submitted": 737303, + "total_acs": 448802, + "total_submitted": 743865, "frontend_question_id": 389, "is_new_question": false }, @@ -47441,8 +47740,8 @@ "question__title": "Longest Absolute File Path", "question__title_slug": "longest-absolute-file-path", "question__hide": false, - "total_acs": 137644, - "total_submitted": 296039, + "total_acs": 138040, + "total_submitted": 296790, "frontend_question_id": 388, "is_new_question": false }, @@ -47464,8 +47763,8 @@ "question__title": "First Unique Character in a String", "question__title_slug": "first-unique-character-in-a-string", "question__hide": false, - "total_acs": 1266956, - "total_submitted": 2152845, + "total_acs": 1279132, + "total_submitted": 2170966, "frontend_question_id": 387, "is_new_question": false }, @@ -47487,8 +47786,8 @@ "question__title": "Lexicographical Numbers", "question__title_slug": "lexicographical-numbers", "question__hide": false, - "total_acs": 92857, - "total_submitted": 153429, + "total_acs": 93558, + "total_submitted": 154283, "frontend_question_id": 386, "is_new_question": false }, @@ -47510,8 +47809,8 @@ "question__title": "Mini Parser", "question__title_slug": "mini-parser", "question__hide": false, - "total_acs": 50373, - "total_submitted": 138081, + "total_acs": 50527, + "total_submitted": 138359, "frontend_question_id": 385, "is_new_question": false }, @@ -47533,8 +47832,8 @@ "question__title": "Shuffle an Array", "question__title_slug": "shuffle-an-array", "question__hide": false, - "total_acs": 285107, - "total_submitted": 494624, + "total_acs": 286599, + "total_submitted": 496977, "frontend_question_id": 384, "is_new_question": false }, @@ -47556,8 +47855,8 @@ "question__title": "Ransom Note", "question__title_slug": "ransom-note", "question__hide": false, - "total_acs": 615965, - "total_submitted": 1068985, + "total_acs": 628637, + "total_submitted": 1090748, "frontend_question_id": 383, "is_new_question": false }, @@ -47579,8 +47878,8 @@ "question__title": "Linked List Random Node", "question__title_slug": "linked-list-random-node", "question__hide": false, - "total_acs": 160207, - "total_submitted": 269320, + "total_acs": 160826, + "total_submitted": 270179, "frontend_question_id": 382, "is_new_question": false }, @@ -47602,8 +47901,8 @@ "question__title": "Insert Delete GetRandom O(1) - Duplicates allowed", "question__title_slug": "insert-delete-getrandom-o1-duplicates-allowed", "question__hide": false, - "total_acs": 119176, - "total_submitted": 333901, + "total_acs": 119843, + "total_submitted": 335777, "frontend_question_id": 381, "is_new_question": false }, @@ -47625,8 +47924,8 @@ "question__title": "Insert Delete GetRandom O(1)", "question__title_slug": "insert-delete-getrandom-o1", "question__hide": false, - "total_acs": 537925, - "total_submitted": 1034147, + "total_acs": 542275, + "total_submitted": 1042103, "frontend_question_id": 380, "is_new_question": false }, @@ -47648,8 +47947,8 @@ "question__title": "Design Phone Directory", "question__title_slug": "design-phone-directory", "question__hide": false, - "total_acs": 58915, - "total_submitted": 115769, + "total_acs": 59142, + "total_submitted": 116132, "frontend_question_id": 379, "is_new_question": false }, @@ -47671,8 +47970,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": 500919, - "total_submitted": 813149, + "total_acs": 503889, + "total_submitted": 817672, "frontend_question_id": 378, "is_new_question": false }, @@ -47694,8 +47993,8 @@ "question__title": "Combination Sum IV", "question__title_slug": "combination-sum-iv", "question__hide": false, - "total_acs": 332410, - "total_submitted": 638250, + "total_acs": 334506, + "total_submitted": 641962, "frontend_question_id": 377, "is_new_question": false }, @@ -47717,8 +48016,8 @@ "question__title": "Wiggle Subsequence", "question__title_slug": "wiggle-subsequence", "question__hide": false, - "total_acs": 207478, - "total_submitted": 430440, + "total_acs": 208644, + "total_submitted": 432723, "frontend_question_id": 376, "is_new_question": false }, @@ -47740,8 +48039,8 @@ "question__title": "Guess Number Higher or Lower II", "question__title_slug": "guess-number-higher-or-lower-ii", "question__hide": false, - "total_acs": 99839, - "total_submitted": 215335, + "total_acs": 100244, + "total_submitted": 216042, "frontend_question_id": 375, "is_new_question": false }, @@ -47763,8 +48062,8 @@ "question__title": "Guess Number Higher or Lower", "question__title_slug": "guess-number-higher-or-lower", "question__hide": false, - "total_acs": 382228, - "total_submitted": 758249, + "total_acs": 386089, + "total_submitted": 764922, "frontend_question_id": 374, "is_new_question": false }, @@ -47786,8 +48085,8 @@ "question__title": "Find K Pairs with Smallest Sums", "question__title_slug": "find-k-pairs-with-smallest-sums", "question__hide": false, - "total_acs": 187555, - "total_submitted": 488949, + "total_acs": 188582, + "total_submitted": 491650, "frontend_question_id": 373, "is_new_question": false }, @@ -47809,8 +48108,8 @@ "question__title": "Super Pow", "question__title_slug": "super-pow", "question__hide": false, - "total_acs": 54232, - "total_submitted": 145777, + "total_acs": 54589, + "total_submitted": 147070, "frontend_question_id": 372, "is_new_question": false }, @@ -47832,8 +48131,8 @@ "question__title": "Sum of Two Integers", "question__title_slug": "sum-of-two-integers", "question__hide": false, - "total_acs": 343707, - "total_submitted": 678266, + "total_acs": 346824, + "total_submitted": 684524, "frontend_question_id": 371, "is_new_question": false }, @@ -47855,8 +48154,8 @@ "question__title": "Range Addition", "question__title_slug": "range-addition", "question__hide": false, - "total_acs": 81208, - "total_submitted": 114604, + "total_acs": 81847, + "total_submitted": 115427, "frontend_question_id": 370, "is_new_question": false }, @@ -47878,8 +48177,8 @@ "question__title": "Plus One Linked List", "question__title_slug": "plus-one-linked-list", "question__hide": false, - "total_acs": 71863, - "total_submitted": 117905, + "total_acs": 72074, + "total_submitted": 118232, "frontend_question_id": 369, "is_new_question": false }, @@ -47901,8 +48200,8 @@ "question__title": "Largest Divisible Subset", "question__title_slug": "largest-divisible-subset", "question__hide": false, - "total_acs": 165862, - "total_submitted": 402211, + "total_acs": 166749, + "total_submitted": 404040, "frontend_question_id": 368, "is_new_question": false }, @@ -47924,8 +48223,8 @@ "question__title": "Valid Perfect Square", "question__title_slug": "valid-perfect-square", "question__hide": false, - "total_acs": 426965, - "total_submitted": 986908, + "total_acs": 431219, + "total_submitted": 996461, "frontend_question_id": 367, "is_new_question": false }, @@ -47947,8 +48246,8 @@ "question__title": "Find Leaves of Binary Tree", "question__title_slug": "find-leaves-of-binary-tree", "question__hide": false, - "total_acs": 222874, - "total_submitted": 278146, + "total_acs": 224844, + "total_submitted": 280547, "frontend_question_id": 366, "is_new_question": false }, @@ -47970,8 +48269,8 @@ "question__title": "Water and Jug Problem", "question__title_slug": "water-and-jug-problem", "question__hide": false, - "total_acs": 73175, - "total_submitted": 200040, + "total_acs": 73753, + "total_submitted": 201149, "frontend_question_id": 365, "is_new_question": false }, @@ -47993,8 +48292,8 @@ "question__title": "Nested List Weight Sum II", "question__title_slug": "nested-list-weight-sum-ii", "question__hide": false, - "total_acs": 126597, - "total_submitted": 188218, + "total_acs": 127063, + "total_submitted": 189243, "frontend_question_id": 364, "is_new_question": false }, @@ -48016,8 +48315,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": 115731, - "total_submitted": 262507, + "total_acs": 116039, + "total_submitted": 263289, "frontend_question_id": 363, "is_new_question": false }, @@ -48039,8 +48338,8 @@ "question__title": "Design Hit Counter", "question__title_slug": "design-hit-counter", "question__hide": false, - "total_acs": 189433, - "total_submitted": 277167, + "total_acs": 191033, + "total_submitted": 279390, "frontend_question_id": 362, "is_new_question": false }, @@ -48062,8 +48361,8 @@ "question__title": "Bomb Enemy", "question__title_slug": "bomb-enemy", "question__hide": false, - "total_acs": 70722, - "total_submitted": 139013, + "total_acs": 71008, + "total_submitted": 139516, "frontend_question_id": 361, "is_new_question": false }, @@ -48085,8 +48384,8 @@ "question__title": "Sort Transformed Array", "question__title_slug": "sort-transformed-array", "question__hide": false, - "total_acs": 59882, - "total_submitted": 109544, + "total_acs": 60077, + "total_submitted": 109826, "frontend_question_id": 360, "is_new_question": false }, @@ -48108,8 +48407,8 @@ "question__title": "Logger Rate Limiter", "question__title_slug": "logger-rate-limiter", "question__hide": false, - "total_acs": 259146, - "total_submitted": 343099, + "total_acs": 261126, + "total_submitted": 345663, "frontend_question_id": 359, "is_new_question": false }, @@ -48131,8 +48430,8 @@ "question__title": "Rearrange String k Distance Apart", "question__title_slug": "rearrange-string-k-distance-apart", "question__hide": false, - "total_acs": 55802, - "total_submitted": 148810, + "total_acs": 55949, + "total_submitted": 149139, "frontend_question_id": 358, "is_new_question": false }, @@ -48154,8 +48453,8 @@ "question__title": "Count Numbers with Unique Digits", "question__title_slug": "count-numbers-with-unique-digits", "question__hide": false, - "total_acs": 110849, - "total_submitted": 215403, + "total_acs": 111380, + "total_submitted": 216239, "frontend_question_id": 357, "is_new_question": false }, @@ -48177,8 +48476,8 @@ "question__title": "Line Reflection", "question__title_slug": "line-reflection", "question__hide": false, - "total_acs": 33203, - "total_submitted": 95874, + "total_acs": 33291, + "total_submitted": 96094, "frontend_question_id": 356, "is_new_question": false }, @@ -48200,8 +48499,8 @@ "question__title": "Design Twitter", "question__title_slug": "design-twitter", "question__hide": false, - "total_acs": 106123, - "total_submitted": 290058, + "total_acs": 107418, + "total_submitted": 292790, "frontend_question_id": 355, "is_new_question": false }, @@ -48223,8 +48522,8 @@ "question__title": "Russian Doll Envelopes", "question__title_slug": "russian-doll-envelopes", "question__hide": false, - "total_acs": 178975, - "total_submitted": 467216, + "total_acs": 179808, + "total_submitted": 469720, "frontend_question_id": 354, "is_new_question": false }, @@ -48246,8 +48545,8 @@ "question__title": "Design Snake Game", "question__title_slug": "design-snake-game", "question__hide": false, - "total_acs": 67355, - "total_submitted": 172775, + "total_acs": 68059, + "total_submitted": 174410, "frontend_question_id": 353, "is_new_question": false }, @@ -48269,8 +48568,8 @@ "question__title": "Data Stream as Disjoint Intervals", "question__title_slug": "data-stream-as-disjoint-intervals", "question__hide": false, - "total_acs": 54919, - "total_submitted": 106620, + "total_acs": 55196, + "total_submitted": 107022, "frontend_question_id": 352, "is_new_question": false }, @@ -48292,8 +48591,8 @@ "question__title": "Android Unlock Patterns", "question__title_slug": "android-unlock-patterns", "question__hide": false, - "total_acs": 67398, - "total_submitted": 131276, + "total_acs": 67533, + "total_submitted": 131508, "frontend_question_id": 351, "is_new_question": false }, @@ -48315,8 +48614,8 @@ "question__title": "Intersection of Two Arrays II", "question__title_slug": "intersection-of-two-arrays-ii", "question__hide": false, - "total_acs": 936046, - "total_submitted": 1685229, + "total_acs": 946108, + "total_submitted": 1701892, "frontend_question_id": 350, "is_new_question": false }, @@ -48338,8 +48637,8 @@ "question__title": "Intersection of Two Arrays", "question__title_slug": "intersection-of-two-arrays", "question__hide": false, - "total_acs": 760704, - "total_submitted": 1083532, + "total_acs": 767813, + "total_submitted": 1092424, "frontend_question_id": 349, "is_new_question": false }, @@ -48361,8 +48660,8 @@ "question__title": "Design Tic-Tac-Toe", "question__title_slug": "design-tic-tac-toe", "question__hide": false, - "total_acs": 201766, - "total_submitted": 350528, + "total_acs": 202553, + "total_submitted": 351876, "frontend_question_id": 348, "is_new_question": false }, @@ -48384,8 +48683,8 @@ "question__title": "Top K Frequent Elements", "question__title_slug": "top-k-frequent-elements", "question__hide": false, - "total_acs": 1206572, - "total_submitted": 1861602, + "total_acs": 1222713, + "total_submitted": 1887111, "frontend_question_id": 347, "is_new_question": false }, @@ -48407,8 +48706,8 @@ "question__title": "Moving Average from Data Stream", "question__title_slug": "moving-average-from-data-stream", "question__hide": false, - "total_acs": 292128, - "total_submitted": 379317, + "total_acs": 293610, + "total_submitted": 381141, "frontend_question_id": 346, "is_new_question": false }, @@ -48430,8 +48729,8 @@ "question__title": "Reverse Vowels of a String", "question__title_slug": "reverse-vowels-of-a-string", "question__hide": false, - "total_acs": 389466, - "total_submitted": 816697, + "total_acs": 458631, + "total_submitted": 923114, "frontend_question_id": 345, "is_new_question": false }, @@ -48453,8 +48752,8 @@ "question__title": "Reverse String", "question__title_slug": "reverse-string", "question__hide": false, - "total_acs": 1850374, - "total_submitted": 2431423, + "total_acs": 1871266, + "total_submitted": 2456389, "frontend_question_id": 344, "is_new_question": false }, @@ -48476,8 +48775,8 @@ "question__title": "Integer Break", "question__title_slug": "integer-break", "question__hide": false, - "total_acs": 211488, - "total_submitted": 382547, + "total_acs": 213106, + "total_submitted": 384995, "frontend_question_id": 343, "is_new_question": false }, @@ -48499,8 +48798,8 @@ "question__title": "Power of Four", "question__title_slug": "power-of-four", "question__hide": false, - "total_acs": 411333, - "total_submitted": 901046, + "total_acs": 414519, + "total_submitted": 907019, "frontend_question_id": 342, "is_new_question": false }, @@ -48522,8 +48821,8 @@ "question__title": "Flatten Nested List Iterator", "question__title_slug": "flatten-nested-list-iterator", "question__hide": false, - "total_acs": 346870, - "total_submitted": 563888, + "total_acs": 348323, + "total_submitted": 565899, "frontend_question_id": 341, "is_new_question": false }, @@ -48545,8 +48844,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": 297058, - "total_submitted": 621619, + "total_acs": 298394, + "total_submitted": 624028, "frontend_question_id": 340, "is_new_question": false }, @@ -48568,8 +48867,8 @@ "question__title": "Nested List Weight Sum", "question__title_slug": "nested-list-weight-sum", "question__hide": false, - "total_acs": 214417, - "total_submitted": 261573, + "total_acs": 216917, + "total_submitted": 264266, "frontend_question_id": 339, "is_new_question": false }, @@ -48591,8 +48890,8 @@ "question__title": "Counting Bits", "question__title_slug": "counting-bits", "question__hide": false, - "total_acs": 683406, - "total_submitted": 908989, + "total_acs": 690076, + "total_submitted": 917255, "frontend_question_id": 338, "is_new_question": false }, @@ -48614,8 +48913,8 @@ "question__title": "House Robber III", "question__title_slug": "house-robber-iii", "question__hide": false, - "total_acs": 314413, - "total_submitted": 584073, + "total_acs": 316263, + "total_submitted": 587242, "frontend_question_id": 337, "is_new_question": false }, @@ -48637,8 +48936,8 @@ "question__title": "Palindrome Pairs", "question__title_slug": "palindrome-pairs", "question__hide": false, - "total_acs": 185762, - "total_submitted": 527454, + "total_acs": 186655, + "total_submitted": 530433, "frontend_question_id": 336, "is_new_question": false }, @@ -48660,8 +48959,8 @@ "question__title": "Self Crossing", "question__title_slug": "self-crossing", "question__hide": false, - "total_acs": 29077, - "total_submitted": 99247, + "total_acs": 29161, + "total_submitted": 99591, "frontend_question_id": 335, "is_new_question": false }, @@ -48683,8 +48982,8 @@ "question__title": "Increasing Triplet Subsequence", "question__title_slug": "increasing-triplet-subsequence", "question__hide": false, - "total_acs": 359520, - "total_submitted": 842323, + "total_acs": 361821, + "total_submitted": 847362, "frontend_question_id": 334, "is_new_question": false }, @@ -48706,8 +49005,8 @@ "question__title": "Largest BST Subtree", "question__title_slug": "largest-bst-subtree", "question__hide": false, - "total_acs": 91385, - "total_submitted": 215631, + "total_acs": 91947, + "total_submitted": 216693, "frontend_question_id": 333, "is_new_question": false }, @@ -48729,8 +49028,8 @@ "question__title": "Reconstruct Itinerary", "question__title_slug": "reconstruct-itinerary", "question__hide": false, - "total_acs": 310627, - "total_submitted": 758602, + "total_acs": 312383, + "total_submitted": 762110, "frontend_question_id": 332, "is_new_question": false }, @@ -48752,8 +49051,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": 122408, - "total_submitted": 276613, + "total_acs": 123059, + "total_submitted": 277814, "frontend_question_id": 331, "is_new_question": false }, @@ -48775,8 +49074,8 @@ "question__title": "Patching Array", "question__title_slug": "patching-array", "question__hide": false, - "total_acs": 59002, - "total_submitted": 147593, + "total_acs": 59186, + "total_submitted": 147967, "frontend_question_id": 330, "is_new_question": false }, @@ -48798,8 +49097,8 @@ "question__title": "Longest Increasing Path in a Matrix", "question__title_slug": "longest-increasing-path-in-a-matrix", "question__hide": false, - "total_acs": 411380, - "total_submitted": 789050, + "total_acs": 414797, + "total_submitted": 794814, "frontend_question_id": 329, "is_new_question": false }, @@ -48821,8 +49120,8 @@ "question__title": "Odd Even Linked List", "question__title_slug": "odd-even-linked-list", "question__hide": false, - "total_acs": 601797, - "total_submitted": 999588, + "total_acs": 606901, + "total_submitted": 1007427, "frontend_question_id": 328, "is_new_question": false }, @@ -48844,8 +49143,8 @@ "question__title": "Count of Range Sum", "question__title_slug": "count-of-range-sum", "question__hide": false, - "total_acs": 64825, - "total_submitted": 180012, + "total_acs": 65316, + "total_submitted": 181123, "frontend_question_id": 327, "is_new_question": false }, @@ -48867,8 +49166,8 @@ "question__title": "Power of Three", "question__title_slug": "power-of-three", "question__hide": false, - "total_acs": 606917, - "total_submitted": 1342772, + "total_acs": 612923, + "total_submitted": 1355352, "frontend_question_id": 326, "is_new_question": false }, @@ -48890,8 +49189,8 @@ "question__title": "Maximum Size Subarray Sum Equals k", "question__title_slug": "maximum-size-subarray-sum-equals-k", "question__hide": false, - "total_acs": 166595, - "total_submitted": 337774, + "total_acs": 167157, + "total_submitted": 338987, "frontend_question_id": 325, "is_new_question": false }, @@ -48913,8 +49212,8 @@ "question__title": "Wiggle Sort II", "question__title_slug": "wiggle-sort-ii", "question__hide": false, - "total_acs": 132770, - "total_submitted": 403277, + "total_acs": 133478, + "total_submitted": 404972, "frontend_question_id": 324, "is_new_question": false }, @@ -48936,8 +49235,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": 299074, - "total_submitted": 482276, + "total_acs": 302271, + "total_submitted": 487244, "frontend_question_id": 323, "is_new_question": false }, @@ -48959,8 +49258,8 @@ "question__title": "Coin Change", "question__title_slug": "coin-change", "question__hide": false, - "total_acs": 1231541, - "total_submitted": 2969045, + "total_acs": 1245650, + "total_submitted": 2999234, "frontend_question_id": 322, "is_new_question": false }, @@ -48982,8 +49281,8 @@ "question__title": "Create Maximum Number", "question__title_slug": "create-maximum-number", "question__hide": false, - "total_acs": 52253, - "total_submitted": 181641, + "total_acs": 52402, + "total_submitted": 182073, "frontend_question_id": 321, "is_new_question": false }, @@ -49005,8 +49304,8 @@ "question__title": "Generalized Abbreviation", "question__title_slug": "generalized-abbreviation", "question__hide": false, - "total_acs": 63730, - "total_submitted": 111272, + "total_acs": 63859, + "total_submitted": 111425, "frontend_question_id": 320, "is_new_question": false }, @@ -49028,8 +49327,8 @@ "question__title": "Bulb Switcher", "question__title_slug": "bulb-switcher", "question__hide": false, - "total_acs": 124122, - "total_submitted": 258307, + "total_acs": 124652, + "total_submitted": 259355, "frontend_question_id": 319, "is_new_question": false }, @@ -49051,8 +49350,8 @@ "question__title": "Maximum Product of Word Lengths", "question__title_slug": "maximum-product-of-word-lengths", "question__hide": false, - "total_acs": 195699, - "total_submitted": 325480, + "total_acs": 196242, + "total_submitted": 326595, "frontend_question_id": 318, "is_new_question": false }, @@ -49074,8 +49373,8 @@ "question__title": "Shortest Distance from All Buildings", "question__title_slug": "shortest-distance-from-all-buildings", "question__hide": false, - "total_acs": 148274, - "total_submitted": 344930, + "total_acs": 148969, + "total_submitted": 347058, "frontend_question_id": 317, "is_new_question": false }, @@ -49097,8 +49396,8 @@ "question__title": "Remove Duplicate Letters", "question__title_slug": "remove-duplicate-letters", "question__hide": false, - "total_acs": 213279, - "total_submitted": 479337, + "total_acs": 214574, + "total_submitted": 481742, "frontend_question_id": 316, "is_new_question": false }, @@ -49120,8 +49419,8 @@ "question__title": "Count of Smaller Numbers After Self", "question__title_slug": "count-of-smaller-numbers-after-self", "question__hide": false, - "total_acs": 279474, - "total_submitted": 652543, + "total_acs": 280836, + "total_submitted": 655860, "frontend_question_id": 315, "is_new_question": false }, @@ -49143,8 +49442,8 @@ "question__title": "Binary Tree Vertical Order Traversal", "question__title_slug": "binary-tree-vertical-order-traversal", "question__hide": false, - "total_acs": 308472, - "total_submitted": 592688, + "total_acs": 310043, + "total_submitted": 595250, "frontend_question_id": 314, "is_new_question": false }, @@ -49166,8 +49465,8 @@ "question__title": "Super Ugly Number", "question__title_slug": "super-ugly-number", "question__hide": false, - "total_acs": 112032, - "total_submitted": 244479, + "total_acs": 112470, + "total_submitted": 245489, "frontend_question_id": 313, "is_new_question": false }, @@ -49189,8 +49488,8 @@ "question__title": "Burst Balloons", "question__title_slug": "burst-balloons", "question__hide": false, - "total_acs": 210498, - "total_submitted": 370185, + "total_acs": 211741, + "total_submitted": 372539, "frontend_question_id": 312, "is_new_question": false }, @@ -49212,8 +49511,8 @@ "question__title": "Sparse Matrix Multiplication", "question__title_slug": "sparse-matrix-multiplication", "question__hide": false, - "total_acs": 164487, - "total_submitted": 245250, + "total_acs": 165218, + "total_submitted": 246191, "frontend_question_id": 311, "is_new_question": false }, @@ -49235,8 +49534,8 @@ "question__title": "Minimum Height Trees", "question__title_slug": "minimum-height-trees", "question__hide": false, - "total_acs": 227426, - "total_submitted": 590642, + "total_acs": 229218, + "total_submitted": 594879, "frontend_question_id": 310, "is_new_question": false }, @@ -49258,8 +49557,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": 330294, - "total_submitted": 606802, + "total_acs": 333415, + "total_submitted": 611542, "frontend_question_id": 309, "is_new_question": false }, @@ -49281,8 +49580,8 @@ "question__title": "Range Sum Query 2D - Mutable", "question__title_slug": "range-sum-query-2d-mutable", "question__hide": false, - "total_acs": 69301, - "total_submitted": 164197, + "total_acs": 69667, + "total_submitted": 164703, "frontend_question_id": 308, "is_new_question": false }, @@ -49304,8 +49603,8 @@ "question__title": "Range Sum Query - Mutable", "question__title_slug": "range-sum-query-mutable", "question__hide": false, - "total_acs": 236105, - "total_submitted": 579991, + "total_acs": 237034, + "total_submitted": 582269, "frontend_question_id": 307, "is_new_question": false }, @@ -49327,8 +49626,8 @@ "question__title": "Additive Number", "question__title_slug": "additive-number", "question__hide": false, - "total_acs": 74551, - "total_submitted": 241016, + "total_acs": 74873, + "total_submitted": 242006, "frontend_question_id": 306, "is_new_question": false }, @@ -49350,8 +49649,8 @@ "question__title": "Number of Islands II", "question__title_slug": "number-of-islands-ii", "question__hide": false, - "total_acs": 122424, - "total_submitted": 310296, + "total_acs": 122884, + "total_submitted": 311539, "frontend_question_id": 305, "is_new_question": false }, @@ -49373,8 +49672,8 @@ "question__title": "Range Sum Query 2D - Immutable", "question__title_slug": "range-sum-query-2d-immutable", "question__hide": false, - "total_acs": 302270, - "total_submitted": 579986, + "total_acs": 303990, + "total_submitted": 582392, "frontend_question_id": 304, "is_new_question": false }, @@ -49396,8 +49695,8 @@ "question__title": "Range Sum Query - Immutable", "question__title_slug": "range-sum-query-immutable", "question__hide": false, - "total_acs": 397258, - "total_submitted": 684962, + "total_acs": 400071, + "total_submitted": 688271, "frontend_question_id": 303, "is_new_question": false }, @@ -49419,8 +49718,8 @@ "question__title": "Smallest Rectangle Enclosing Black Pixels", "question__title_slug": "smallest-rectangle-enclosing-black-pixels", "question__hide": false, - "total_acs": 45932, - "total_submitted": 78931, + "total_acs": 46075, + "total_submitted": 79140, "frontend_question_id": 302, "is_new_question": false }, @@ -49442,8 +49741,8 @@ "question__title": "Remove Invalid Parentheses", "question__title_slug": "remove-invalid-parentheses", "question__hide": false, - "total_acs": 369974, - "total_submitted": 785497, + "total_acs": 371097, + "total_submitted": 787567, "frontend_question_id": 301, "is_new_question": false }, @@ -49465,8 +49764,8 @@ "question__title": "Longest Increasing Subsequence", "question__title_slug": "longest-increasing-subsequence", "question__hide": false, - "total_acs": 1081076, - "total_submitted": 2097567, + "total_acs": 1091287, + "total_submitted": 2116052, "frontend_question_id": 300, "is_new_question": false }, @@ -49488,8 +49787,8 @@ "question__title": "Bulls and Cows", "question__title_slug": "bulls-and-cows", "question__hide": false, - "total_acs": 308934, - "total_submitted": 636480, + "total_acs": 311457, + "total_submitted": 640806, "frontend_question_id": 299, "is_new_question": false }, @@ -49511,8 +49810,8 @@ "question__title": "Binary Tree Longest Consecutive Sequence", "question__title_slug": "binary-tree-longest-consecutive-sequence", "question__hide": false, - "total_acs": 133778, - "total_submitted": 254826, + "total_acs": 134196, + "total_submitted": 255494, "frontend_question_id": 298, "is_new_question": false }, @@ -49534,8 +49833,8 @@ "question__title": "Serialize and Deserialize Binary Tree", "question__title_slug": "serialize-and-deserialize-binary-tree", "question__hide": false, - "total_acs": 690813, - "total_submitted": 1257720, + "total_acs": 695461, + "total_submitted": 1264917, "frontend_question_id": 297, "is_new_question": false }, @@ -49557,8 +49856,8 @@ "question__title": "Best Meeting Point", "question__title_slug": "best-meeting-point", "question__hide": false, - "total_acs": 64222, - "total_submitted": 107081, + "total_acs": 65151, + "total_submitted": 108423, "frontend_question_id": 296, "is_new_question": false }, @@ -49580,8 +49879,8 @@ "question__title": "Find Median from Data Stream", "question__title_slug": "find-median-from-data-stream", "question__hide": false, - "total_acs": 540001, - "total_submitted": 1057064, + "total_acs": 544575, + "total_submitted": 1065810, "frontend_question_id": 295, "is_new_question": false }, @@ -49603,8 +49902,8 @@ "question__title": "Flip Game II", "question__title_slug": "flip-game-ii", "question__hide": false, - "total_acs": 65983, - "total_submitted": 127459, + "total_acs": 66134, + "total_submitted": 127731, "frontend_question_id": 294, "is_new_question": false }, @@ -49626,8 +49925,8 @@ "question__title": "Flip Game", "question__title_slug": "flip-game", "question__hide": false, - "total_acs": 61827, - "total_submitted": 98171, + "total_acs": 61971, + "total_submitted": 98373, "frontend_question_id": 293, "is_new_question": false }, @@ -49649,8 +49948,8 @@ "question__title": "Nim Game", "question__title_slug": "nim-game", "question__hide": false, - "total_acs": 299002, - "total_submitted": 535300, + "total_acs": 300590, + "total_submitted": 537978, "frontend_question_id": 292, "is_new_question": false }, @@ -49672,8 +49971,8 @@ "question__title": "Word Pattern II", "question__title_slug": "word-pattern-ii", "question__hide": false, - "total_acs": 64982, - "total_submitted": 138663, + "total_acs": 65183, + "total_submitted": 139060, "frontend_question_id": 291, "is_new_question": false }, @@ -49695,8 +49994,8 @@ "question__title": "Word Pattern", "question__title_slug": "word-pattern", "question__hide": false, - "total_acs": 400997, - "total_submitted": 992620, + "total_acs": 404335, + "total_submitted": 1000315, "frontend_question_id": 290, "is_new_question": false }, @@ -49718,8 +50017,8 @@ "question__title": "Game of Life", "question__title_slug": "game-of-life", "question__hide": false, - "total_acs": 371245, - "total_submitted": 557139, + "total_acs": 373051, + "total_submitted": 559327, "frontend_question_id": 289, "is_new_question": false }, @@ -49741,8 +50040,8 @@ "question__title": "Unique Word Abbreviation", "question__title_slug": "unique-word-abbreviation", "question__hide": false, - "total_acs": 67382, - "total_submitted": 266763, + "total_acs": 67605, + "total_submitted": 267181, "frontend_question_id": 288, "is_new_question": false }, @@ -49764,8 +50063,8 @@ "question__title": "Find the Duplicate Number", "question__title_slug": "find-the-duplicate-number", "question__hide": false, - "total_acs": 1031527, - "total_submitted": 1744891, + "total_acs": 1041650, + "total_submitted": 1761860, "frontend_question_id": 287, "is_new_question": false }, @@ -49787,8 +50086,8 @@ "question__title": "Walls and Gates", "question__title_slug": "walls-and-gates", "question__hide": false, - "total_acs": 251442, - "total_submitted": 417540, + "total_acs": 253705, + "total_submitted": 421030, "frontend_question_id": 286, "is_new_question": false }, @@ -49810,8 +50109,8 @@ "question__title": "Inorder Successor in BST", "question__title_slug": "inorder-successor-in-bst", "question__hide": false, - "total_acs": 289135, - "total_submitted": 598617, + "total_acs": 290549, + "total_submitted": 600913, "frontend_question_id": 285, "is_new_question": false }, @@ -49833,8 +50132,8 @@ "question__title": "Peeking Iterator", "question__title_slug": "peeking-iterator", "question__hide": false, - "total_acs": 199478, - "total_submitted": 342608, + "total_acs": 200063, + "total_submitted": 343382, "frontend_question_id": 284, "is_new_question": false }, @@ -49856,8 +50155,8 @@ "question__title": "Move Zeroes", "question__title_slug": "move-zeroes", "question__hide": false, - "total_acs": 1954046, - "total_submitted": 3186977, + "total_acs": 1974925, + "total_submitted": 3219755, "frontend_question_id": 283, "is_new_question": false }, @@ -49879,8 +50178,8 @@ "question__title": "Expression Add Operators", "question__title_slug": "expression-add-operators", "question__hide": false, - "total_acs": 192090, - "total_submitted": 489701, + "total_acs": 192616, + "total_submitted": 491153, "frontend_question_id": 282, "is_new_question": false }, @@ -49902,8 +50201,8 @@ "question__title": "Zigzag Iterator", "question__title_slug": "zigzag-iterator", "question__hide": false, - "total_acs": 84038, - "total_submitted": 134909, + "total_acs": 84255, + "total_submitted": 135164, "frontend_question_id": 281, "is_new_question": false }, @@ -49925,8 +50224,8 @@ "question__title": "Wiggle Sort", "question__title_slug": "wiggle-sort", "question__hide": false, - "total_acs": 119744, - "total_submitted": 180450, + "total_acs": 120160, + "total_submitted": 180963, "frontend_question_id": 280, "is_new_question": false }, @@ -49948,8 +50247,8 @@ "question__title": "Perfect Squares", "question__title_slug": "perfect-squares", "question__hide": false, - "total_acs": 576511, - "total_submitted": 1105589, + "total_acs": 579614, + "total_submitted": 1111942, "frontend_question_id": 279, "is_new_question": false }, @@ -49971,8 +50270,8 @@ "question__title": "First Bad Version", "question__title_slug": "first-bad-version", "question__hide": false, - "total_acs": 1264833, - "total_submitted": 2948758, + "total_acs": 1282075, + "total_submitted": 2986063, "frontend_question_id": 278, "is_new_question": false }, @@ -49994,8 +50293,8 @@ "question__title": "Find the Celebrity", "question__title_slug": "find-the-celebrity", "question__hide": false, - "total_acs": 238973, - "total_submitted": 512523, + "total_acs": 239702, + "total_submitted": 514739, "frontend_question_id": 277, "is_new_question": false }, @@ -50017,8 +50316,8 @@ "question__title": "Paint Fence", "question__title_slug": "paint-fence", "question__hide": false, - "total_acs": 93189, - "total_submitted": 211699, + "total_acs": 93649, + "total_submitted": 212440, "frontend_question_id": 276, "is_new_question": false }, @@ -50040,8 +50339,8 @@ "question__title": "H-Index II", "question__title_slug": "h-index-ii", "question__hide": false, - "total_acs": 167945, - "total_submitted": 449280, + "total_acs": 168481, + "total_submitted": 450600, "frontend_question_id": 275, "is_new_question": false }, @@ -50063,8 +50362,8 @@ "question__title": "H-Index", "question__title_slug": "h-index", "question__hide": false, - "total_acs": 248983, - "total_submitted": 653264, + "total_acs": 250160, + "total_submitted": 656113, "frontend_question_id": 274, "is_new_question": false }, @@ -50086,8 +50385,8 @@ "question__title": "Integer to English Words", "question__title_slug": "integer-to-english-words", "question__hide": false, - "total_acs": 329503, - "total_submitted": 1102290, + "total_acs": 331009, + "total_submitted": 1107317, "frontend_question_id": 273, "is_new_question": false }, @@ -50109,8 +50408,8 @@ "question__title": "Closest Binary Search Tree Value II", "question__title_slug": "closest-binary-search-tree-value-ii", "question__hide": false, - "total_acs": 107821, - "total_submitted": 185251, + "total_acs": 108129, + "total_submitted": 185649, "frontend_question_id": 272, "is_new_question": false }, @@ -50132,8 +50431,8 @@ "question__title": "Encode and Decode Strings", "question__title_slug": "encode-and-decode-strings", "question__hide": false, - "total_acs": 123256, - "total_submitted": 297823, + "total_acs": 124948, + "total_submitted": 300682, "frontend_question_id": 271, "is_new_question": false }, @@ -50155,8 +50454,8 @@ "question__title": "Closest Binary Search Tree Value", "question__title_slug": "closest-binary-search-tree-value", "question__hide": false, - "total_acs": 271876, - "total_submitted": 498433, + "total_acs": 273058, + "total_submitted": 500306, "frontend_question_id": 270, "is_new_question": false }, @@ -50178,8 +50477,8 @@ "question__title": "Alien Dictionary", "question__title_slug": "alien-dictionary", "question__hide": false, - "total_acs": 318826, - "total_submitted": 904459, + "total_acs": 320521, + "total_submitted": 908879, "frontend_question_id": 269, "is_new_question": false }, @@ -50201,8 +50500,8 @@ "question__title": "Missing Number", "question__title_slug": "missing-number", "question__hide": false, - "total_acs": 1280796, - "total_submitted": 2081977, + "total_acs": 1297855, + "total_submitted": 2106678, "frontend_question_id": 268, "is_new_question": false }, @@ -50224,8 +50523,8 @@ "question__title": "Palindrome Permutation II", "question__title_slug": "palindrome-permutation-ii", "question__hide": false, - "total_acs": 58856, - "total_submitted": 145506, + "total_acs": 59073, + "total_submitted": 145896, "frontend_question_id": 267, "is_new_question": false }, @@ -50247,8 +50546,8 @@ "question__title": "Palindrome Permutation", "question__title_slug": "palindrome-permutation", "question__hide": false, - "total_acs": 174687, - "total_submitted": 265354, + "total_acs": 175207, + "total_submitted": 266129, "frontend_question_id": 266, "is_new_question": false }, @@ -50270,8 +50569,8 @@ "question__title": "Paint House II", "question__title_slug": "paint-house-ii", "question__hide": false, - "total_acs": 104011, - "total_submitted": 199024, + "total_acs": 104571, + "total_submitted": 199751, "frontend_question_id": 265, "is_new_question": false }, @@ -50293,8 +50592,8 @@ "question__title": "Ugly Number II", "question__title_slug": "ugly-number-ii", "question__hide": false, - "total_acs": 285346, - "total_submitted": 618441, + "total_acs": 286968, + "total_submitted": 621443, "frontend_question_id": 264, "is_new_question": false }, @@ -50316,8 +50615,8 @@ "question__title": "Ugly Number", "question__title_slug": "ugly-number", "question__hide": false, - "total_acs": 330613, - "total_submitted": 793564, + "total_acs": 333153, + "total_submitted": 800317, "frontend_question_id": 263, "is_new_question": false }, @@ -50339,8 +50638,8 @@ "question__title": "Trips and Users", "question__title_slug": "trips-and-users", "question__hide": false, - "total_acs": 132088, - "total_submitted": 343438, + "total_acs": 133100, + "total_submitted": 346140, "frontend_question_id": 262, "is_new_question": false }, @@ -50362,8 +50661,8 @@ "question__title": "Graph Valid Tree", "question__title_slug": "graph-valid-tree", "question__hide": false, - "total_acs": 310650, - "total_submitted": 663669, + "total_acs": 313426, + "total_submitted": 669133, "frontend_question_id": 261, "is_new_question": false }, @@ -50385,8 +50684,8 @@ "question__title": "Single Number III", "question__title_slug": "single-number-iii", "question__hide": false, - "total_acs": 275261, - "total_submitted": 408107, + "total_acs": 277128, + "total_submitted": 410710, "frontend_question_id": 260, "is_new_question": false }, @@ -50408,8 +50707,8 @@ "question__title": "3Sum Smaller", "question__title_slug": "3sum-smaller", "question__hide": false, - "total_acs": 128027, - "total_submitted": 252535, + "total_acs": 128654, + "total_submitted": 253723, "frontend_question_id": 259, "is_new_question": false }, @@ -50431,8 +50730,8 @@ "question__title": "Add Digits", "question__title_slug": "add-digits", "question__hide": false, - "total_acs": 512149, - "total_submitted": 808066, + "total_acs": 516104, + "total_submitted": 813285, "frontend_question_id": 258, "is_new_question": false }, @@ -50454,8 +50753,8 @@ "question__title": "Binary Tree Paths", "question__title_slug": "binary-tree-paths", "question__hide": false, - "total_acs": 570807, - "total_submitted": 943201, + "total_acs": 574470, + "total_submitted": 947719, "frontend_question_id": 257, "is_new_question": false }, @@ -50477,8 +50776,8 @@ "question__title": "Paint House", "question__title_slug": "paint-house", "question__hide": false, - "total_acs": 176607, - "total_submitted": 291721, + "total_acs": 177663, + "total_submitted": 293085, "frontend_question_id": 256, "is_new_question": false }, @@ -50500,8 +50799,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": 68203, - "total_submitted": 142066, + "total_acs": 68353, + "total_submitted": 142312, "frontend_question_id": 255, "is_new_question": false }, @@ -50523,8 +50822,8 @@ "question__title": "Factor Combinations", "question__title_slug": "factor-combinations", "question__hide": false, - "total_acs": 114618, - "total_submitted": 235009, + "total_acs": 115317, + "total_submitted": 236319, "frontend_question_id": 254, "is_new_question": false }, @@ -50546,8 +50845,8 @@ "question__title": "Meeting Rooms II", "question__title_slug": "meeting-rooms-ii", "question__hide": false, - "total_acs": 728751, - "total_submitted": 1444649, + "total_acs": 734936, + "total_submitted": 1455866, "frontend_question_id": 253, "is_new_question": false }, @@ -50569,8 +50868,8 @@ "question__title": "Meeting Rooms", "question__title_slug": "meeting-rooms", "question__hide": false, - "total_acs": 311808, - "total_submitted": 546657, + "total_acs": 314671, + "total_submitted": 551643, "frontend_question_id": 252, "is_new_question": false }, @@ -50592,8 +50891,8 @@ "question__title": "Flatten 2D Vector", "question__title_slug": "flatten-2d-vector", "question__hide": false, - "total_acs": 113974, - "total_submitted": 233126, + "total_acs": 114432, + "total_submitted": 234001, "frontend_question_id": 251, "is_new_question": false }, @@ -50615,8 +50914,8 @@ "question__title": "Count Univalue Subtrees", "question__title_slug": "count-univalue-subtrees", "question__hide": false, - "total_acs": 132119, - "total_submitted": 239148, + "total_acs": 132750, + "total_submitted": 240194, "frontend_question_id": 250, "is_new_question": false }, @@ -50638,8 +50937,8 @@ "question__title": "Group Shifted Strings", "question__title_slug": "group-shifted-strings", "question__hide": false, - "total_acs": 184586, - "total_submitted": 287300, + "total_acs": 185257, + "total_submitted": 288293, "frontend_question_id": 249, "is_new_question": false }, @@ -50661,8 +50960,8 @@ "question__title": "Strobogrammatic Number III", "question__title_slug": "strobogrammatic-number-iii", "question__hide": false, - "total_acs": 34709, - "total_submitted": 83226, + "total_acs": 34738, + "total_submitted": 83265, "frontend_question_id": 248, "is_new_question": false }, @@ -50684,8 +50983,8 @@ "question__title": "Strobogrammatic Number II", "question__title_slug": "strobogrammatic-number-ii", "question__hide": false, - "total_acs": 125781, - "total_submitted": 244531, + "total_acs": 126012, + "total_submitted": 245007, "frontend_question_id": 247, "is_new_question": false }, @@ -50707,8 +51006,8 @@ "question__title": "Strobogrammatic Number", "question__title_slug": "strobogrammatic-number", "question__hide": false, - "total_acs": 150779, - "total_submitted": 316856, + "total_acs": 151187, + "total_submitted": 317769, "frontend_question_id": 246, "is_new_question": false }, @@ -50730,8 +51029,8 @@ "question__title": "Shortest Word Distance III", "question__title_slug": "shortest-word-distance-iii", "question__hide": false, - "total_acs": 72302, - "total_submitted": 125778, + "total_acs": 72485, + "total_submitted": 126116, "frontend_question_id": 245, "is_new_question": false }, @@ -50753,8 +51052,8 @@ "question__title": "Shortest Word Distance II", "question__title_slug": "shortest-word-distance-ii", "question__hide": false, - "total_acs": 142812, - "total_submitted": 235249, + "total_acs": 143492, + "total_submitted": 236259, "frontend_question_id": 244, "is_new_question": false }, @@ -50776,8 +51075,8 @@ "question__title": "Shortest Word Distance", "question__title_slug": "shortest-word-distance", "question__hide": false, - "total_acs": 192630, - "total_submitted": 296818, + "total_acs": 193468, + "total_submitted": 298055, "frontend_question_id": 243, "is_new_question": false }, @@ -50799,8 +51098,8 @@ "question__title": "Valid Anagram", "question__title_slug": "valid-anagram", "question__hide": false, - "total_acs": 1757389, - "total_submitted": 2802674, + "total_acs": 1788433, + "total_submitted": 2850428, "frontend_question_id": 242, "is_new_question": false }, @@ -50822,8 +51121,8 @@ "question__title": "Different Ways to Add Parentheses", "question__title_slug": "different-ways-to-add-parentheses", "question__hide": false, - "total_acs": 181376, - "total_submitted": 287091, + "total_acs": 182461, + "total_submitted": 288460, "frontend_question_id": 241, "is_new_question": false }, @@ -50845,8 +51144,8 @@ "question__title": "Search a 2D Matrix II", "question__title_slug": "search-a-2d-matrix-ii", "question__hide": false, - "total_acs": 728389, - "total_submitted": 1440993, + "total_acs": 733137, + "total_submitted": 1448823, "frontend_question_id": 240, "is_new_question": false }, @@ -50868,8 +51167,8 @@ "question__title": "Sliding Window Maximum", "question__title_slug": "sliding-window-maximum", "question__hide": false, - "total_acs": 679418, - "total_submitted": 1456914, + "total_acs": 686253, + "total_submitted": 1471812, "frontend_question_id": 239, "is_new_question": false }, @@ -50891,8 +51190,8 @@ "question__title": "Product of Array Except Self", "question__title_slug": "product-of-array-except-self", "question__hide": false, - "total_acs": 1415229, - "total_submitted": 2188054, + "total_acs": 1431660, + "total_submitted": 2212062, "frontend_question_id": 238, "is_new_question": false }, @@ -50914,8 +51213,8 @@ "question__title": "Delete Node in a Linked List", "question__title_slug": "delete-node-in-a-linked-list", "question__hide": false, - "total_acs": 978150, - "total_submitted": 1301915, + "total_acs": 985007, + "total_submitted": 1309457, "frontend_question_id": 237, "is_new_question": false }, @@ -50937,8 +51236,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": 1197436, - "total_submitted": 2067519, + "total_acs": 1205625, + "total_submitted": 2078886, "frontend_question_id": 236, "is_new_question": false }, @@ -50960,8 +51259,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": 1025667, - "total_submitted": 1705672, + "total_acs": 1038138, + "total_submitted": 1723455, "frontend_question_id": 235, "is_new_question": false }, @@ -50983,8 +51282,8 @@ "question__title": "Palindrome Linked List", "question__title_slug": "palindrome-linked-list", "question__hide": false, - "total_acs": 1257067, - "total_submitted": 2541803, + "total_acs": 1273225, + "total_submitted": 2569823, "frontend_question_id": 234, "is_new_question": false }, @@ -51006,8 +51305,8 @@ "question__title": "Number of Digit One", "question__title_slug": "number-of-digit-one", "question__hide": false, - "total_acs": 70695, - "total_submitted": 206894, + "total_acs": 71074, + "total_submitted": 208050, "frontend_question_id": 233, "is_new_question": false }, @@ -51029,8 +51328,8 @@ "question__title": "Implement Queue using Stacks", "question__title_slug": "implement-queue-using-stacks", "question__hide": false, - "total_acs": 520621, - "total_submitted": 852897, + "total_acs": 527717, + "total_submitted": 862689, "frontend_question_id": 232, "is_new_question": false }, @@ -51052,8 +51351,8 @@ "question__title": "Power of Two", "question__title_slug": "power-of-two", "question__hide": false, - "total_acs": 761928, - "total_submitted": 1668883, + "total_acs": 771560, + "total_submitted": 1689031, "frontend_question_id": 231, "is_new_question": false }, @@ -51075,8 +51374,8 @@ "question__title": "Kth Smallest Element in a BST", "question__title_slug": "kth-smallest-element-in-a-bst", "question__hide": false, - "total_acs": 963923, - "total_submitted": 1391033, + "total_acs": 974016, + "total_submitted": 1403879, "frontend_question_id": 230, "is_new_question": false }, @@ -51098,8 +51397,8 @@ "question__title": "Majority Element II", "question__title_slug": "majority-element-ii", "question__hide": false, - "total_acs": 351508, - "total_submitted": 798346, + "total_acs": 355136, + "total_submitted": 804640, "frontend_question_id": 229, "is_new_question": false }, @@ -51121,8 +51420,8 @@ "question__title": "Summary Ranges", "question__title_slug": "summary-ranges", "question__hide": false, - "total_acs": 318839, - "total_submitted": 681106, + "total_acs": 320859, + "total_submitted": 684878, "frontend_question_id": 228, "is_new_question": false }, @@ -51144,8 +51443,8 @@ "question__title": "Basic Calculator II", "question__title_slug": "basic-calculator-ii", "question__hide": false, - "total_acs": 481481, - "total_submitted": 1141290, + "total_acs": 484501, + "total_submitted": 1147850, "frontend_question_id": 227, "is_new_question": false }, @@ -51167,8 +51466,8 @@ "question__title": "Invert Binary Tree", "question__title_slug": "invert-binary-tree", "question__hide": false, - "total_acs": 1292447, - "total_submitted": 1765798, + "total_acs": 1309766, + "total_submitted": 1787210, "frontend_question_id": 226, "is_new_question": false }, @@ -51190,8 +51489,8 @@ "question__title": "Implement Stack using Queues", "question__title_slug": "implement-stack-using-queues", "question__hide": false, - "total_acs": 395078, - "total_submitted": 687478, + "total_acs": 399219, + "total_submitted": 693090, "frontend_question_id": 225, "is_new_question": false }, @@ -51213,8 +51512,8 @@ "question__title": "Basic Calculator", "question__title_slug": "basic-calculator", "question__hide": false, - "total_acs": 325819, - "total_submitted": 791895, + "total_acs": 327830, + "total_submitted": 796167, "frontend_question_id": 224, "is_new_question": false }, @@ -51236,8 +51535,8 @@ "question__title": "Rectangle Area", "question__title_slug": "rectangle-area", "question__hide": false, - "total_acs": 144168, - "total_submitted": 353174, + "total_acs": 144735, + "total_submitted": 354128, "frontend_question_id": 223, "is_new_question": false }, @@ -51259,8 +51558,8 @@ "question__title": "Count Complete Tree Nodes", "question__title_slug": "count-complete-tree-nodes", "question__hide": false, - "total_acs": 454120, - "total_submitted": 790965, + "total_acs": 456921, + "total_submitted": 794368, "frontend_question_id": 222, "is_new_question": false }, @@ -51282,8 +51581,8 @@ "question__title": "Maximal Square", "question__title_slug": "maximal-square", "question__hide": false, - "total_acs": 544705, - "total_submitted": 1224853, + "total_acs": 547762, + "total_submitted": 1230389, "frontend_question_id": 221, "is_new_question": false }, @@ -51305,8 +51604,8 @@ "question__title": "Contains Duplicate III", "question__title_slug": "contains-duplicate-iii", "question__hide": false, - "total_acs": 219066, - "total_submitted": 999835, + "total_acs": 219913, + "total_submitted": 1002497, "frontend_question_id": 220, "is_new_question": false }, @@ -51328,8 +51627,8 @@ "question__title": "Contains Duplicate II", "question__title_slug": "contains-duplicate-ii", "question__hide": false, - "total_acs": 600706, - "total_submitted": 1421590, + "total_acs": 606617, + "total_submitted": 1434721, "frontend_question_id": 219, "is_new_question": false }, @@ -51351,8 +51650,8 @@ "question__title": "The Skyline Problem", "question__title_slug": "the-skyline-problem", "question__hide": false, - "total_acs": 251663, - "total_submitted": 605893, + "total_acs": 252957, + "total_submitted": 608317, "frontend_question_id": 218, "is_new_question": false }, @@ -51374,8 +51673,8 @@ "question__title": "Contains Duplicate", "question__title_slug": "contains-duplicate", "question__hide": false, - "total_acs": 2184464, - "total_submitted": 3565025, + "total_acs": 2225377, + "total_submitted": 3631025, "frontend_question_id": 217, "is_new_question": false }, @@ -51397,8 +51696,8 @@ "question__title": "Combination Sum III", "question__title_slug": "combination-sum-iii", "question__hide": false, - "total_acs": 367453, - "total_submitted": 548098, + "total_acs": 369734, + "total_submitted": 551065, "frontend_question_id": 216, "is_new_question": false }, @@ -51420,8 +51719,8 @@ "question__title": "Kth Largest Element in an Array", "question__title_slug": "kth-largest-element-in-an-array", "question__hide": false, - "total_acs": 1593189, - "total_submitted": 2425335, + "total_acs": 1605713, + "total_submitted": 2442616, "frontend_question_id": 215, "is_new_question": false }, @@ -51443,8 +51742,8 @@ "question__title": "Shortest Palindrome", "question__title_slug": "shortest-palindrome", "question__hide": false, - "total_acs": 146975, - "total_submitted": 456606, + "total_acs": 147674, + "total_submitted": 458593, "frontend_question_id": 214, "is_new_question": false }, @@ -51466,8 +51765,8 @@ "question__title": "House Robber II", "question__title_slug": "house-robber-ii", "question__hide": false, - "total_acs": 500941, - "total_submitted": 1231783, + "total_acs": 507359, + "total_submitted": 1246588, "frontend_question_id": 213, "is_new_question": false }, @@ -51489,8 +51788,8 @@ "question__title": "Word Search II", "question__title_slug": "word-search-ii", "question__hide": false, - "total_acs": 488985, - "total_submitted": 1324518, + "total_acs": 525082, + "total_submitted": 1422274, "frontend_question_id": 212, "is_new_question": false }, @@ -51512,8 +51811,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": 447427, - "total_submitted": 1035936, + "total_acs": 450114, + "total_submitted": 1044236, "frontend_question_id": 211, "is_new_question": false }, @@ -51535,8 +51834,8 @@ "question__title": "Course Schedule II", "question__title_slug": "course-schedule-ii", "question__hide": false, - "total_acs": 737054, - "total_submitted": 1537459, + "total_acs": 744420, + "total_submitted": 1550652, "frontend_question_id": 210, "is_new_question": false }, @@ -51558,8 +51857,8 @@ "question__title": "Minimum Size Subarray Sum", "question__title_slug": "minimum-size-subarray-sum", "question__hide": false, - "total_acs": 620286, - "total_submitted": 1395800, + "total_acs": 626566, + "total_submitted": 1408034, "frontend_question_id": 209, "is_new_question": false }, @@ -51581,8 +51880,8 @@ "question__title": "Implement Trie (Prefix Tree)", "question__title_slug": "implement-trie-prefix-tree", "question__hide": false, - "total_acs": 691978, - "total_submitted": 1138655, + "total_acs": 699813, + "total_submitted": 1148669, "frontend_question_id": 208, "is_new_question": false }, @@ -51604,8 +51903,8 @@ "question__title": "Course Schedule", "question__title_slug": "course-schedule", "question__hide": false, - "total_acs": 1046119, - "total_submitted": 2306969, + "total_acs": 1057592, + "total_submitted": 2331397, "frontend_question_id": 207, "is_new_question": false }, @@ -51627,8 +51926,8 @@ "question__title": "Reverse Linked List", "question__title_slug": "reverse-linked-list", "question__hide": false, - "total_acs": 2636484, - "total_submitted": 3643954, + "total_acs": 2671852, + "total_submitted": 3687280, "frontend_question_id": 206, "is_new_question": false }, @@ -51650,8 +51949,8 @@ "question__title": "Isomorphic Strings", "question__title_slug": "isomorphic-strings", "question__hide": false, - "total_acs": 683278, - "total_submitted": 1606300, + "total_acs": 699155, + "total_submitted": 1642331, "frontend_question_id": 205, "is_new_question": false }, @@ -51673,8 +51972,8 @@ "question__title": "Count Primes", "question__title_slug": "count-primes", "question__hide": false, - "total_acs": 669776, - "total_submitted": 2024969, + "total_acs": 674515, + "total_submitted": 2039403, "frontend_question_id": 204, "is_new_question": false }, @@ -51696,8 +51995,8 @@ "question__title": "Remove Linked List Elements", "question__title_slug": "remove-linked-list-elements", "question__hide": false, - "total_acs": 824574, - "total_submitted": 1843059, + "total_acs": 832943, + "total_submitted": 1858317, "frontend_question_id": 203, "is_new_question": false }, @@ -51719,8 +52018,8 @@ "question__title": "Happy Number", "question__title_slug": "happy-number", "question__hide": false, - "total_acs": 983241, - "total_submitted": 1809570, + "total_acs": 996888, + "total_submitted": 1832549, "frontend_question_id": 202, "is_new_question": false }, @@ -51742,8 +52041,8 @@ "question__title": "Bitwise AND of Numbers Range", "question__title_slug": "bitwise-and-of-numbers-range", "question__hide": false, - "total_acs": 228659, - "total_submitted": 541319, + "total_acs": 229550, + "total_submitted": 543159, "frontend_question_id": 201, "is_new_question": false }, @@ -51765,8 +52064,8 @@ "question__title": "Number of Islands", "question__title_slug": "number-of-islands", "question__hide": false, - "total_acs": 1929971, - "total_submitted": 3434546, + "total_acs": 1951321, + "total_submitted": 3466695, "frontend_question_id": 200, "is_new_question": false }, @@ -51788,8 +52087,8 @@ "question__title": "Binary Tree Right Side View", "question__title_slug": "binary-tree-right-side-view", "question__hide": false, - "total_acs": 853512, - "total_submitted": 1395716, + "total_acs": 861237, + "total_submitted": 1407282, "frontend_question_id": 199, "is_new_question": false }, @@ -51811,8 +52110,8 @@ "question__title": "House Robber", "question__title_slug": "house-robber", "question__hide": false, - "total_acs": 1373986, - "total_submitted": 2823736, + "total_acs": 1389063, + "total_submitted": 2851195, "frontend_question_id": 198, "is_new_question": false }, @@ -51834,8 +52133,8 @@ "question__title": "Rising Temperature", "question__title_slug": "rising-temperature", "question__hide": false, - "total_acs": 275522, - "total_submitted": 619473, + "total_acs": 279327, + "total_submitted": 626576, "frontend_question_id": 197, "is_new_question": false }, @@ -51857,8 +52156,8 @@ "question__title": "Delete Duplicate Emails", "question__title_slug": "delete-duplicate-emails", "question__hide": false, - "total_acs": 301790, - "total_submitted": 515826, + "total_acs": 307611, + "total_submitted": 523043, "frontend_question_id": 196, "is_new_question": false }, @@ -51880,8 +52179,8 @@ "question__title": "Tenth Line", "question__title_slug": "tenth-line", "question__hide": false, - "total_acs": 80021, - "total_submitted": 242943, + "total_acs": 80627, + "total_submitted": 244685, "frontend_question_id": 195, "is_new_question": false }, @@ -51903,8 +52202,8 @@ "question__title": "Transpose File", "question__title_slug": "transpose-file", "question__hide": false, - "total_acs": 19855, - "total_submitted": 78352, + "total_acs": 19957, + "total_submitted": 78736, "frontend_question_id": 194, "is_new_question": false }, @@ -51926,8 +52225,8 @@ "question__title": "Valid Phone Numbers", "question__title_slug": "valid-phone-numbers", "question__hide": false, - "total_acs": 61697, - "total_submitted": 237274, + "total_acs": 62215, + "total_submitted": 239135, "frontend_question_id": 193, "is_new_question": false }, @@ -51949,8 +52248,8 @@ "question__title": "Word Frequency", "question__title_slug": "word-frequency", "question__hide": false, - "total_acs": 39940, - "total_submitted": 155664, + "total_acs": 40175, + "total_submitted": 156466, "frontend_question_id": 192, "is_new_question": false }, @@ -51972,8 +52271,8 @@ "question__title": "Number of 1 Bits", "question__title_slug": "number-of-1-bits", "question__hide": false, - "total_acs": 943276, - "total_submitted": 1459144, + "total_acs": 956198, + "total_submitted": 1474956, "frontend_question_id": 191, "is_new_question": false }, @@ -51995,8 +52294,8 @@ "question__title": "Reverse Bits", "question__title_slug": "reverse-bits", "question__hide": false, - "total_acs": 552163, - "total_submitted": 1061168, + "total_acs": 558360, + "total_submitted": 1068913, "frontend_question_id": 190, "is_new_question": false }, @@ -52018,8 +52317,8 @@ "question__title": "Rotate Array", "question__title_slug": "rotate-array", "question__hide": false, - "total_acs": 1305540, - "total_submitted": 3332004, + "total_acs": 1319404, + "total_submitted": 3365273, "frontend_question_id": 189, "is_new_question": false }, @@ -52041,8 +52340,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": 326780, - "total_submitted": 863141, + "total_acs": 329513, + "total_submitted": 867489, "frontend_question_id": 188, "is_new_question": false }, @@ -52064,8 +52363,8 @@ "question__title": "Repeated DNA Sequences", "question__title_slug": "repeated-dna-sequences", "question__hide": false, - "total_acs": 297749, - "total_submitted": 645358, + "total_acs": 299880, + "total_submitted": 648853, "frontend_question_id": 187, "is_new_question": false }, @@ -52087,8 +52386,8 @@ "question__title": "Reverse Words in a String II", "question__title_slug": "reverse-words-in-a-string-ii", "question__hide": false, - "total_acs": 142558, - "total_submitted": 272440, + "total_acs": 142988, + "total_submitted": 272953, "frontend_question_id": 186, "is_new_question": false }, @@ -52110,8 +52409,8 @@ "question__title": "Department Top Three Salaries", "question__title_slug": "department-top-three-salaries", "question__hide": false, - "total_acs": 193472, - "total_submitted": 387550, + "total_acs": 195318, + "total_submitted": 390296, "frontend_question_id": 185, "is_new_question": false }, @@ -52133,8 +52432,8 @@ "question__title": "Department Highest Salary", "question__title_slug": "department-highest-salary", "question__hide": false, - "total_acs": 260767, - "total_submitted": 526420, + "total_acs": 263627, + "total_submitted": 530896, "frontend_question_id": 184, "is_new_question": false }, @@ -52156,8 +52455,8 @@ "question__title": "Customers Who Never Order", "question__title_slug": "customers-who-never-order", "question__hide": false, - "total_acs": 489750, - "total_submitted": 722915, + "total_acs": 500109, + "total_submitted": 736096, "frontend_question_id": 183, "is_new_question": false }, @@ -52179,8 +52478,8 @@ "question__title": "Duplicate Emails", "question__title_slug": "duplicate-emails", "question__hide": false, - "total_acs": 425637, - "total_submitted": 603225, + "total_acs": 431525, + "total_submitted": 610825, "frontend_question_id": 182, "is_new_question": false }, @@ -52202,8 +52501,8 @@ "question__title": "Employees Earning More Than Their Managers", "question__title_slug": "employees-earning-more-than-their-managers", "question__hide": false, - "total_acs": 422875, - "total_submitted": 617479, + "total_acs": 427830, + "total_submitted": 623647, "frontend_question_id": 181, "is_new_question": false }, @@ -52225,8 +52524,8 @@ "question__title": "Consecutive Numbers", "question__title_slug": "consecutive-numbers", "question__hide": false, - "total_acs": 220753, - "total_submitted": 472617, + "total_acs": 222990, + "total_submitted": 476972, "frontend_question_id": 180, "is_new_question": false }, @@ -52248,8 +52547,8 @@ "question__title": "Largest Number", "question__title_slug": "largest-number", "question__hide": false, - "total_acs": 357214, - "total_submitted": 1051833, + "total_acs": 359996, + "total_submitted": 1058392, "frontend_question_id": 179, "is_new_question": false }, @@ -52271,8 +52570,8 @@ "question__title": "Rank Scores", "question__title_slug": "rank-scores", "question__hide": false, - "total_acs": 262616, - "total_submitted": 439005, + "total_acs": 265345, + "total_submitted": 442550, "frontend_question_id": 178, "is_new_question": false }, @@ -52294,8 +52593,8 @@ "question__title": "Nth Highest Salary", "question__title_slug": "nth-highest-salary", "question__hide": false, - "total_acs": 275185, - "total_submitted": 736682, + "total_acs": 277601, + "total_submitted": 741846, "frontend_question_id": 177, "is_new_question": false }, @@ -52317,8 +52616,8 @@ "question__title": "Second Highest Salary", "question__title_slug": "second-highest-salary", "question__hide": false, - "total_acs": 562071, - "total_submitted": 1541099, + "total_acs": 568507, + "total_submitted": 1555158, "frontend_question_id": 176, "is_new_question": false }, @@ -52340,8 +52639,8 @@ "question__title": "Combine Two Tables", "question__title_slug": "combine-two-tables", "question__hide": false, - "total_acs": 643958, - "total_submitted": 883658, + "total_acs": 652734, + "total_submitted": 893862, "frontend_question_id": 175, "is_new_question": false }, @@ -52363,8 +52662,8 @@ "question__title": "Dungeon Game", "question__title_slug": "dungeon-game", "question__hide": false, - "total_acs": 187694, - "total_submitted": 503741, + "total_acs": 188393, + "total_submitted": 505480, "frontend_question_id": 174, "is_new_question": false }, @@ -52386,8 +52685,8 @@ "question__title": "Binary Search Tree Iterator", "question__title_slug": "binary-search-tree-iterator", "question__hide": false, - "total_acs": 632418, - "total_submitted": 916428, + "total_acs": 635816, + "total_submitted": 920210, "frontend_question_id": 173, "is_new_question": false }, @@ -52409,8 +52708,8 @@ "question__title": "Factorial Trailing Zeroes", "question__title_slug": "factorial-trailing-zeroes", "question__hide": false, - "total_acs": 341870, - "total_submitted": 820491, + "total_acs": 343629, + "total_submitted": 823893, "frontend_question_id": 172, "is_new_question": false }, @@ -52432,8 +52731,8 @@ "question__title": "Excel Sheet Column Number", "question__title_slug": "excel-sheet-column-number", "question__hide": false, - "total_acs": 547572, - "total_submitted": 893227, + "total_acs": 552143, + "total_submitted": 899722, "frontend_question_id": 171, "is_new_question": false }, @@ -52455,8 +52754,8 @@ "question__title": "Two Sum III - Data structure design", "question__title_slug": "two-sum-iii-data-structure-design", "question__hide": false, - "total_acs": 134553, - "total_submitted": 360863, + "total_acs": 135074, + "total_submitted": 362186, "frontend_question_id": 170, "is_new_question": false }, @@ -52478,8 +52777,8 @@ "question__title": "Majority Element", "question__title_slug": "majority-element", "question__hide": false, - "total_acs": 1479185, - "total_submitted": 2318367, + "total_acs": 1498098, + "total_submitted": 2346131, "frontend_question_id": 169, "is_new_question": false }, @@ -52501,8 +52800,8 @@ "question__title": "Excel Sheet Column Title", "question__title_slug": "excel-sheet-column-title", "question__hide": false, - "total_acs": 344871, - "total_submitted": 993761, + "total_acs": 347250, + "total_submitted": 998766, "frontend_question_id": 168, "is_new_question": false }, @@ -52524,8 +52823,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": 1262196, - "total_submitted": 2102856, + "total_acs": 1276720, + "total_submitted": 2126760, "frontend_question_id": 167, "is_new_question": false }, @@ -52547,8 +52846,8 @@ "question__title": "Fraction to Recurring Decimal", "question__title_slug": "fraction-to-recurring-decimal", "question__hide": false, - "total_acs": 196163, - "total_submitted": 816177, + "total_acs": 197016, + "total_submitted": 818899, "frontend_question_id": 166, "is_new_question": false }, @@ -52570,8 +52869,8 @@ "question__title": "Compare Version Numbers", "question__title_slug": "compare-version-numbers", "question__hide": false, - "total_acs": 337117, - "total_submitted": 953427, + "total_acs": 338246, + "total_submitted": 955654, "frontend_question_id": 165, "is_new_question": false }, @@ -52593,8 +52892,8 @@ "question__title": "Maximum Gap", "question__title_slug": "maximum-gap", "question__hide": false, - "total_acs": 154363, - "total_submitted": 362048, + "total_acs": 155177, + "total_submitted": 363459, "frontend_question_id": 164, "is_new_question": false }, @@ -52616,8 +52915,8 @@ "question__title": "Missing Ranges", "question__title_slug": "missing-ranges", "question__hide": false, - "total_acs": 186334, - "total_submitted": 583698, + "total_acs": 187706, + "total_submitted": 587118, "frontend_question_id": 163, "is_new_question": false }, @@ -52639,8 +52938,8 @@ "question__title": "Find Peak Element", "question__title_slug": "find-peak-element", "question__hide": false, - "total_acs": 910470, - "total_submitted": 1970791, + "total_acs": 918518, + "total_submitted": 1987931, "frontend_question_id": 162, "is_new_question": false }, @@ -52662,8 +52961,8 @@ "question__title": "One Edit Distance", "question__title_slug": "one-edit-distance", "question__hide": false, - "total_acs": 182672, - "total_submitted": 535733, + "total_acs": 183146, + "total_submitted": 537040, "frontend_question_id": 161, "is_new_question": false }, @@ -52685,8 +52984,8 @@ "question__title": "Intersection of Two Linked Lists", "question__title_slug": "intersection-of-two-linked-lists", "question__hide": false, - "total_acs": 1141533, - "total_submitted": 2147969, + "total_acs": 1151941, + "total_submitted": 2162506, "frontend_question_id": 160, "is_new_question": false }, @@ -52708,8 +53007,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": 215745, - "total_submitted": 403436, + "total_acs": 216821, + "total_submitted": 405234, "frontend_question_id": 159, "is_new_question": false }, @@ -52731,8 +53030,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": 172195, - "total_submitted": 415935, + "total_acs": 172464, + "total_submitted": 416400, "frontend_question_id": 158, "is_new_question": false }, @@ -52754,8 +53053,8 @@ "question__title": "Read N Characters Given Read4", "question__title_slug": "read-n-characters-given-read4", "question__hide": false, - "total_acs": 176204, - "total_submitted": 432491, + "total_acs": 176543, + "total_submitted": 433146, "frontend_question_id": 157, "is_new_question": false }, @@ -52777,8 +53076,8 @@ "question__title": "Binary Tree Upside Down", "question__title_slug": "binary-tree-upside-down", "question__hide": false, - "total_acs": 94224, - "total_submitted": 153029, + "total_acs": 94502, + "total_submitted": 153408, "frontend_question_id": 156, "is_new_question": false }, @@ -52800,8 +53099,8 @@ "question__title": "Min Stack", "question__title_slug": "min-stack", "question__hide": false, - "total_acs": 1136744, - "total_submitted": 2196004, + "total_acs": 1146121, + "total_submitted": 2210966, "frontend_question_id": 155, "is_new_question": false }, @@ -52823,8 +53122,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": 358611, - "total_submitted": 825879, + "total_acs": 360462, + "total_submitted": 829990, "frontend_question_id": 154, "is_new_question": false }, @@ -52846,8 +53145,8 @@ "question__title": "Find Minimum in Rotated Sorted Array", "question__title_slug": "find-minimum-in-rotated-sorted-array", "question__hide": false, - "total_acs": 1126558, - "total_submitted": 2324491, + "total_acs": 1138723, + "total_submitted": 2348303, "frontend_question_id": 153, "is_new_question": false }, @@ -52869,8 +53168,8 @@ "question__title": "Maximum Product Subarray", "question__title_slug": "maximum-product-subarray", "question__hide": false, - "total_acs": 890570, - "total_submitted": 2551447, + "total_acs": 899187, + "total_submitted": 2575539, "frontend_question_id": 152, "is_new_question": false }, @@ -52892,8 +53191,8 @@ "question__title": "Reverse Words in a String", "question__title_slug": "reverse-words-in-a-string", "question__hide": false, - "total_acs": 787089, - "total_submitted": 2602567, + "total_acs": 792514, + "total_submitted": 2611457, "frontend_question_id": 151, "is_new_question": false }, @@ -52915,8 +53214,8 @@ "question__title": "Evaluate Reverse Polish Notation", "question__title_slug": "evaluate-reverse-polish-notation", "question__hide": false, - "total_acs": 523587, - "total_submitted": 1187902, + "total_acs": 529680, + "total_submitted": 1201138, "frontend_question_id": 150, "is_new_question": false }, @@ -52938,8 +53237,8 @@ "question__title": "Max Points on a Line", "question__title_slug": "max-points-on-a-line", "question__hide": false, - "total_acs": 255794, - "total_submitted": 1178757, + "total_acs": 257323, + "total_submitted": 1182613, "frontend_question_id": 149, "is_new_question": false }, @@ -52961,8 +53260,8 @@ "question__title": "Sort List", "question__title_slug": "sort-list", "question__hide": false, - "total_acs": 564105, - "total_submitted": 1043637, + "total_acs": 569245, + "total_submitted": 1050881, "frontend_question_id": 148, "is_new_question": false }, @@ -52984,8 +53283,8 @@ "question__title": "Insertion Sort List", "question__title_slug": "insertion-sort-list", "question__hide": false, - "total_acs": 304284, - "total_submitted": 606819, + "total_acs": 305625, + "total_submitted": 608565, "frontend_question_id": 147, "is_new_question": false }, @@ -53007,8 +53306,8 @@ "question__title": "LRU Cache", "question__title_slug": "lru-cache", "question__hide": false, - "total_acs": 1207215, - "total_submitted": 2980226, + "total_acs": 1216205, + "total_submitted": 3002915, "frontend_question_id": 146, "is_new_question": false }, @@ -53030,8 +53329,8 @@ "question__title": "Binary Tree Postorder Traversal", "question__title_slug": "binary-tree-postorder-traversal", "question__hide": false, - "total_acs": 846807, - "total_submitted": 1272480, + "total_acs": 854637, + "total_submitted": 1282113, "frontend_question_id": 145, "is_new_question": false }, @@ -53053,8 +53352,8 @@ "question__title": "Binary Tree Preorder Traversal", "question__title_slug": "binary-tree-preorder-traversal", "question__hide": false, - "total_acs": 1111594, - "total_submitted": 1720750, + "total_acs": 1121614, + "total_submitted": 1733332, "frontend_question_id": 144, "is_new_question": false }, @@ -53076,8 +53375,8 @@ "question__title": "Reorder List", "question__title_slug": "reorder-list", "question__hide": false, - "total_acs": 588289, - "total_submitted": 1153993, + "total_acs": 594443, + "total_submitted": 1162716, "frontend_question_id": 143, "is_new_question": false }, @@ -53099,8 +53398,8 @@ "question__title": "Linked List Cycle II", "question__title_slug": "linked-list-cycle-ii", "question__hide": false, - "total_acs": 851316, - "total_submitted": 1841039, + "total_acs": 863172, + "total_submitted": 1862003, "frontend_question_id": 142, "is_new_question": false }, @@ -53122,8 +53421,8 @@ "question__title": "Linked List Cycle", "question__title_slug": "linked-list-cycle", "question__hide": false, - "total_acs": 1773227, - "total_submitted": 3784594, + "total_acs": 1795176, + "total_submitted": 3827222, "frontend_question_id": 141, "is_new_question": false }, @@ -53145,8 +53444,8 @@ "question__title": "Word Break II", "question__title_slug": "word-break-ii", "question__hide": false, - "total_acs": 487302, - "total_submitted": 1098410, + "total_acs": 490081, + "total_submitted": 1101771, "frontend_question_id": 140, "is_new_question": false }, @@ -53168,8 +53467,8 @@ "question__title": "Word Break", "question__title_slug": "word-break", "question__hide": false, - "total_acs": 1229145, - "total_submitted": 2707735, + "total_acs": 1238496, + "total_submitted": 2725908, "frontend_question_id": 139, "is_new_question": false }, @@ -53191,8 +53490,8 @@ "question__title": "Copy List with Random Pointer", "question__title_slug": "copy-list-with-random-pointer", "question__hide": false, - "total_acs": 886746, - "total_submitted": 1757974, + "total_acs": 892044, + "total_submitted": 1764764, "frontend_question_id": 138, "is_new_question": false }, @@ -53214,8 +53513,8 @@ "question__title": "Single Number II", "question__title_slug": "single-number-ii", "question__hide": false, - "total_acs": 378573, - "total_submitted": 655824, + "total_acs": 381065, + "total_submitted": 659192, "frontend_question_id": 137, "is_new_question": false }, @@ -53237,8 +53536,8 @@ "question__title": "Single Number", "question__title_slug": "single-number", "question__hide": false, - "total_acs": 1904618, - "total_submitted": 2719549, + "total_acs": 1925314, + "total_submitted": 2747583, "frontend_question_id": 136, "is_new_question": false }, @@ -53260,8 +53559,8 @@ "question__title": "Candy", "question__title_slug": "candy", "question__hide": false, - "total_acs": 286043, - "total_submitted": 703160, + "total_acs": 287746, + "total_submitted": 706464, "frontend_question_id": 135, "is_new_question": false }, @@ -53283,8 +53582,8 @@ "question__title": "Gas Station", "question__title_slug": "gas-station", "question__hide": false, - "total_acs": 470498, - "total_submitted": 1044117, + "total_acs": 474435, + "total_submitted": 1052298, "frontend_question_id": 134, "is_new_question": false }, @@ -53306,8 +53605,8 @@ "question__title": "Clone Graph", "question__title_slug": "clone-graph", "question__hide": false, - "total_acs": 853644, - "total_submitted": 1687984, + "total_acs": 861288, + "total_submitted": 1698214, "frontend_question_id": 133, "is_new_question": false }, @@ -53329,8 +53628,8 @@ "question__title": "Palindrome Partitioning II", "question__title_slug": "palindrome-partitioning-ii", "question__hide": false, - "total_acs": 225764, - "total_submitted": 671900, + "total_acs": 226761, + "total_submitted": 674561, "frontend_question_id": 132, "is_new_question": false }, @@ -53352,8 +53651,8 @@ "question__title": "Palindrome Partitioning", "question__title_slug": "palindrome-partitioning", "question__hide": false, - "total_acs": 533522, - "total_submitted": 855767, + "total_acs": 538033, + "total_submitted": 861445, "frontend_question_id": 131, "is_new_question": false }, @@ -53375,8 +53674,8 @@ "question__title": "Surrounded Regions", "question__title_slug": "surrounded-regions", "question__hide": false, - "total_acs": 479030, - "total_submitted": 1334751, + "total_acs": 483651, + "total_submitted": 1343361, "frontend_question_id": 130, "is_new_question": false }, @@ -53398,8 +53697,8 @@ "question__title": "Sum Root to Leaf Numbers", "question__title_slug": "sum-root-to-leaf-numbers", "question__hide": false, - "total_acs": 511191, - "total_submitted": 871687, + "total_acs": 513937, + "total_submitted": 875239, "frontend_question_id": 129, "is_new_question": false }, @@ -53421,8 +53720,8 @@ "question__title": "Longest Consecutive Sequence", "question__title_slug": "longest-consecutive-sequence", "question__hide": false, - "total_acs": 945942, - "total_submitted": 1932749, + "total_acs": 958777, + "total_submitted": 1959948, "frontend_question_id": 128, "is_new_question": false }, @@ -53444,8 +53743,8 @@ "question__title": "Word Ladder", "question__title_slug": "word-ladder", "question__hide": false, - "total_acs": 854391, - "total_submitted": 2332906, + "total_acs": 860427, + "total_submitted": 2344996, "frontend_question_id": 127, "is_new_question": false }, @@ -53467,8 +53766,8 @@ "question__title": "Word Ladder II", "question__title_slug": "word-ladder-ii", "question__hide": false, - "total_acs": 332288, - "total_submitted": 1204368, + "total_acs": 333102, + "total_submitted": 1207588, "frontend_question_id": 126, "is_new_question": false }, @@ -53490,8 +53789,8 @@ "question__title": "Valid Palindrome", "question__title_slug": "valid-palindrome", "question__hide": false, - "total_acs": 1614516, - "total_submitted": 3710710, + "total_acs": 1639821, + "total_submitted": 3759479, "frontend_question_id": 125, "is_new_question": false }, @@ -53513,8 +53812,8 @@ "question__title": "Binary Tree Maximum Path Sum", "question__title_slug": "binary-tree-maximum-path-sum", "question__hide": false, - "total_acs": 854720, - "total_submitted": 2226610, + "total_acs": 862121, + "total_submitted": 2242893, "frontend_question_id": 124, "is_new_question": false }, @@ -53536,8 +53835,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": 437849, - "total_submitted": 977098, + "total_acs": 440756, + "total_submitted": 982301, "frontend_question_id": 123, "is_new_question": false }, @@ -53559,8 +53858,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": 1303271, - "total_submitted": 2060173, + "total_acs": 1313242, + "total_submitted": 2073897, "frontend_question_id": 122, "is_new_question": false }, @@ -53582,8 +53881,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": 2773451, - "total_submitted": 5090248, + "total_acs": 2813061, + "total_submitted": 5164628, "frontend_question_id": 121, "is_new_question": false }, @@ -53605,8 +53904,8 @@ "question__title": "Triangle", "question__title_slug": "triangle", "question__hide": false, - "total_acs": 535462, - "total_submitted": 993764, + "total_acs": 539417, + "total_submitted": 999856, "frontend_question_id": 120, "is_new_question": false }, @@ -53628,8 +53927,8 @@ "question__title": "Pascal's Triangle II", "question__title_slug": "pascals-triangle-ii", "question__hide": false, - "total_acs": 606398, - "total_submitted": 1017238, + "total_acs": 611692, + "total_submitted": 1024284, "frontend_question_id": 119, "is_new_question": false }, @@ -53651,8 +53950,8 @@ "question__title": "Pascal's Triangle", "question__title_slug": "pascals-triangle", "question__hide": false, - "total_acs": 1035777, - "total_submitted": 1501049, + "total_acs": 1049717, + "total_submitted": 1517234, "frontend_question_id": 118, "is_new_question": false }, @@ -53674,8 +53973,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": 519120, - "total_submitted": 1045589, + "total_acs": 521690, + "total_submitted": 1049195, "frontend_question_id": 117, "is_new_question": false }, @@ -53697,8 +53996,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": 854042, - "total_submitted": 1439063, + "total_acs": 859937, + "total_submitted": 1446360, "frontend_question_id": 116, "is_new_question": false }, @@ -53720,8 +54019,8 @@ "question__title": "Distinct Subsequences", "question__title_slug": "distinct-subsequences", "question__hide": false, - "total_acs": 260891, - "total_submitted": 596665, + "total_acs": 263045, + "total_submitted": 600786, "frontend_question_id": 115, "is_new_question": false }, @@ -53743,8 +54042,8 @@ "question__title": "Flatten Binary Tree to Linked List", "question__title_slug": "flatten-binary-tree-to-linked-list", "question__hide": false, - "total_acs": 724725, - "total_submitted": 1186898, + "total_acs": 728734, + "total_submitted": 1191916, "frontend_question_id": 114, "is_new_question": false }, @@ -53766,8 +54065,8 @@ "question__title": "Path Sum II", "question__title_slug": "path-sum-ii", "question__hide": false, - "total_acs": 695942, - "total_submitted": 1230015, + "total_acs": 700018, + "total_submitted": 1235936, "frontend_question_id": 113, "is_new_question": false }, @@ -53789,8 +54088,8 @@ "question__title": "Path Sum", "question__title_slug": "path-sum", "question__hide": false, - "total_acs": 1064208, - "total_submitted": 2236016, + "total_acs": 1072475, + "total_submitted": 2250631, "frontend_question_id": 112, "is_new_question": false }, @@ -53812,8 +54111,8 @@ "question__title": "Minimum Depth of Binary Tree", "question__title_slug": "minimum-depth-of-binary-tree", "question__hide": false, - "total_acs": 852364, - "total_submitted": 1958690, + "total_acs": 859542, + "total_submitted": 1971691, "frontend_question_id": 111, "is_new_question": false }, @@ -53835,8 +54134,8 @@ "question__title": "Balanced Binary Tree", "question__title_slug": "balanced-binary-tree", "question__hide": false, - "total_acs": 956814, - "total_submitted": 1987200, + "total_acs": 968686, + "total_submitted": 2009623, "frontend_question_id": 110, "is_new_question": false }, @@ -53858,8 +54157,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": 404958, - "total_submitted": 707358, + "total_acs": 406730, + "total_submitted": 709426, "frontend_question_id": 109, "is_new_question": false }, @@ -53881,8 +54180,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": 891110, - "total_submitted": 1292262, + "total_acs": 899688, + "total_submitted": 1302812, "frontend_question_id": 108, "is_new_question": false }, @@ -53904,8 +54203,8 @@ "question__title": "Binary Tree Level Order Traversal II", "question__title_slug": "binary-tree-level-order-traversal-ii", "question__hide": false, - "total_acs": 545286, - "total_submitted": 904494, + "total_acs": 547729, + "total_submitted": 907425, "frontend_question_id": 107, "is_new_question": false }, @@ -53927,8 +54226,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": 443794, - "total_submitted": 773657, + "total_acs": 446228, + "total_submitted": 776759, "frontend_question_id": 106, "is_new_question": false }, @@ -53950,8 +54249,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": 873139, - "total_submitted": 1438539, + "total_acs": 880585, + "total_submitted": 1448470, "frontend_question_id": 105, "is_new_question": false }, @@ -53973,8 +54272,8 @@ "question__title": "Maximum Depth of Binary Tree", "question__title_slug": "maximum-depth-of-binary-tree", "question__hide": false, - "total_acs": 1998234, - "total_submitted": 2734739, + "total_acs": 2020936, + "total_submitted": 2763510, "frontend_question_id": 104, "is_new_question": false }, @@ -53996,8 +54295,8 @@ "question__title": "Binary Tree Zigzag Level Order Traversal", "question__title_slug": "binary-tree-zigzag-level-order-traversal", "question__hide": false, - "total_acs": 823314, - "total_submitted": 1494342, + "total_acs": 830338, + "total_submitted": 1505078, "frontend_question_id": 103, "is_new_question": false }, @@ -54019,8 +54318,8 @@ "question__title": "Binary Tree Level Order Traversal", "question__title_slug": "binary-tree-level-order-traversal", "question__hide": false, - "total_acs": 1564939, - "total_submitted": 2475795, + "total_acs": 1582736, + "total_submitted": 2500451, "frontend_question_id": 102, "is_new_question": false }, @@ -54042,8 +54341,8 @@ "question__title": "Symmetric Tree", "question__title_slug": "symmetric-tree", "question__hide": false, - "total_acs": 1421788, - "total_submitted": 2689138, + "total_acs": 1434410, + "total_submitted": 2709507, "frontend_question_id": 101, "is_new_question": false }, @@ -54065,8 +54364,8 @@ "question__title": "Same Tree", "question__title_slug": "same-tree", "question__hide": false, - "total_acs": 1263659, - "total_submitted": 2243360, + "total_acs": 1279081, + "total_submitted": 2268882, "frontend_question_id": 100, "is_new_question": false }, @@ -54088,8 +54387,8 @@ "question__title": "Recover Binary Search Tree", "question__title_slug": "recover-binary-search-tree", "question__hide": false, - "total_acs": 366410, - "total_submitted": 729159, + "total_acs": 368625, + "total_submitted": 732625, "frontend_question_id": 99, "is_new_question": false }, @@ -54111,8 +54410,8 @@ "question__title": "Validate Binary Search Tree", "question__title_slug": "validate-binary-search-tree", "question__hide": false, - "total_acs": 1720815, - "total_submitted": 5426519, + "total_acs": 1738240, + "total_submitted": 5476689, "frontend_question_id": 98, "is_new_question": false }, @@ -54134,8 +54433,8 @@ "question__title": "Interleaving String", "question__title_slug": "interleaving-string", "question__hide": false, - "total_acs": 350508, - "total_submitted": 945109, + "total_acs": 352618, + "total_submitted": 950033, "frontend_question_id": 97, "is_new_question": false }, @@ -54157,8 +54456,8 @@ "question__title": "Unique Binary Search Trees", "question__title_slug": "unique-binary-search-trees", "question__hide": false, - "total_acs": 531794, - "total_submitted": 897759, + "total_acs": 534798, + "total_submitted": 902418, "frontend_question_id": 96, "is_new_question": false }, @@ -54180,8 +54479,8 @@ "question__title": "Unique Binary Search Trees II", "question__title_slug": "unique-binary-search-trees-ii", "question__hide": false, - "total_acs": 334135, - "total_submitted": 649192, + "total_acs": 335679, + "total_submitted": 651041, "frontend_question_id": 95, "is_new_question": false }, @@ -54203,8 +54502,8 @@ "question__title": "Binary Tree Inorder Traversal", "question__title_slug": "binary-tree-inorder-traversal", "question__hide": false, - "total_acs": 1781271, - "total_submitted": 2442150, + "total_acs": 1798909, + "total_submitted": 2463508, "frontend_question_id": 94, "is_new_question": false }, @@ -54226,8 +54525,8 @@ "question__title": "Restore IP Addresses", "question__title_slug": "restore-ip-addresses", "question__hide": false, - "total_acs": 326248, - "total_submitted": 752359, + "total_acs": 328298, + "total_submitted": 755211, "frontend_question_id": 93, "is_new_question": false }, @@ -54249,8 +54548,8 @@ "question__title": "Reverse Linked List II", "question__title_slug": "reverse-linked-list-ii", "question__hide": false, - "total_acs": 583748, - "total_submitted": 1287004, + "total_acs": 587540, + "total_submitted": 1294836, "frontend_question_id": 92, "is_new_question": false }, @@ -54272,8 +54571,8 @@ "question__title": "Decode Ways", "question__title_slug": "decode-ways", "question__hide": false, - "total_acs": 934456, - "total_submitted": 2901331, + "total_acs": 941401, + "total_submitted": 2917361, "frontend_question_id": 91, "is_new_question": false }, @@ -54295,8 +54594,8 @@ "question__title": "Subsets II", "question__title_slug": "subsets-ii", "question__hide": false, - "total_acs": 616092, - "total_submitted": 1115421, + "total_acs": 622823, + "total_submitted": 1125661, "frontend_question_id": 90, "is_new_question": false }, @@ -54318,8 +54617,8 @@ "question__title": "Gray Code", "question__title_slug": "gray-code", "question__hide": false, - "total_acs": 248101, - "total_submitted": 439542, + "total_acs": 249143, + "total_submitted": 440839, "frontend_question_id": 89, "is_new_question": false }, @@ -54341,8 +54640,8 @@ "question__title": "Merge Sorted Array", "question__title_slug": "merge-sorted-array", "question__hide": false, - "total_acs": 1733367, - "total_submitted": 3792861, + "total_acs": 1754574, + "total_submitted": 3833124, "frontend_question_id": 88, "is_new_question": false }, @@ -54364,8 +54663,8 @@ "question__title": "Scramble String", "question__title_slug": "scramble-string", "question__hide": false, - "total_acs": 156585, - "total_submitted": 433872, + "total_acs": 157117, + "total_submitted": 435259, "frontend_question_id": 87, "is_new_question": false }, @@ -54387,8 +54686,8 @@ "question__title": "Partition List", "question__title_slug": "partition-list", "question__hide": false, - "total_acs": 421025, - "total_submitted": 820630, + "total_acs": 423331, + "total_submitted": 823899, "frontend_question_id": 86, "is_new_question": false }, @@ -54410,8 +54709,8 @@ "question__title": "Maximal Rectangle", "question__title_slug": "maximal-rectangle", "question__hide": false, - "total_acs": 323531, - "total_submitted": 733233, + "total_acs": 324984, + "total_submitted": 735721, "frontend_question_id": 85, "is_new_question": false }, @@ -54433,8 +54732,8 @@ "question__title": "Largest Rectangle in Histogram", "question__title_slug": "largest-rectangle-in-histogram", "question__hide": false, - "total_acs": 597747, - "total_submitted": 1419839, + "total_acs": 602965, + "total_submitted": 1430039, "frontend_question_id": 84, "is_new_question": false }, @@ -54456,8 +54755,8 @@ "question__title": "Remove Duplicates from Sorted List", "question__title_slug": "remove-duplicates-from-sorted-list", "question__hide": false, - "total_acs": 1020753, - "total_submitted": 2047827, + "total_acs": 1032927, + "total_submitted": 2070119, "frontend_question_id": 83, "is_new_question": false }, @@ -54479,8 +54778,8 @@ "question__title": "Remove Duplicates from Sorted List II", "question__title_slug": "remove-duplicates-from-sorted-list-ii", "question__hide": false, - "total_acs": 550080, - "total_submitted": 1211232, + "total_acs": 553912, + "total_submitted": 1218216, "frontend_question_id": 82, "is_new_question": false }, @@ -54502,8 +54801,8 @@ "question__title": "Search in Rotated Sorted Array II", "question__title_slug": "search-in-rotated-sorted-array-ii", "question__hide": false, - "total_acs": 469942, - "total_submitted": 1314818, + "total_acs": 472980, + "total_submitted": 1322768, "frontend_question_id": 81, "is_new_question": false }, @@ -54525,8 +54824,8 @@ "question__title": "Remove Duplicates from Sorted Array II", "question__title_slug": "remove-duplicates-from-sorted-array-ii", "question__hide": false, - "total_acs": 467743, - "total_submitted": 907719, + "total_acs": 470338, + "total_submitted": 911444, "frontend_question_id": 80, "is_new_question": false }, @@ -54548,8 +54847,8 @@ "question__title": "Word Search", "question__title_slug": "word-search", "question__hide": false, - "total_acs": 1122185, - "total_submitted": 2819437, + "total_acs": 1134619, + "total_submitted": 2852034, "frontend_question_id": 79, "is_new_question": false }, @@ -54571,8 +54870,8 @@ "question__title": "Subsets", "question__title_slug": "subsets", "question__hide": false, - "total_acs": 1283259, - "total_submitted": 1738676, + "total_acs": 1295718, + "total_submitted": 1752580, "frontend_question_id": 78, "is_new_question": false }, @@ -54594,8 +54893,8 @@ "question__title": "Combinations", "question__title_slug": "combinations", "question__hide": false, - "total_acs": 604223, - "total_submitted": 914835, + "total_acs": 609038, + "total_submitted": 920821, "frontend_question_id": 77, "is_new_question": false }, @@ -54617,8 +54916,8 @@ "question__title": "Minimum Window Substring", "question__title_slug": "minimum-window-substring", "question__hide": false, - "total_acs": 917444, - "total_submitted": 2256506, + "total_acs": 925622, + "total_submitted": 2274277, "frontend_question_id": 76, "is_new_question": false }, @@ -54640,8 +54939,8 @@ "question__title": "Sort Colors", "question__title_slug": "sort-colors", "question__hide": false, - "total_acs": 1227930, - "total_submitted": 2149043, + "total_acs": 1242246, + "total_submitted": 2169008, "frontend_question_id": 75, "is_new_question": false }, @@ -54663,8 +54962,8 @@ "question__title": "Search a 2D Matrix", "question__title_slug": "search-a-2d-matrix", "question__hide": false, - "total_acs": 1024203, - "total_submitted": 2188740, + "total_acs": 1038973, + "total_submitted": 2215044, "frontend_question_id": 74, "is_new_question": false }, @@ -54686,8 +54985,8 @@ "question__title": "Set Matrix Zeroes", "question__title_slug": "set-matrix-zeroes", "question__hide": false, - "total_acs": 857453, - "total_submitted": 1715703, + "total_acs": 867351, + "total_submitted": 1732246, "frontend_question_id": 73, "is_new_question": false }, @@ -54709,8 +55008,8 @@ "question__title": "Edit Distance", "question__title_slug": "edit-distance", "question__hide": false, - "total_acs": 545806, - "total_submitted": 1037669, + "total_acs": 550511, + "total_submitted": 1044918, "frontend_question_id": 72, "is_new_question": false }, @@ -54732,8 +55031,8 @@ "question__title": "Simplify Path", "question__title_slug": "simplify-path", "question__hide": false, - "total_acs": 468938, - "total_submitted": 1196112, + "total_acs": 471578, + "total_submitted": 1202339, "frontend_question_id": 71, "is_new_question": false }, @@ -54755,8 +55054,8 @@ "question__title": "Climbing Stairs", "question__title_slug": "climbing-stairs", "question__hide": false, - "total_acs": 1950014, - "total_submitted": 3770331, + "total_acs": 1979679, + "total_submitted": 3826138, "frontend_question_id": 70, "is_new_question": false }, @@ -54778,8 +55077,8 @@ "question__title": "Sqrt(x)", "question__title_slug": "sqrtx", "question__hide": false, - "total_acs": 1246757, - "total_submitted": 3367207, + "total_acs": 1264278, + "total_submitted": 3411483, "frontend_question_id": 69, "is_new_question": false }, @@ -54801,8 +55100,8 @@ "question__title": "Text Justification", "question__title_slug": "text-justification", "question__hide": false, - "total_acs": 274730, - "total_submitted": 749728, + "total_acs": 276387, + "total_submitted": 752546, "frontend_question_id": 68, "is_new_question": false }, @@ -54824,8 +55123,8 @@ "question__title": "Add Binary", "question__title_slug": "add-binary", "question__hide": false, - "total_acs": 958132, - "total_submitted": 1867402, + "total_acs": 967608, + "total_submitted": 1884353, "frontend_question_id": 67, "is_new_question": false }, @@ -54847,8 +55146,8 @@ "question__title": "Plus One", "question__title_slug": "plus-one", "question__hide": false, - "total_acs": 1426828, - "total_submitted": 3292765, + "total_acs": 1447449, + "total_submitted": 3336985, "frontend_question_id": 66, "is_new_question": false }, @@ -54870,8 +55169,8 @@ "question__title": "Valid Number", "question__title_slug": "valid-number", "question__hide": false, - "total_acs": 291923, - "total_submitted": 1569436, + "total_acs": 292806, + "total_submitted": 1573417, "frontend_question_id": 65, "is_new_question": false }, @@ -54893,8 +55192,8 @@ "question__title": "Minimum Path Sum", "question__title_slug": "minimum-path-sum", "question__hide": false, - "total_acs": 805320, - "total_submitted": 1329108, + "total_acs": 811432, + "total_submitted": 1337987, "frontend_question_id": 64, "is_new_question": false }, @@ -54916,8 +55215,8 @@ "question__title": "Unique Paths II", "question__title_slug": "unique-paths-ii", "question__hide": false, - "total_acs": 617116, - "total_submitted": 1578950, + "total_acs": 621884, + "total_submitted": 1589438, "frontend_question_id": 63, "is_new_question": false }, @@ -54939,8 +55238,8 @@ "question__title": "Unique Paths", "question__title_slug": "unique-paths", "question__hide": false, - "total_acs": 1209363, - "total_submitted": 1943505, + "total_acs": 1222699, + "total_submitted": 1962823, "frontend_question_id": 62, "is_new_question": false }, @@ -54962,8 +55261,8 @@ "question__title": "Rotate List", "question__title_slug": "rotate-list", "question__hide": false, - "total_acs": 648194, - "total_submitted": 1814222, + "total_acs": 654091, + "total_submitted": 1827795, "frontend_question_id": 61, "is_new_question": false }, @@ -54985,8 +55284,8 @@ "question__title": "Permutation Sequence", "question__title_slug": "permutation-sequence", "question__hide": false, - "total_acs": 303241, - "total_submitted": 693579, + "total_acs": 304903, + "total_submitted": 696409, "frontend_question_id": 60, "is_new_question": false }, @@ -55008,8 +55307,8 @@ "question__title": "Spiral Matrix II", "question__title_slug": "spiral-matrix-ii", "question__hide": false, - "total_acs": 402112, - "total_submitted": 604500, + "total_acs": 404830, + "total_submitted": 607824, "frontend_question_id": 59, "is_new_question": false }, @@ -55031,8 +55330,8 @@ "question__title": "Length of Last Word", "question__title_slug": "length-of-last-word", "question__hide": false, - "total_acs": 908644, - "total_submitted": 2248306, + "total_acs": 926252, + "total_submitted": 2277678, "frontend_question_id": 58, "is_new_question": false }, @@ -55054,8 +55353,8 @@ "question__title": "Insert Interval", "question__title_slug": "insert-interval", "question__hide": false, - "total_acs": 620776, - "total_submitted": 1635953, + "total_acs": 628466, + "total_submitted": 1655037, "frontend_question_id": 57, "is_new_question": false }, @@ -55077,8 +55376,8 @@ "question__title": "Merge Intervals", "question__title_slug": "merge-intervals", "question__hide": false, - "total_acs": 1692426, - "total_submitted": 3686997, + "total_acs": 1708451, + "total_submitted": 3718172, "frontend_question_id": 56, "is_new_question": false }, @@ -55100,8 +55399,8 @@ "question__title": "Jump Game", "question__title_slug": "jump-game", "question__hide": false, - "total_acs": 1190664, - "total_submitted": 3098270, + "total_acs": 1202517, + "total_submitted": 3127620, "frontend_question_id": 55, "is_new_question": false }, @@ -55123,8 +55422,8 @@ "question__title": "Spiral Matrix", "question__title_slug": "spiral-matrix", "question__hide": false, - "total_acs": 886714, - "total_submitted": 2032214, + "total_acs": 897513, + "total_submitted": 2051282, "frontend_question_id": 54, "is_new_question": false }, @@ -55146,8 +55445,8 @@ "question__title": "Maximum Subarray", "question__title_slug": "maximum-subarray", "question__hide": false, - "total_acs": 2810015, - "total_submitted": 5614759, + "total_acs": 2838575, + "total_submitted": 5669671, "frontend_question_id": 53, "is_new_question": false }, @@ -55169,8 +55468,8 @@ "question__title": "N-Queens II", "question__title_slug": "n-queens-ii", "question__hide": false, - "total_acs": 285540, - "total_submitted": 403008, + "total_acs": 287293, + "total_submitted": 405035, "frontend_question_id": 52, "is_new_question": false }, @@ -55192,8 +55491,8 @@ "question__title": "N-Queens", "question__title_slug": "n-queens", "question__hide": false, - "total_acs": 482837, - "total_submitted": 767942, + "total_acs": 487157, + "total_submitted": 773076, "frontend_question_id": 51, "is_new_question": false }, @@ -55215,8 +55514,8 @@ "question__title": "Pow(x, n)", "question__title_slug": "powx-n", "question__hide": false, - "total_acs": 1064894, - "total_submitted": 3249070, + "total_acs": 1075116, + "total_submitted": 3277709, "frontend_question_id": 50, "is_new_question": false }, @@ -55238,8 +55537,8 @@ "question__title": "Group Anagrams", "question__title_slug": "group-anagrams", "question__hide": false, - "total_acs": 1652406, - "total_submitted": 2506176, + "total_acs": 1725088, + "total_submitted": 2596497, "frontend_question_id": 49, "is_new_question": false }, @@ -55261,8 +55560,8 @@ "question__title": "Rotate Image", "question__title_slug": "rotate-image", "question__hide": false, - "total_acs": 1123738, - "total_submitted": 1608364, + "total_acs": 1136052, + "total_submitted": 1623366, "frontend_question_id": 48, "is_new_question": false }, @@ -55284,8 +55583,8 @@ "question__title": "Permutations II", "question__title_slug": "permutations-ii", "question__hide": false, - "total_acs": 723168, - "total_submitted": 1276273, + "total_acs": 728198, + "total_submitted": 1283341, "frontend_question_id": 47, "is_new_question": false }, @@ -55307,8 +55606,8 @@ "question__title": "Permutations", "question__title_slug": "permutations", "question__hide": false, - "total_acs": 1395265, - "total_submitted": 1868487, + "total_acs": 1409660, + "total_submitted": 1884922, "frontend_question_id": 46, "is_new_question": false }, @@ -55330,8 +55629,8 @@ "question__title": "Jump Game II", "question__title_slug": "jump-game-ii", "question__hide": false, - "total_acs": 728487, - "total_submitted": 1889910, + "total_acs": 736135, + "total_submitted": 1907494, "frontend_question_id": 45, "is_new_question": false }, @@ -55353,8 +55652,8 @@ "question__title": "Wildcard Matching", "question__title_slug": "wildcard-matching", "question__hide": false, - "total_acs": 434017, - "total_submitted": 1617754, + "total_acs": 436995, + "total_submitted": 1628136, "frontend_question_id": 44, "is_new_question": false }, @@ -55376,8 +55675,8 @@ "question__title": "Multiply Strings", "question__title_slug": "multiply-strings", "question__hide": false, - "total_acs": 590844, - "total_submitted": 1525184, + "total_acs": 596005, + "total_submitted": 1536909, "frontend_question_id": 43, "is_new_question": false }, @@ -55399,8 +55698,8 @@ "question__title": "Trapping Rain Water", "question__title_slug": "trapping-rain-water", "question__hide": false, - "total_acs": 1370333, - "total_submitted": 2332155, + "total_acs": 1382546, + "total_submitted": 2350815, "frontend_question_id": 42, "is_new_question": false }, @@ -55422,8 +55721,8 @@ "question__title": "First Missing Positive", "question__title_slug": "first-missing-positive", "question__hide": false, - "total_acs": 785378, - "total_submitted": 2150634, + "total_acs": 792725, + "total_submitted": 2169552, "frontend_question_id": 41, "is_new_question": false }, @@ -55445,8 +55744,8 @@ "question__title": "Combination Sum II", "question__title_slug": "combination-sum-ii", "question__hide": false, - "total_acs": 661978, - "total_submitted": 1242690, + "total_acs": 668073, + "total_submitted": 1253459, "frontend_question_id": 40, "is_new_question": false }, @@ -55468,8 +55767,8 @@ "question__title": "Combination Sum", "question__title_slug": "combination-sum", "question__hide": false, - "total_acs": 1300158, - "total_submitted": 1923566, + "total_acs": 1313432, + "total_submitted": 1939975, "frontend_question_id": 39, "is_new_question": false }, @@ -55491,8 +55790,8 @@ "question__title": "Count and Say", "question__title_slug": "count-and-say", "question__hide": false, - "total_acs": 733001, - "total_submitted": 1431215, + "total_acs": 737390, + "total_submitted": 1437594, "frontend_question_id": 38, "is_new_question": false }, @@ -55514,8 +55813,8 @@ "question__title": "Sudoku Solver", "question__title_slug": "sudoku-solver", "question__hide": false, - "total_acs": 409494, - "total_submitted": 723234, + "total_acs": 413271, + "total_submitted": 728041, "frontend_question_id": 37, "is_new_question": false }, @@ -55537,8 +55836,8 @@ "question__title": "Valid Sudoku", "question__title_slug": "valid-sudoku", "question__hide": false, - "total_acs": 903372, - "total_submitted": 1591503, + "total_acs": 914893, + "total_submitted": 1609330, "frontend_question_id": 36, "is_new_question": false }, @@ -55560,8 +55859,8 @@ "question__title": "Search Insert Position", "question__title_slug": "search-insert-position", "question__hide": false, - "total_acs": 1777193, - "total_submitted": 4232246, + "total_acs": 1804111, + "total_submitted": 4294255, "frontend_question_id": 35, "is_new_question": false }, @@ -55583,8 +55882,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": 1353942, - "total_submitted": 3261969, + "total_acs": 1368081, + "total_submitted": 3292428, "frontend_question_id": 34, "is_new_question": false }, @@ -55606,8 +55905,8 @@ "question__title": "Search in Rotated Sorted Array", "question__title_slug": "search-in-rotated-sorted-array", "question__hide": false, - "total_acs": 1782765, - "total_submitted": 4614571, + "total_acs": 1802070, + "total_submitted": 4659535, "frontend_question_id": 33, "is_new_question": false }, @@ -55629,8 +55928,8 @@ "question__title": "Longest Valid Parentheses", "question__title_slug": "longest-valid-parentheses", "question__hide": false, - "total_acs": 572320, - "total_submitted": 1751135, + "total_acs": 575743, + "total_submitted": 1760464, "frontend_question_id": 32, "is_new_question": false }, @@ -55652,8 +55951,8 @@ "question__title": "Next Permutation", "question__title_slug": "next-permutation", "question__hide": false, - "total_acs": 938194, - "total_submitted": 2529830, + "total_acs": 945796, + "total_submitted": 2547519, "frontend_question_id": 31, "is_new_question": false }, @@ -55675,8 +55974,8 @@ "question__title": "Substring with Concatenation of All Words", "question__title_slug": "substring-with-concatenation-of-all-words", "question__hide": false, - "total_acs": 320406, - "total_submitted": 1037615, + "total_acs": 322134, + "total_submitted": 1042529, "frontend_question_id": 30, "is_new_question": false }, @@ -55698,8 +55997,8 @@ "question__title": "Divide Two Integers", "question__title_slug": "divide-two-integers", "question__hide": false, - "total_acs": 550545, - "total_submitted": 3174108, + "total_acs": 554381, + "total_submitted": 3198510, "frontend_question_id": 29, "is_new_question": false }, @@ -55721,8 +56020,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": 1447650, - "total_submitted": 3862166, + "total_acs": 1459571, + "total_submitted": 3885342, "frontend_question_id": 28, "is_new_question": false }, @@ -55744,8 +56043,8 @@ "question__title": "Remove Element", "question__title_slug": "remove-element", "question__hide": false, - "total_acs": 1519622, - "total_submitted": 2918125, + "total_acs": 1539588, + "total_submitted": 2952392, "frontend_question_id": 27, "is_new_question": false }, @@ -55767,8 +56066,8 @@ "question__title": "Remove Duplicates from Sorted Array", "question__title_slug": "remove-duplicates-from-sorted-array", "question__hide": false, - "total_acs": 2516749, - "total_submitted": 5003445, + "total_acs": 2548015, + "total_submitted": 5055819, "frontend_question_id": 26, "is_new_question": false }, @@ -55790,8 +56089,8 @@ "question__title": "Reverse Nodes in k-Group", "question__title_slug": "reverse-nodes-in-k-group", "question__hide": false, - "total_acs": 614528, - "total_submitted": 1149715, + "total_acs": 620543, + "total_submitted": 1158207, "frontend_question_id": 25, "is_new_question": false }, @@ -55813,8 +56112,8 @@ "question__title": "Swap Nodes in Pairs", "question__title_slug": "swap-nodes-in-pairs", "question__hide": false, - "total_acs": 986830, - "total_submitted": 1636067, + "total_acs": 995028, + "total_submitted": 1647336, "frontend_question_id": 24, "is_new_question": false }, @@ -55836,8 +56135,8 @@ "question__title": "Merge k Sorted Lists", "question__title_slug": "merge-k-sorted-lists", "question__hide": false, - "total_acs": 1447958, - "total_submitted": 2994957, + "total_acs": 1459837, + "total_submitted": 3015177, "frontend_question_id": 23, "is_new_question": false }, @@ -55859,8 +56158,8 @@ "question__title": "Generate Parentheses", "question__title_slug": "generate-parentheses", "question__hide": false, - "total_acs": 1240401, - "total_submitted": 1727735, + "total_acs": 1253382, + "total_submitted": 1743388, "frontend_question_id": 22, "is_new_question": false }, @@ -55882,8 +56181,8 @@ "question__title": "Merge Two Sorted Lists", "question__title_slug": "merge-two-sorted-lists", "question__hide": false, - "total_acs": 2727630, - "total_submitted": 4414334, + "total_acs": 2766260, + "total_submitted": 4471254, "frontend_question_id": 21, "is_new_question": false }, @@ -55905,8 +56204,8 @@ "question__title": "Valid Parentheses", "question__title_slug": "valid-parentheses", "question__hide": false, - "total_acs": 2765812, - "total_submitted": 6797079, + "total_acs": 2806211, + "total_submitted": 6901838, "frontend_question_id": 20, "is_new_question": false }, @@ -55928,8 +56227,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": 1755403, - "total_submitted": 4398983, + "total_acs": 1775864, + "total_submitted": 4441897, "frontend_question_id": 19, "is_new_question": false }, @@ -55951,8 +56250,8 @@ "question__title": "4Sum", "question__title_slug": "4sum", "question__hide": false, - "total_acs": 666219, - "total_submitted": 1824345, + "total_acs": 671446, + "total_submitted": 1841395, "frontend_question_id": 18, "is_new_question": false }, @@ -55974,8 +56273,8 @@ "question__title": "Letter Combinations of a Phone Number", "question__title_slug": "letter-combinations-of-a-phone-number", "question__hide": false, - "total_acs": 1395319, - "total_submitted": 2512251, + "total_acs": 1408047, + "total_submitted": 2531549, "frontend_question_id": 17, "is_new_question": false }, @@ -55997,8 +56296,8 @@ "question__title": "3Sum Closest", "question__title_slug": "3sum-closest", "question__hide": false, - "total_acs": 946282, - "total_submitted": 2048256, + "total_acs": 952262, + "total_submitted": 2062757, "frontend_question_id": 16, "is_new_question": false }, @@ -56020,8 +56319,8 @@ "question__title": "3Sum", "question__title_slug": "3sum", "question__hide": false, - "total_acs": 2330323, - "total_submitted": 7226829, + "total_acs": 2356189, + "total_submitted": 7294484, "frontend_question_id": 15, "is_new_question": false }, @@ -56043,8 +56342,8 @@ "question__title": "Longest Common Prefix", "question__title_slug": "longest-common-prefix", "question__hide": false, - "total_acs": 1954730, - "total_submitted": 4799258, + "total_acs": 1987414, + "total_submitted": 4872448, "frontend_question_id": 14, "is_new_question": false }, @@ -56066,8 +56365,8 @@ "question__title": "Roman to Integer", "question__title_slug": "roman-to-integer", "question__hide": false, - "total_acs": 2146907, - "total_submitted": 3685733, + "total_acs": 2190824, + "total_submitted": 3760903, "frontend_question_id": 13, "is_new_question": false }, @@ -56089,8 +56388,8 @@ "question__title": "Integer to Roman", "question__title_slug": "integer-to-roman", "question__hide": false, - "total_acs": 878374, - "total_submitted": 1429913, + "total_acs": 888048, + "total_submitted": 1444326, "frontend_question_id": 12, "is_new_question": false }, @@ -56112,8 +56411,8 @@ "question__title": "Container With Most Water", "question__title_slug": "container-with-most-water", "question__hide": false, - "total_acs": 1817936, - "total_submitted": 3346672, + "total_acs": 1839396, + "total_submitted": 3385425, "frontend_question_id": 11, "is_new_question": false }, @@ -56135,8 +56434,8 @@ "question__title": "Regular Expression Matching", "question__title_slug": "regular-expression-matching", "question__hide": false, - "total_acs": 752050, - "total_submitted": 2662798, + "total_acs": 756455, + "total_submitted": 2679114, "frontend_question_id": 10, "is_new_question": false }, @@ -56158,8 +56457,8 @@ "question__title": "Palindrome Number", "question__title_slug": "palindrome-number", "question__hide": false, - "total_acs": 2591373, - "total_submitted": 4903547, + "total_acs": 2636208, + "total_submitted": 4983228, "frontend_question_id": 9, "is_new_question": false }, @@ -56181,8 +56480,8 @@ "question__title": "String to Integer (atoi)", "question__title_slug": "string-to-integer-atoi", "question__hide": false, - "total_acs": 1133126, - "total_submitted": 6815504, + "total_acs": 1142071, + "total_submitted": 6869358, "frontend_question_id": 8, "is_new_question": false }, @@ -56204,8 +56503,8 @@ "question__title": "Reverse Integer", "question__title_slug": "reverse-integer", "question__hide": false, - "total_acs": 2314889, - "total_submitted": 8510240, + "total_acs": 2335194, + "total_submitted": 8575048, "frontend_question_id": 7, "is_new_question": false }, @@ -56227,8 +56526,8 @@ "question__title": "Zigzag Conversion", "question__title_slug": "zigzag-conversion", "question__hide": false, - "total_acs": 870403, - "total_submitted": 2023276, + "total_acs": 878278, + "total_submitted": 2037240, "frontend_question_id": 6, "is_new_question": false }, @@ -56250,8 +56549,8 @@ "question__title": "Longest Palindromic Substring", "question__title_slug": "longest-palindromic-substring", "question__hide": false, - "total_acs": 2157604, - "total_submitted": 6658708, + "total_acs": 2177807, + "total_submitted": 6719067, "frontend_question_id": 5, "is_new_question": false }, @@ -56273,8 +56572,8 @@ "question__title": "Median of Two Sorted Arrays", "question__title_slug": "median-of-two-sorted-arrays", "question__hide": false, - "total_acs": 1643074, - "total_submitted": 4672188, + "total_acs": 1662088, + "total_submitted": 4715793, "frontend_question_id": 4, "is_new_question": false }, @@ -56296,8 +56595,8 @@ "question__title": "Longest Substring Without Repeating Characters", "question__title_slug": "longest-substring-without-repeating-characters", "question__hide": false, - "total_acs": 3963530, - "total_submitted": 11737744, + "total_acs": 4007114, + "total_submitted": 11859149, "frontend_question_id": 3, "is_new_question": false }, @@ -56319,8 +56618,8 @@ "question__title": "Add Two Numbers", "question__title_slug": "add-two-numbers", "question__hide": false, - "total_acs": 3203647, - "total_submitted": 8067458, + "total_acs": 3235396, + "total_submitted": 8133246, "frontend_question_id": 2, "is_new_question": false }, @@ -56342,8 +56641,8 @@ "question__title": "Two Sum", "question__title_slug": "two-sum", "question__hide": false, - "total_acs": 8116789, - "total_submitted": 16540431, + "total_acs": 8231314, + "total_submitted": 16772322, "frontend_question_id": 1, "is_new_question": false }, diff --git a/leetcode/originData/[no content]sort-array-by-moving-items-to-empty-space.json b/leetcode/originData/[no content]sort-array-by-moving-items-to-empty-space.json new file mode 100644 index 00000000..103c563a --- /dev/null +++ b/leetcode/originData/[no content]sort-array-by-moving-items-to-empty-space.json @@ -0,0 +1,66 @@ +{ + "data": { + "question": { + "questionId": "2489", + "questionFrontendId": "2459", + "boundTopicId": null, + "title": "Sort Array by Moving Items to Empty Space", + "titleSlug": "sort-array-by-moving-items-to-empty-space", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Hard", + "likes": 11, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Course Schedule II\", \"titleSlug\": \"course-schedule-ii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Strange Printer II\", \"titleSlug\": \"strange-printer-ii\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Create Sorted Array through Instructions\", \"titleSlug\": \"create-sorted-array-through-instructions\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]", + "exampleTestcases": "[4,2,0,3,1]\n[1,2,3,4,0]\n[1,0,2,4,3]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Greedy", + "slug": "greedy", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Sorting", + "slug": "sorting", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"259\", \"totalSubmission\": \"485\", \"totalAcceptedRaw\": 259, \"totalSubmissionRaw\": 485, \"acRate\": \"53.4%\"}", + "hints": [ + "There are two possibilities for nums to be sorted. Find the minimum number of operations needed for the first possibility, then find the minimum number of operations needed for the second possibility. The answer is the minimum out of the two.", + "If the empty space is not at its ending position, then you can move the item that should be where the empty space is to the empty space.", + "If the empty space is at its ending position, then you need to move an out-of-place item to the empty space." + ], + "solution": null, + "status": null, + "sampleTestCase": "[4,2,0,3,1]", + "metaData": "{\n \"name\": \"sortArray\",\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 datastructures-js/priority-queue and datastructures-js/queue.

\"], \"ruby\": [\"Ruby\", \"

Ruby 3.1

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

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

\"], \"swift\": [\"Swift\", \"

Swift 5.5.2.

\"], \"golang\": [\"Go\", \"

Go 1.17.6.

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

Support https://godoc.org/github.com/emirpasic/gods library.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

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

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

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

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

\"], \"scala\": [\"Scala\", \"

Scala 2.13.7.

\"], \"kotlin\": [\"Kotlin\", \"

Kotlin 1.3.10.

\"], \"rust\": [\"Rust\", \"

Rust 1.58.1

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

Supports rand v0.6\\u00a0from crates.io

\"], \"php\": [\"PHP\", \"

PHP 8.1.

\\r\\n

With bcmath module

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

TypeScript 4.5.4, Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

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

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

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

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/apply-operations-to-an-array.json b/leetcode/originData/apply-operations-to-an-array.json new file mode 100644 index 00000000..65ae697e --- /dev/null +++ b/leetcode/originData/apply-operations-to-an-array.json @@ -0,0 +1,173 @@ +{ + "data": { + "question": { + "questionId": "2551", + "questionFrontendId": "2460", + "boundTopicId": null, + "title": "Apply Operations to an Array", + "titleSlug": "apply-operations-to-an-array", + "content": "

You are given a 0-indexed array nums of size n consisting of non-negative integers.

\n\n

You need to apply n - 1 operations to this array where, in the ith operation (0-indexed), you will apply the following on the ith element of nums:

\n\n
    \n\t
  • If nums[i] == nums[i + 1], then multiply nums[i] by 2 and set nums[i + 1] to 0. Otherwise, you skip this operation.
  • \n
\n\n

After performing all the operations, shift all the 0's to the end of the array.

\n\n
    \n\t
  • For example, the array [1,0,2,0,0,1] after shifting all its 0's to the end, is [1,2,1,0,0,0].
  • \n
\n\n

Return the resulting array.

\n\n

Note that the operations are applied sequentially, not all at once.

\n\n

 

\n

Example 1:

\n\n
\nInput: nums = [1,2,2,1,1,0]\nOutput: [1,4,2,0,0,0]\nExplanation: We do the following operations:\n- i = 0: nums[0] and nums[1] are not equal, so we skip this operation.\n- i = 1: nums[1] and nums[2] are equal, we multiply nums[1] by 2 and change nums[2] to 0. The array becomes [1,4,0,1,1,0].\n- i = 2: nums[2] and nums[3] are not equal, so we skip this operation.\n- i = 3: nums[3] and nums[4] are equal, we multiply nums[3] by 2 and change nums[4] to 0. The array becomes [1,4,0,2,0,0].\n- i = 4: nums[4] and nums[5] are equal, we multiply nums[4] by 2 and change nums[5] to 0. The array becomes [1,4,0,2,0,0].\nAfter that, we shift the 0's to the end, which gives the array [1,4,2,0,0,0].\n
\n\n

Example 2:

\n\n
\nInput: nums = [0,1]\nOutput: [1,0]\nExplanation: No operation can be applied, we just shift the 0 to the end.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 2 <= nums.length <= 2000
  • \n\t
  • 0 <= nums[i] <= 1000
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 147, + "dislikes": 6, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Remove Duplicates from Sorted Array\", \"titleSlug\": \"remove-duplicates-from-sorted-array\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Move Zeroes\", \"titleSlug\": \"move-zeroes\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]", + "exampleTestcases": "[1,2,2,1,1,0]\n[0,1]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Simulation", + "slug": "simulation", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n vector applyOperations(vector& nums) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int[] applyOperations(int[] nums) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def applyOperations(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 applyOperations(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* applyOperations(int* nums, int numsSize, int* returnSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int[] ApplyOperations(int[] nums) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums\n * @return {number[]}\n */\nvar applyOperations = function(nums) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums\n# @return {Integer[]}\ndef apply_operations(nums)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func applyOperations(_ nums: [Int]) -> [Int] {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func applyOperations(nums []int) []int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def applyOperations(nums: Array[Int]): Array[Int] = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun applyOperations(nums: IntArray): IntArray {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn apply_operations(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 applyOperations($nums) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function applyOperations(nums: number[]): number[] {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (apply-operations nums)\n (-> (listof exact-integer?) (listof exact-integer?))\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec apply_operations(Nums :: [integer()]) -> [integer()].\napply_operations(Nums) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec apply_operations(nums :: [integer]) :: [integer]\n def apply_operations(nums) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n List applyOperations(List nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"20K\", \"totalSubmission\": \"29.8K\", \"totalAcceptedRaw\": 20003, \"totalSubmissionRaw\": 29842, \"acRate\": \"67.0%\"}", + "hints": [ + "Iterate over the array and simulate the described process." + ], + "solution": null, + "status": null, + "sampleTestCase": "[1,2,2,1,1,0]", + "metaData": "{\n \"name\": \"applyOperations\",\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 datastructures-js/priority-queue and datastructures-js/queue.

\"], \"ruby\": [\"Ruby\", \"

Ruby 3.1

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

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

\"], \"swift\": [\"Swift\", \"

Swift 5.5.2.

\"], \"golang\": [\"Go\", \"

Go 1.17.6.

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

Support https://godoc.org/github.com/emirpasic/gods library.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

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

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

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

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

\"], \"scala\": [\"Scala\", \"

Scala 2.13.7.

\"], \"kotlin\": [\"Kotlin\", \"

Kotlin 1.3.10.

\"], \"rust\": [\"Rust\", \"

Rust 1.58.1

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

Supports rand v0.6\\u00a0from crates.io

\"], \"php\": [\"PHP\", \"

PHP 8.1.

\\r\\n

With bcmath module

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

TypeScript 4.5.4, Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

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

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

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

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/average-value-of-even-numbers-that-are-divisible-by-three.json b/leetcode/originData/average-value-of-even-numbers-that-are-divisible-by-three.json new file mode 100644 index 00000000..524dc494 --- /dev/null +++ b/leetcode/originData/average-value-of-even-numbers-that-are-divisible-by-three.json @@ -0,0 +1,174 @@ +{ + "data": { + "question": { + "questionId": "2542", + "questionFrontendId": "2455", + "boundTopicId": null, + "title": "Average Value of Even Numbers That Are Divisible by Three", + "titleSlug": "average-value-of-even-numbers-that-are-divisible-by-three", + "content": "

Given an integer array nums of positive integers, return the average value of all even integers that are divisible by 3.

\n\n

Note that the average of n elements is the sum of the n elements divided by n and rounded down to the nearest integer.

\n\n

 

\n

Example 1:

\n\n
\nInput: nums = [1,3,6,10,12,15]\nOutput: 9\nExplanation: 6 and 12 are even numbers that are divisible by 3. (6 + 12) / 2 = 9.\n
\n\n

Example 2:

\n\n
\nInput: nums = [1,2,4,7,10]\nOutput: 0\nExplanation: There is no single number that satisfies the requirement, so return 0.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= nums.length <= 1000
  • \n\t
  • 1 <= nums[i] <= 1000
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 129, + "dislikes": 10, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Binary Prefix Divisible By 5\", \"titleSlug\": \"binary-prefix-divisible-by-5\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]", + "exampleTestcases": "[1,3,6,10,12,15]\n[1,2,4,7,10]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Math", + "slug": "math", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int averageValue(vector& nums) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int averageValue(int[] nums) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def averageValue(self, nums):\n \"\"\"\n :type nums: List[int]\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def averageValue(self, nums: List[int]) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int averageValue(int* nums, int numsSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int AverageValue(int[] nums) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums\n * @return {number}\n */\nvar averageValue = function(nums) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums\n# @return {Integer}\ndef average_value(nums)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func averageValue(_ nums: [Int]) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func averageValue(nums []int) int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def averageValue(nums: Array[Int]): Int = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun averageValue(nums: IntArray): Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn average_value(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 averageValue($nums) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function averageValue(nums: number[]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (average-value nums)\n (-> (listof exact-integer?) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec average_value(Nums :: [integer()]) -> integer().\naverage_value(Nums) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec average_value(nums :: [integer]) :: integer\n def average_value(nums) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int averageValue(List nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"24.2K\", \"totalSubmission\": \"41.6K\", \"totalAcceptedRaw\": 24152, \"totalSubmissionRaw\": 41608, \"acRate\": \"58.0%\"}", + "hints": [ + "What is the property of a number if it is divisible by both 2 and 3 at the same time?", + "It is equivalent to finding all the numbers that are divisible by 6." + ], + "solution": null, + "status": null, + "sampleTestCase": "[1,3,6,10,12,15]", + "metaData": "{\n \"name\": \"averageValue\",\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 datastructures-js/priority-queue and datastructures-js/queue.

\"], \"ruby\": [\"Ruby\", \"

Ruby 3.1

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

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

\"], \"swift\": [\"Swift\", \"

Swift 5.5.2.

\"], \"golang\": [\"Go\", \"

Go 1.17.6.

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

Support https://godoc.org/github.com/emirpasic/gods library.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

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

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

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

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

\"], \"scala\": [\"Scala\", \"

Scala 2.13.7.

\"], \"kotlin\": [\"Kotlin\", \"

Kotlin 1.3.10.

\"], \"rust\": [\"Rust\", \"

Rust 1.58.1

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

Supports rand v0.6\\u00a0from crates.io

\"], \"php\": [\"PHP\", \"

PHP 8.1.

\\r\\n

With bcmath module

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

TypeScript 4.5.4, Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

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

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

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

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/destroy-sequential-targets.json b/leetcode/originData/destroy-sequential-targets.json new file mode 100644 index 00000000..b4863467 --- /dev/null +++ b/leetcode/originData/destroy-sequential-targets.json @@ -0,0 +1,180 @@ +{ + "data": { + "question": { + "questionId": "2548", + "questionFrontendId": "2453", + "boundTopicId": null, + "title": "Destroy Sequential Targets", + "titleSlug": "destroy-sequential-targets", + "content": "

You are given a 0-indexed array nums consisting of positive integers, representing targets on a number line. You are also given an integer space.

\n\n

You have a machine which can destroy targets. Seeding the machine with some nums[i] allows it to destroy all targets with values that can be represented as nums[i] + c * space, where c is any non-negative integer. You want to destroy the maximum number of targets in nums.

\n\n

Return the minimum value of nums[i] you can seed the machine with to destroy the maximum number of targets.

\n\n

 

\n

Example 1:

\n\n
\nInput: nums = [3,7,8,1,1,5], space = 2\nOutput: 1\nExplanation: If we seed the machine with nums[3], then we destroy all targets equal to 1,3,5,7,9,... \nIn this case, we would destroy 5 total targets (all except for nums[2]). \nIt is impossible to destroy more than 5 targets, so we return nums[3].\n
\n\n

Example 2:

\n\n
\nInput: nums = [1,3,5,2,4,6], space = 2\nOutput: 1\nExplanation: Seeding the machine with nums[0], or nums[3] destroys 3 targets. \nIt is not possible to destroy more than 3 targets.\nSince nums[0] is the minimal integer that can destroy 3 targets, we return 1.\n
\n\n

Example 3:

\n\n
\nInput: nums = [6,2,5], space = 100\nOutput: 2\nExplanation: Whatever initial seed we select, we can only destroy 1 target. The minimal seed is nums[1].\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= nums.length <= 105
  • \n\t
  • 1 <= nums[i] <= 109
  • \n\t
  • 1 <= space <= 109
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 262, + "dislikes": 9, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Arithmetic Slices II - Subsequence\", \"titleSlug\": \"arithmetic-slices-ii-subsequence\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Pairs of Songs With Total Durations Divisible by 60\", \"titleSlug\": \"pairs-of-songs-with-total-durations-divisible-by-60\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Longest Arithmetic Subsequence\", \"titleSlug\": \"longest-arithmetic-subsequence\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Longest Arithmetic Subsequence of Given Difference\", \"titleSlug\": \"longest-arithmetic-subsequence-of-given-difference\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]", + "exampleTestcases": "[3,7,8,1,1,5]\n2\n[1,3,5,2,4,6]\n2\n[6,2,5]\n100", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Hash Table", + "slug": "hash-table", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Counting", + "slug": "counting", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int destroyTargets(vector& nums, int space) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int destroyTargets(int[] nums, int space) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def destroyTargets(self, nums, space):\n \"\"\"\n :type nums: List[int]\n :type space: int\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def destroyTargets(self, nums: List[int], space: int) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int destroyTargets(int* nums, int numsSize, int space){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int DestroyTargets(int[] nums, int space) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums\n * @param {number} space\n * @return {number}\n */\nvar destroyTargets = function(nums, space) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums\n# @param {Integer} space\n# @return {Integer}\ndef destroy_targets(nums, space)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func destroyTargets(_ nums: [Int], _ space: Int) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func destroyTargets(nums []int, space int) int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def destroyTargets(nums: Array[Int], space: Int): Int = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun destroyTargets(nums: IntArray, space: Int): Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn destroy_targets(nums: Vec, space: i32) -> i32 {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[] $nums\n * @param Integer $space\n * @return Integer\n */\n function destroyTargets($nums, $space) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function destroyTargets(nums: number[], space: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (destroy-targets nums space)\n (-> (listof exact-integer?) exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec destroy_targets(Nums :: [integer()], Space :: integer()) -> integer().\ndestroy_targets(Nums, Space) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec destroy_targets(nums :: [integer], space :: integer) :: integer\n def destroy_targets(nums, space) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int destroyTargets(List nums, int space) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"9K\", \"totalSubmission\": \"24.6K\", \"totalAcceptedRaw\": 8960, \"totalSubmissionRaw\": 24605, \"acRate\": \"36.4%\"}", + "hints": [ + "Keep track of nums[i] modulo k.", + "Iterate over nums in sorted order." + ], + "solution": null, + "status": null, + "sampleTestCase": "[3,7,8,1,1,5]\n2", + "metaData": "{\n \"name\": \"destroyTargets\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"space\"\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 datastructures-js/priority-queue and datastructures-js/queue.

\"], \"ruby\": [\"Ruby\", \"

Ruby 3.1

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

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

\"], \"swift\": [\"Swift\", \"

Swift 5.5.2.

\"], \"golang\": [\"Go\", \"

Go 1.17.6.

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

Support https://godoc.org/github.com/emirpasic/gods library.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

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

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

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

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

\"], \"scala\": [\"Scala\", \"

Scala 2.13.7.

\"], \"kotlin\": [\"Kotlin\", \"

Kotlin 1.3.10.

\"], \"rust\": [\"Rust\", \"

Rust 1.58.1

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

Supports rand v0.6\\u00a0from crates.io

\"], \"php\": [\"PHP\", \"

PHP 8.1.

\\r\\n

With bcmath module

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

TypeScript 4.5.4, Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

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

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

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

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/height-of-binary-tree-after-subtree-removal-queries.json b/leetcode/originData/height-of-binary-tree-after-subtree-removal-queries.json new file mode 100644 index 00000000..2c27f1ae --- /dev/null +++ b/leetcode/originData/height-of-binary-tree-after-subtree-removal-queries.json @@ -0,0 +1,192 @@ +{ + "data": { + "question": { + "questionId": "2545", + "questionFrontendId": "2458", + "boundTopicId": null, + "title": "Height of Binary Tree After Subtree Removal Queries", + "titleSlug": "height-of-binary-tree-after-subtree-removal-queries", + "content": "

You are given the root of a binary tree with n nodes. Each node is assigned a unique value from 1 to n. You are also given an array queries of size m.

\n\n

You have to perform m independent queries on the tree where in the ith query you do the following:

\n\n
    \n\t
  • Remove the subtree rooted at the node with the value queries[i] from the tree. It is guaranteed that queries[i] will not be equal to the value of the root.
  • \n
\n\n

Return an array answer of size m where answer[i] is the height of the tree after performing the ith query.

\n\n

Note:

\n\n
    \n\t
  • The queries are independent, so the tree returns to its initial state after each query.
  • \n\t
  • The height of a tree is the number of edges in the longest simple path from the root to some node in the tree.
  • \n
\n\n

 

\n

Example 1:

\n\"\"\n
\nInput: root = [1,3,4,2,null,6,5,null,null,null,null,null,7], queries = [4]\nOutput: [2]\nExplanation: The diagram above shows the tree after removing the subtree rooted at node with value 4.\nThe height of the tree is 2 (The path 1 -> 3 -> 2).\n
\n\n

Example 2:

\n\"\"\n
\nInput: root = [5,8,9,2,1,3,7,4,6], queries = [3,2,4,8]\nOutput: [3,2,3,2]\nExplanation: We have the following queries:\n- Removing the subtree rooted at node with value 3. The height of the tree becomes 3 (The path 5 -> 8 -> 2 -> 4).\n- Removing the subtree rooted at node with value 2. The height of the tree becomes 2 (The path 5 -> 8 -> 1).\n- Removing the subtree rooted at node with value 4. The height of the tree becomes 3 (The path 5 -> 8 -> 2 -> 6).\n- Removing the subtree rooted at node with value 8. The height of the tree becomes 2 (The path 5 -> 9 -> 3).\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • The number of nodes in the tree is n.
  • \n\t
  • 2 <= n <= 105
  • \n\t
  • 1 <= Node.val <= n
  • \n\t
  • All the values in the tree are unique.
  • \n\t
  • m == queries.length
  • \n\t
  • 1 <= m <= min(n, 104)
  • \n\t
  • 1 <= queries[i] <= n
  • \n\t
  • queries[i] != root.val
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Hard", + "likes": 303, + "dislikes": 9, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Maximum Depth of Binary Tree\", \"titleSlug\": \"maximum-depth-of-binary-tree\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]", + "exampleTestcases": "[1,3,4,2,null,6,5,null,null,null,null,null,7]\n[4]\n[5,8,9,2,1,3,7,4,6]\n[3,2,4,8]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Tree", + "slug": "tree", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Depth-First Search", + "slug": "depth-first-search", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Breadth-First Search", + "slug": "breadth-first-search", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Binary Tree", + "slug": "binary-tree", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "/**\n * Definition for a binary tree node.\n * struct TreeNode {\n * int val;\n * TreeNode *left;\n * TreeNode *right;\n * TreeNode() : val(0), left(nullptr), right(nullptr) {}\n * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}\n * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}\n * };\n */\nclass Solution {\npublic:\n vector treeQueries(TreeNode* root, vector& queries) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "/**\n * Definition for a binary tree node.\n * public class TreeNode {\n * int val;\n * TreeNode left;\n * TreeNode right;\n * TreeNode() {}\n * TreeNode(int val) { this.val = val; }\n * TreeNode(int val, TreeNode left, TreeNode right) {\n * this.val = val;\n * this.left = left;\n * this.right = right;\n * }\n * }\n */\nclass Solution {\n public int[] treeQueries(TreeNode root, int[] queries) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "# Definition for a binary tree node.\n# class TreeNode(object):\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution(object):\n def treeQueries(self, root, queries):\n \"\"\"\n :type root: Optional[TreeNode]\n :type queries: List[int]\n :rtype: List[int]\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def treeQueries(self, root: Optional[TreeNode], queries: List[int]) -> List[int]:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "/**\n * Definition for a binary tree node.\n * struct TreeNode {\n * int val;\n * struct TreeNode *left;\n * struct TreeNode *right;\n * };\n */\n/**\n * Note: The returned array must be malloced, assume caller calls free().\n */\nint* treeQueries(struct TreeNode* root, int* queries, int queriesSize, int* returnSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "/**\n * Definition for a binary tree node.\n * public class TreeNode {\n * public int val;\n * public TreeNode left;\n * public TreeNode right;\n * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) {\n * this.val = val;\n * this.left = left;\n * this.right = right;\n * }\n * }\n */\npublic class Solution {\n public int[] TreeQueries(TreeNode root, int[] queries) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * Definition for a binary tree node.\n * function TreeNode(val, left, right) {\n * this.val = (val===undefined ? 0 : val)\n * this.left = (left===undefined ? null : left)\n * this.right = (right===undefined ? null : right)\n * }\n */\n/**\n * @param {TreeNode} root\n * @param {number[]} queries\n * @return {number[]}\n */\nvar treeQueries = function(root, queries) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# Definition for a binary tree node.\n# class TreeNode\n# attr_accessor :val, :left, :right\n# def initialize(val = 0, left = nil, right = nil)\n# @val = val\n# @left = left\n# @right = right\n# end\n# end\n# @param {TreeNode} root\n# @param {Integer[]} queries\n# @return {Integer[]}\ndef tree_queries(root, queries)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "/**\n * Definition for a binary tree node.\n * public class TreeNode {\n * public var val: Int\n * public var left: TreeNode?\n * public var right: TreeNode?\n * public init() { self.val = 0; self.left = nil; self.right = nil; }\n * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; }\n * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) {\n * self.val = val\n * self.left = left\n * self.right = right\n * }\n * }\n */\nclass Solution {\n func treeQueries(_ root: TreeNode?, _ queries: [Int]) -> [Int] {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "/**\n * Definition for a binary tree node.\n * type TreeNode struct {\n * Val int\n * Left *TreeNode\n * Right *TreeNode\n * }\n */\nfunc treeQueries(root *TreeNode, queries []int) []int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "/**\n * Definition for a binary tree node.\n * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) {\n * var value: Int = _value\n * var left: TreeNode = _left\n * var right: TreeNode = _right\n * }\n */\nobject Solution {\n def treeQueries(root: TreeNode, queries: Array[Int]): Array[Int] = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "/**\n * Example:\n * var ti = TreeNode(5)\n * var v = ti.`val`\n * Definition for a binary tree node.\n * class TreeNode(var `val`: Int) {\n * var left: TreeNode? = null\n * var right: TreeNode? = null\n * }\n */\nclass Solution {\n fun treeQueries(root: TreeNode?, queries: IntArray): IntArray {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "// Definition for a binary tree node.\n// #[derive(Debug, PartialEq, Eq)]\n// pub struct TreeNode {\n// pub val: i32,\n// pub left: Option>>,\n// pub right: Option>>,\n// }\n// \n// impl TreeNode {\n// #[inline]\n// pub fn new(val: i32) -> Self {\n// TreeNode {\n// val,\n// left: None,\n// right: None\n// }\n// }\n// }\nuse std::rc::Rc;\nuse std::cell::RefCell;\nimpl Solution {\n pub fn tree_queries(root: Option>>, queries: Vec) -> Vec {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "/**\n * Definition for a binary tree node.\n * class TreeNode {\n * public $val = null;\n * public $left = null;\n * public $right = null;\n * function __construct($val = 0, $left = null, $right = null) {\n * $this->val = $val;\n * $this->left = $left;\n * $this->right = $right;\n * }\n * }\n */\nclass Solution {\n\n /**\n * @param TreeNode $root\n * @param Integer[] $queries\n * @return Integer[]\n */\n function treeQueries($root, $queries) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "/**\n * Definition for a binary tree node.\n * class TreeNode {\n * val: number\n * left: TreeNode | null\n * right: TreeNode | null\n * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {\n * this.val = (val===undefined ? 0 : val)\n * this.left = (left===undefined ? null : left)\n * this.right = (right===undefined ? null : right)\n * }\n * }\n */\n\nfunction treeQueries(root: TreeNode | null, queries: number[]): number[] {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "; Definition for a binary tree node.\n#|\n\n; val : integer?\n; left : (or/c tree-node? #f)\n; right : (or/c tree-node? #f)\n(struct tree-node\n (val left right) #:mutable #:transparent)\n\n; constructor\n(define (make-tree-node [val 0])\n (tree-node val #f #f))\n\n|#\n\n(define/contract (tree-queries root queries)\n (-> (or/c tree-node? #f) (listof exact-integer?) (listof exact-integer?))\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "%% Definition for a binary tree node.\n%%\n%% -record(tree_node, {val = 0 :: integer(),\n%% left = null :: 'null' | #tree_node{},\n%% right = null :: 'null' | #tree_node{}}).\n\n-spec tree_queries(Root :: #tree_node{} | null, Queries :: [integer()]) -> [integer()].\ntree_queries(Root, Queries) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "# Definition for a binary tree node.\n#\n# defmodule TreeNode do\n# @type t :: %__MODULE__{\n# val: integer,\n# left: TreeNode.t() | nil,\n# right: TreeNode.t() | nil\n# }\n# defstruct val: 0, left: nil, right: nil\n# end\n\ndefmodule Solution do\n @spec tree_queries(root :: TreeNode.t | nil, queries :: [integer]) :: [integer]\n def tree_queries(root, queries) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "/**\n * Definition for a binary tree node.\n * class TreeNode {\n * int val;\n * TreeNode? left;\n * TreeNode? right;\n * TreeNode([this.val = 0, this.left, this.right]);\n * }\n */\nclass Solution {\n List treeQueries(TreeNode? root, List queries) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"5.8K\", \"totalSubmission\": \"16.5K\", \"totalAcceptedRaw\": 5757, \"totalSubmissionRaw\": 16509, \"acRate\": \"34.9%\"}", + "hints": [ + "Try pre-computing the answer for each node from 1 to n, and answer each query in O(1).", + "The answers can be precomputed in a single tree traversal after computing the height of each subtree." + ], + "solution": null, + "status": null, + "sampleTestCase": "[1,3,4,2,null,6,5,null,null,null,null,null,7]\n[4]", + "metaData": "{\n \"name\": \"treeQueries\",\n \"params\": [\n {\n \"name\": \"root\",\n \"type\": \"TreeNode\"\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 datastructures-js/priority-queue and datastructures-js/queue.

\"], \"ruby\": [\"Ruby\", \"

Ruby 3.1

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

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

\"], \"swift\": [\"Swift\", \"

Swift 5.5.2.

\"], \"golang\": [\"Go\", \"

Go 1.17.6.

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

Support https://godoc.org/github.com/emirpasic/gods library.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

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

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

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

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

\"], \"scala\": [\"Scala\", \"

Scala 2.13.7.

\"], \"kotlin\": [\"Kotlin\", \"

Kotlin 1.3.10.

\"], \"rust\": [\"Rust\", \"

Rust 1.58.1

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

Supports rand v0.6\\u00a0from crates.io

\"], \"php\": [\"PHP\", \"

PHP 8.1.

\\r\\n

With bcmath module

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

TypeScript 4.5.4, Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

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

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

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

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/maximum-sum-of-distinct-subarrays-with-length-k.json b/leetcode/originData/maximum-sum-of-distinct-subarrays-with-length-k.json new file mode 100644 index 00000000..7c8643fd --- /dev/null +++ b/leetcode/originData/maximum-sum-of-distinct-subarrays-with-length-k.json @@ -0,0 +1,181 @@ +{ + "data": { + "question": { + "questionId": "2552", + "questionFrontendId": "2461", + "boundTopicId": null, + "title": "Maximum Sum of Distinct Subarrays With Length K", + "titleSlug": "maximum-sum-of-distinct-subarrays-with-length-k", + "content": "

You are given an integer array nums and an integer k. Find the maximum subarray sum of all the subarrays of nums that meet the following conditions:

\n\n
    \n\t
  • The length of the subarray is k, and
  • \n\t
  • All the elements of the subarray are distinct.
  • \n
\n\n

Return the maximum subarray sum of all the subarrays that meet the conditions. If no subarray meets the conditions, return 0.

\n\n

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

\n\n

 

\n

Example 1:

\n\n
\nInput: nums = [1,5,4,2,9,9,9], k = 3\nOutput: 15\nExplanation: The subarrays of nums with length 3 are:\n- [1,5,4] which meets the requirements and has a sum of 10.\n- [5,4,2] which meets the requirements and has a sum of 11.\n- [4,2,9] which meets the requirements and has a sum of 15.\n- [2,9,9] which does not meet the requirements because the element 9 is repeated.\n- [9,9,9] which does not meet the requirements because the element 9 is repeated.\nWe return 15 because it is the maximum subarray sum of all the subarrays that meet the conditions\n
\n\n

Example 2:

\n\n
\nInput: nums = [4,4,4], k = 3\nOutput: 0\nExplanation: The subarrays of nums with length 3 are:\n- [4,4,4] which does not meet the requirements because the element 4 is repeated.\nWe return 0 because no subarrays meet the conditions.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= k <= nums.length <= 105
  • \n\t
  • 1 <= nums[i] <= 105
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 331, + "dislikes": 3, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Max Consecutive Ones III\", \"titleSlug\": \"max-consecutive-ones-iii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Longest Nice Subarray\", \"titleSlug\": \"longest-nice-subarray\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Optimal Partition of String\", \"titleSlug\": \"optimal-partition-of-string\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]", + "exampleTestcases": "[1,5,4,2,9,9,9]\n3\n[4,4,4]\n3", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Hash Table", + "slug": "hash-table", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Sliding Window", + "slug": "sliding-window", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n long long maximumSubarraySum(vector& nums, int k) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public long maximumSubarraySum(int[] nums, int k) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def maximumSubarraySum(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 maximumSubarraySum(self, nums: List[int], k: int) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "long long maximumSubarraySum(int* nums, int numsSize, int k){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public long MaximumSubarraySum(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 maximumSubarraySum = function(nums, k) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums\n# @param {Integer} k\n# @return {Integer}\ndef maximum_subarray_sum(nums, k)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func maximumSubarraySum(_ nums: [Int], _ k: Int) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func maximumSubarraySum(nums []int, k int) int64 {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def maximumSubarraySum(nums: Array[Int], k: Int): Long = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun maximumSubarraySum(nums: IntArray, k: Int): Long {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn maximum_subarray_sum(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 maximumSubarraySum($nums, $k) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function maximumSubarraySum(nums: number[], k: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (maximum-subarray-sum nums k)\n (-> (listof exact-integer?) exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec maximum_subarray_sum(Nums :: [integer()], K :: integer()) -> integer().\nmaximum_subarray_sum(Nums, K) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec maximum_subarray_sum(nums :: [integer], k :: integer) :: integer\n def maximum_subarray_sum(nums, k) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int maximumSubarraySum(List nums, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"15.8K\", \"totalSubmission\": \"46.2K\", \"totalAcceptedRaw\": 15773, \"totalSubmissionRaw\": 46249, \"acRate\": \"34.1%\"}", + "hints": [ + "Which elements change when moving from the subarray of size k that ends at index i to the subarray of size k that ends at index i + 1?", + "Only two elements change, the element at i + 1 is added into the subarray, and the element at i - k + 1 gets removed from the subarray.", + "Iterate through each subarray of size k and keep track of the sum of the subarray and the frequency of each element." + ], + "solution": null, + "status": null, + "sampleTestCase": "[1,5,4,2,9,9,9]\n3", + "metaData": "{\n \"name\": \"maximumSubarraySum\",\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 datastructures-js/priority-queue and datastructures-js/queue.

\"], \"ruby\": [\"Ruby\", \"

Ruby 3.1

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

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

\"], \"swift\": [\"Swift\", \"

Swift 5.5.2.

\"], \"golang\": [\"Go\", \"

Go 1.17.6.

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

Support https://godoc.org/github.com/emirpasic/gods library.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

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

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

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

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

\"], \"scala\": [\"Scala\", \"

Scala 2.13.7.

\"], \"kotlin\": [\"Kotlin\", \"

Kotlin 1.3.10.

\"], \"rust\": [\"Rust\", \"

Rust 1.58.1

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

Supports rand v0.6\\u00a0from crates.io

\"], \"php\": [\"PHP\", \"

PHP 8.1.

\\r\\n

With bcmath module

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

TypeScript 4.5.4, Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

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

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

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

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/minimum-addition-to-make-integer-beautiful.json b/leetcode/originData/minimum-addition-to-make-integer-beautiful.json new file mode 100644 index 00000000..7cb86b9f --- /dev/null +++ b/leetcode/originData/minimum-addition-to-make-integer-beautiful.json @@ -0,0 +1,174 @@ +{ + "data": { + "question": { + "questionId": "2544", + "questionFrontendId": "2457", + "boundTopicId": null, + "title": "Minimum Addition to Make Integer Beautiful", + "titleSlug": "minimum-addition-to-make-integer-beautiful", + "content": "

You are given two positive integers n and target.

\n\n

An integer is considered beautiful if the sum of its digits is less than or equal to target.

\n\n

Return the minimum non-negative integer x such that n + x is beautiful. The input will be generated such that it is always possible to make n beautiful.

\n\n

 

\n

Example 1:

\n\n
\nInput: n = 16, target = 6\nOutput: 4\nExplanation: Initially n is 16 and its digit sum is 1 + 6 = 7. After adding 4, n becomes 20 and digit sum becomes 2 + 0 = 2. It can be shown that we can not make n beautiful with adding non-negative integer less than 4.\n
\n\n

Example 2:

\n\n
\nInput: n = 467, target = 6\nOutput: 33\nExplanation: Initially n is 467 and its digit sum is 4 + 6 + 7 = 17. After adding 33, n becomes 500 and digit sum becomes 5 + 0 + 0 = 5. It can be shown that we can not make n beautiful with adding non-negative integer less than 33.\n
\n\n

Example 3:

\n\n
\nInput: n = 1, target = 1\nOutput: 0\nExplanation: Initially n is 1 and its digit sum is 1, which is already smaller than or equal to target.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= n <= 1012
  • \n\t
  • 1 <= target <= 150
  • \n\t
  • The input will be generated such that it is always possible to make n beautiful.
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 332, + "dislikes": 17, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Happy Number\", \"titleSlug\": \"happy-number\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]", + "exampleTestcases": "16\n6\n467\n6\n1\n1", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Math", + "slug": "math", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Greedy", + "slug": "greedy", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n long long makeIntegerBeautiful(long long n, int target) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public long makeIntegerBeautiful(long n, int target) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def makeIntegerBeautiful(self, n, target):\n \"\"\"\n :type n: int\n :type target: int\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def makeIntegerBeautiful(self, n: int, target: int) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "long long makeIntegerBeautiful(long long n, int target){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public long MakeIntegerBeautiful(long n, int target) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number} n\n * @param {number} target\n * @return {number}\n */\nvar makeIntegerBeautiful = function(n, target) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer} n\n# @param {Integer} target\n# @return {Integer}\ndef make_integer_beautiful(n, target)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func makeIntegerBeautiful(_ n: Int, _ target: Int) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func makeIntegerBeautiful(n int64, target int) int64 {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def makeIntegerBeautiful(n: Long, target: Int): Long = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun makeIntegerBeautiful(n: Long, target: Int): Long {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn make_integer_beautiful(n: i64, target: i32) -> i64 {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer $n\n * @param Integer $target\n * @return Integer\n */\n function makeIntegerBeautiful($n, $target) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function makeIntegerBeautiful(n: number, target: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (make-integer-beautiful n target)\n (-> exact-integer? exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec make_integer_beautiful(N :: integer(), Target :: integer()) -> integer().\nmake_integer_beautiful(N, Target) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec make_integer_beautiful(n :: integer, target :: integer) :: integer\n def make_integer_beautiful(n, target) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int makeIntegerBeautiful(int n, int target) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"12.6K\", \"totalSubmission\": \"34.5K\", \"totalAcceptedRaw\": 12614, \"totalSubmissionRaw\": 34462, \"acRate\": \"36.6%\"}", + "hints": [ + "Think about each digit independently.", + "Turn the rightmost non-zero digit to zero until the digit sum is greater than target." + ], + "solution": null, + "status": null, + "sampleTestCase": "16\n6", + "metaData": "{\n \"name\": \"makeIntegerBeautiful\",\n \"params\": [\n {\n \"name\": \"n\",\n \"type\": \"long\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"target\"\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 datastructures-js/priority-queue and datastructures-js/queue.

\"], \"ruby\": [\"Ruby\", \"

Ruby 3.1

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

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

\"], \"swift\": [\"Swift\", \"

Swift 5.5.2.

\"], \"golang\": [\"Go\", \"

Go 1.17.6.

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

Support https://godoc.org/github.com/emirpasic/gods library.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

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

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

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

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

\"], \"scala\": [\"Scala\", \"

Scala 2.13.7.

\"], \"kotlin\": [\"Kotlin\", \"

Kotlin 1.3.10.

\"], \"rust\": [\"Rust\", \"

Rust 1.58.1

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

Supports rand v0.6\\u00a0from crates.io

\"], \"php\": [\"PHP\", \"

PHP 8.1.

\\r\\n

With bcmath module

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

TypeScript 4.5.4, Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

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

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

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

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/minimum-number-of-food-buckets-to-feed-the-hamsters.json b/leetcode/originData/minimum-number-of-food-buckets-to-feed-the-hamsters.json new file mode 100644 index 00000000..361fe913 --- /dev/null +++ b/leetcode/originData/minimum-number-of-food-buckets-to-feed-the-hamsters.json @@ -0,0 +1,182 @@ +{ + "data": { + "question": { + "questionId": "2191", + "questionFrontendId": "2086", + "boundTopicId": null, + "title": "Minimum Number of Food Buckets to Feed the Hamsters", + "titleSlug": "minimum-number-of-food-buckets-to-feed-the-hamsters", + "content": "

You are given a 0-indexed string hamsters where hamsters[i] is either:

\n\n
    \n\t
  • 'H' indicating that there is a hamster at index i, or
  • \n\t
  • '.' indicating that index i is empty.
  • \n
\n\n

You will add some number of food buckets at the empty indices in order to feed the hamsters. A hamster can be fed if there is at least one food bucket to its left or to its right. More formally, a hamster at index i can be fed if you place a food bucket at index i - 1 and/or at index i + 1.

\n\n

Return the minimum number of food buckets you should place at empty indices to feed all the hamsters or -1 if it is impossible to feed all of them.

\n\n

 

\n

Example 1:

\n\"\"\n
\nInput: hamsters = "H..H"\nOutput: 2\nExplanation: We place two food buckets at indices 1 and 2.\nIt can be shown that if we place only one food bucket, one of the hamsters will not be fed.\n
\n\n

Example 2:

\n\"\"\n
\nInput: hamsters = ".H.H."\nOutput: 1\nExplanation: We place one food bucket at index 2.\n
\n\n

Example 3:

\n\"\"\n
\nInput: hamsters = ".HHH."\nOutput: -1\nExplanation: If we place a food bucket at every empty index as shown, the hamster at index 2 will not be able to eat.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= hamsters.length <= 105
  • \n\t
  • hamsters[i] is either'H' or '.'.
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 393, + "dislikes": 18, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Maximum Number of People That Can Be Caught in Tag\", \"titleSlug\": \"maximum-number-of-people-that-can-be-caught-in-tag\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Brightest Position on Street\", \"titleSlug\": \"brightest-position-on-street\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]", + "exampleTestcases": "\"H..H\"\n\".H.H.\"\n\".HHH.\"", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "String", + "slug": "string", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Dynamic Programming", + "slug": "dynamic-programming", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Greedy", + "slug": "greedy", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int minimumBuckets(string hamsters) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int minimumBuckets(String hamsters) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def minimumBuckets(self, hamsters):\n \"\"\"\n :type hamsters: str\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def minimumBuckets(self, hamsters: str) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int minimumBuckets(char * hamsters){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int MinimumBuckets(string hamsters) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {string} hamsters\n * @return {number}\n */\nvar minimumBuckets = function(hamsters) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {String} hamsters\n# @return {Integer}\ndef minimum_buckets(hamsters)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func minimumBuckets(_ hamsters: String) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func minimumBuckets(hamsters string) int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def minimumBuckets(hamsters: String): Int = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun minimumBuckets(hamsters: String): Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn minimum_buckets(hamsters: String) -> i32 {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param String $hamsters\n * @return Integer\n */\n function minimumBuckets($hamsters) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function minimumBuckets(hamsters: string): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (minimum-buckets hamsters)\n (-> string? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec minimum_buckets(Hamsters :: unicode:unicode_binary()) -> integer().\nminimum_buckets(Hamsters) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec minimum_buckets(hamsters :: String.t) :: integer\n def minimum_buckets(hamsters) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int minimumBuckets(String hamsters) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"13K\", \"totalSubmission\": \"28.9K\", \"totalAcceptedRaw\": 13043, \"totalSubmissionRaw\": 28936, \"acRate\": \"45.1%\"}", + "hints": [ + "When is it impossible to collect the rainwater from all the houses?", + "When one or more houses do not have an empty space adjacent to it.", + "Assuming the rainwater from all previous houses is collected. If there is a house at index i and you are able to place a bucket at index i - 1 or i + 1, where should you put it?", + "It is always better to place a bucket at index i + 1 because it can collect the rainwater from the next house as well." + ], + "solution": null, + "status": null, + "sampleTestCase": "\"H..H\"", + "metaData": "{\n \"name\": \"minimumBuckets\",\n \"params\": [\n {\n \"name\": \"hamsters\",\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 datastructures-js/priority-queue and datastructures-js/queue.

\"], \"ruby\": [\"Ruby\", \"

Ruby 3.1

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

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

\"], \"swift\": [\"Swift\", \"

Swift 5.5.2.

\"], \"golang\": [\"Go\", \"

Go 1.17.6.

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

Support https://godoc.org/github.com/emirpasic/gods library.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

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

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

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

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

\"], \"scala\": [\"Scala\", \"

Scala 2.13.7.

\"], \"kotlin\": [\"Kotlin\", \"

Kotlin 1.3.10.

\"], \"rust\": [\"Rust\", \"

Rust 1.58.1

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

Supports rand v0.6\\u00a0from crates.io

\"], \"php\": [\"PHP\", \"

PHP 8.1.

\\r\\n

With bcmath module

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

TypeScript 4.5.4, Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

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

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

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

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/minimum-total-distance-traveled.json b/leetcode/originData/minimum-total-distance-traveled.json new file mode 100644 index 00000000..8183658b --- /dev/null +++ b/leetcode/originData/minimum-total-distance-traveled.json @@ -0,0 +1,181 @@ +{ + "data": { + "question": { + "questionId": "2554", + "questionFrontendId": "2463", + "boundTopicId": null, + "title": "Minimum Total Distance Traveled", + "titleSlug": "minimum-total-distance-traveled", + "content": "

There are some robots and factories on the X-axis. You are given an integer array robot where robot[i] is the position of the ith robot. You are also given a 2D integer array factory where factory[j] = [positionj, limitj] indicates that positionj is the position of the jth factory and that the jth factory can repair at most limitj robots.

\n\n

The positions of each robot are unique. The positions of each factory are also unique. Note that a robot can be in the same position as a factory initially.

\n\n

All the robots are initially broken; they keep moving in one direction. The direction could be the negative or the positive direction of the X-axis. When a robot reaches a factory that did not reach its limit, the factory repairs the robot, and it stops moving.

\n\n

At any moment, you can set the initial direction of moving for some robot. Your target is to minimize the total distance traveled by all the robots.

\n\n

Return the minimum total distance traveled by all the robots. The test cases are generated such that all the robots can be repaired.

\n\n

Note that

\n\n
    \n\t
  • All robots move at the same speed.
  • \n\t
  • If two robots move in the same direction, they will never collide.
  • \n\t
  • If two robots move in opposite directions and they meet at some point, they do not collide. They cross each other.
  • \n\t
  • If a robot passes by a factory that reached its limits, it crosses it as if it does not exist.
  • \n\t
  • If the robot moved from a position x to a position y, the distance it moved is |y - x|.
  • \n
\n\n

 

\n

Example 1:

\n\"\"\n
\nInput: robot = [0,4,6], factory = [[2,2],[6,2]]\nOutput: 4\nExplanation: As shown in the figure:\n- The first robot at position 0 moves in the positive direction. It will be repaired at the first factory.\n- The second robot at position 4 moves in the negative direction. It will be repaired at the first factory.\n- The third robot at position 6 will be repaired at the second factory. It does not need to move.\nThe limit of the first factory is 2, and it fixed 2 robots.\nThe limit of the second factory is 2, and it fixed 1 robot.\nThe total distance is |2 - 0| + |2 - 4| + |6 - 6| = 4. It can be shown that we cannot achieve a better total distance than 4.\n
\n\n

Example 2:

\n\"\"\n
\nInput: robot = [1,-1], factory = [[-2,1],[2,1]]\nOutput: 2\nExplanation: As shown in the figure:\n- The first robot at position 1 moves in the positive direction. It will be repaired at the second factory.\n- The second robot at position -1 moves in the negative direction. It will be repaired at the first factory.\nThe limit of the first factory is 1, and it fixed 1 robot.\nThe limit of the second factory is 1, and it fixed 1 robot.\nThe total distance is |2 - 1| + |(-2) - (-1)| = 2. It can be shown that we cannot achieve a better total distance than 2.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= robot.length, factory.length <= 100
  • \n\t
  • factory[j].length == 2
  • \n\t
  • -109 <= robot[i], positionj <= 109
  • \n\t
  • 0 <= limitj <= robot.length
  • \n\t
  • The input will be generated such that it is always possible to repair every robot.
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Hard", + "likes": 226, + "dislikes": 2, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Capacity To Ship Packages Within D Days\", \"titleSlug\": \"capacity-to-ship-packages-within-d-days\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]", + "exampleTestcases": "[0,4,6]\n[[2,2],[6,2]]\n[1,-1]\n[[-2,1],[2,1]]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Dynamic Programming", + "slug": "dynamic-programming", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Sorting", + "slug": "sorting", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n long long minimumTotalDistance(vector& robot, vector>& factory) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public long minimumTotalDistance(List robot, int[][] factory) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def minimumTotalDistance(self, robot, factory):\n \"\"\"\n :type robot: List[int]\n :type factory: List[List[int]]\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def minimumTotalDistance(self, robot: List[int], factory: List[List[int]]) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "long long minimumTotalDistance(int* robot, int robotSize, int** factory, int factorySize, int* factoryColSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public long MinimumTotalDistance(IList robot, int[][] factory) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} robot\n * @param {number[][]} factory\n * @return {number}\n */\nvar minimumTotalDistance = function(robot, factory) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} robot\n# @param {Integer[][]} factory\n# @return {Integer}\ndef minimum_total_distance(robot, factory)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func minimumTotalDistance(_ robot: [Int], _ factory: [[Int]]) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func minimumTotalDistance(robot []int, factory [][]int) int64 {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def minimumTotalDistance(robot: List[Int], factory: Array[Array[Int]]): Long = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun minimumTotalDistance(robot: List, factory: Array): Long {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn minimum_total_distance(robot: Vec, factory: Vec>) -> i64 {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[] $robot\n * @param Integer[][] $factory\n * @return Integer\n */\n function minimumTotalDistance($robot, $factory) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function minimumTotalDistance(robot: number[], factory: number[][]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (minimum-total-distance robot factory)\n (-> (listof exact-integer?) (listof (listof exact-integer?)) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec minimum_total_distance(Robot :: [integer()], Factory :: [[integer()]]) -> integer().\nminimum_total_distance(Robot, Factory) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec minimum_total_distance(robot :: [integer], factory :: [[integer]]) :: integer\n def minimum_total_distance(robot, factory) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int minimumTotalDistance(List robot, List> factory) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"3.5K\", \"totalSubmission\": \"9K\", \"totalAcceptedRaw\": 3478, \"totalSubmissionRaw\": 8984, \"acRate\": \"38.7%\"}", + "hints": [ + "Sort robots and factories by their positions.", + "After sorting, notice that each factory should repair some subsegment of robots.", + "Find the minimum total distance to repair first i robots with first j factories." + ], + "solution": null, + "status": null, + "sampleTestCase": "[0,4,6]\n[[2,2],[6,2]]", + "metaData": "{\n \"name\": \"minimumTotalDistance\",\n \"params\": [\n {\n \"name\": \"robot\",\n \"type\": \"list\"\n },\n {\n \"type\": \"integer[][]\",\n \"name\": \"factory\"\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 datastructures-js/priority-queue and datastructures-js/queue.

\"], \"ruby\": [\"Ruby\", \"

Ruby 3.1

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

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

\"], \"swift\": [\"Swift\", \"

Swift 5.5.2.

\"], \"golang\": [\"Go\", \"

Go 1.17.6.

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

Support https://godoc.org/github.com/emirpasic/gods library.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

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

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

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

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

\"], \"scala\": [\"Scala\", \"

Scala 2.13.7.

\"], \"kotlin\": [\"Kotlin\", \"

Kotlin 1.3.10.

\"], \"rust\": [\"Rust\", \"

Rust 1.58.1

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

Supports rand v0.6\\u00a0from crates.io

\"], \"php\": [\"PHP\", \"

PHP 8.1.

\\r\\n

With bcmath module

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

TypeScript 4.5.4, Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

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

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

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

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/most-popular-video-creator.json b/leetcode/originData/most-popular-video-creator.json new file mode 100644 index 00000000..eb208d46 --- /dev/null +++ b/leetcode/originData/most-popular-video-creator.json @@ -0,0 +1,192 @@ +{ + "data": { + "question": { + "questionId": "2543", + "questionFrontendId": "2456", + "boundTopicId": null, + "title": "Most Popular Video Creator", + "titleSlug": "most-popular-video-creator", + "content": "

You are given two string arrays creators and ids, and an integer array views, all of length n. The ith video on a platform was created by creator[i], has an id of ids[i], and has views[i] views.

\n\n

The popularity of a creator is the sum of the number of views on all of the creator's videos. Find the creator with the highest popularity and the id of their most viewed video.

\n\n
    \n\t
  • If multiple creators have the highest popularity, find all of them.
  • \n\t
  • If multiple videos have the highest view count for a creator, find the lexicographically smallest id.
  • \n
\n\n

Return a 2D array of strings answer where answer[i] = [creatori, idi] means that creatori has the highest popularity and idi is the id of their most popular video. The answer can be returned in any order.

\n\n

 

\n

Example 1:

\n\n
\nInput: creators = ["alice","bob","alice","chris"], ids = ["one","two","three","four"], views = [5,10,5,4]\nOutput: [["alice","one"],["bob","two"]]\nExplanation:\nThe popularity of alice is 5 + 5 = 10.\nThe popularity of bob is 10.\nThe popularity of chris is 4.\nalice and bob are the most popular creators.\nFor bob, the video with the highest view count is "two".\nFor alice, the videos with the highest view count are "one" and "three". Since "one" is lexicographically smaller than "three", it is included in the answer.\n
\n\n

Example 2:

\n\n
\nInput: creators = ["alice","alice","alice"], ids = ["a","b","c"], views = [1,2,2]\nOutput: [["alice","b"]]\nExplanation:\nThe videos with id "b" and "c" have the highest view count.\nSince "b" is lexicographically smaller than "c", it is included in the answer.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • n == creators.length == ids.length == views.length
  • \n\t
  • 1 <= n <= 105
  • \n\t
  • 1 <= creators[i].length, ids[i].length <= 5
  • \n\t
  • creators[i] and ids[i] consist only of lowercase English letters.
  • \n\t
  • 0 <= views[i] <= 105
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 145, + "dislikes": 288, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Design Video Sharing Platform\", \"titleSlug\": \"design-video-sharing-platform\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Design a Food Rating System\", \"titleSlug\": \"design-a-food-rating-system\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]", + "exampleTestcases": "[\"alice\",\"bob\",\"alice\",\"chris\"]\n[\"one\",\"two\",\"three\",\"four\"]\n[5,10,5,4]\n[\"alice\",\"alice\",\"alice\"]\n[\"a\",\"b\",\"c\"]\n[1,2,2]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Hash Table", + "slug": "hash-table", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "String", + "slug": "string", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Sorting", + "slug": "sorting", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Heap (Priority Queue)", + "slug": "heap-priority-queue", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n vector> mostPopularCreator(vector& creators, vector& ids, vector& views) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public List> mostPopularCreator(String[] creators, String[] ids, int[] views) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def mostPopularCreator(self, creators, ids, views):\n \"\"\"\n :type creators: List[str]\n :type ids: List[str]\n :type views: List[int]\n :rtype: List[List[str]]\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def mostPopularCreator(self, creators: List[str], ids: List[str], views: List[int]) -> List[List[str]]:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "/**\n * Return an array of arrays of size *returnSize.\n * The sizes of the arrays are returned as *returnColumnSizes array.\n * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free().\n */\nchar *** mostPopularCreator(char ** creators, int creatorsSize, char ** ids, int idsSize, int* views, int viewsSize, int* returnSize, int** returnColumnSizes){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public IList> MostPopularCreator(string[] creators, string[] ids, int[] views) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {string[]} creators\n * @param {string[]} ids\n * @param {number[]} views\n * @return {string[][]}\n */\nvar mostPopularCreator = function(creators, ids, views) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {String[]} creators\n# @param {String[]} ids\n# @param {Integer[]} views\n# @return {String[][]}\ndef most_popular_creator(creators, ids, views)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func mostPopularCreator(_ creators: [String], _ ids: [String], _ views: [Int]) -> [[String]] {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func mostPopularCreator(creators []string, ids []string, views []int) [][]string {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def mostPopularCreator(creators: Array[String], ids: Array[String], views: Array[Int]): List[List[String]] = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun mostPopularCreator(creators: Array, ids: Array, views: IntArray): List> {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn most_popular_creator(creators: Vec, ids: Vec, views: Vec) -> Vec> {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param String[] $creators\n * @param String[] $ids\n * @param Integer[] $views\n * @return String[][]\n */\n function mostPopularCreator($creators, $ids, $views) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function mostPopularCreator(creators: string[], ids: string[], views: number[]): string[][] {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (most-popular-creator creators ids views)\n (-> (listof string?) (listof string?) (listof exact-integer?) (listof (listof string?)))\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec most_popular_creator(Creators :: [unicode:unicode_binary()], Ids :: [unicode:unicode_binary()], Views :: [integer()]) -> [[unicode:unicode_binary()]].\nmost_popular_creator(Creators, Ids, Views) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec most_popular_creator(creators :: [String.t], ids :: [String.t], views :: [integer]) :: [[String.t]]\n def most_popular_creator(creators, ids, views) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n List> mostPopularCreator(List creators, List ids, List views) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"15.2K\", \"totalSubmission\": \"34.5K\", \"totalAcceptedRaw\": 15246, \"totalSubmissionRaw\": 34538, \"acRate\": \"44.1%\"}", + "hints": [ + "Use a hash table to store and categorize videos based on their creator.", + "For each creator, iterate through all their videos and use three variables to keep track of their popularity, their most popular video, and the id of their most popular video." + ], + "solution": null, + "status": null, + "sampleTestCase": "[\"alice\",\"bob\",\"alice\",\"chris\"]\n[\"one\",\"two\",\"three\",\"four\"]\n[5,10,5,4]", + "metaData": "{\n \"name\": \"mostPopularCreator\",\n \"params\": [\n {\n \"name\": \"creators\",\n \"type\": \"string[]\"\n },\n {\n \"type\": \"string[]\",\n \"name\": \"ids\"\n },\n {\n \"type\": \"integer[]\",\n \"name\": \"views\"\n }\n ],\n \"return\": {\n \"type\": \"list>\"\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 datastructures-js/priority-queue and datastructures-js/queue.

\"], \"ruby\": [\"Ruby\", \"

Ruby 3.1

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

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

\"], \"swift\": [\"Swift\", \"

Swift 5.5.2.

\"], \"golang\": [\"Go\", \"

Go 1.17.6.

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

Support https://godoc.org/github.com/emirpasic/gods library.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

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

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

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

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

\"], \"scala\": [\"Scala\", \"

Scala 2.13.7.

\"], \"kotlin\": [\"Kotlin\", \"

Kotlin 1.3.10.

\"], \"rust\": [\"Rust\", \"

Rust 1.58.1

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

Supports rand v0.6\\u00a0from crates.io

\"], \"php\": [\"PHP\", \"

PHP 8.1.

\\r\\n

With bcmath module

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

TypeScript 4.5.4, Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

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

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

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

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/next-greater-element-iv.json b/leetcode/originData/next-greater-element-iv.json new file mode 100644 index 00000000..21900c70 --- /dev/null +++ b/leetcode/originData/next-greater-element-iv.json @@ -0,0 +1,199 @@ +{ + "data": { + "question": { + "questionId": "2549", + "questionFrontendId": "2454", + "boundTopicId": null, + "title": "Next Greater Element IV", + "titleSlug": "next-greater-element-iv", + "content": "

You are given a 0-indexed array of non-negative integers nums. For each integer in nums, you must find its respective second greater integer.

\n\n

The second greater integer of nums[i] is nums[j] such that:

\n\n
    \n\t
  • j > i
  • \n\t
  • nums[j] > nums[i]
  • \n\t
  • There exists exactly one index k such that nums[k] > nums[i] and i < k < j.
  • \n
\n\n

If there is no such nums[j], the second greater integer is considered to be -1.

\n\n
    \n\t
  • For example, in the array [1, 2, 4, 3], the second greater integer of 1 is 4, 2 is 3, and that of 3 and 4 is -1.
  • \n
\n\n

Return an integer array answer, where answer[i] is the second greater integer of nums[i].

\n\n

 

\n

Example 1:

\n\n
\nInput: nums = [2,4,0,9,6]\nOutput: [9,6,6,-1,-1]\nExplanation:\n0th index: 4 is the first integer greater than 2, and 9 is the second integer greater than 2, to the right of 2.\n1st index: 9 is the first, and 6 is the second integer greater than 4, to the right of 4.\n2nd index: 9 is the first, and 6 is the second integer greater than 0, to the right of 0.\n3rd index: There is no integer greater than 9 to its right, so the second greater integer is considered to be -1.\n4th index: There is no integer greater than 6 to its right, so the second greater integer is considered to be -1.\nThus, we return [9,6,6,-1,-1].\n
\n\n

Example 2:

\n\n
\nInput: nums = [3,3]\nOutput: [-1,-1]\nExplanation:\nWe return [-1,-1] since neither integer has any integer greater than it.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= nums.length <= 105
  • \n\t
  • 0 <= nums[i] <= 109
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Hard", + "likes": 286, + "dislikes": 2, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Next Greater Element I\", \"titleSlug\": \"next-greater-element-i\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Replace Elements with Greatest Element on Right Side\", \"titleSlug\": \"replace-elements-with-greatest-element-on-right-side\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]", + "exampleTestcases": "[2,4,0,9,6]\n[3,3]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Binary Search", + "slug": "binary-search", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Stack", + "slug": "stack", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Sorting", + "slug": "sorting", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Heap (Priority Queue)", + "slug": "heap-priority-queue", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Monotonic Stack", + "slug": "monotonic-stack", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n vector secondGreaterElement(vector& nums) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int[] secondGreaterElement(int[] nums) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def secondGreaterElement(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 secondGreaterElement(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* secondGreaterElement(int* nums, int numsSize, int* returnSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int[] SecondGreaterElement(int[] nums) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums\n * @return {number[]}\n */\nvar secondGreaterElement = function(nums) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums\n# @return {Integer[]}\ndef second_greater_element(nums)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func secondGreaterElement(_ nums: [Int]) -> [Int] {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func secondGreaterElement(nums []int) []int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def secondGreaterElement(nums: Array[Int]): Array[Int] = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun secondGreaterElement(nums: IntArray): IntArray {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn second_greater_element(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 secondGreaterElement($nums) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function secondGreaterElement(nums: number[]): number[] {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (second-greater-element nums)\n (-> (listof exact-integer?) (listof exact-integer?))\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec second_greater_element(Nums :: [integer()]) -> [integer()].\nsecond_greater_element(Nums) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec second_greater_element(nums :: [integer]) :: [integer]\n def second_greater_element(nums) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n List secondGreaterElement(List nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"4.7K\", \"totalSubmission\": \"12K\", \"totalAcceptedRaw\": 4694, \"totalSubmissionRaw\": 11998, \"acRate\": \"39.1%\"}", + "hints": [ + "Move forward in nums and store the value in a non-increasing stack for the first greater value.", + "Move the value in the stack to an ordered data structure for the second greater value.", + "Move value from the ordered data structure for the answer." + ], + "solution": null, + "status": null, + "sampleTestCase": "[2,4,0,9,6]", + "metaData": "{\n \"name\": \"secondGreaterElement\",\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 datastructures-js/priority-queue and datastructures-js/queue.

\"], \"ruby\": [\"Ruby\", \"

Ruby 3.1

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

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

\"], \"swift\": [\"Swift\", \"

Swift 5.5.2.

\"], \"golang\": [\"Go\", \"

Go 1.17.6.

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

Support https://godoc.org/github.com/emirpasic/gods library.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

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

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

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

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

\"], \"scala\": [\"Scala\", \"

Scala 2.13.7.

\"], \"kotlin\": [\"Kotlin\", \"

Kotlin 1.3.10.

\"], \"rust\": [\"Rust\", \"

Rust 1.58.1

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

Supports rand v0.6\\u00a0from crates.io

\"], \"php\": [\"PHP\", \"

PHP 8.1.

\\r\\n

With bcmath module

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

TypeScript 4.5.4, Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

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

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

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

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/odd-string-difference.json b/leetcode/originData/odd-string-difference.json new file mode 100644 index 00000000..bbe49270 --- /dev/null +++ b/leetcode/originData/odd-string-difference.json @@ -0,0 +1,180 @@ +{ + "data": { + "question": { + "questionId": "2547", + "questionFrontendId": "2451", + "boundTopicId": null, + "title": "Odd String Difference", + "titleSlug": "odd-string-difference", + "content": "

You are given an array of equal-length strings words. Assume that the length of each string is n.

\n\n

Each string words[i] can be converted into a difference integer array difference[i] of length n - 1 where difference[i][j] = words[i][j+1] - words[i][j] where 0 <= j <= n - 2. Note that the difference between two letters is the difference between their positions in the alphabet i.e. the position of 'a' is 0, 'b' is 1, and 'z' is 25.

\n\n
    \n\t
  • For example, for the string "acb", the difference integer array is [2 - 0, 1 - 2] = [2, -1].
  • \n
\n\n

All the strings in words have the same difference integer array, except one. You should find that string.

\n\n

Return the string in words that has different difference integer array.

\n\n

 

\n

Example 1:

\n\n
\nInput: words = ["adc","wzy","abc"]\nOutput: "abc"\nExplanation: \n- The difference integer array of "adc" is [3 - 0, 2 - 3] = [3, -1].\n- The difference integer array of "wzy" is [25 - 22, 24 - 25]= [3, -1].\n- The difference integer array of "abc" is [1 - 0, 2 - 1] = [1, 1]. \nThe odd array out is [1, 1], so we return the corresponding string, "abc".\n
\n\n

Example 2:

\n\n
\nInput: words = ["aaa","bob","ccc","ddd"]\nOutput: "bob"\nExplanation: All the integer arrays are [0, 0] except for "bob", which corresponds to [13, -13].\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 3 <= words.length <= 100
  • \n\t
  • n == words[i].length
  • \n\t
  • 2 <= n <= 20
  • \n\t
  • words[i] consists of lowercase English letters.
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 150, + "dislikes": 59, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Minimum Rounds to Complete All Tasks\", \"titleSlug\": \"minimum-rounds-to-complete-all-tasks\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]", + "exampleTestcases": "[\"adc\",\"wzy\",\"abc\"]\n[\"aaa\",\"bob\",\"ccc\",\"ddd\"]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Hash Table", + "slug": "hash-table", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Math", + "slug": "math", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "String", + "slug": "string", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n string oddString(vector& words) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public String oddString(String[] words) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def oddString(self, words):\n \"\"\"\n :type words: List[str]\n :rtype: str\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def oddString(self, words: List[str]) -> str:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "char * oddString(char ** words, int wordsSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public string OddString(string[] words) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {string[]} words\n * @return {string}\n */\nvar oddString = function(words) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {String[]} words\n# @return {String}\ndef odd_string(words)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func oddString(_ words: [String]) -> String {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func oddString(words []string) string {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def oddString(words: Array[String]): String = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun oddString(words: Array): String {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn odd_string(words: Vec) -> String {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param String[] $words\n * @return String\n */\n function oddString($words) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function oddString(words: string[]): string {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (odd-string words)\n (-> (listof string?) string?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec odd_string(Words :: [unicode:unicode_binary()]) -> unicode:unicode_binary().\nodd_string(Words) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec odd_string(words :: [String.t]) :: String.t\n def odd_string(words) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n String oddString(List words) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"14.4K\", \"totalSubmission\": \"24.2K\", \"totalAcceptedRaw\": 14354, \"totalSubmissionRaw\": 24185, \"acRate\": \"59.4%\"}", + "hints": [ + "Find the difference integer array for each string.", + "Compare them to find the odd one out." + ], + "solution": null, + "status": null, + "sampleTestCase": "[\"adc\",\"wzy\",\"abc\"]", + "metaData": "{\n \"name\": \"oddString\",\n \"params\": [\n {\n \"name\": \"words\",\n \"type\": \"string[]\"\n }\n ],\n \"return\": {\n \"type\": \"string\"\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 datastructures-js/priority-queue and datastructures-js/queue.

\"], \"ruby\": [\"Ruby\", \"

Ruby 3.1

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

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

\"], \"swift\": [\"Swift\", \"

Swift 5.5.2.

\"], \"golang\": [\"Go\", \"

Go 1.17.6.

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

Support https://godoc.org/github.com/emirpasic/gods library.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

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

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

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

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

\"], \"scala\": [\"Scala\", \"

Scala 2.13.7.

\"], \"kotlin\": [\"Kotlin\", \"

Kotlin 1.3.10.

\"], \"rust\": [\"Rust\", \"

Rust 1.58.1

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

Supports rand v0.6\\u00a0from crates.io

\"], \"php\": [\"PHP\", \"

PHP 8.1.

\\r\\n

With bcmath module

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

TypeScript 4.5.4, Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

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

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

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

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/total-cost-to-hire-k-workers.json b/leetcode/originData/total-cost-to-hire-k-workers.json new file mode 100644 index 00000000..4a6ea19a --- /dev/null +++ b/leetcode/originData/total-cost-to-hire-k-workers.json @@ -0,0 +1,187 @@ +{ + "data": { + "question": { + "questionId": "2553", + "questionFrontendId": "2462", + "boundTopicId": null, + "title": "Total Cost to Hire K Workers", + "titleSlug": "total-cost-to-hire-k-workers", + "content": "

You are given a 0-indexed integer array costs where costs[i] is the cost of hiring the ith worker.

\n\n

You are also given two integers k and candidates. We want to hire exactly k workers according to the following rules:

\n\n
    \n\t
  • You will run k sessions and hire exactly one worker in each session.
  • \n\t
  • In each hiring session, choose the worker with the lowest cost from either the first candidates workers or the last candidates workers. Break the tie by the smallest index.\n\t
      \n\t\t
    • For example, if costs = [3,2,7,7,1,2] and candidates = 2, then in the first hiring session, we will choose the 4th worker because they have the lowest cost [3,2,7,7,1,2].
    • \n\t\t
    • In the second hiring session, we will choose 1st worker because they have the same lowest cost as 4th worker but they have the smallest index [3,2,7,7,2]. Please note that the indexing may be changed in the process.
    • \n\t
    \n\t
  • \n\t
  • If there are fewer than candidates workers remaining, choose the worker with the lowest cost among them. Break the tie by the smallest index.
  • \n\t
  • A worker can only be chosen once.
  • \n
\n\n

Return the total cost to hire exactly k workers.

\n\n

 

\n

Example 1:

\n\n
\nInput: costs = [17,12,10,2,7,2,11,20,8], k = 3, candidates = 4\nOutput: 11\nExplanation: We hire 3 workers in total. The total cost is initially 0.\n- In the first hiring round we choose the worker from [17,12,10,2,7,2,11,20,8]. The lowest cost is 2, and we break the tie by the smallest index, which is 3. The total cost = 0 + 2 = 2.\n- In the second hiring round we choose the worker from [17,12,10,7,2,11,20,8]. The lowest cost is 2 (index 4). The total cost = 2 + 2 = 4.\n- In the third hiring round we choose the worker from [17,12,10,7,11,20,8]. The lowest cost is 7 (index 3). The total cost = 4 + 7 = 11. Notice that the worker with index 3 was common in the first and last four workers.\nThe total hiring cost is 11.\n
\n\n

Example 2:

\n\n
\nInput: costs = [1,2,4,1], k = 3, candidates = 3\nOutput: 4\nExplanation: We hire 3 workers in total. The total cost is initially 0.\n- In the first hiring round we choose the worker from [1,2,4,1]. The lowest cost is 1, and we break the tie by the smallest index, which is 0. The total cost = 0 + 1 = 1. Notice that workers with index 1 and 2 are common in the first and last 3 workers.\n- In the second hiring round we choose the worker from [2,4,1]. The lowest cost is 1 (index 2). The total cost = 1 + 1 = 2.\n- In the third hiring round there are less than three candidates. We choose the worker from the remaining workers [2,4]. The lowest cost is 2 (index 0). The total cost = 2 + 2 = 4.\nThe total hiring cost is 4.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= costs.length <= 105
  • \n\t
  • 1 <= costs[i] <= 105
  • \n\t
  • 1 <= k, candidates <= costs.length
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 272, + "dislikes": 46, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Meeting Rooms II\", \"titleSlug\": \"meeting-rooms-ii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]", + "exampleTestcases": "[17,12,10,2,7,2,11,20,8]\n3\n4\n[1,2,4,1]\n3\n3", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Two Pointers", + "slug": "two-pointers", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Heap (Priority Queue)", + "slug": "heap-priority-queue", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Simulation", + "slug": "simulation", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n long long totalCost(vector& costs, int k, int candidates) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public long totalCost(int[] costs, int k, int candidates) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def totalCost(self, costs, k, candidates):\n \"\"\"\n :type costs: List[int]\n :type k: int\n :type candidates: int\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def totalCost(self, costs: List[int], k: int, candidates: int) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "long long totalCost(int* costs, int costsSize, int k, int candidates){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public long TotalCost(int[] costs, int k, int candidates) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} costs\n * @param {number} k\n * @param {number} candidates\n * @return {number}\n */\nvar totalCost = function(costs, k, candidates) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} costs\n# @param {Integer} k\n# @param {Integer} candidates\n# @return {Integer}\ndef total_cost(costs, k, candidates)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func totalCost(_ costs: [Int], _ k: Int, _ candidates: Int) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func totalCost(costs []int, k int, candidates int) int64 {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def totalCost(costs: Array[Int], k: Int, candidates: Int): Long = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun totalCost(costs: IntArray, k: Int, candidates: Int): Long {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn total_cost(costs: Vec, k: i32, candidates: i32) -> i64 {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[] $costs\n * @param Integer $k\n * @param Integer $candidates\n * @return Integer\n */\n function totalCost($costs, $k, $candidates) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function totalCost(costs: number[], k: number, candidates: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (total-cost costs k candidates)\n (-> (listof exact-integer?) exact-integer? exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec total_cost(Costs :: [integer()], K :: integer(), Candidates :: integer()) -> integer().\ntotal_cost(Costs, K, Candidates) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec total_cost(costs :: [integer], k :: integer, candidates :: integer) :: integer\n def total_cost(costs, k, candidates) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int totalCost(List costs, int k, int candidates) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"10.1K\", \"totalSubmission\": \"27.3K\", \"totalAcceptedRaw\": 10066, \"totalSubmissionRaw\": 27276, \"acRate\": \"36.9%\"}", + "hints": [ + "Maintain two minheaps: one for the left and one for the right.", + "Compare the top element from two heaps and remove the appropriate one.", + "Add a new element to the heap and maintain its size as k." + ], + "solution": null, + "status": null, + "sampleTestCase": "[17,12,10,2,7,2,11,20,8]\n3\n4", + "metaData": "{\n \"name\": \"totalCost\",\n \"params\": [\n {\n \"name\": \"costs\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"k\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"candidates\"\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 datastructures-js/priority-queue and datastructures-js/queue.

\"], \"ruby\": [\"Ruby\", \"

Ruby 3.1

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

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

\"], \"swift\": [\"Swift\", \"

Swift 5.5.2.

\"], \"golang\": [\"Go\", \"

Go 1.17.6.

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

Support https://godoc.org/github.com/emirpasic/gods library.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

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

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

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

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

\"], \"scala\": [\"Scala\", \"

Scala 2.13.7.

\"], \"kotlin\": [\"Kotlin\", \"

Kotlin 1.3.10.

\"], \"rust\": [\"Rust\", \"

Rust 1.58.1

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

Supports rand v0.6\\u00a0from crates.io

\"], \"php\": [\"PHP\", \"

PHP 8.1.

\\r\\n

With bcmath module

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

TypeScript 4.5.4, Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

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

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

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

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/words-within-two-edits-of-dictionary.json b/leetcode/originData/words-within-two-edits-of-dictionary.json new file mode 100644 index 00000000..15ed74cc --- /dev/null +++ b/leetcode/originData/words-within-two-edits-of-dictionary.json @@ -0,0 +1,175 @@ +{ + "data": { + "question": { + "questionId": "2550", + "questionFrontendId": "2452", + "boundTopicId": null, + "title": "Words Within Two Edits of Dictionary", + "titleSlug": "words-within-two-edits-of-dictionary", + "content": "

You are given two string arrays, queries and dictionary. All words in each array comprise of lowercase English letters and have the same length.

\n\n

In one edit you can take a word from queries, and change any letter in it to any other letter. Find all words from queries that, after a maximum of two edits, equal some word from dictionary.

\n\n

Return a list of all words from queries, that match with some word from dictionary after a maximum of two edits. Return the words in the same order they appear in queries.

\n\n

 

\n

Example 1:

\n\n
\nInput: queries = ["word","note","ants","wood"], dictionary = ["wood","joke","moat"]\nOutput: ["word","note","wood"]\nExplanation:\n- Changing the 'r' in "word" to 'o' allows it to equal the dictionary word "wood".\n- Changing the 'n' to 'j' and the 't' to 'k' in "note" changes it to "joke".\n- It would take more than 2 edits for "ants" to equal a dictionary word.\n- "wood" can remain unchanged (0 edits) and match the corresponding dictionary word.\nThus, we return ["word","note","wood"].\n
\n\n

Example 2:

\n\n
\nInput: queries = ["yes"], dictionary = ["not"]\nOutput: []\nExplanation:\nApplying any two edits to "yes" cannot make it equal to "not". Thus, we return an empty array.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= queries.length, dictionary.length <= 100
  • \n\t
  • n == queries[i].length == dictionary[j].length
  • \n\t
  • 1 <= n <= 100
  • \n\t
  • All queries[i] and dictionary[j] are composed of lowercase English letters.
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 147, + "dislikes": 6, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Word Ladder\", \"titleSlug\": \"word-ladder\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]", + "exampleTestcases": "[\"word\",\"note\",\"ants\",\"wood\"]\n[\"wood\",\"joke\",\"moat\"]\n[\"yes\"]\n[\"not\"]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "String", + "slug": "string", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n vector twoEditWords(vector& queries, vector& dictionary) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public List twoEditWords(String[] queries, String[] dictionary) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def twoEditWords(self, queries, dictionary):\n \"\"\"\n :type queries: List[str]\n :type dictionary: List[str]\n :rtype: List[str]\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def twoEditWords(self, queries: List[str], dictionary: List[str]) -> List[str]:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "/**\n * Note: The returned array must be malloced, assume caller calls free().\n */\nchar ** twoEditWords(char ** queries, int queriesSize, char ** dictionary, int dictionarySize, int* returnSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public IList TwoEditWords(string[] queries, string[] dictionary) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {string[]} queries\n * @param {string[]} dictionary\n * @return {string[]}\n */\nvar twoEditWords = function(queries, dictionary) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {String[]} queries\n# @param {String[]} dictionary\n# @return {String[]}\ndef two_edit_words(queries, dictionary)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func twoEditWords(_ queries: [String], _ dictionary: [String]) -> [String] {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func twoEditWords(queries []string, dictionary []string) []string {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def twoEditWords(queries: Array[String], dictionary: Array[String]): List[String] = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun twoEditWords(queries: Array, dictionary: Array): List {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn two_edit_words(queries: Vec, dictionary: Vec) -> Vec {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param String[] $queries\n * @param String[] $dictionary\n * @return String[]\n */\n function twoEditWords($queries, $dictionary) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function twoEditWords(queries: string[], dictionary: string[]): string[] {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (two-edit-words queries dictionary)\n (-> (listof string?) (listof string?) (listof string?))\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec two_edit_words(Queries :: [unicode:unicode_binary()], Dictionary :: [unicode:unicode_binary()]) -> [unicode:unicode_binary()].\ntwo_edit_words(Queries, Dictionary) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec two_edit_words(queries :: [String.t], dictionary :: [String.t]) :: [String.t]\n def two_edit_words(queries, dictionary) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n List twoEditWords(List queries, List dictionary) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"12.6K\", \"totalSubmission\": \"21K\", \"totalAcceptedRaw\": 12618, \"totalSubmissionRaw\": 20981, \"acRate\": \"60.1%\"}", + "hints": [ + "Try brute-forcing the problem.", + "For each word in queries, try comparing to each word in dictionary.", + "If there is a maximum of two edit differences, the word should be present in answer." + ], + "solution": null, + "status": null, + "sampleTestCase": "[\"word\",\"note\",\"ants\",\"wood\"]\n[\"wood\",\"joke\",\"moat\"]", + "metaData": "{\n \"name\": \"twoEditWords\",\n \"params\": [\n {\n \"name\": \"queries\",\n \"type\": \"string[]\"\n },\n {\n \"type\": \"string[]\",\n \"name\": \"dictionary\"\n }\n ],\n \"return\": {\n \"type\": \"list\"\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 datastructures-js/priority-queue and datastructures-js/queue.

\"], \"ruby\": [\"Ruby\", \"

Ruby 3.1

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

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

\"], \"swift\": [\"Swift\", \"

Swift 5.5.2.

\"], \"golang\": [\"Go\", \"

Go 1.17.6.

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

Support https://godoc.org/github.com/emirpasic/gods library.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

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

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

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

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

\"], \"scala\": [\"Scala\", \"

Scala 2.13.7.

\"], \"kotlin\": [\"Kotlin\", \"

Kotlin 1.3.10.

\"], \"rust\": [\"Rust\", \"

Rust 1.58.1

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

Supports rand v0.6\\u00a0from crates.io

\"], \"php\": [\"PHP\", \"

PHP 8.1.

\\r\\n

With bcmath module

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

TypeScript 4.5.4, Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

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

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

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

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/problem/apply-operations-to-an-array.html b/leetcode/problem/apply-operations-to-an-array.html new file mode 100644 index 00000000..21443c21 --- /dev/null +++ b/leetcode/problem/apply-operations-to-an-array.html @@ -0,0 +1,48 @@ +

You are given a 0-indexed array nums of size n consisting of non-negative integers.

+ +

You need to apply n - 1 operations to this array where, in the ith operation (0-indexed), you will apply the following on the ith element of nums:

+ +
    +
  • If nums[i] == nums[i + 1], then multiply nums[i] by 2 and set nums[i + 1] to 0. Otherwise, you skip this operation.
  • +
+ +

After performing all the operations, shift all the 0's to the end of the array.

+ +
    +
  • For example, the array [1,0,2,0,0,1] after shifting all its 0's to the end, is [1,2,1,0,0,0].
  • +
+ +

Return the resulting array.

+ +

Note that the operations are applied sequentially, not all at once.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,2,1,1,0]
+Output: [1,4,2,0,0,0]
+Explanation: We do the following operations:
+- i = 0: nums[0] and nums[1] are not equal, so we skip this operation.
+- i = 1: nums[1] and nums[2] are equal, we multiply nums[1] by 2 and change nums[2] to 0. The array becomes [1,4,0,1,1,0].
+- i = 2: nums[2] and nums[3] are not equal, so we skip this operation.
+- i = 3: nums[3] and nums[4] are equal, we multiply nums[3] by 2 and change nums[4] to 0. The array becomes [1,4,0,2,0,0].
+- i = 4: nums[4] and nums[5] are equal, we multiply nums[4] by 2 and change nums[5] to 0. The array becomes [1,4,0,2,0,0].
+After that, we shift the 0's to the end, which gives the array [1,4,2,0,0,0].
+
+ +

Example 2:

+ +
+Input: nums = [0,1]
+Output: [1,0]
+Explanation: No operation can be applied, we just shift the 0 to the end.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= nums.length <= 2000
  • +
  • 0 <= nums[i] <= 1000
  • +
diff --git a/leetcode/problem/average-value-of-even-numbers-that-are-divisible-by-three.html b/leetcode/problem/average-value-of-even-numbers-that-are-divisible-by-three.html new file mode 100644 index 00000000..a25d49f0 --- /dev/null +++ b/leetcode/problem/average-value-of-even-numbers-that-are-divisible-by-three.html @@ -0,0 +1,28 @@ +

Given an integer array nums of positive integers, return the average value of all even integers that are divisible by 3.

+ +

Note that the average of n elements is the sum of the n elements divided by n and rounded down to the nearest integer.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,3,6,10,12,15]
+Output: 9
+Explanation: 6 and 12 are even numbers that are divisible by 3. (6 + 12) / 2 = 9.
+
+ +

Example 2:

+ +
+Input: nums = [1,2,4,7,10]
+Output: 0
+Explanation: There is no single number that satisfies the requirement, so return 0.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 1000
  • +
  • 1 <= nums[i] <= 1000
  • +
diff --git a/leetcode/problem/destroy-sequential-targets.html b/leetcode/problem/destroy-sequential-targets.html new file mode 100644 index 00000000..78e9e5f9 --- /dev/null +++ b/leetcode/problem/destroy-sequential-targets.html @@ -0,0 +1,43 @@ +

You are given a 0-indexed array nums consisting of positive integers, representing targets on a number line. You are also given an integer space.

+ +

You have a machine which can destroy targets. Seeding the machine with some nums[i] allows it to destroy all targets with values that can be represented as nums[i] + c * space, where c is any non-negative integer. You want to destroy the maximum number of targets in nums.

+ +

Return the minimum value of nums[i] you can seed the machine with to destroy the maximum number of targets.

+ +

 

+

Example 1:

+ +
+Input: nums = [3,7,8,1,1,5], space = 2
+Output: 1
+Explanation: If we seed the machine with nums[3], then we destroy all targets equal to 1,3,5,7,9,... 
+In this case, we would destroy 5 total targets (all except for nums[2]). 
+It is impossible to destroy more than 5 targets, so we return nums[3].
+
+ +

Example 2:

+ +
+Input: nums = [1,3,5,2,4,6], space = 2
+Output: 1
+Explanation: Seeding the machine with nums[0], or nums[3] destroys 3 targets. 
+It is not possible to destroy more than 3 targets.
+Since nums[0] is the minimal integer that can destroy 3 targets, we return 1.
+
+ +

Example 3:

+ +
+Input: nums = [6,2,5], space = 100
+Output: 2
+Explanation: Whatever initial seed we select, we can only destroy 1 target. The minimal seed is nums[1].
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
  • +
  • 1 <= nums[i] <= 109
  • +
  • 1 <= space <= 109
  • +
diff --git a/leetcode/problem/height-of-binary-tree-after-subtree-removal-queries.html b/leetcode/problem/height-of-binary-tree-after-subtree-removal-queries.html new file mode 100644 index 00000000..cc9b6fdb --- /dev/null +++ b/leetcode/problem/height-of-binary-tree-after-subtree-removal-queries.html @@ -0,0 +1,52 @@ +

You are given the root of a binary tree with n nodes. Each node is assigned a unique value from 1 to n. You are also given an array queries of size m.

+ +

You have to perform m independent queries on the tree where in the ith query you do the following:

+ +
    +
  • Remove the subtree rooted at the node with the value queries[i] from the tree. It is guaranteed that queries[i] will not be equal to the value of the root.
  • +
+ +

Return an array answer of size m where answer[i] is the height of the tree after performing the ith query.

+ +

Note:

+ +
    +
  • The queries are independent, so the tree returns to its initial state after each query.
  • +
  • The height of a tree is the number of edges in the longest simple path from the root to some node in the tree.
  • +
+ +

 

+

Example 1:

+ +
+Input: root = [1,3,4,2,null,6,5,null,null,null,null,null,7], queries = [4]
+Output: [2]
+Explanation: The diagram above shows the tree after removing the subtree rooted at node with value 4.
+The height of the tree is 2 (The path 1 -> 3 -> 2).
+
+ +

Example 2:

+ +
+Input: root = [5,8,9,2,1,3,7,4,6], queries = [3,2,4,8]
+Output: [3,2,3,2]
+Explanation: We have the following queries:
+- Removing the subtree rooted at node with value 3. The height of the tree becomes 3 (The path 5 -> 8 -> 2 -> 4).
+- Removing the subtree rooted at node with value 2. The height of the tree becomes 2 (The path 5 -> 8 -> 1).
+- Removing the subtree rooted at node with value 4. The height of the tree becomes 3 (The path 5 -> 8 -> 2 -> 6).
+- Removing the subtree rooted at node with value 8. The height of the tree becomes 2 (The path 5 -> 9 -> 3).
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree is n.
  • +
  • 2 <= n <= 105
  • +
  • 1 <= Node.val <= n
  • +
  • All the values in the tree are unique.
  • +
  • m == queries.length
  • +
  • 1 <= m <= min(n, 104)
  • +
  • 1 <= queries[i] <= n
  • +
  • queries[i] != root.val
  • +
diff --git a/leetcode/problem/maximum-sum-of-distinct-subarrays-with-length-k.html b/leetcode/problem/maximum-sum-of-distinct-subarrays-with-length-k.html new file mode 100644 index 00000000..009e96ee --- /dev/null +++ b/leetcode/problem/maximum-sum-of-distinct-subarrays-with-length-k.html @@ -0,0 +1,43 @@ +

You are given an integer array nums and an integer k. Find the maximum subarray sum of all the subarrays of nums that meet the following conditions:

+ +
    +
  • The length of the subarray is k, and
  • +
  • All the elements of the subarray are distinct.
  • +
+ +

Return the maximum subarray sum of all the subarrays that meet the conditions. If no subarray meets the conditions, return 0.

+ +

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

+ +

 

+

Example 1:

+ +
+Input: nums = [1,5,4,2,9,9,9], k = 3
+Output: 15
+Explanation: The subarrays of nums with length 3 are:
+- [1,5,4] which meets the requirements and has a sum of 10.
+- [5,4,2] which meets the requirements and has a sum of 11.
+- [4,2,9] which meets the requirements and has a sum of 15.
+- [2,9,9] which does not meet the requirements because the element 9 is repeated.
+- [9,9,9] which does not meet the requirements because the element 9 is repeated.
+We return 15 because it is the maximum subarray sum of all the subarrays that meet the conditions
+
+ +

Example 2:

+ +
+Input: nums = [4,4,4], k = 3
+Output: 0
+Explanation: The subarrays of nums with length 3 are:
+- [4,4,4] which does not meet the requirements because the element 4 is repeated.
+We return 0 because no subarrays meet the conditions.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= k <= nums.length <= 105
  • +
  • 1 <= nums[i] <= 105
  • +
diff --git a/leetcode/problem/minimum-addition-to-make-integer-beautiful.html b/leetcode/problem/minimum-addition-to-make-integer-beautiful.html new file mode 100644 index 00000000..4de6dbed --- /dev/null +++ b/leetcode/problem/minimum-addition-to-make-integer-beautiful.html @@ -0,0 +1,39 @@ +

You are given two positive integers n and target.

+ +

An integer is considered beautiful if the sum of its digits is less than or equal to target.

+ +

Return the minimum non-negative integer x such that n + x is beautiful. The input will be generated such that it is always possible to make n beautiful.

+ +

 

+

Example 1:

+ +
+Input: n = 16, target = 6
+Output: 4
+Explanation: Initially n is 16 and its digit sum is 1 + 6 = 7. After adding 4, n becomes 20 and digit sum becomes 2 + 0 = 2. It can be shown that we can not make n beautiful with adding non-negative integer less than 4.
+
+ +

Example 2:

+ +
+Input: n = 467, target = 6
+Output: 33
+Explanation: Initially n is 467 and its digit sum is 4 + 6 + 7 = 17. After adding 33, n becomes 500 and digit sum becomes 5 + 0 + 0 = 5. It can be shown that we can not make n beautiful with adding non-negative integer less than 33.
+
+ +

Example 3:

+ +
+Input: n = 1, target = 1
+Output: 0
+Explanation: Initially n is 1 and its digit sum is 1, which is already smaller than or equal to target.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 1012
  • +
  • 1 <= target <= 150
  • +
  • The input will be generated such that it is always possible to make n beautiful.
  • +
diff --git a/leetcode/problem/minimum-number-of-food-buckets-to-feed-the-hamsters.html b/leetcode/problem/minimum-number-of-food-buckets-to-feed-the-hamsters.html new file mode 100644 index 00000000..005abb5c --- /dev/null +++ b/leetcode/problem/minimum-number-of-food-buckets-to-feed-the-hamsters.html @@ -0,0 +1,44 @@ +

You are given a 0-indexed string hamsters where hamsters[i] is either:

+ +
    +
  • 'H' indicating that there is a hamster at index i, or
  • +
  • '.' indicating that index i is empty.
  • +
+ +

You will add some number of food buckets at the empty indices in order to feed the hamsters. A hamster can be fed if there is at least one food bucket to its left or to its right. More formally, a hamster at index i can be fed if you place a food bucket at index i - 1 and/or at index i + 1.

+ +

Return the minimum number of food buckets you should place at empty indices to feed all the hamsters or -1 if it is impossible to feed all of them.

+ +

 

+

Example 1:

+ +
+Input: hamsters = "H..H"
+Output: 2
+Explanation: We place two food buckets at indices 1 and 2.
+It can be shown that if we place only one food bucket, one of the hamsters will not be fed.
+
+ +

Example 2:

+ +
+Input: hamsters = ".H.H."
+Output: 1
+Explanation: We place one food bucket at index 2.
+
+ +

Example 3:

+ +
+Input: hamsters = ".HHH."
+Output: -1
+Explanation: If we place a food bucket at every empty index as shown, the hamster at index 2 will not be able to eat.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= hamsters.length <= 105
  • +
  • hamsters[i] is either'H' or '.'.
  • +
diff --git a/leetcode/problem/minimum-total-distance-traveled.html b/leetcode/problem/minimum-total-distance-traveled.html new file mode 100644 index 00000000..29c30d8e --- /dev/null +++ b/leetcode/problem/minimum-total-distance-traveled.html @@ -0,0 +1,58 @@ +

There are some robots and factories on the X-axis. You are given an integer array robot where robot[i] is the position of the ith robot. You are also given a 2D integer array factory where factory[j] = [positionj, limitj] indicates that positionj is the position of the jth factory and that the jth factory can repair at most limitj robots.

+ +

The positions of each robot are unique. The positions of each factory are also unique. Note that a robot can be in the same position as a factory initially.

+ +

All the robots are initially broken; they keep moving in one direction. The direction could be the negative or the positive direction of the X-axis. When a robot reaches a factory that did not reach its limit, the factory repairs the robot, and it stops moving.

+ +

At any moment, you can set the initial direction of moving for some robot. Your target is to minimize the total distance traveled by all the robots.

+ +

Return the minimum total distance traveled by all the robots. The test cases are generated such that all the robots can be repaired.

+ +

Note that

+ +
    +
  • All robots move at the same speed.
  • +
  • If two robots move in the same direction, they will never collide.
  • +
  • If two robots move in opposite directions and they meet at some point, they do not collide. They cross each other.
  • +
  • If a robot passes by a factory that reached its limits, it crosses it as if it does not exist.
  • +
  • If the robot moved from a position x to a position y, the distance it moved is |y - x|.
  • +
+ +

 

+

Example 1:

+ +
+Input: robot = [0,4,6], factory = [[2,2],[6,2]]
+Output: 4
+Explanation: As shown in the figure:
+- The first robot at position 0 moves in the positive direction. It will be repaired at the first factory.
+- The second robot at position 4 moves in the negative direction. It will be repaired at the first factory.
+- The third robot at position 6 will be repaired at the second factory. It does not need to move.
+The limit of the first factory is 2, and it fixed 2 robots.
+The limit of the second factory is 2, and it fixed 1 robot.
+The total distance is |2 - 0| + |2 - 4| + |6 - 6| = 4. It can be shown that we cannot achieve a better total distance than 4.
+
+ +

Example 2:

+ +
+Input: robot = [1,-1], factory = [[-2,1],[2,1]]
+Output: 2
+Explanation: As shown in the figure:
+- The first robot at position 1 moves in the positive direction. It will be repaired at the second factory.
+- The second robot at position -1 moves in the negative direction. It will be repaired at the first factory.
+The limit of the first factory is 1, and it fixed 1 robot.
+The limit of the second factory is 1, and it fixed 1 robot.
+The total distance is |2 - 1| + |(-2) - (-1)| = 2. It can be shown that we cannot achieve a better total distance than 2.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= robot.length, factory.length <= 100
  • +
  • factory[j].length == 2
  • +
  • -109 <= robot[i], positionj <= 109
  • +
  • 0 <= limitj <= robot.length
  • +
  • The input will be generated such that it is always possible to repair every robot.
  • +
diff --git a/leetcode/problem/most-popular-video-creator.html b/leetcode/problem/most-popular-video-creator.html new file mode 100644 index 00000000..6d8b567c --- /dev/null +++ b/leetcode/problem/most-popular-video-creator.html @@ -0,0 +1,46 @@ +

You are given two string arrays creators and ids, and an integer array views, all of length n. The ith video on a platform was created by creator[i], has an id of ids[i], and has views[i] views.

+ +

The popularity of a creator is the sum of the number of views on all of the creator's videos. Find the creator with the highest popularity and the id of their most viewed video.

+ +
    +
  • If multiple creators have the highest popularity, find all of them.
  • +
  • If multiple videos have the highest view count for a creator, find the lexicographically smallest id.
  • +
+ +

Return a 2D array of strings answer where answer[i] = [creatori, idi] means that creatori has the highest popularity and idi is the id of their most popular video. The answer can be returned in any order.

+ +

 

+

Example 1:

+ +
+Input: creators = ["alice","bob","alice","chris"], ids = ["one","two","three","four"], views = [5,10,5,4]
+Output: [["alice","one"],["bob","two"]]
+Explanation:
+The popularity of alice is 5 + 5 = 10.
+The popularity of bob is 10.
+The popularity of chris is 4.
+alice and bob are the most popular creators.
+For bob, the video with the highest view count is "two".
+For alice, the videos with the highest view count are "one" and "three". Since "one" is lexicographically smaller than "three", it is included in the answer.
+
+ +

Example 2:

+ +
+Input: creators = ["alice","alice","alice"], ids = ["a","b","c"], views = [1,2,2]
+Output: [["alice","b"]]
+Explanation:
+The videos with id "b" and "c" have the highest view count.
+Since "b" is lexicographically smaller than "c", it is included in the answer.
+
+ +

 

+

Constraints:

+ +
    +
  • n == creators.length == ids.length == views.length
  • +
  • 1 <= n <= 105
  • +
  • 1 <= creators[i].length, ids[i].length <= 5
  • +
  • creators[i] and ids[i] consist only of lowercase English letters.
  • +
  • 0 <= views[i] <= 105
  • +
diff --git a/leetcode/problem/next-greater-element-iv.html b/leetcode/problem/next-greater-element-iv.html new file mode 100644 index 00000000..14cd910c --- /dev/null +++ b/leetcode/problem/next-greater-element-iv.html @@ -0,0 +1,49 @@ +

You are given a 0-indexed array of non-negative integers nums. For each integer in nums, you must find its respective second greater integer.

+ +

The second greater integer of nums[i] is nums[j] such that:

+ +
    +
  • j > i
  • +
  • nums[j] > nums[i]
  • +
  • There exists exactly one index k such that nums[k] > nums[i] and i < k < j.
  • +
+ +

If there is no such nums[j], the second greater integer is considered to be -1.

+ +
    +
  • For example, in the array [1, 2, 4, 3], the second greater integer of 1 is 4, 2 is 3, and that of 3 and 4 is -1.
  • +
+ +

Return an integer array answer, where answer[i] is the second greater integer of nums[i].

+ +

 

+

Example 1:

+ +
+Input: nums = [2,4,0,9,6]
+Output: [9,6,6,-1,-1]
+Explanation:
+0th index: 4 is the first integer greater than 2, and 9 is the second integer greater than 2, to the right of 2.
+1st index: 9 is the first, and 6 is the second integer greater than 4, to the right of 4.
+2nd index: 9 is the first, and 6 is the second integer greater than 0, to the right of 0.
+3rd index: There is no integer greater than 9 to its right, so the second greater integer is considered to be -1.
+4th index: There is no integer greater than 6 to its right, so the second greater integer is considered to be -1.
+Thus, we return [9,6,6,-1,-1].
+
+ +

Example 2:

+ +
+Input: nums = [3,3]
+Output: [-1,-1]
+Explanation:
+We return [-1,-1] since neither integer has any integer greater than it.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
  • +
  • 0 <= nums[i] <= 109
  • +
diff --git a/leetcode/problem/odd-string-difference.html b/leetcode/problem/odd-string-difference.html new file mode 100644 index 00000000..95bb4a61 --- /dev/null +++ b/leetcode/problem/odd-string-difference.html @@ -0,0 +1,42 @@ +

You are given an array of equal-length strings words. Assume that the length of each string is n.

+ +

Each string words[i] can be converted into a difference integer array difference[i] of length n - 1 where difference[i][j] = words[i][j+1] - words[i][j] where 0 <= j <= n - 2. Note that the difference between two letters is the difference between their positions in the alphabet i.e. the position of 'a' is 0, 'b' is 1, and 'z' is 25.

+ +
    +
  • For example, for the string "acb", the difference integer array is [2 - 0, 1 - 2] = [2, -1].
  • +
+ +

All the strings in words have the same difference integer array, except one. You should find that string.

+ +

Return the string in words that has different difference integer array.

+ +

 

+

Example 1:

+ +
+Input: words = ["adc","wzy","abc"]
+Output: "abc"
+Explanation: 
+- The difference integer array of "adc" is [3 - 0, 2 - 3] = [3, -1].
+- The difference integer array of "wzy" is [25 - 22, 24 - 25]= [3, -1].
+- The difference integer array of "abc" is [1 - 0, 2 - 1] = [1, 1]. 
+The odd array out is [1, 1], so we return the corresponding string, "abc".
+
+ +

Example 2:

+ +
+Input: words = ["aaa","bob","ccc","ddd"]
+Output: "bob"
+Explanation: All the integer arrays are [0, 0] except for "bob", which corresponds to [13, -13].
+
+ +

 

+

Constraints:

+ +
    +
  • 3 <= words.length <= 100
  • +
  • n == words[i].length
  • +
  • 2 <= n <= 20
  • +
  • words[i] consists of lowercase English letters.
  • +
diff --git a/leetcode/problem/total-cost-to-hire-k-workers.html b/leetcode/problem/total-cost-to-hire-k-workers.html new file mode 100644 index 00000000..b70170f7 --- /dev/null +++ b/leetcode/problem/total-cost-to-hire-k-workers.html @@ -0,0 +1,51 @@ +

You are given a 0-indexed integer array costs where costs[i] is the cost of hiring the ith worker.

+ +

You are also given two integers k and candidates. We want to hire exactly k workers according to the following rules:

+ +
    +
  • You will run k sessions and hire exactly one worker in each session.
  • +
  • In each hiring session, choose the worker with the lowest cost from either the first candidates workers or the last candidates workers. Break the tie by the smallest index. +
      +
    • For example, if costs = [3,2,7,7,1,2] and candidates = 2, then in the first hiring session, we will choose the 4th worker because they have the lowest cost [3,2,7,7,1,2].
    • +
    • In the second hiring session, we will choose 1st worker because they have the same lowest cost as 4th worker but they have the smallest index [3,2,7,7,2]. Please note that the indexing may be changed in the process.
    • +
    +
  • +
  • If there are fewer than candidates workers remaining, choose the worker with the lowest cost among them. Break the tie by the smallest index.
  • +
  • A worker can only be chosen once.
  • +
+ +

Return the total cost to hire exactly k workers.

+ +

 

+

Example 1:

+ +
+Input: costs = [17,12,10,2,7,2,11,20,8], k = 3, candidates = 4
+Output: 11
+Explanation: We hire 3 workers in total. The total cost is initially 0.
+- In the first hiring round we choose the worker from [17,12,10,2,7,2,11,20,8]. The lowest cost is 2, and we break the tie by the smallest index, which is 3. The total cost = 0 + 2 = 2.
+- In the second hiring round we choose the worker from [17,12,10,7,2,11,20,8]. The lowest cost is 2 (index 4). The total cost = 2 + 2 = 4.
+- In the third hiring round we choose the worker from [17,12,10,7,11,20,8]. The lowest cost is 7 (index 3). The total cost = 4 + 7 = 11. Notice that the worker with index 3 was common in the first and last four workers.
+The total hiring cost is 11.
+
+ +

Example 2:

+ +
+Input: costs = [1,2,4,1], k = 3, candidates = 3
+Output: 4
+Explanation: We hire 3 workers in total. The total cost is initially 0.
+- In the first hiring round we choose the worker from [1,2,4,1]. The lowest cost is 1, and we break the tie by the smallest index, which is 0. The total cost = 0 + 1 = 1. Notice that workers with index 1 and 2 are common in the first and last 3 workers.
+- In the second hiring round we choose the worker from [2,4,1]. The lowest cost is 1 (index 2). The total cost = 1 + 1 = 2.
+- In the third hiring round there are less than three candidates. We choose the worker from the remaining workers [2,4]. The lowest cost is 2 (index 0). The total cost = 2 + 2 = 4.
+The total hiring cost is 4.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= costs.length <= 105
  • +
  • 1 <= costs[i] <= 105
  • +
  • 1 <= k, candidates <= costs.length
  • +
diff --git a/leetcode/problem/words-within-two-edits-of-dictionary.html b/leetcode/problem/words-within-two-edits-of-dictionary.html new file mode 100644 index 00000000..fdb46814 --- /dev/null +++ b/leetcode/problem/words-within-two-edits-of-dictionary.html @@ -0,0 +1,38 @@ +

You are given two string arrays, queries and dictionary. All words in each array comprise of lowercase English letters and have the same length.

+ +

In one edit you can take a word from queries, and change any letter in it to any other letter. Find all words from queries that, after a maximum of two edits, equal some word from dictionary.

+ +

Return a list of all words from queries, that match with some word from dictionary after a maximum of two edits. Return the words in the same order they appear in queries.

+ +

 

+

Example 1:

+ +
+Input: queries = ["word","note","ants","wood"], dictionary = ["wood","joke","moat"]
+Output: ["word","note","wood"]
+Explanation:
+- Changing the 'r' in "word" to 'o' allows it to equal the dictionary word "wood".
+- Changing the 'n' to 'j' and the 't' to 'k' in "note" changes it to "joke".
+- It would take more than 2 edits for "ants" to equal a dictionary word.
+- "wood" can remain unchanged (0 edits) and match the corresponding dictionary word.
+Thus, we return ["word","note","wood"].
+
+ +

Example 2:

+ +
+Input: queries = ["yes"], dictionary = ["not"]
+Output: []
+Explanation:
+Applying any two edits to "yes" cannot make it equal to "not". Thus, we return an empty array.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= queries.length, dictionary.length <= 100
  • +
  • n == queries[i].length == dictionary[j].length
  • +
  • 1 <= n <= 100
  • +
  • All queries[i] and dictionary[j] are composed of lowercase English letters.
  • +