Input: grid = [[1,0,2],[1,0,2]]
\n\nOutput: true
\n\nExplanation:
\n\n![\"\"](\"https://assets.leetcode.com/uploads/2024/04/15/examplechanged.png\")
All the cells in the grid satisfy the conditions.
\n\\u7248\\u672c\\uff1a mssql server 2019.<\\/p>\"],\"oraclesql\":[\"Oracle\",\" Oracle Sql 11.2.<\\/p>\"],\"pythondata\":[\"Pandas\",\" Python 3.10 with Pandas 2.0.2 and NumPy 1.25.0<\\/p>\"],\"postgresql\":[\"PostgreSQL\",\" PostgreSQL 16<\\/p>\"]}",
+ "book": null,
+ "isSubscribed": false,
+ "isDailyQuestion": false,
+ "dailyRecordStatus": null,
+ "editorType": "CKEDITOR",
+ "ugcQuestionId": null,
+ "style": "LEETCODE",
+ "exampleTestcases": "{\"headers\":{\"cities\":[\"state\",\"city\"]},\"rows\":{\"cities\":[[\"California\",\"Los Angeles\"],[\"California\",\"San Francisco\"],[\"California\",\"San Diego\"],[\"Texas\",\"Houston\"],[\"Texas\",\"Austin\"],[\"Texas\",\"Dallas\"],[\"New York\",\"New York City\"],[\"New York\",\"Buffalo\"],[\"New York\",\"Rochester\"]]}}",
+ "__typename": "QuestionNode"
+ }
+ }
+}
\ No newline at end of file
diff --git a/leetcode/origin-data.json b/leetcode/origin-data.json
index f702147f..cb49c454 100644
--- a/leetcode/origin-data.json
+++ b/leetcode/origin-data.json
@@ -1,23 +1,23 @@
{
"user_name": "",
"num_solved": 0,
- "num_total": 3172,
+ "num_total": 3198,
"ac_easy": 0,
"ac_medium": 0,
"ac_hard": 0,
"stat_status_pairs": [
{
"stat": {
- "question_id": 3481,
+ "question_id": 3505,
"question__article__live": null,
"question__article__slug": null,
"question__article__has_video_solution": null,
- "question__title": "Second Day Verification",
- "question__title_slug": "second-day-verification",
+ "question__title": "Find Cities in Each State",
+ "question__title_slug": "find-cities-in-each-state",
"question__hide": false,
- "total_acs": 144,
- "total_submitted": 169,
- "frontend_question_id": 3172,
+ "total_acs": 58,
+ "total_submitted": 58,
+ "frontend_question_id": 3198,
"is_new_question": true
},
"status": null,
@@ -29,6 +29,190 @@
"frequency": 0,
"progress": 0
},
+ {
+ "stat": {
+ "question_id": 3504,
+ "question__article__live": null,
+ "question__article__slug": null,
+ "question__article__has_video_solution": null,
+ "question__title": "Minimum Moves to Get a Peaceful Board",
+ "question__title_slug": "minimum-moves-to-get-a-peaceful-board",
+ "question__hide": false,
+ "total_acs": 297,
+ "total_submitted": 390,
+ "frontend_question_id": 3189,
+ "is_new_question": true
+ },
+ "status": null,
+ "difficulty": {
+ "level": 2
+ },
+ "paid_only": true,
+ "is_favor": false,
+ "frequency": 0,
+ "progress": 0
+ },
+ {
+ "stat": {
+ "question_id": 3503,
+ "question__article__live": null,
+ "question__article__slug": null,
+ "question__article__has_video_solution": null,
+ "question__title": "Find Top Scoring Students II",
+ "question__title_slug": "find-top-scoring-students-ii",
+ "question__hide": false,
+ "total_acs": 179,
+ "total_submitted": 326,
+ "frontend_question_id": 3188,
+ "is_new_question": true
+ },
+ "status": null,
+ "difficulty": {
+ "level": 3
+ },
+ "paid_only": true,
+ "is_favor": false,
+ "frequency": 0,
+ "progress": 0
+ },
+ {
+ "stat": {
+ "question_id": 3489,
+ "question__article__live": null,
+ "question__article__slug": null,
+ "question__article__has_video_solution": null,
+ "question__title": "The Number of Ways to Make the Sum",
+ "question__title_slug": "the-number-of-ways-to-make-the-sum",
+ "question__hide": false,
+ "total_acs": 550,
+ "total_submitted": 876,
+ "frontend_question_id": 3183,
+ "is_new_question": false
+ },
+ "status": null,
+ "difficulty": {
+ "level": 2
+ },
+ "paid_only": true,
+ "is_favor": false,
+ "frequency": 0,
+ "progress": 0
+ },
+ {
+ "stat": {
+ "question_id": 3488,
+ "question__article__live": null,
+ "question__article__slug": null,
+ "question__article__has_video_solution": null,
+ "question__title": "Find Top Scoring Students",
+ "question__title_slug": "find-top-scoring-students",
+ "question__hide": false,
+ "total_acs": 298,
+ "total_submitted": 531,
+ "frontend_question_id": 3182,
+ "is_new_question": false
+ },
+ "status": null,
+ "difficulty": {
+ "level": 2
+ },
+ "paid_only": true,
+ "is_favor": false,
+ "frequency": 0,
+ "progress": 0
+ },
+ {
+ "stat": {
+ "question_id": 3481,
+ "question__article__live": null,
+ "question__article__slug": null,
+ "question__article__has_video_solution": null,
+ "question__title": "Second Day Verification",
+ "question__title_slug": "second-day-verification",
+ "question__hide": false,
+ "total_acs": 467,
+ "total_submitted": 596,
+ "frontend_question_id": 3172,
+ "is_new_question": false
+ },
+ "status": null,
+ "difficulty": {
+ "level": 1
+ },
+ "paid_only": true,
+ "is_favor": false,
+ "frequency": 0,
+ "progress": 0
+ },
+ {
+ "stat": {
+ "question_id": 3477,
+ "question__article__live": null,
+ "question__article__slug": null,
+ "question__article__has_video_solution": null,
+ "question__title": "Minimum Operations to Make Binary Array Elements Equal to One II",
+ "question__title_slug": "minimum-operations-to-make-binary-array-elements-equal-to-one-ii",
+ "question__hide": false,
+ "total_acs": 27994,
+ "total_submitted": 44294,
+ "frontend_question_id": 3192,
+ "is_new_question": false
+ },
+ "status": null,
+ "difficulty": {
+ "level": 2
+ },
+ "paid_only": false,
+ "is_favor": false,
+ "frequency": 0,
+ "progress": 0
+ },
+ {
+ "stat": {
+ "question_id": 3476,
+ "question__article__live": null,
+ "question__article__slug": null,
+ "question__article__has_video_solution": null,
+ "question__title": "Find Minimum Operations to Make All Elements Divisible by Three",
+ "question__title_slug": "find-minimum-operations-to-make-all-elements-divisible-by-three",
+ "question__hide": false,
+ "total_acs": 36795,
+ "total_submitted": 41866,
+ "frontend_question_id": 3190,
+ "is_new_question": false
+ },
+ "status": null,
+ "difficulty": {
+ "level": 1
+ },
+ "paid_only": false,
+ "is_favor": false,
+ "frequency": 0,
+ "progress": 0
+ },
+ {
+ "stat": {
+ "question_id": 3475,
+ "question__article__live": null,
+ "question__article__slug": null,
+ "question__article__has_video_solution": null,
+ "question__title": "Minimum Operations to Make Binary Array Elements Equal to One I",
+ "question__title_slug": "minimum-operations-to-make-binary-array-elements-equal-to-one-i",
+ "question__hide": false,
+ "total_acs": 34650,
+ "total_submitted": 49638,
+ "frontend_question_id": 3191,
+ "is_new_question": false
+ },
+ "status": null,
+ "difficulty": {
+ "level": 2
+ },
+ "paid_only": false,
+ "is_favor": false,
+ "frequency": 0,
+ "progress": 0
+ },
{
"stat": {
"question_id": 3474,
@@ -38,10 +222,10 @@
"question__title": "Better Compression of String",
"question__title_slug": "better-compression-of-string",
"question__hide": false,
- "total_acs": 460,
- "total_submitted": 539,
+ "total_acs": 801,
+ "total_submitted": 938,
"frontend_question_id": 3167,
- "is_new_question": true
+ "is_new_question": false
},
"status": null,
"difficulty": {
@@ -61,8 +245,8 @@
"question__title": "Calculate Parking Fees and Duration",
"question__title_slug": "calculate-parking-fees-and-duration",
"question__hide": false,
- "total_acs": 232,
- "total_submitted": 353,
+ "total_acs": 377,
+ "total_submitted": 631,
"frontend_question_id": 3166,
"is_new_question": false
},
@@ -75,6 +259,52 @@
"frequency": 0,
"progress": 0
},
+ {
+ "stat": {
+ "question_id": 3472,
+ "question__article__live": null,
+ "question__article__slug": null,
+ "question__article__has_video_solution": null,
+ "question__title": "Bitwise OR of Adjacent Elements",
+ "question__title_slug": "bitwise-or-of-adjacent-elements",
+ "question__hide": false,
+ "total_acs": 867,
+ "total_submitted": 908,
+ "frontend_question_id": 3173,
+ "is_new_question": false
+ },
+ "status": null,
+ "difficulty": {
+ "level": 1
+ },
+ "paid_only": true,
+ "is_favor": false,
+ "frequency": 0,
+ "progress": 0
+ },
+ {
+ "stat": {
+ "question_id": 3471,
+ "question__article__live": null,
+ "question__article__slug": null,
+ "question__article__has_video_solution": null,
+ "question__title": "Minimum Average of Smallest and Largest Elements",
+ "question__title_slug": "minimum-average-of-smallest-and-largest-elements",
+ "question__hide": false,
+ "total_acs": 36551,
+ "total_submitted": 43701,
+ "frontend_question_id": 3194,
+ "is_new_question": false
+ },
+ "status": null,
+ "difficulty": {
+ "level": 1
+ },
+ "paid_only": false,
+ "is_favor": false,
+ "frequency": 0,
+ "progress": 0
+ },
{
"stat": {
"question_id": 3467,
@@ -84,8 +314,8 @@
"question__title": "Find the Level of Tree with Minimum Sum",
"question__title_slug": "find-the-level-of-tree-with-minimum-sum",
"question__hide": false,
- "total_acs": 488,
- "total_submitted": 669,
+ "total_acs": 676,
+ "total_submitted": 954,
"frontend_question_id": 3157,
"is_new_question": false
},
@@ -107,8 +337,8 @@
"question__title": "Employee Task Duration and Concurrent Tasks",
"question__title_slug": "employee-task-duration-and-concurrent-tasks",
"question__hide": false,
- "total_acs": 217,
- "total_submitted": 337,
+ "total_acs": 278,
+ "total_submitted": 474,
"frontend_question_id": 3156,
"is_new_question": false
},
@@ -121,6 +351,98 @@
"frequency": 0,
"progress": 0
},
+ {
+ "stat": {
+ "question_id": 3464,
+ "question__article__live": null,
+ "question__article__slug": null,
+ "question__article__has_video_solution": null,
+ "question__title": "Maximize Total Cost of Alternating Subarrays",
+ "question__title_slug": "maximize-total-cost-of-alternating-subarrays",
+ "question__hide": false,
+ "total_acs": 14725,
+ "total_submitted": 57731,
+ "frontend_question_id": 3196,
+ "is_new_question": false
+ },
+ "status": null,
+ "difficulty": {
+ "level": 2
+ },
+ "paid_only": false,
+ "is_favor": false,
+ "frequency": 0,
+ "progress": 0
+ },
+ {
+ "stat": {
+ "question_id": 3461,
+ "question__article__live": null,
+ "question__article__slug": null,
+ "question__article__has_video_solution": null,
+ "question__title": "Find the Minimum Area to Cover All Ones I",
+ "question__title_slug": "find-the-minimum-area-to-cover-all-ones-i",
+ "question__hide": false,
+ "total_acs": 30293,
+ "total_submitted": 40577,
+ "frontend_question_id": 3195,
+ "is_new_question": false
+ },
+ "status": null,
+ "difficulty": {
+ "level": 2
+ },
+ "paid_only": false,
+ "is_favor": false,
+ "frequency": 0,
+ "progress": 0
+ },
+ {
+ "stat": {
+ "question_id": 3460,
+ "question__article__live": null,
+ "question__article__slug": null,
+ "question__article__has_video_solution": null,
+ "question__title": "Count the Number of Inversions",
+ "question__title_slug": "count-the-number-of-inversions",
+ "question__hide": false,
+ "total_acs": 4458,
+ "total_submitted": 14673,
+ "frontend_question_id": 3193,
+ "is_new_question": false
+ },
+ "status": null,
+ "difficulty": {
+ "level": 3
+ },
+ "paid_only": false,
+ "is_favor": false,
+ "frequency": 0,
+ "progress": 0
+ },
+ {
+ "stat": {
+ "question_id": 3459,
+ "question__article__live": null,
+ "question__article__slug": null,
+ "question__article__has_video_solution": null,
+ "question__title": "Find the Minimum Area to Cover All Ones II",
+ "question__title_slug": "find-the-minimum-area-to-cover-all-ones-ii",
+ "question__hide": false,
+ "total_acs": 2373,
+ "total_submitted": 8506,
+ "frontend_question_id": 3197,
+ "is_new_question": false
+ },
+ "status": null,
+ "difficulty": {
+ "level": 3
+ },
+ "paid_only": false,
+ "is_favor": false,
+ "frequency": 0,
+ "progress": 0
+ },
{
"stat": {
"question_id": 3458,
@@ -130,8 +452,8 @@
"question__title": "Maximum Number of Upgradable Servers",
"question__title_slug": "maximum-number-of-upgradable-servers",
"question__hide": false,
- "total_acs": 421,
- "total_submitted": 757,
+ "total_acs": 496,
+ "total_submitted": 920,
"frontend_question_id": 3155,
"is_new_question": false
},
@@ -153,8 +475,8 @@
"question__title": "Invalid Tweets II",
"question__title_slug": "invalid-tweets-ii",
"question__hide": false,
- "total_acs": 504,
- "total_submitted": 553,
+ "total_acs": 734,
+ "total_submitted": 800,
"frontend_question_id": 3150,
"is_new_question": false
},
@@ -167,6 +489,52 @@
"frequency": 0,
"progress": 0
},
+ {
+ "stat": {
+ "question_id": 3456,
+ "question__article__live": null,
+ "question__article__slug": null,
+ "question__article__has_video_solution": null,
+ "question__title": "Find the Maximum Length of a Good Subsequence I",
+ "question__title_slug": "find-the-maximum-length-of-a-good-subsequence-i",
+ "question__hide": false,
+ "total_acs": 15391,
+ "total_submitted": 51783,
+ "frontend_question_id": 3176,
+ "is_new_question": false
+ },
+ "status": null,
+ "difficulty": {
+ "level": 2
+ },
+ "paid_only": false,
+ "is_favor": false,
+ "frequency": 0,
+ "progress": 0
+ },
+ {
+ "stat": {
+ "question_id": 3452,
+ "question__article__live": null,
+ "question__article__slug": null,
+ "question__article__has_video_solution": null,
+ "question__title": "Find the Maximum Length of a Good Subsequence II",
+ "question__title_slug": "find-the-maximum-length-of-a-good-subsequence-ii",
+ "question__hide": false,
+ "total_acs": 5343,
+ "total_submitted": 23169,
+ "frontend_question_id": 3177,
+ "is_new_question": false
+ },
+ "status": null,
+ "difficulty": {
+ "level": 3
+ },
+ "paid_only": false,
+ "is_favor": false,
+ "frequency": 0,
+ "progress": 0
+ },
{
"stat": {
"question_id": 3451,
@@ -176,8 +544,8 @@
"question__title": "String Compression III",
"question__title_slug": "string-compression-iii",
"question__hide": false,
- "total_acs": 33868,
- "total_submitted": 60783,
+ "total_acs": 36227,
+ "total_submitted": 64694,
"frontend_question_id": 3163,
"is_new_question": false
},
@@ -190,6 +558,29 @@
"frequency": 0,
"progress": 0
},
+ {
+ "stat": {
+ "question_id": 3450,
+ "question__article__live": null,
+ "question__article__slug": null,
+ "question__article__has_video_solution": null,
+ "question__title": "Find the Child Who Has the Ball After K Seconds",
+ "question__title_slug": "find-the-child-who-has-the-ball-after-k-seconds",
+ "question__hide": false,
+ "total_acs": 39509,
+ "total_submitted": 63584,
+ "frontend_question_id": 3178,
+ "is_new_question": false
+ },
+ "status": null,
+ "difficulty": {
+ "level": 1
+ },
+ "paid_only": false,
+ "is_favor": false,
+ "frequency": 0,
+ "progress": 0
+ },
{
"stat": {
"question_id": 3449,
@@ -199,8 +590,8 @@
"question__title": "Maximum Hamming Distances",
"question__title_slug": "maximum-hamming-distances",
"question__hide": false,
- "total_acs": 320,
- "total_submitted": 427,
+ "total_acs": 346,
+ "total_submitted": 465,
"frontend_question_id": 3141,
"is_new_question": false
},
@@ -222,8 +613,8 @@
"question__title": "Consecutive Available Seats II",
"question__title_slug": "consecutive-available-seats-ii",
"question__hide": false,
- "total_acs": 379,
- "total_submitted": 590,
+ "total_acs": 513,
+ "total_submitted": 807,
"frontend_question_id": 3140,
"is_new_question": false
},
@@ -236,6 +627,29 @@
"frequency": 0,
"progress": 0
},
+ {
+ "stat": {
+ "question_id": 3447,
+ "question__article__live": null,
+ "question__article__slug": null,
+ "question__article__has_video_solution": null,
+ "question__title": "Clear Digits",
+ "question__title_slug": "clear-digits",
+ "question__hide": false,
+ "total_acs": 40226,
+ "total_submitted": 55301,
+ "frontend_question_id": 3174,
+ "is_new_question": false
+ },
+ "status": null,
+ "difficulty": {
+ "level": 1
+ },
+ "paid_only": false,
+ "is_favor": false,
+ "frequency": 0,
+ "progress": 0
+ },
{
"stat": {
"question_id": 3446,
@@ -245,8 +659,8 @@
"question__title": "Find the Number of Good Pairs I",
"question__title_slug": "find-the-number-of-good-pairs-i",
"question__hide": false,
- "total_acs": 41255,
- "total_submitted": 47700,
+ "total_acs": 49165,
+ "total_submitted": 56426,
"frontend_question_id": 3162,
"is_new_question": false
},
@@ -268,8 +682,8 @@
"question__title": "Lexicographically Minimum String After Removing Stars",
"question__title_slug": "lexicographically-minimum-string-after-removing-stars",
"question__hide": false,
- "total_acs": 18563,
- "total_submitted": 56497,
+ "total_acs": 23486,
+ "total_submitted": 65733,
"frontend_question_id": 3170,
"is_new_question": false
},
@@ -291,8 +705,8 @@
"question__title": "Find the Number of Good Pairs II",
"question__title_slug": "find-the-number-of-good-pairs-ii",
"question__hide": false,
- "total_acs": 20835,
- "total_submitted": 84353,
+ "total_acs": 22701,
+ "total_submitted": 89581,
"frontend_question_id": 3164,
"is_new_question": false
},
@@ -305,6 +719,52 @@
"frequency": 0,
"progress": 0
},
+ {
+ "stat": {
+ "question_id": 3443,
+ "question__article__live": null,
+ "question__article__slug": null,
+ "question__article__has_video_solution": null,
+ "question__title": "Maximum Total Reward Using Operations II",
+ "question__title_slug": "maximum-total-reward-using-operations-ii",
+ "question__hide": false,
+ "total_acs": 5376,
+ "total_submitted": 27169,
+ "frontend_question_id": 3181,
+ "is_new_question": false
+ },
+ "status": null,
+ "difficulty": {
+ "level": 3
+ },
+ "paid_only": false,
+ "is_favor": false,
+ "frequency": 0,
+ "progress": 0
+ },
+ {
+ "stat": {
+ "question_id": 3442,
+ "question__article__live": null,
+ "question__article__slug": null,
+ "question__article__has_video_solution": null,
+ "question__title": "Maximum Total Reward Using Operations I",
+ "question__title_slug": "maximum-total-reward-using-operations-i",
+ "question__hide": false,
+ "total_acs": 22460,
+ "total_submitted": 77947,
+ "frontend_question_id": 3180,
+ "is_new_question": false
+ },
+ "status": null,
+ "difficulty": {
+ "level": 2
+ },
+ "paid_only": false,
+ "is_favor": false,
+ "frequency": 0,
+ "progress": 0
+ },
{
"stat": {
"question_id": 3441,
@@ -314,8 +774,8 @@
"question__title": "Equalize Strings by Adding or Removing Characters at Ends",
"question__title_slug": "equalize-strings-by-adding-or-removing-characters-at-ends",
"question__hide": false,
- "total_acs": 439,
- "total_submitted": 748,
+ "total_acs": 488,
+ "total_submitted": 851,
"frontend_question_id": 3135,
"is_new_question": false
},
@@ -337,8 +797,8 @@
"question__title": "Server Utilization Time",
"question__title_slug": "server-utilization-time",
"question__hide": false,
- "total_acs": 522,
- "total_submitted": 1090,
+ "total_acs": 615,
+ "total_submitted": 1230,
"frontend_question_id": 3126,
"is_new_question": false
},
@@ -351,17 +811,63 @@
"frequency": 0,
"progress": 0
},
+ {
+ "stat": {
+ "question_id": 3438,
+ "question__article__live": null,
+ "question__article__slug": null,
+ "question__article__has_video_solution": null,
+ "question__title": "Peaks in Array",
+ "question__title_slug": "peaks-in-array",
+ "question__hide": false,
+ "total_acs": 7446,
+ "total_submitted": 28637,
+ "frontend_question_id": 3187,
+ "is_new_question": false
+ },
+ "status": null,
+ "difficulty": {
+ "level": 3
+ },
+ "paid_only": false,
+ "is_favor": false,
+ "frequency": 0,
+ "progress": 0
+ },
+ {
+ "stat": {
+ "question_id": 3437,
+ "question__article__live": null,
+ "question__article__slug": null,
+ "question__article__has_video_solution": null,
+ "question__title": "Maximum Total Damage With Spell Casting",
+ "question__title_slug": "maximum-total-damage-with-spell-casting",
+ "question__hide": false,
+ "total_acs": 19092,
+ "total_submitted": 75977,
+ "frontend_question_id": 3186,
+ "is_new_question": false
+ },
+ "status": null,
+ "difficulty": {
+ "level": 2
+ },
+ "paid_only": false,
+ "is_favor": false,
+ "frequency": 0,
+ "progress": 0
+ },
{
"stat": {
"question_id": 3436,
"question__article__live": null,
"question__article__slug": null,
"question__article__has_video_solution": null,
- "question__title": "Find Subarray With Bitwise AND Closest to K",
- "question__title_slug": "find-subarray-with-bitwise-and-closest-to-k",
+ "question__title": "Find Subarray With Bitwise OR Closest to K",
+ "question__title_slug": "find-subarray-with-bitwise-or-closest-to-k",
"question__hide": false,
- "total_acs": 8103,
- "total_submitted": 27242,
+ "total_acs": 10242,
+ "total_submitted": 33025,
"frontend_question_id": 3171,
"is_new_question": false
},
@@ -383,8 +889,8 @@
"question__title": "Block Placement Queries",
"question__title_slug": "block-placement-queries",
"question__hide": false,
- "total_acs": 2985,
- "total_submitted": 24865,
+ "total_acs": 3643,
+ "total_submitted": 28172,
"frontend_question_id": 3161,
"is_new_question": false
},
@@ -406,8 +912,8 @@
"question__title": "Find the Number of Distinct Colors Among the Balls",
"question__title_slug": "find-the-number-of-distinct-colors-among-the-balls",
"question__hide": false,
- "total_acs": 20643,
- "total_submitted": 50799,
+ "total_acs": 22118,
+ "total_submitted": 53700,
"frontend_question_id": 3160,
"is_new_question": false
},
@@ -429,8 +935,8 @@
"question__title": "Maximum Number That Makes Result of Bitwise AND Zero",
"question__title_slug": "maximum-number-that-makes-result-of-bitwise-and-zero",
"question__hide": false,
- "total_acs": 458,
- "total_submitted": 653,
+ "total_acs": 513,
+ "total_submitted": 741,
"frontend_question_id": 3125,
"is_new_question": false
},
@@ -452,8 +958,8 @@
"question__title": "Find Longest Calls",
"question__title_slug": "find-longest-calls",
"question__hide": false,
- "total_acs": 510,
- "total_submitted": 702,
+ "total_acs": 601,
+ "total_submitted": 836,
"frontend_question_id": 3124,
"is_new_question": false
},
@@ -475,8 +981,8 @@
"question__title": "Find the Minimum Cost Array Permutation",
"question__title_slug": "find-the-minimum-cost-array-permutation",
"question__hide": false,
- "total_acs": 3499,
- "total_submitted": 15075,
+ "total_acs": 3751,
+ "total_submitted": 15927,
"frontend_question_id": 3149,
"is_new_question": false
},
@@ -498,8 +1004,8 @@
"question__title": "Count Days Without Meetings",
"question__title_slug": "count-days-without-meetings",
"question__hide": false,
- "total_acs": 29054,
- "total_submitted": 89860,
+ "total_acs": 34143,
+ "total_submitted": 102454,
"frontend_question_id": 3169,
"is_new_question": false
},
@@ -521,8 +1027,8 @@
"question__title": "Special Array I",
"question__title_slug": "special-array-i",
"question__hide": false,
- "total_acs": 42904,
- "total_submitted": 56613,
+ "total_acs": 48788,
+ "total_submitted": 64076,
"frontend_question_id": 3151,
"is_new_question": false
},
@@ -544,8 +1050,8 @@
"question__title": "Find the XOR of Numbers Which Appear Twice",
"question__title_slug": "find-the-xor-of-numbers-which-appear-twice",
"question__hide": false,
- "total_acs": 33359,
- "total_submitted": 40058,
+ "total_acs": 38154,
+ "total_submitted": 45826,
"frontend_question_id": 3158,
"is_new_question": false
},
@@ -567,8 +1073,8 @@
"question__title": "Special Array II",
"question__title_slug": "special-array-ii",
"question__hide": false,
- "total_acs": 26713,
- "total_submitted": 91641,
+ "total_acs": 28453,
+ "total_submitted": 96008,
"frontend_question_id": 3152,
"is_new_question": false
},
@@ -590,8 +1096,8 @@
"question__title": "Minimum Number of Chairs in a Waiting Room",
"question__title_slug": "minimum-number-of-chairs-in-a-waiting-room",
"question__hide": false,
- "total_acs": 37745,
- "total_submitted": 47032,
+ "total_acs": 45522,
+ "total_submitted": 56347,
"frontend_question_id": 3168,
"is_new_question": false
},
@@ -613,8 +1119,8 @@
"question__title": "Maximum Number of Potholes That Can Be Fixed",
"question__title_slug": "maximum-number-of-potholes-that-can-be-fixed",
"question__hide": false,
- "total_acs": 620,
- "total_submitted": 973,
+ "total_acs": 673,
+ "total_submitted": 1060,
"frontend_question_id": 3119,
"is_new_question": false
},
@@ -636,8 +1142,8 @@
"question__title": "Friday Purchase III ",
"question__title_slug": "friday-purchase-iii",
"question__hide": false,
- "total_acs": 404,
- "total_submitted": 702,
+ "total_acs": 474,
+ "total_submitted": 803,
"frontend_question_id": 3118,
"is_new_question": false
},
@@ -659,8 +1165,8 @@
"question__title": "Maximum Sum of Subsequence With Non-adjacent Elements",
"question__title_slug": "maximum-sum-of-subsequence-with-non-adjacent-elements",
"question__hide": false,
- "total_acs": 4574,
- "total_submitted": 27001,
+ "total_acs": 5218,
+ "total_submitted": 29500,
"frontend_question_id": 3165,
"is_new_question": false
},
@@ -673,6 +1179,52 @@
"frequency": 0,
"progress": 0
},
+ {
+ "stat": {
+ "question_id": 3422,
+ "question__article__live": null,
+ "question__article__slug": null,
+ "question__article__has_video_solution": null,
+ "question__title": "Find the N-th Value After K Seconds",
+ "question__title_slug": "find-the-n-th-value-after-k-seconds",
+ "question__hide": false,
+ "total_acs": 33982,
+ "total_submitted": 61342,
+ "frontend_question_id": 3179,
+ "is_new_question": false
+ },
+ "status": null,
+ "difficulty": {
+ "level": 2
+ },
+ "paid_only": false,
+ "is_favor": false,
+ "frequency": 0,
+ "progress": 0
+ },
+ {
+ "stat": {
+ "question_id": 3421,
+ "question__article__live": null,
+ "question__article__slug": null,
+ "question__article__has_video_solution": null,
+ "question__title": "Count Pairs That Form a Complete Day I",
+ "question__title_slug": "count-pairs-that-form-a-complete-day-i",
+ "question__hide": false,
+ "total_acs": 45421,
+ "total_submitted": 56932,
+ "frontend_question_id": 3184,
+ "is_new_question": false
+ },
+ "status": null,
+ "difficulty": {
+ "level": 1
+ },
+ "paid_only": false,
+ "is_favor": false,
+ "frequency": 0,
+ "progress": 0
+ },
{
"stat": {
"question_id": 3420,
@@ -682,8 +1234,8 @@
"question__title": "Find Occurrences of an Element in an Array",
"question__title_slug": "find-occurrences-of-an-element-in-an-array",
"question__hide": false,
- "total_acs": 28552,
- "total_submitted": 38344,
+ "total_acs": 31196,
+ "total_submitted": 41795,
"frontend_question_id": 3159,
"is_new_question": false
},
@@ -705,8 +1257,8 @@
"question__title": "Maximum Points Inside the Square",
"question__title_slug": "maximum-points-inside-the-square",
"question__hide": false,
- "total_acs": 15184,
- "total_submitted": 39465,
+ "total_acs": 15932,
+ "total_submitted": 41039,
"frontend_question_id": 3143,
"is_new_question": false
},
@@ -719,6 +1271,29 @@
"frequency": 0,
"progress": 0
},
+ {
+ "stat": {
+ "question_id": 3418,
+ "question__article__live": null,
+ "question__article__slug": null,
+ "question__article__has_video_solution": null,
+ "question__title": "Count Pairs That Form a Complete Day II",
+ "question__title_slug": "count-pairs-that-form-a-complete-day-ii",
+ "question__hide": false,
+ "total_acs": 35631,
+ "total_submitted": 83156,
+ "frontend_question_id": 3185,
+ "is_new_question": false
+ },
+ "status": null,
+ "difficulty": {
+ "level": 2
+ },
+ "paid_only": false,
+ "is_favor": false,
+ "frequency": 0,
+ "progress": 0
+ },
{
"stat": {
"question_id": 3417,
@@ -728,8 +1303,8 @@
"question__title": "Find the Index of Permutation",
"question__title_slug": "find-the-index-of-permutation",
"question__hide": false,
- "total_acs": 313,
- "total_submitted": 728,
+ "total_acs": 328,
+ "total_submitted": 791,
"frontend_question_id": 3109,
"is_new_question": false
},
@@ -751,8 +1326,8 @@
"question__title": "Sum of Digit Differences of All Pairs",
"question__title_slug": "sum-of-digit-differences-of-all-pairs",
"question__hide": false,
- "total_acs": 20362,
- "total_submitted": 45375,
+ "total_acs": 21421,
+ "total_submitted": 47992,
"frontend_question_id": 3153,
"is_new_question": false
},
@@ -774,8 +1349,8 @@
"question__title": "Check if Grid Satisfies Conditions",
"question__title_slug": "check-if-grid-satisfies-conditions",
"question__hide": false,
- "total_acs": 27342,
- "total_submitted": 64455,
+ "total_acs": 29062,
+ "total_submitted": 67644,
"frontend_question_id": 3142,
"is_new_question": false
},
@@ -797,8 +1372,8 @@
"question__title": "Find Number of Ways to Reach the K-th Stair",
"question__title_slug": "find-number-of-ways-to-reach-the-k-th-stair",
"question__hide": false,
- "total_acs": 9336,
- "total_submitted": 25828,
+ "total_acs": 9942,
+ "total_submitted": 27272,
"frontend_question_id": 3154,
"is_new_question": false
},
@@ -811,6 +1386,29 @@
"frequency": 0,
"progress": 0
},
+ {
+ "stat": {
+ "question_id": 3413,
+ "question__article__live": null,
+ "question__article__slug": null,
+ "question__article__has_video_solution": null,
+ "question__title": "Find The First Player to win K Games in a Row",
+ "question__title_slug": "find-the-first-player-to-win-k-games-in-a-row",
+ "question__hide": false,
+ "total_acs": 28484,
+ "total_submitted": 72225,
+ "frontend_question_id": 3175,
+ "is_new_question": false
+ },
+ "status": null,
+ "difficulty": {
+ "level": 2
+ },
+ "paid_only": false,
+ "is_favor": false,
+ "frequency": 0,
+ "progress": 0
+ },
{
"stat": {
"question_id": 3412,
@@ -820,8 +1418,8 @@
"question__title": "Permutation Difference between Two Strings",
"question__title_slug": "permutation-difference-between-two-strings",
"question__hide": false,
- "total_acs": 42713,
- "total_submitted": 47647,
+ "total_acs": 50654,
+ "total_submitted": 56454,
"frontend_question_id": 3146,
"is_new_question": false
},
@@ -843,8 +1441,8 @@
"question__title": "Find Products of Elements of Big Array",
"question__title_slug": "find-products-of-elements-of-big-array",
"question__hide": false,
- "total_acs": 1564,
- "total_submitted": 6152,
+ "total_acs": 1709,
+ "total_submitted": 6538,
"frontend_question_id": 3145,
"is_new_question": false
},
@@ -866,8 +1464,8 @@
"question__title": "Find Longest Self-Contained Substring",
"question__title_slug": "find-longest-self-contained-substring",
"question__hide": false,
- "total_acs": 410,
- "total_submitted": 694,
+ "total_acs": 434,
+ "total_submitted": 738,
"frontend_question_id": 3104,
"is_new_question": false
},
@@ -889,8 +1487,8 @@
"question__title": "Find Trending Hashtags II ",
"question__title_slug": "find-trending-hashtags-ii",
"question__hide": false,
- "total_acs": 326,
- "total_submitted": 489,
+ "total_acs": 386,
+ "total_submitted": 613,
"frontend_question_id": 3103,
"is_new_question": false
},
@@ -912,8 +1510,8 @@
"question__title": "Count the Number of Special Characters I",
"question__title_slug": "count-the-number-of-special-characters-i",
"question__hide": false,
- "total_acs": 38845,
- "total_submitted": 59404,
+ "total_acs": 40755,
+ "total_submitted": 61888,
"frontend_question_id": 3120,
"is_new_question": false
},
@@ -935,8 +1533,8 @@
"question__title": "Find All Possible Stable Binary Arrays II",
"question__title_slug": "find-all-possible-stable-binary-arrays-ii",
"question__hide": false,
- "total_acs": 2499,
- "total_submitted": 8536,
+ "total_acs": 2646,
+ "total_submitted": 9054,
"frontend_question_id": 3130,
"is_new_question": false
},
@@ -958,8 +1556,8 @@
"question__title": "Find All Possible Stable Binary Arrays I",
"question__title_slug": "find-all-possible-stable-binary-arrays-i",
"question__hide": false,
- "total_acs": 6612,
- "total_submitted": 24390,
+ "total_acs": 6941,
+ "total_submitted": 25476,
"frontend_question_id": 3129,
"is_new_question": false
},
@@ -981,8 +1579,8 @@
"question__title": "Count the Number of Special Characters II",
"question__title_slug": "count-the-number-of-special-characters-ii",
"question__hide": false,
- "total_acs": 28229,
- "total_submitted": 68089,
+ "total_acs": 29083,
+ "total_submitted": 69799,
"frontend_question_id": 3121,
"is_new_question": false
},
@@ -1004,8 +1602,8 @@
"question__title": "Minimum Number of Operations to Satisfy Conditions",
"question__title_slug": "minimum-number-of-operations-to-satisfy-conditions",
"question__hide": false,
- "total_acs": 13028,
- "total_submitted": 31587,
+ "total_acs": 13594,
+ "total_submitted": 32489,
"frontend_question_id": 3122,
"is_new_question": false
},
@@ -1027,8 +1625,8 @@
"question__title": "Minimum Substring Partition of Equal Character Frequency",
"question__title_slug": "minimum-substring-partition-of-equal-character-frequency",
"question__hide": false,
- "total_acs": 11232,
- "total_submitted": 27702,
+ "total_acs": 12024,
+ "total_submitted": 29318,
"frontend_question_id": 3144,
"is_new_question": false
},
@@ -1050,8 +1648,8 @@
"question__title": "Minimum Cost to Equalize Array",
"question__title_slug": "minimum-cost-to-equalize-array",
"question__hide": false,
- "total_acs": 3405,
- "total_submitted": 21597,
+ "total_acs": 3623,
+ "total_submitted": 22652,
"frontend_question_id": 3139,
"is_new_question": false
},
@@ -1073,8 +1671,8 @@
"question__title": "Guess the Number Using Bitwise Questions II",
"question__title_slug": "guess-the-number-using-bitwise-questions-ii",
"question__hide": false,
- "total_acs": 438,
- "total_submitted": 535,
+ "total_acs": 468,
+ "total_submitted": 583,
"frontend_question_id": 3094,
"is_new_question": false
},
@@ -1096,8 +1694,8 @@
"question__title": "Find Bursty Behavior",
"question__title_slug": "find-bursty-behavior",
"question__hide": false,
- "total_acs": 483,
- "total_submitted": 1285,
+ "total_acs": 565,
+ "total_submitted": 1507,
"frontend_question_id": 3089,
"is_new_question": false
},
@@ -1119,8 +1717,8 @@
"question__title": "Find the Integer Added to Array II",
"question__title_slug": "find-the-integer-added-to-array-ii",
"question__hide": false,
- "total_acs": 19242,
- "total_submitted": 62360,
+ "total_acs": 20023,
+ "total_submitted": 64496,
"frontend_question_id": 3132,
"is_new_question": false
},
@@ -1142,8 +1740,8 @@
"question__title": "Make a Square with the Same Color",
"question__title_slug": "make-a-square-with-the-same-color",
"question__hide": false,
- "total_acs": 22887,
- "total_submitted": 45117,
+ "total_acs": 23801,
+ "total_submitted": 46531,
"frontend_question_id": 3127,
"is_new_question": false
},
@@ -1165,8 +1763,8 @@
"question__title": "Find the Integer Added to Array I",
"question__title_slug": "find-the-integer-added-to-array-i",
"question__hide": false,
- "total_acs": 42837,
- "total_submitted": 52307,
+ "total_acs": 46721,
+ "total_submitted": 56749,
"frontend_question_id": 3131,
"is_new_question": false
},
@@ -1188,8 +1786,8 @@
"question__title": "Valid Word",
"question__title_slug": "valid-word",
"question__hide": false,
- "total_acs": 33098,
- "total_submitted": 91485,
+ "total_acs": 36129,
+ "total_submitted": 97631,
"frontend_question_id": 3136,
"is_new_question": false
},
@@ -1211,8 +1809,8 @@
"question__title": "Minimum Length of Anagram Concatenation",
"question__title_slug": "minimum-length-of-anagram-concatenation",
"question__hide": false,
- "total_acs": 25838,
- "total_submitted": 60687,
+ "total_acs": 26567,
+ "total_submitted": 62621,
"frontend_question_id": 3138,
"is_new_question": false
},
@@ -1234,8 +1832,8 @@
"question__title": "Minimum Array End",
"question__title_slug": "minimum-array-end",
"question__hide": false,
- "total_acs": 12232,
- "total_submitted": 32348,
+ "total_acs": 12838,
+ "total_submitted": 33599,
"frontend_question_id": 3133,
"is_new_question": false
},
@@ -1257,8 +1855,8 @@
"question__title": "Make String Anti-palindrome",
"question__title_slug": "make-string-anti-palindrome",
"question__hide": false,
- "total_acs": 342,
- "total_submitted": 626,
+ "total_acs": 354,
+ "total_submitted": 650,
"frontend_question_id": 3088,
"is_new_question": false
},
@@ -1280,8 +1878,8 @@
"question__title": "Find Trending Hashtags",
"question__title_slug": "find-trending-hashtags",
"question__hide": false,
- "total_acs": 648,
- "total_submitted": 1001,
+ "total_acs": 727,
+ "total_submitted": 1138,
"frontend_question_id": 3087,
"is_new_question": false
},
@@ -1303,8 +1901,8 @@
"question__title": "Maximum Difference Score in a Grid",
"question__title_slug": "maximum-difference-score-in-a-grid",
"question__hide": false,
- "total_acs": 15325,
- "total_submitted": 31633,
+ "total_acs": 16156,
+ "total_submitted": 33376,
"frontend_question_id": 3148,
"is_new_question": false
},
@@ -1326,8 +1924,8 @@
"question__title": "Minimum Rectangles to Cover Points",
"question__title_slug": "minimum-rectangles-to-cover-points",
"question__hide": false,
- "total_acs": 24199,
- "total_submitted": 37655,
+ "total_acs": 24758,
+ "total_submitted": 38339,
"frontend_question_id": 3111,
"is_new_question": false
},
@@ -1349,8 +1947,8 @@
"question__title": "Minimum Time to Visit Disappearing Nodes",
"question__title_slug": "minimum-time-to-visit-disappearing-nodes",
"question__hide": false,
- "total_acs": 16134,
- "total_submitted": 47274,
+ "total_acs": 16772,
+ "total_submitted": 48764,
"frontend_question_id": 3112,
"is_new_question": false
},
@@ -1372,8 +1970,8 @@
"question__title": "Right Triangles",
"question__title_slug": "right-triangles",
"question__hide": false,
- "total_acs": 16868,
- "total_submitted": 35603,
+ "total_acs": 17405,
+ "total_submitted": 36559,
"frontend_question_id": 3128,
"is_new_question": false
},
@@ -1395,8 +1993,8 @@
"question__title": "Minimum Operations to Make Median of Array Equal to K",
"question__title_slug": "minimum-operations-to-make-median-of-array-equal-to-k",
"question__hide": false,
- "total_acs": 22624,
- "total_submitted": 46387,
+ "total_acs": 23139,
+ "total_submitted": 47230,
"frontend_question_id": 3107,
"is_new_question": false
},
@@ -1418,8 +2016,8 @@
"question__title": "Find Edges in Shortest Paths",
"question__title_slug": "find-edges-in-shortest-paths",
"question__hide": false,
- "total_acs": 9985,
- "total_submitted": 19551,
+ "total_acs": 10426,
+ "total_submitted": 20633,
"frontend_question_id": 3123,
"is_new_question": false
},
@@ -1441,8 +2039,8 @@
"question__title": "Match Alphanumerical Pattern in Matrix I",
"question__title_slug": "match-alphanumerical-pattern-in-matrix-i",
"question__hide": false,
- "total_acs": 366,
- "total_submitted": 533,
+ "total_acs": 399,
+ "total_submitted": 594,
"frontend_question_id": 3078,
"is_new_question": false
},
@@ -1464,8 +2062,8 @@
"question__title": "Minimum Number of Operations to Make Word K-Periodic",
"question__title_slug": "minimum-number-of-operations-to-make-word-k-periodic",
"question__hide": false,
- "total_acs": 21976,
- "total_submitted": 34650,
+ "total_acs": 22774,
+ "total_submitted": 35811,
"frontend_question_id": 3137,
"is_new_question": false
},
@@ -1487,8 +2085,8 @@
"question__title": "Taking Maximum Energy From the Mystic Dungeon",
"question__title_slug": "taking-maximum-energy-from-the-mystic-dungeon",
"question__hide": false,
- "total_acs": 26295,
- "total_submitted": 65763,
+ "total_acs": 27455,
+ "total_submitted": 67971,
"frontend_question_id": 3147,
"is_new_question": false
},
@@ -1510,8 +2108,8 @@
"question__title": "Find the Number of Subarrays Where Boundary Elements Are Maximum",
"question__title_slug": "find-the-number-of-subarrays-where-boundary-elements-are-maximum",
"question__hide": false,
- "total_acs": 8665,
- "total_submitted": 29452,
+ "total_acs": 8968,
+ "total_submitted": 30097,
"frontend_question_id": 3113,
"is_new_question": false
},
@@ -1533,8 +2131,8 @@
"question__title": "Shortest Subarray With OR at Least K I",
"question__title_slug": "shortest-subarray-with-or-at-least-k-i",
"question__hide": false,
- "total_acs": 25267,
- "total_submitted": 61945,
+ "total_acs": 25924,
+ "total_submitted": 63228,
"frontend_question_id": 3095,
"is_new_question": false
},
@@ -1556,8 +2154,8 @@
"question__title": "Shortest Subarray With OR at Least K II",
"question__title_slug": "shortest-subarray-with-or-at-least-k-ii",
"question__hide": false,
- "total_acs": 12029,
- "total_submitted": 40442,
+ "total_acs": 12384,
+ "total_submitted": 41285,
"frontend_question_id": 3097,
"is_new_question": false
},
@@ -1579,8 +2177,8 @@
"question__title": "Score of a String",
"question__title_slug": "score-of-a-string",
"question__hide": false,
- "total_acs": 197247,
- "total_submitted": 208844,
+ "total_acs": 222747,
+ "total_submitted": 237066,
"frontend_question_id": 3110,
"is_new_question": false
},
@@ -1602,8 +2200,8 @@
"question__title": "Maximum Increasing Triplet Value",
"question__title_slug": "maximum-increasing-triplet-value",
"question__hide": false,
- "total_acs": 499,
- "total_submitted": 1179,
+ "total_acs": 531,
+ "total_submitted": 1247,
"frontend_question_id": 3073,
"is_new_question": false
},
@@ -1625,8 +2223,8 @@
"question__title": "Longest Common Suffix Queries",
"question__title_slug": "longest-common-suffix-queries",
"question__hide": false,
- "total_acs": 8104,
- "total_submitted": 19466,
+ "total_acs": 8513,
+ "total_submitted": 20233,
"frontend_question_id": 3093,
"is_new_question": false
},
@@ -1648,8 +2246,8 @@
"question__title": "Kth Smallest Amount With Single Denomination Combination",
"question__title_slug": "kth-smallest-amount-with-single-denomination-combination",
"question__hide": false,
- "total_acs": 7173,
- "total_submitted": 45353,
+ "total_acs": 7472,
+ "total_submitted": 46272,
"frontend_question_id": 3116,
"is_new_question": false
},
@@ -1671,8 +2269,8 @@
"question__title": "Count Alternating Subarrays",
"question__title_slug": "count-alternating-subarrays",
"question__hide": false,
- "total_acs": 31283,
- "total_submitted": 54819,
+ "total_acs": 32173,
+ "total_submitted": 56091,
"frontend_question_id": 3101,
"is_new_question": false
},
@@ -1694,8 +2292,8 @@
"question__title": "Maximum Prime Difference",
"question__title_slug": "maximum-prime-difference",
"question__hide": false,
- "total_acs": 34803,
- "total_submitted": 59376,
+ "total_acs": 35847,
+ "total_submitted": 60994,
"frontend_question_id": 3115,
"is_new_question": false
},
@@ -1717,8 +2315,8 @@
"question__title": "Longest Strictly Increasing or Strictly Decreasing Subarray",
"question__title_slug": "longest-strictly-increasing-or-strictly-decreasing-subarray",
"question__hide": false,
- "total_acs": 37277,
- "total_submitted": 65103,
+ "total_acs": 38076,
+ "total_submitted": 66396,
"frontend_question_id": 3105,
"is_new_question": false
},
@@ -1740,8 +2338,8 @@
"question__title": "Harshad Number",
"question__title_slug": "harshad-number",
"question__hide": false,
- "total_acs": 48900,
- "total_submitted": 59010,
+ "total_acs": 51632,
+ "total_submitted": 62185,
"frontend_question_id": 3099,
"is_new_question": false
},
@@ -1763,8 +2361,8 @@
"question__title": "Guess the Number Using Bitwise Questions I",
"question__title_slug": "guess-the-number-using-bitwise-questions-i",
"question__hide": false,
- "total_acs": 871,
- "total_submitted": 952,
+ "total_acs": 972,
+ "total_submitted": 1059,
"frontend_question_id": 3064,
"is_new_question": false
},
@@ -1786,8 +2384,8 @@
"question__title": "Calculate Trapping Rain Water",
"question__title_slug": "calculate-trapping-rain-water",
"question__hide": false,
- "total_acs": 396,
- "total_submitted": 514,
+ "total_acs": 452,
+ "total_submitted": 585,
"frontend_question_id": 3061,
"is_new_question": false
},
@@ -1809,8 +2407,8 @@
"question__title": "Winner of the Linked List Game",
"question__title_slug": "winner-of-the-linked-list-game",
"question__hide": false,
- "total_acs": 7940,
- "total_submitted": 9701,
+ "total_acs": 8119,
+ "total_submitted": 9941,
"frontend_question_id": 3062,
"is_new_question": false
},
@@ -1832,8 +2430,8 @@
"question__title": "Find the Sum of Encrypted Integers",
"question__title_slug": "find-the-sum-of-encrypted-integers",
"question__hide": false,
- "total_acs": 39414,
- "total_submitted": 53384,
+ "total_acs": 40709,
+ "total_submitted": 54994,
"frontend_question_id": 3079,
"is_new_question": false
},
@@ -1855,8 +2453,8 @@
"question__title": "User Activities within Time Bounds",
"question__title_slug": "user-activities-within-time-bounds",
"question__hide": false,
- "total_acs": 627,
- "total_submitted": 1626,
+ "total_acs": 695,
+ "total_submitted": 1746,
"frontend_question_id": 3060,
"is_new_question": false
},
@@ -1878,8 +2476,8 @@
"question__title": "Find All Unique Email Domains",
"question__title_slug": "find-all-unique-email-domains",
"question__hide": false,
- "total_acs": 1172,
- "total_submitted": 1808,
+ "total_acs": 1332,
+ "total_submitted": 2014,
"frontend_question_id": 3059,
"is_new_question": false
},
@@ -1901,8 +2499,8 @@
"question__title": "Minimum Sum of Values by Dividing Array",
"question__title_slug": "minimum-sum-of-values-by-dividing-array",
"question__hide": false,
- "total_acs": 4039,
- "total_submitted": 14506,
+ "total_acs": 4248,
+ "total_submitted": 15185,
"frontend_question_id": 3117,
"is_new_question": false
},
@@ -1924,8 +2522,8 @@
"question__title": "Most Frequent IDs",
"question__title_slug": "most-frequent-ids",
"question__hide": false,
- "total_acs": 18004,
- "total_submitted": 42375,
+ "total_acs": 18405,
+ "total_submitted": 43128,
"frontend_question_id": 3092,
"is_new_question": false
},
@@ -1947,8 +2545,8 @@
"question__title": "Find the Median of the Uniqueness Array",
"question__title_slug": "find-the-median-of-the-uniqueness-array",
"question__hide": false,
- "total_acs": 4679,
- "total_submitted": 16406,
+ "total_acs": 5069,
+ "total_submitted": 17399,
"frontend_question_id": 3134,
"is_new_question": false
},
@@ -1970,8 +2568,8 @@
"question__title": "Latest Time You Can Obtain After Replacing Characters",
"question__title_slug": "latest-time-you-can-obtain-after-replacing-characters",
"question__hide": false,
- "total_acs": 30826,
- "total_submitted": 87164,
+ "total_acs": 31561,
+ "total_submitted": 88856,
"frontend_question_id": 3114,
"is_new_question": false
},
@@ -1993,8 +2591,8 @@
"question__title": "Minimum Deletions to Make String K-Special",
"question__title_slug": "minimum-deletions-to-make-string-k-special",
"question__hide": false,
- "total_acs": 18261,
- "total_submitted": 41290,
+ "total_acs": 18637,
+ "total_submitted": 42035,
"frontend_question_id": 3085,
"is_new_question": false
},
@@ -2016,8 +2614,8 @@
"question__title": "Linked List Frequency",
"question__title_slug": "linked-list-frequency",
"question__hide": false,
- "total_acs": 8784,
- "total_submitted": 10143,
+ "total_acs": 9040,
+ "total_submitted": 10436,
"frontend_question_id": 3063,
"is_new_question": false
},
@@ -2039,8 +2637,8 @@
"question__title": "Friends With No Mutual Friends",
"question__title_slug": "friends-with-no-mutual-friends",
"question__hide": false,
- "total_acs": 741,
- "total_submitted": 1423,
+ "total_acs": 836,
+ "total_submitted": 1643,
"frontend_question_id": 3058,
"is_new_question": false
},
@@ -2062,8 +2660,8 @@
"question__title": "Employees Project Allocation",
"question__title_slug": "employees-project-allocation",
"question__hide": false,
- "total_acs": 660,
- "total_submitted": 968,
+ "total_acs": 739,
+ "total_submitted": 1078,
"frontend_question_id": 3057,
"is_new_question": false
},
@@ -2085,8 +2683,8 @@
"question__title": "Shortest Uncommon Substring in an Array",
"question__title_slug": "shortest-uncommon-substring-in-an-array",
"question__hide": false,
- "total_acs": 19879,
- "total_submitted": 44059,
+ "total_acs": 20275,
+ "total_submitted": 44800,
"frontend_question_id": 3076,
"is_new_question": false
},
@@ -2108,8 +2706,8 @@
"question__title": "Minimum Levels to Gain More Points",
"question__title_slug": "minimum-levels-to-gain-more-points",
"question__hide": false,
- "total_acs": 20416,
- "total_submitted": 50021,
+ "total_acs": 20727,
+ "total_submitted": 50671,
"frontend_question_id": 3096,
"is_new_question": false
},
@@ -2131,8 +2729,8 @@
"question__title": "Replace Question Marks in String to Minimize Its Value",
"question__title_slug": "replace-question-marks-in-string-to-minimize-its-value",
"question__hide": false,
- "total_acs": 12256,
- "total_submitted": 45986,
+ "total_acs": 12583,
+ "total_submitted": 46816,
"frontend_question_id": 3081,
"is_new_question": false
},
@@ -2154,8 +2752,8 @@
"question__title": "Existence of a Substring in a String and Its Reverse",
"question__title_slug": "existence-of-a-substring-in-a-string-and-its-reverse",
"question__hide": false,
- "total_acs": 40692,
- "total_submitted": 61293,
+ "total_acs": 41600,
+ "total_submitted": 62515,
"frontend_question_id": 3083,
"is_new_question": false
},
@@ -2177,8 +2775,8 @@
"question__title": "Find Pattern in Infinite Stream II",
"question__title_slug": "find-pattern-in-infinite-stream-ii",
"question__hide": false,
- "total_acs": 465,
- "total_submitted": 665,
+ "total_acs": 501,
+ "total_submitted": 715,
"frontend_question_id": 3037,
"is_new_question": false
},
@@ -2200,8 +2798,8 @@
"question__title": "Maximize Happiness of Selected Children",
"question__title_slug": "maximize-happiness-of-selected-children",
"question__hide": false,
- "total_acs": 169627,
- "total_submitted": 307824,
+ "total_acs": 170834,
+ "total_submitted": 310106,
"frontend_question_id": 3075,
"is_new_question": false
},
@@ -2223,8 +2821,8 @@
"question__title": "Distribute Elements Into Two Arrays II",
"question__title_slug": "distribute-elements-into-two-arrays-ii",
"question__hide": false,
- "total_acs": 9324,
- "total_submitted": 34917,
+ "total_acs": 9676,
+ "total_submitted": 35523,
"frontend_question_id": 3072,
"is_new_question": false
},
@@ -2246,8 +2844,8 @@
"question__title": "Maximum Length Substring With Two Occurrences",
"question__title_slug": "maximum-length-substring-with-two-occurrences",
"question__hide": false,
- "total_acs": 34919,
- "total_submitted": 54831,
+ "total_acs": 36161,
+ "total_submitted": 56581,
"frontend_question_id": 3090,
"is_new_question": false
},
@@ -2269,8 +2867,8 @@
"question__title": "Minimum Cost Walk in Weighted Graph",
"question__title_slug": "minimum-cost-walk-in-weighted-graph",
"question__hide": false,
- "total_acs": 10620,
- "total_submitted": 22962,
+ "total_acs": 10915,
+ "total_submitted": 23637,
"frontend_question_id": 3108,
"is_new_question": false
},
@@ -2292,8 +2890,8 @@
"question__title": "Distribute Elements Into Two Arrays I",
"question__title_slug": "distribute-elements-into-two-arrays-i",
"question__hide": false,
- "total_acs": 39396,
- "total_submitted": 54756,
+ "total_acs": 40307,
+ "total_submitted": 55857,
"frontend_question_id": 3069,
"is_new_question": false
},
@@ -2315,8 +2913,8 @@
"question__title": "Lexicographically Smallest String After Operations With Constraint",
"question__title_slug": "lexicographically-smallest-string-after-operations-with-constraint",
"question__hide": false,
- "total_acs": 23563,
- "total_submitted": 36913,
+ "total_acs": 24005,
+ "total_submitted": 37473,
"frontend_question_id": 3106,
"is_new_question": false
},
@@ -2338,8 +2936,8 @@
"question__title": "Find the Sum of the Power of All Subsequences",
"question__title_slug": "find-the-sum-of-the-power-of-all-subsequences",
"question__hide": false,
- "total_acs": 6416,
- "total_submitted": 16684,
+ "total_acs": 6604,
+ "total_submitted": 17190,
"frontend_question_id": 3082,
"is_new_question": false
},
@@ -2361,8 +2959,8 @@
"question__title": "Minimize Manhattan Distances",
"question__title_slug": "minimize-manhattan-distances",
"question__hide": false,
- "total_acs": 7557,
- "total_submitted": 23470,
+ "total_acs": 7770,
+ "total_submitted": 23996,
"frontend_question_id": 3102,
"is_new_question": false
},
@@ -2384,8 +2982,8 @@
"question__title": "Count Numbers With Unique Digits II",
"question__title_slug": "count-numbers-with-unique-digits-ii",
"question__hide": false,
- "total_acs": 2928,
- "total_submitted": 3339,
+ "total_acs": 3193,
+ "total_submitted": 3646,
"frontend_question_id": 3032,
"is_new_question": false
},
@@ -2407,8 +3005,8 @@
"question__title": "Snaps Analysis",
"question__title_slug": "snaps-analysis",
"question__hide": false,
- "total_acs": 866,
- "total_submitted": 1470,
+ "total_acs": 968,
+ "total_submitted": 1659,
"frontend_question_id": 3056,
"is_new_question": false
},
@@ -2430,8 +3028,8 @@
"question__title": "Top Percentile Fraud",
"question__title_slug": "top-percentile-fraud",
"question__hide": false,
- "total_acs": 829,
- "total_submitted": 1381,
+ "total_acs": 972,
+ "total_submitted": 1605,
"frontend_question_id": 3055,
"is_new_question": false
},
@@ -2453,8 +3051,8 @@
"question__title": "Count Submatrices with Top-Left Element and Sum Less Than k",
"question__title_slug": "count-submatrices-with-top-left-element-and-sum-less-than-k",
"question__hide": false,
- "total_acs": 24555,
- "total_submitted": 41540,
+ "total_acs": 24826,
+ "total_submitted": 41963,
"frontend_question_id": 3070,
"is_new_question": false
},
@@ -2476,8 +3074,8 @@
"question__title": "Count Substrings Starting and Ending with Given Character",
"question__title_slug": "count-substrings-starting-and-ending-with-given-character",
"question__hide": false,
- "total_acs": 34237,
- "total_submitted": 70066,
+ "total_acs": 34791,
+ "total_submitted": 71032,
"frontend_question_id": 3084,
"is_new_question": false
},
@@ -2499,8 +3097,8 @@
"question__title": "Water Bottles II",
"question__title_slug": "water-bottles-ii",
"question__hide": false,
- "total_acs": 29369,
- "total_submitted": 46626,
+ "total_acs": 29972,
+ "total_submitted": 47464,
"frontend_question_id": 3100,
"is_new_question": false
},
@@ -2522,8 +3120,8 @@
"question__title": "Minimum Operations to Write the Letter Y on a Grid",
"question__title_slug": "minimum-operations-to-write-the-letter-y-on-a-grid",
"question__hide": false,
- "total_acs": 16099,
- "total_submitted": 25945,
+ "total_acs": 16300,
+ "total_submitted": 26259,
"frontend_question_id": 3071,
"is_new_question": false
},
@@ -2545,8 +3143,8 @@
"question__title": "Apple Redistribution into Boxes",
"question__title_slug": "apple-redistribution-into-boxes",
"question__hide": false,
- "total_acs": 42221,
- "total_submitted": 63748,
+ "total_acs": 43362,
+ "total_submitted": 65277,
"frontend_question_id": 3074,
"is_new_question": false
},
@@ -2568,8 +3166,8 @@
"question__title": "Find Pattern in Infinite Stream I",
"question__title_slug": "find-pattern-in-infinite-stream-i",
"question__hide": false,
- "total_acs": 680,
- "total_submitted": 1136,
+ "total_acs": 712,
+ "total_submitted": 1187,
"frontend_question_id": 3023,
"is_new_question": false
},
@@ -2591,8 +3189,8 @@
"question__title": "Minimum Operations to Exceed Threshold Value II",
"question__title_slug": "minimum-operations-to-exceed-threshold-value-ii",
"question__hide": false,
- "total_acs": 26727,
- "total_submitted": 98100,
+ "total_acs": 27058,
+ "total_submitted": 98853,
"frontend_question_id": 3066,
"is_new_question": false
},
@@ -2614,8 +3212,8 @@
"question__title": "Minimum Operations to Exceed Threshold Value I",
"question__title_slug": "minimum-operations-to-exceed-threshold-value-i",
"question__hide": false,
- "total_acs": 50501,
- "total_submitted": 59097,
+ "total_acs": 53189,
+ "total_submitted": 62134,
"frontend_question_id": 3065,
"is_new_question": false
},
@@ -2637,8 +3235,8 @@
"question__title": "Modify the Matrix",
"question__title_slug": "modify-the-matrix",
"question__hide": false,
- "total_acs": 35910,
- "total_submitted": 52809,
+ "total_acs": 37020,
+ "total_submitted": 54259,
"frontend_question_id": 3033,
"is_new_question": false
},
@@ -2660,8 +3258,8 @@
"question__title": "Find the Length of the Longest Common Prefix",
"question__title_slug": "find-the-length-of-the-longest-common-prefix",
"question__hide": false,
- "total_acs": 20098,
- "total_submitted": 60953,
+ "total_acs": 20675,
+ "total_submitted": 61978,
"frontend_question_id": 3043,
"is_new_question": false
},
@@ -2683,8 +3281,8 @@
"question__title": "Apply Operations to Make Sum of Array Greater Than or Equal to k",
"question__title_slug": "apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k",
"question__hide": false,
- "total_acs": 26039,
- "total_submitted": 58217,
+ "total_acs": 26390,
+ "total_submitted": 58866,
"frontend_question_id": 3091,
"is_new_question": false
},
@@ -2706,8 +3304,8 @@
"question__title": "Minimum Moves to Pick K Ones",
"question__title_slug": "minimum-moves-to-pick-k-ones",
"question__hide": false,
- "total_acs": 2590,
- "total_submitted": 10913,
+ "total_acs": 2632,
+ "total_submitted": 11115,
"frontend_question_id": 3086,
"is_new_question": false
},
@@ -2729,8 +3327,8 @@
"question__title": "Count Pairs of Connectable Servers in a Weighted Tree Network",
"question__title_slug": "count-pairs-of-connectable-servers-in-a-weighted-tree-network",
"question__hide": false,
- "total_acs": 11224,
- "total_submitted": 19491,
+ "total_acs": 11421,
+ "total_submitted": 19847,
"frontend_question_id": 3067,
"is_new_question": false
},
@@ -2752,8 +3350,8 @@
"question__title": "Find the Largest Area of Square Inside Two Rectangles",
"question__title_slug": "find-the-largest-area-of-square-inside-two-rectangles",
"question__hide": false,
- "total_acs": 18645,
- "total_submitted": 41425,
+ "total_acs": 18828,
+ "total_submitted": 41792,
"frontend_question_id": 3047,
"is_new_question": false
},
@@ -2775,8 +3373,8 @@
"question__title": "Split the Array",
"question__title_slug": "split-the-array",
"question__hide": false,
- "total_acs": 44071,
- "total_submitted": 76049,
+ "total_acs": 45665,
+ "total_submitted": 78569,
"frontend_question_id": 3046,
"is_new_question": false
},
@@ -2798,8 +3396,8 @@
"question__title": "Maximum Number of Removal Queries That Can Be Processed I",
"question__title_slug": "maximum-number-of-removal-queries-that-can-be-processed-i",
"question__hide": false,
- "total_acs": 377,
- "total_submitted": 852,
+ "total_acs": 391,
+ "total_submitted": 876,
"frontend_question_id": 3018,
"is_new_question": false
},
@@ -2821,8 +3419,8 @@
"question__title": "Type of Triangle",
"question__title_slug": "type-of-triangle",
"question__hide": false,
- "total_acs": 40485,
- "total_submitted": 105948,
+ "total_acs": 41982,
+ "total_submitted": 109827,
"frontend_question_id": 3024,
"is_new_question": false
},
@@ -2844,8 +3442,8 @@
"question__title": "Maximum Number of Operations With the Same Score I",
"question__title_slug": "maximum-number-of-operations-with-the-same-score-i",
"question__hide": false,
- "total_acs": 31120,
- "total_submitted": 60401,
+ "total_acs": 31848,
+ "total_submitted": 61604,
"frontend_question_id": 3038,
"is_new_question": false
},
@@ -2867,8 +3465,8 @@
"question__title": "Maximum Number of Operations With the Same Score II",
"question__title_slug": "maximum-number-of-operations-with-the-same-score-ii",
"question__hide": false,
- "total_acs": 17557,
- "total_submitted": 54142,
+ "total_acs": 18347,
+ "total_submitted": 55889,
"frontend_question_id": 3040,
"is_new_question": false
},
@@ -2890,8 +3488,8 @@
"question__title": "Maximum Palindromes After Operations",
"question__title_slug": "maximum-palindromes-after-operations",
"question__hide": false,
- "total_acs": 13603,
- "total_submitted": 32232,
+ "total_acs": 13860,
+ "total_submitted": 32747,
"frontend_question_id": 3035,
"is_new_question": false
},
@@ -2913,8 +3511,8 @@
"question__title": "Find the Sum of Subsequence Powers",
"question__title_slug": "find-the-sum-of-subsequence-powers",
"question__hide": false,
- "total_acs": 4097,
- "total_submitted": 16731,
+ "total_acs": 4234,
+ "total_submitted": 17269,
"frontend_question_id": 3098,
"is_new_question": false
},
@@ -2936,8 +3534,8 @@
"question__title": "Maximum Number of Intersections on the Chart",
"question__title_slug": "maximum-number-of-intersections-on-the-chart",
"question__hide": false,
- "total_acs": 2676,
- "total_submitted": 5839,
+ "total_acs": 3062,
+ "total_submitted": 6612,
"frontend_question_id": 3009,
"is_new_question": false
},
@@ -2959,8 +3557,8 @@
"question__title": "Most Frequent Prime",
"question__title_slug": "most-frequent-prime",
"question__hide": false,
- "total_acs": 14558,
- "total_submitted": 30351,
+ "total_acs": 14784,
+ "total_submitted": 30751,
"frontend_question_id": 3044,
"is_new_question": false
},
@@ -2982,8 +3580,8 @@
"question__title": "Maximum Strength of K Disjoint Subarrays",
"question__title_slug": "maximum-strength-of-k-disjoint-subarrays",
"question__hide": false,
- "total_acs": 5680,
- "total_submitted": 20476,
+ "total_acs": 5854,
+ "total_submitted": 21072,
"frontend_question_id": 3077,
"is_new_question": false
},
@@ -3005,8 +3603,8 @@
"question__title": "Number of Changing Keys",
"question__title_slug": "number-of-changing-keys",
"question__hide": false,
- "total_acs": 44335,
- "total_submitted": 55067,
+ "total_acs": 46049,
+ "total_submitted": 57094,
"frontend_question_id": 3019,
"is_new_question": false
},
@@ -3028,8 +3626,8 @@
"question__title": "Ant on the Boundary",
"question__title_slug": "ant-on-the-boundary",
"question__hide": false,
- "total_acs": 42439,
- "total_submitted": 56766,
+ "total_acs": 43940,
+ "total_submitted": 58726,
"frontend_question_id": 3028,
"is_new_question": false
},
@@ -3051,8 +3649,8 @@
"question__title": "Count the Number of Houses at a Certain Distance II",
"question__title_slug": "count-the-number-of-houses-at-a-certain-distance-ii",
"question__hide": false,
- "total_acs": 2659,
- "total_submitted": 12626,
+ "total_acs": 2739,
+ "total_submitted": 12846,
"frontend_question_id": 3017,
"is_new_question": false
},
@@ -3074,8 +3672,8 @@
"question__title": "Count Prefix and Suffix Pairs I",
"question__title_slug": "count-prefix-and-suffix-pairs-i",
"question__hide": false,
- "total_acs": 34060,
- "total_submitted": 52803,
+ "total_acs": 35155,
+ "total_submitted": 54284,
"frontend_question_id": 3042,
"is_new_question": false
},
@@ -3097,8 +3695,8 @@
"question__title": "Apply Operations to Make String Empty",
"question__title_slug": "apply-operations-to-make-string-empty",
"question__hide": false,
- "total_acs": 24444,
- "total_submitted": 43312,
+ "total_acs": 24894,
+ "total_submitted": 43988,
"frontend_question_id": 3039,
"is_new_question": false
},
@@ -3120,8 +3718,8 @@
"question__title": "Find the Maximum Sum of Node Values",
"question__title_slug": "find-the-maximum-sum-of-node-values",
"question__hide": false,
- "total_acs": 68710,
- "total_submitted": 101863,
+ "total_acs": 69334,
+ "total_submitted": 103073,
"frontend_question_id": 3068,
"is_new_question": false
},
@@ -3143,8 +3741,8 @@
"question__title": "Mark Elements on Array by Performing Queries",
"question__title_slug": "mark-elements-on-array-by-performing-queries",
"question__hide": false,
- "total_acs": 17124,
- "total_submitted": 35067,
+ "total_acs": 17424,
+ "total_submitted": 35564,
"frontend_question_id": 3080,
"is_new_question": false
},
@@ -3166,8 +3764,8 @@
"question__title": "Count Prefix and Suffix Pairs II",
"question__title_slug": "count-prefix-and-suffix-pairs-ii",
"question__hide": false,
- "total_acs": 7365,
- "total_submitted": 31069,
+ "total_acs": 7694,
+ "total_submitted": 31779,
"frontend_question_id": 3045,
"is_new_question": false
},
@@ -3189,8 +3787,8 @@
"question__title": "Maximum Subtree of the Same Color",
"question__title_slug": "maximum-subtree-of-the-same-color",
"question__hide": false,
- "total_acs": 1081,
- "total_submitted": 1631,
+ "total_acs": 1125,
+ "total_submitted": 1706,
"frontend_question_id": 3004,
"is_new_question": false
},
@@ -3212,8 +3810,8 @@
"question__title": "Find Beautiful Indices in the Given Array II",
"question__title_slug": "find-beautiful-indices-in-the-given-array-ii",
"question__hide": false,
- "total_acs": 9434,
- "total_submitted": 39396,
+ "total_acs": 9642,
+ "total_submitted": 39919,
"frontend_question_id": 3008,
"is_new_question": false
},
@@ -3235,8 +3833,8 @@
"question__title": "Viewers Turned Streamers",
"question__title_slug": "viewers-turned-streamers",
"question__hide": false,
- "total_acs": 941,
- "total_submitted": 2196,
+ "total_acs": 999,
+ "total_submitted": 2355,
"frontend_question_id": 2995,
"is_new_question": false
},
@@ -3258,8 +3856,8 @@
"question__title": "Friday Purchases II ",
"question__title_slug": "friday-purchases-ii",
"question__hide": false,
- "total_acs": 903,
- "total_submitted": 1225,
+ "total_acs": 957,
+ "total_submitted": 1305,
"frontend_question_id": 2994,
"is_new_question": false
},
@@ -3281,8 +3879,8 @@
"question__title": "Friday Purchases I",
"question__title_slug": "friday-purchases-i",
"question__hide": false,
- "total_acs": 1341,
- "total_submitted": 1690,
+ "total_acs": 1434,
+ "total_submitted": 1791,
"frontend_question_id": 2993,
"is_new_question": false
},
@@ -3304,8 +3902,8 @@
"question__title": "Find the Maximum Number of Elements in Subset",
"question__title_slug": "find-the-maximum-number-of-elements-in-subset",
"question__hide": false,
- "total_acs": 18952,
- "total_submitted": 77478,
+ "total_acs": 19208,
+ "total_submitted": 78359,
"frontend_question_id": 3020,
"is_new_question": false
},
@@ -3327,8 +3925,8 @@
"question__title": "Maximize Consecutive Elements in an Array After Modification",
"question__title_slug": "maximize-consecutive-elements-in-an-array-after-modification",
"question__hide": false,
- "total_acs": 6906,
- "total_submitted": 21972,
+ "total_acs": 7114,
+ "total_submitted": 22448,
"frontend_question_id": 3041,
"is_new_question": false
},
@@ -3350,8 +3948,8 @@
"question__title": "Minimum Time to Revert Word to Initial State I",
"question__title_slug": "minimum-time-to-revert-word-to-initial-state-i",
"question__hide": false,
- "total_acs": 18533,
- "total_submitted": 46292,
+ "total_acs": 18968,
+ "total_submitted": 46965,
"frontend_question_id": 3029,
"is_new_question": false
},
@@ -3373,8 +3971,8 @@
"question__title": "Minimum Time to Revert Word to Initial State II",
"question__title_slug": "minimum-time-to-revert-word-to-initial-state-ii",
"question__hide": false,
- "total_acs": 10352,
- "total_submitted": 29155,
+ "total_acs": 10521,
+ "total_submitted": 29610,
"frontend_question_id": 3031,
"is_new_question": false
},
@@ -3396,8 +3994,8 @@
"question__title": "Number of Self-Divisible Permutations",
"question__title_slug": "number-of-self-divisible-permutations",
"question__hide": false,
- "total_acs": 1080,
- "total_submitted": 1462,
+ "total_acs": 1133,
+ "total_submitted": 1539,
"frontend_question_id": 2992,
"is_new_question": false
},
@@ -3419,8 +4017,8 @@
"question__title": "Earliest Second to Mark Indices I",
"question__title_slug": "earliest-second-to-mark-indices-i",
"question__hide": false,
- "total_acs": 7628,
- "total_submitted": 21796,
+ "total_acs": 7798,
+ "total_submitted": 22088,
"frontend_question_id": 3048,
"is_new_question": false
},
@@ -3442,8 +4040,8 @@
"question__title": "Find if Array Can Be Sorted",
"question__title_slug": "find-if-array-can-be-sorted",
"question__hide": false,
- "total_acs": 21756,
- "total_submitted": 42584,
+ "total_acs": 22093,
+ "total_submitted": 43127,
"frontend_question_id": 3011,
"is_new_question": false
},
@@ -3465,8 +4063,8 @@
"question__title": "Number of Subarrays That Match a Pattern II",
"question__title_slug": "number-of-subarrays-that-match-a-pattern-ii",
"question__hide": false,
- "total_acs": 10386,
- "total_submitted": 32351,
+ "total_acs": 10558,
+ "total_submitted": 32734,
"frontend_question_id": 3036,
"is_new_question": false
},
@@ -3488,8 +4086,8 @@
"question__title": "Earliest Second to Mark Indices II",
"question__title_slug": "earliest-second-to-mark-indices-ii",
"question__hide": false,
- "total_acs": 2090,
- "total_submitted": 9429,
+ "total_acs": 2171,
+ "total_submitted": 9758,
"frontend_question_id": 3049,
"is_new_question": false
},
@@ -3511,8 +4109,8 @@
"question__title": "Top Three Wineries ",
"question__title_slug": "top-three-wineries",
"question__hide": false,
- "total_acs": 985,
- "total_submitted": 1840,
+ "total_acs": 1047,
+ "total_submitted": 1972,
"frontend_question_id": 2991,
"is_new_question": false
},
@@ -3534,8 +4132,8 @@
"question__title": "Loan Types",
"question__title_slug": "loan-types",
"question__hide": false,
- "total_acs": 1783,
- "total_submitted": 2923,
+ "total_acs": 1917,
+ "total_submitted": 3151,
"frontend_question_id": 2990,
"is_new_question": false
},
@@ -3557,8 +4155,8 @@
"question__title": "Class Performance",
"question__title_slug": "class-performance",
"question__hide": false,
- "total_acs": 1901,
- "total_submitted": 2139,
+ "total_acs": 2039,
+ "total_submitted": 2291,
"frontend_question_id": 2989,
"is_new_question": false
},
@@ -3580,8 +4178,8 @@
"question__title": "Manager of the Largest Department",
"question__title_slug": "manager-of-the-largest-department",
"question__hide": false,
- "total_acs": 1504,
- "total_submitted": 1946,
+ "total_acs": 1630,
+ "total_submitted": 2078,
"frontend_question_id": 2988,
"is_new_question": false
},
@@ -3603,8 +4201,8 @@
"question__title": "Find Expensive Cities",
"question__title_slug": "find-expensive-cities",
"question__hide": false,
- "total_acs": 1700,
- "total_submitted": 2133,
+ "total_acs": 1833,
+ "total_submitted": 2325,
"frontend_question_id": 2987,
"is_new_question": false
},
@@ -3626,8 +4224,8 @@
"question__title": "Find Third Transaction",
"question__title_slug": "find-third-transaction",
"question__hide": false,
- "total_acs": 1298,
- "total_submitted": 2565,
+ "total_acs": 1418,
+ "total_submitted": 2770,
"frontend_question_id": 2986,
"is_new_question": false
},
@@ -3649,8 +4247,8 @@
"question__title": "Calculate Compressed Mean",
"question__title_slug": "calculate-compressed-mean",
"question__hide": false,
- "total_acs": 1612,
- "total_submitted": 1856,
+ "total_acs": 1744,
+ "total_submitted": 2009,
"frontend_question_id": 2985,
"is_new_question": false
},
@@ -3672,8 +4270,8 @@
"question__title": "Find Peak Calling Hours for Each City",
"question__title_slug": "find-peak-calling-hours-for-each-city",
"question__hide": false,
- "total_acs": 1219,
- "total_submitted": 2026,
+ "total_acs": 1333,
+ "total_submitted": 2185,
"frontend_question_id": 2984,
"is_new_question": false
},
@@ -3695,8 +4293,8 @@
"question__title": "Alice and Bob Playing Flower Game",
"question__title_slug": "alice-and-bob-playing-flower-game",
"question__hide": false,
- "total_acs": 18779,
- "total_submitted": 39489,
+ "total_acs": 19016,
+ "total_submitted": 39950,
"frontend_question_id": 3021,
"is_new_question": false
},
@@ -3718,8 +4316,8 @@
"question__title": "Find the Number of Ways to Place People I",
"question__title_slug": "find-the-number-of-ways-to-place-people-i",
"question__hide": false,
- "total_acs": 13161,
- "total_submitted": 32275,
+ "total_acs": 13333,
+ "total_submitted": 32593,
"frontend_question_id": 3025,
"is_new_question": false
},
@@ -3741,8 +4339,8 @@
"question__title": "Find the Number of Ways to Place People II",
"question__title_slug": "find-the-number-of-ways-to-place-people-ii",
"question__hide": false,
- "total_acs": 8450,
- "total_submitted": 17586,
+ "total_acs": 8574,
+ "total_submitted": 17906,
"frontend_question_id": 3027,
"is_new_question": false
},
@@ -3764,8 +4362,8 @@
"question__title": "Minimum Number of Pushes to Type Word II",
"question__title_slug": "minimum-number-of-pushes-to-type-word-ii",
"question__hide": false,
- "total_acs": 22552,
- "total_submitted": 32055,
+ "total_acs": 23263,
+ "total_submitted": 32957,
"frontend_question_id": 3016,
"is_new_question": false
},
@@ -3787,8 +4385,8 @@
"question__title": "Minimum Number of Pushes to Type Word I",
"question__title_slug": "minimum-number-of-pushes-to-type-word-i",
"question__hide": false,
- "total_acs": 31664,
- "total_submitted": 49799,
+ "total_acs": 32647,
+ "total_submitted": 51256,
"frontend_question_id": 3014,
"is_new_question": false
},
@@ -3810,8 +4408,8 @@
"question__title": "Most Expensive Item That Can Not Be Bought",
"question__title_slug": "most-expensive-item-that-can-not-be-bought",
"question__hide": false,
- "total_acs": 1337,
- "total_submitted": 1719,
+ "total_acs": 1397,
+ "total_submitted": 1802,
"frontend_question_id": 2979,
"is_new_question": false
},
@@ -3833,8 +4431,8 @@
"question__title": "Find the Grid of Region Average",
"question__title_slug": "find-the-grid-of-region-average",
"question__hide": false,
- "total_acs": 9269,
- "total_submitted": 21134,
+ "total_acs": 9386,
+ "total_submitted": 21371,
"frontend_question_id": 3030,
"is_new_question": false
},
@@ -3856,8 +4454,8 @@
"question__title": "Count the Number of Houses at a Certain Distance I",
"question__title_slug": "count-the-number-of-houses-at-a-certain-distance-i",
"question__hide": false,
- "total_acs": 17481,
- "total_submitted": 31663,
+ "total_acs": 17839,
+ "total_submitted": 32156,
"frontend_question_id": 3015,
"is_new_question": false
},
@@ -3879,8 +4477,8 @@
"question__title": "Minimum Moves to Capture The Queen",
"question__title_slug": "minimum-moves-to-capture-the-queen",
"question__hide": false,
- "total_acs": 16180,
- "total_submitted": 79252,
+ "total_acs": 16625,
+ "total_submitted": 80446,
"frontend_question_id": 3001,
"is_new_question": false
},
@@ -3902,8 +4500,8 @@
"question__title": "Number of Subarrays That Match a Pattern I",
"question__title_slug": "number-of-subarrays-that-match-a-pattern-i",
"question__hide": false,
- "total_acs": 24397,
- "total_submitted": 36819,
+ "total_acs": 24775,
+ "total_submitted": 37306,
"frontend_question_id": 3034,
"is_new_question": false
},
@@ -3925,8 +4523,8 @@
"question__title": "Minimum Number of Coins for Fruits II",
"question__title_slug": "minimum-number-of-coins-for-fruits-ii",
"question__hide": false,
- "total_acs": 532,
- "total_submitted": 953,
+ "total_acs": 558,
+ "total_submitted": 999,
"frontend_question_id": 2969,
"is_new_question": false
},
@@ -3948,8 +4546,8 @@
"question__title": "Find Longest Special Substring That Occurs Thrice I",
"question__title_slug": "find-longest-special-substring-that-occurs-thrice-i",
"question__hide": false,
- "total_acs": 19632,
- "total_submitted": 46231,
+ "total_acs": 19979,
+ "total_submitted": 46782,
"frontend_question_id": 2981,
"is_new_question": false
},
@@ -3971,8 +4569,8 @@
"question__title": "Find Longest Special Substring That Occurs Thrice II",
"question__title_slug": "find-longest-special-substring-that-occurs-thrice-ii",
"question__hide": false,
- "total_acs": 15912,
- "total_submitted": 47358,
+ "total_acs": 16424,
+ "total_submitted": 48475,
"frontend_question_id": 2982,
"is_new_question": false
},
@@ -3994,8 +4592,8 @@
"question__title": "Maximum Good Subarray Sum",
"question__title_slug": "maximum-good-subarray-sum",
"question__hide": false,
- "total_acs": 15708,
- "total_submitted": 88077,
+ "total_acs": 16319,
+ "total_submitted": 90465,
"frontend_question_id": 3026,
"is_new_question": false
},
@@ -4017,8 +4615,8 @@
"question__title": "Divide an Array Into Subarrays With Minimum Cost I",
"question__title_slug": "divide-an-array-into-subarrays-with-minimum-cost-i",
"question__hide": false,
- "total_acs": 30907,
- "total_submitted": 47068,
+ "total_acs": 31476,
+ "total_submitted": 47769,
"frontend_question_id": 3010,
"is_new_question": false
},
@@ -4040,8 +4638,8 @@
"question__title": "Find Polygon With the Largest Perimeter",
"question__title_slug": "find-polygon-with-the-largest-perimeter",
"question__hide": false,
- "total_acs": 129815,
- "total_submitted": 196421,
+ "total_acs": 130960,
+ "total_submitted": 198013,
"frontend_question_id": 2971,
"is_new_question": false
},
@@ -4063,8 +4661,8 @@
"question__title": "Minimize OR of Remaining Elements Using Operations",
"question__title_slug": "minimize-or-of-remaining-elements-using-operations",
"question__hide": false,
- "total_acs": 2822,
- "total_submitted": 8410,
+ "total_acs": 2874,
+ "total_submitted": 8572,
"frontend_question_id": 3022,
"is_new_question": false
},
@@ -4086,8 +4684,8 @@
"question__title": "Divide an Array Into Subarrays With Minimum Cost II",
"question__title_slug": "divide-an-array-into-subarrays-with-minimum-cost-ii",
"question__hide": false,
- "total_acs": 4576,
- "total_submitted": 14453,
+ "total_acs": 4748,
+ "total_submitted": 14901,
"frontend_question_id": 3013,
"is_new_question": false
},
@@ -4109,8 +4707,8 @@
"question__title": "Binary Tree Nodes",
"question__title_slug": "binary-tree-nodes",
"question__hide": false,
- "total_acs": 927,
- "total_submitted": 1181,
+ "total_acs": 1007,
+ "total_submitted": 1279,
"frontend_question_id": 3054,
"is_new_question": false
},
@@ -4132,8 +4730,8 @@
"question__title": "Classifying Triangles by Lengths",
"question__title_slug": "classifying-triangles-by-lengths",
"question__hide": false,
- "total_acs": 1068,
- "total_submitted": 2132,
+ "total_acs": 1200,
+ "total_submitted": 2361,
"frontend_question_id": 3053,
"is_new_question": false
},
@@ -4155,8 +4753,8 @@
"question__title": "Maximize Items",
"question__title_slug": "maximize-items",
"question__hide": false,
- "total_acs": 531,
- "total_submitted": 758,
+ "total_acs": 583,
+ "total_submitted": 817,
"frontend_question_id": 3052,
"is_new_question": false
},
@@ -4178,8 +4776,8 @@
"question__title": "Find Candidates for Data Scientist Position",
"question__title_slug": "find-candidates-for-data-scientist-position",
"question__hide": false,
- "total_acs": 1577,
- "total_submitted": 2157,
+ "total_acs": 1773,
+ "total_submitted": 2421,
"frontend_question_id": 3051,
"is_new_question": false
},
@@ -4201,8 +4799,8 @@
"question__title": "Pizza Toppings Cost Analysis",
"question__title_slug": "pizza-toppings-cost-analysis",
"question__hide": false,
- "total_acs": 921,
- "total_submitted": 1347,
+ "total_acs": 1047,
+ "total_submitted": 1521,
"frontend_question_id": 3050,
"is_new_question": false
},
@@ -4224,8 +4822,8 @@
"question__title": "Number of Divisible Triplet Sums",
"question__title_slug": "number-of-divisible-triplet-sums",
"question__hide": false,
- "total_acs": 1450,
- "total_submitted": 2154,
+ "total_acs": 1529,
+ "total_submitted": 2279,
"frontend_question_id": 2964,
"is_new_question": false
},
@@ -4247,8 +4845,8 @@
"question__title": "Symmetric Coordinates",
"question__title_slug": "symmetric-coordinates",
"question__hide": false,
- "total_acs": 1031,
- "total_submitted": 2446,
+ "total_acs": 1099,
+ "total_submitted": 2622,
"frontend_question_id": 2978,
"is_new_question": false
},
@@ -4270,8 +4868,8 @@
"question__title": "Count the Number of Incremovable Subarrays I",
"question__title_slug": "count-the-number-of-incremovable-subarrays-i",
"question__hide": false,
- "total_acs": 17935,
- "total_submitted": 35273,
+ "total_acs": 18378,
+ "total_submitted": 35887,
"frontend_question_id": 2970,
"is_new_question": false
},
@@ -4293,8 +4891,8 @@
"question__title": "Maximum Area of Longest Diagonal Rectangle",
"question__title_slug": "maximum-area-of-longest-diagonal-rectangle",
"question__hide": false,
- "total_acs": 32479,
- "total_submitted": 91139,
+ "total_acs": 33269,
+ "total_submitted": 92785,
"frontend_question_id": 3000,
"is_new_question": false
},
@@ -4316,8 +4914,8 @@
"question__title": "Maximum Square Area by Removing Fences From a Field",
"question__title_slug": "maximum-square-area-by-removing-fences-from-a-field",
"question__hide": false,
- "total_acs": 13195,
- "total_submitted": 58457,
+ "total_acs": 13365,
+ "total_submitted": 59025,
"frontend_question_id": 2975,
"is_new_question": false
},
@@ -4339,8 +4937,8 @@
"question__title": "Minimum Number of Operations to Make Array XOR Equal to K",
"question__title_slug": "minimum-number-of-operations-to-make-array-xor-equal-to-k",
"question__hide": false,
- "total_acs": 105789,
- "total_submitted": 122242,
+ "total_acs": 106734,
+ "total_submitted": 123345,
"frontend_question_id": 2997,
"is_new_question": false
},
@@ -4362,8 +4960,8 @@
"question__title": "Count the Number of Incremovable Subarrays II",
"question__title_slug": "count-the-number-of-incremovable-subarrays-ii",
"question__hide": false,
- "total_acs": 6470,
- "total_submitted": 16579,
+ "total_acs": 6592,
+ "total_submitted": 16816,
"frontend_question_id": 2972,
"is_new_question": false
},
@@ -4385,8 +4983,8 @@
"question__title": "Number of Same-End Substrings",
"question__title_slug": "number-of-same-end-substrings",
"question__hide": false,
- "total_acs": 852,
- "total_submitted": 1202,
+ "total_acs": 892,
+ "total_submitted": 1265,
"frontend_question_id": 2955,
"is_new_question": false
},
@@ -4408,8 +5006,8 @@
"question__title": "Check if Bitwise OR Has Trailing Zeros",
"question__title_slug": "check-if-bitwise-or-has-trailing-zeros",
"question__hide": false,
- "total_acs": 30884,
- "total_submitted": 44026,
+ "total_acs": 31657,
+ "total_submitted": 45044,
"frontend_question_id": 2980,
"is_new_question": false
},
@@ -4431,8 +5029,8 @@
"question__title": "Find Beautiful Indices in the Given Array I",
"question__title_slug": "find-beautiful-indices-in-the-given-array-i",
"question__hide": false,
- "total_acs": 23930,
- "total_submitted": 66296,
+ "total_acs": 24252,
+ "total_submitted": 66964,
"frontend_question_id": 3006,
"is_new_question": false
},
@@ -4454,8 +5052,8 @@
"question__title": "Minimize Length of Array Using Operations",
"question__title_slug": "minimize-length-of-array-using-operations",
"question__hide": false,
- "total_acs": 13079,
- "total_submitted": 37328,
+ "total_acs": 13231,
+ "total_submitted": 37673,
"frontend_question_id": 3012,
"is_new_question": false
},
@@ -4477,8 +5075,8 @@
"question__title": "Count the Number of Powerful Integers",
"question__title_slug": "count-the-number-of-powerful-integers",
"question__hide": false,
- "total_acs": 4273,
- "total_submitted": 16416,
+ "total_acs": 4364,
+ "total_submitted": 16724,
"frontend_question_id": 2999,
"is_new_question": false
},
@@ -4500,8 +5098,8 @@
"question__title": "Count Elements With Maximum Frequency",
"question__title_slug": "count-elements-with-maximum-frequency",
"question__hide": false,
- "total_acs": 196936,
- "total_submitted": 248969,
+ "total_acs": 200128,
+ "total_submitted": 253229,
"frontend_question_id": 3005,
"is_new_question": false
},
@@ -4523,8 +5121,8 @@
"question__title": "Divide Array Into Arrays With Max Difference",
"question__title_slug": "divide-array-into-arrays-with-max-difference",
"question__hide": false,
- "total_acs": 147235,
- "total_submitted": 206181,
+ "total_acs": 148465,
+ "total_submitted": 207867,
"frontend_question_id": 2966,
"is_new_question": false
},
@@ -4546,8 +5144,8 @@
"question__title": "Maximum Number That Sum of the Prices Is Less Than or Equal to K",
"question__title_slug": "maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k",
"question__hide": false,
- "total_acs": 8126,
- "total_submitted": 22600,
+ "total_acs": 8340,
+ "total_submitted": 23059,
"frontend_question_id": 3007,
"is_new_question": false
},
@@ -4569,8 +5167,8 @@
"question__title": "Minimum Number of Operations to Make X and Y Equal",
"question__title_slug": "minimum-number-of-operations-to-make-x-and-y-equal",
"question__hide": false,
- "total_acs": 16740,
- "total_submitted": 37037,
+ "total_acs": 17409,
+ "total_submitted": 38248,
"frontend_question_id": 2998,
"is_new_question": false
},
@@ -4592,8 +5190,8 @@
"question__title": "Minimum Cost to Convert String II",
"question__title_slug": "minimum-cost-to-convert-string-ii",
"question__hide": false,
- "total_acs": 4092,
- "total_submitted": 16697,
+ "total_acs": 4161,
+ "total_submitted": 16972,
"frontend_question_id": 2977,
"is_new_question": false
},
@@ -4615,8 +5213,8 @@
"question__title": "Number of Divisible Substrings",
"question__title_slug": "number-of-divisible-substrings",
"question__hide": false,
- "total_acs": 1141,
- "total_submitted": 1497,
+ "total_acs": 1168,
+ "total_submitted": 1534,
"frontend_question_id": 2950,
"is_new_question": false
},
@@ -4638,8 +5236,8 @@
"question__title": "Smallest Missing Integer Greater Than Sequential Prefix Sum",
"question__title_slug": "smallest-missing-integer-greater-than-sequential-prefix-sum",
"question__hide": false,
- "total_acs": 27296,
- "total_submitted": 85686,
+ "total_acs": 28297,
+ "total_submitted": 88015,
"frontend_question_id": 2996,
"is_new_question": false
},
@@ -4661,8 +5259,8 @@
"question__title": "Minimum Cost to Convert String I",
"question__title_slug": "minimum-cost-to-convert-string-i",
"question__hide": false,
- "total_acs": 13837,
- "total_submitted": 34956,
+ "total_acs": 14203,
+ "total_submitted": 35790,
"frontend_question_id": 2976,
"is_new_question": false
},
@@ -4684,8 +5282,8 @@
"question__title": "Double Modular Exponentiation",
"question__title_slug": "double-modular-exponentiation",
"question__hide": false,
- "total_acs": 20043,
- "total_submitted": 42145,
+ "total_acs": 20291,
+ "total_submitted": 42571,
"frontend_question_id": 2961,
"is_new_question": false
},
@@ -4707,8 +5305,8 @@
"question__title": "Maximize the Number of Partitions After Operations",
"question__title_slug": "maximize-the-number-of-partitions-after-operations",
"question__hide": false,
- "total_acs": 2989,
- "total_submitted": 10792,
+ "total_acs": 3093,
+ "total_submitted": 11105,
"frontend_question_id": 3003,
"is_new_question": false
},
@@ -4730,8 +5328,8 @@
"question__title": "Maximum GCD-Sum of a Subarray",
"question__title_slug": "maximum-gcd-sum-of-a-subarray",
"question__hide": false,
- "total_acs": 336,
- "total_submitted": 709,
+ "total_acs": 360,
+ "total_submitted": 761,
"frontend_question_id": 2941,
"is_new_question": false
},
@@ -4753,8 +5351,8 @@
"question__title": "Minimum Number of Coins to be Added",
"question__title_slug": "minimum-number-of-coins-to-be-added",
"question__hide": false,
- "total_acs": 15160,
- "total_submitted": 28122,
+ "total_acs": 17036,
+ "total_submitted": 30518,
"frontend_question_id": 2952,
"is_new_question": false
},
@@ -4776,8 +5374,8 @@
"question__title": "Remove Adjacent Almost-Equal Characters",
"question__title_slug": "remove-adjacent-almost-equal-characters",
"question__hide": false,
- "total_acs": 20571,
- "total_submitted": 39586,
+ "total_acs": 20907,
+ "total_submitted": 40118,
"frontend_question_id": 2957,
"is_new_question": false
},
@@ -4799,8 +5397,8 @@
"question__title": "Minimum Cost to Make Array Equalindromic",
"question__title_slug": "minimum-cost-to-make-array-equalindromic",
"question__hide": false,
- "total_acs": 12214,
- "total_submitted": 55823,
+ "total_acs": 12425,
+ "total_submitted": 56453,
"frontend_question_id": 2967,
"is_new_question": false
},
@@ -4822,8 +5420,8 @@
"question__title": "Maximum Size of a Set After Removals",
"question__title_slug": "maximum-size-of-a-set-after-removals",
"question__hide": false,
- "total_acs": 14411,
- "total_submitted": 32088,
+ "total_acs": 14846,
+ "total_submitted": 32802,
"frontend_question_id": 3002,
"is_new_question": false
},
@@ -4845,8 +5443,8 @@
"question__title": "Find Missing and Repeated Values",
"question__title_slug": "find-missing-and-repeated-values",
"question__hide": false,
- "total_acs": 43270,
- "total_submitted": 57376,
+ "total_acs": 45176,
+ "total_submitted": 59835,
"frontend_question_id": 2965,
"is_new_question": false
},
@@ -4868,8 +5466,8 @@
"question__title": "Minimum Number Game",
"question__title_slug": "minimum-number-game",
"question__hide": false,
- "total_acs": 69548,
- "total_submitted": 81335,
+ "total_acs": 73690,
+ "total_submitted": 86037,
"frontend_question_id": 2974,
"is_new_question": false
},
@@ -4891,8 +5489,8 @@
"question__title": "Length of Longest Subarray With at Most K Frequency",
"question__title_slug": "length-of-longest-subarray-with-at-most-k-frequency",
"question__hide": false,
- "total_acs": 140965,
- "total_submitted": 252897,
+ "total_acs": 142862,
+ "total_submitted": 256122,
"frontend_question_id": 2958,
"is_new_question": false
},
@@ -4914,8 +5512,8 @@
"question__title": "Count the Number of Infection Sequences",
"question__title_slug": "count-the-number-of-infection-sequences",
"question__hide": false,
- "total_acs": 2918,
- "total_submitted": 8048,
+ "total_acs": 2984,
+ "total_submitted": 8236,
"frontend_question_id": 2954,
"is_new_question": false
},
@@ -4937,8 +5535,8 @@
"question__title": "Count Complete Substrings",
"question__title_slug": "count-complete-substrings",
"question__hide": false,
- "total_acs": 6100,
- "total_submitted": 23039,
+ "total_acs": 6367,
+ "total_submitted": 23593,
"frontend_question_id": 2953,
"is_new_question": false
},
@@ -4960,8 +5558,8 @@
"question__title": "Number of Equal Numbers Blocks",
"question__title_slug": "number-of-equal-numbers-blocks",
"question__hide": false,
- "total_acs": 1673,
- "total_submitted": 2460,
+ "total_acs": 1696,
+ "total_submitted": 2507,
"frontend_question_id": 2936,
"is_new_question": false
},
@@ -4983,8 +5581,8 @@
"question__title": "Find the Peaks",
"question__title_slug": "find-the-peaks",
"question__hide": false,
- "total_acs": 42398,
- "total_submitted": 56267,
+ "total_acs": 44108,
+ "total_submitted": 58511,
"frontend_question_id": 2951,
"is_new_question": false
},
@@ -5006,8 +5604,8 @@
"question__title": "Count Tested Devices After Test Operations",
"question__title_slug": "count-tested-devices-after-test-operations",
"question__hide": false,
- "total_acs": 37076,
- "total_submitted": 45913,
+ "total_acs": 38233,
+ "total_submitted": 47360,
"frontend_question_id": 2960,
"is_new_question": false
},
@@ -5029,8 +5627,8 @@
"question__title": "Make Lexicographically Smallest Array by Swapping Elements",
"question__title_slug": "make-lexicographically-smallest-array-by-swapping-elements",
"question__hide": false,
- "total_acs": 8371,
- "total_submitted": 21386,
+ "total_acs": 8480,
+ "total_submitted": 21620,
"frontend_question_id": 2948,
"is_new_question": false
},
@@ -5052,8 +5650,8 @@
"question__title": "Find Number of Coins to Place in Tree Nodes",
"question__title_slug": "find-number-of-coins-to-place-in-tree-nodes",
"question__hide": false,
- "total_acs": 7116,
- "total_submitted": 19803,
+ "total_acs": 7543,
+ "total_submitted": 20749,
"frontend_question_id": 2973,
"is_new_question": false
},
@@ -5075,8 +5673,8 @@
"question__title": "Number of Possible Sets of Closing Branches",
"question__title_slug": "number-of-possible-sets-of-closing-branches",
"question__hide": false,
- "total_acs": 6260,
- "total_submitted": 12358,
+ "total_acs": 6397,
+ "total_submitted": 12614,
"frontend_question_id": 2959,
"is_new_question": false
},
@@ -5098,8 +5696,8 @@
"question__title": "Distribute Candies Among Children III",
"question__title_slug": "distribute-candies-among-children-iii",
"question__hide": false,
- "total_acs": 484,
- "total_submitted": 1087,
+ "total_acs": 500,
+ "total_submitted": 1110,
"frontend_question_id": 2927,
"is_new_question": false
},
@@ -5121,8 +5719,8 @@
"question__title": "Matrix Similarity After Cyclic Shifts",
"question__title_slug": "matrix-similarity-after-cyclic-shifts",
"question__hide": false,
- "total_acs": 21340,
- "total_submitted": 36955,
+ "total_acs": 21780,
+ "total_submitted": 37581,
"frontend_question_id": 2946,
"is_new_question": false
},
@@ -5144,8 +5742,8 @@
"question__title": "Maximize Area of Square Hole in Grid",
"question__title_slug": "maximize-area-of-square-hole-in-grid",
"question__hide": false,
- "total_acs": 11007,
- "total_submitted": 30348,
+ "total_acs": 11138,
+ "total_submitted": 30611,
"frontend_question_id": 2943,
"is_new_question": false
},
@@ -5167,8 +5765,8 @@
"question__title": "Count Subarrays Where Max Element Appears at Least K Times",
"question__title_slug": "count-subarrays-where-max-element-appears-at-least-k-times",
"question__hide": false,
- "total_acs": 126235,
- "total_submitted": 213647,
+ "total_acs": 127837,
+ "total_submitted": 216356,
"frontend_question_id": 2962,
"is_new_question": false
},
@@ -5190,8 +5788,8 @@
"question__title": "Count the Number of Good Partitions",
"question__title_slug": "count-the-number-of-good-partitions",
"question__hide": false,
- "total_acs": 9662,
- "total_submitted": 19612,
+ "total_acs": 9884,
+ "total_submitted": 20023,
"frontend_question_id": 2963,
"is_new_question": false
},
@@ -5213,8 +5811,8 @@
"question__title": "Find Maximum Non-decreasing Array Length",
"question__title_slug": "find-maximum-non-decreasing-array-length",
"question__hide": false,
- "total_acs": 3345,
- "total_submitted": 21226,
+ "total_acs": 3484,
+ "total_submitted": 22052,
"frontend_question_id": 2945,
"is_new_question": false
},
@@ -5236,8 +5834,8 @@
"question__title": "Count Beautiful Substrings I",
"question__title_slug": "count-beautiful-substrings-i",
"question__hide": false,
- "total_acs": 19199,
- "total_submitted": 31164,
+ "total_acs": 19565,
+ "total_submitted": 31700,
"frontend_question_id": 2947,
"is_new_question": false
},
@@ -5259,8 +5857,8 @@
"question__title": "Minimum Number of Coins for Fruits",
"question__title_slug": "minimum-number-of-coins-for-fruits",
"question__hide": false,
- "total_acs": 14044,
- "total_submitted": 31541,
+ "total_acs": 14569,
+ "total_submitted": 32397,
"frontend_question_id": 2944,
"is_new_question": false
},
@@ -5282,8 +5880,8 @@
"question__title": "Count Beautiful Substrings II",
"question__title_slug": "count-beautiful-substrings-ii",
"question__hide": false,
- "total_acs": 4658,
- "total_submitted": 18748,
+ "total_acs": 4766,
+ "total_submitted": 19150,
"frontend_question_id": 2949,
"is_new_question": false
},
@@ -5305,8 +5903,8 @@
"question__title": "Make Three Strings Equal",
"question__title_slug": "make-three-strings-equal",
"question__hide": false,
- "total_acs": 26396,
- "total_submitted": 61810,
+ "total_acs": 26884,
+ "total_submitted": 62797,
"frontend_question_id": 2937,
"is_new_question": false
},
@@ -5328,8 +5926,8 @@
"question__title": "Find Common Elements Between Two Arrays",
"question__title_slug": "find-common-elements-between-two-arrays",
"question__hide": false,
- "total_acs": 50472,
- "total_submitted": 60945,
+ "total_acs": 53285,
+ "total_submitted": 64098,
"frontend_question_id": 2956,
"is_new_question": false
},
@@ -5351,8 +5949,8 @@
"question__title": "Market Analysis III",
"question__title_slug": "market-analysis-iii",
"question__hide": false,
- "total_acs": 1463,
- "total_submitted": 3713,
+ "total_acs": 1561,
+ "total_submitted": 3904,
"frontend_question_id": 2922,
"is_new_question": false
},
@@ -5374,8 +5972,8 @@
"question__title": "Maximum Profitable Triplets With Increasing Prices II",
"question__title_slug": "maximum-profitable-triplets-with-increasing-prices-ii",
"question__hide": false,
- "total_acs": 374,
- "total_submitted": 757,
+ "total_acs": 394,
+ "total_submitted": 790,
"frontend_question_id": 2921,
"is_new_question": false
},
@@ -5397,8 +5995,8 @@
"question__title": "Palindrome Rearrangement Queries",
"question__title_slug": "palindrome-rearrangement-queries",
"question__hide": false,
- "total_acs": 2891,
- "total_submitted": 11390,
+ "total_acs": 2987,
+ "total_submitted": 11640,
"frontend_question_id": 2983,
"is_new_question": false
},
@@ -5420,8 +6018,8 @@
"question__title": "High-Access Employees",
"question__title_slug": "high-access-employees",
"question__hide": false,
- "total_acs": 20487,
- "total_submitted": 46604,
+ "total_acs": 20729,
+ "total_submitted": 47050,
"frontend_question_id": 2933,
"is_new_question": false
},
@@ -5443,8 +6041,8 @@
"question__title": "Distribute Candies Among Children II",
"question__title_slug": "distribute-candies-among-children-ii",
"question__hide": false,
- "total_acs": 11709,
- "total_submitted": 33458,
+ "total_acs": 11879,
+ "total_submitted": 33849,
"frontend_question_id": 2929,
"is_new_question": false
},
@@ -5466,8 +6064,8 @@
"question__title": "Number of Strings Which Can Be Rearranged to Contain Substring",
"question__title_slug": "number-of-strings-which-can-be-rearranged-to-contain-substring",
"question__hide": false,
- "total_acs": 5863,
- "total_submitted": 10522,
+ "total_acs": 5965,
+ "total_submitted": 10691,
"frontend_question_id": 2930,
"is_new_question": false
},
@@ -5489,8 +6087,8 @@
"question__title": "Distribute Candies Among Children I",
"question__title_slug": "distribute-candies-among-children-i",
"question__hide": false,
- "total_acs": 23553,
- "total_submitted": 31245,
+ "total_acs": 24147,
+ "total_submitted": 31919,
"frontend_question_id": 2928,
"is_new_question": false
},
@@ -5512,8 +6110,8 @@
"question__title": "Number of Ways to Reach Destination in the Grid",
"question__title_slug": "number-of-ways-to-reach-destination-in-the-grid",
"question__hide": false,
- "total_acs": 800,
- "total_submitted": 1232,
+ "total_acs": 808,
+ "total_submitted": 1256,
"frontend_question_id": 2912,
"is_new_question": false
},
@@ -5535,8 +6133,8 @@
"question__title": "Maximum Strong Pair XOR II",
"question__title_slug": "maximum-strong-pair-xor-ii",
"question__hide": false,
- "total_acs": 5804,
- "total_submitted": 19365,
+ "total_acs": 5899,
+ "total_submitted": 19592,
"frontend_question_id": 2935,
"is_new_question": false
},
@@ -5558,8 +6156,8 @@
"question__title": "Apply Operations to Maximize Frequency Score",
"question__title_slug": "apply-operations-to-maximize-frequency-score",
"question__hide": false,
- "total_acs": 5863,
- "total_submitted": 15057,
+ "total_acs": 6007,
+ "total_submitted": 15344,
"frontend_question_id": 2968,
"is_new_question": false
},
@@ -5581,8 +6179,8 @@
"question__title": "Separate Black and White Balls",
"question__title_slug": "separate-black-and-white-balls",
"question__hide": false,
- "total_acs": 22539,
- "total_submitted": 42601,
+ "total_acs": 23112,
+ "total_submitted": 43467,
"frontend_question_id": 2938,
"is_new_question": false
},
@@ -5604,8 +6202,8 @@
"question__title": "Find Words Containing Character",
"question__title_slug": "find-words-containing-character",
"question__hide": false,
- "total_acs": 115939,
- "total_submitted": 131150,
+ "total_acs": 124902,
+ "total_submitted": 141148,
"frontend_question_id": 2942,
"is_new_question": false
},
@@ -5627,8 +6225,8 @@
"question__title": "Maximum Strong Pair XOR I",
"question__title_slug": "maximum-strong-pair-xor-i",
"question__hide": false,
- "total_acs": 33444,
- "total_submitted": 44028,
+ "total_acs": 34935,
+ "total_submitted": 45952,
"frontend_question_id": 2932,
"is_new_question": false
},
@@ -5650,8 +6248,8 @@
"question__title": "Maximum Xor Product",
"question__title_slug": "maximum-xor-product",
"question__hide": false,
- "total_acs": 8327,
- "total_submitted": 32421,
+ "total_acs": 8502,
+ "total_submitted": 32917,
"frontend_question_id": 2939,
"is_new_question": false
},
@@ -5673,8 +6271,8 @@
"question__title": "Maximum Score After Applying Operations on a Tree",
"question__title_slug": "maximum-score-after-applying-operations-on-a-tree",
"question__hide": false,
- "total_acs": 12149,
- "total_submitted": 24712,
+ "total_acs": 12360,
+ "total_submitted": 25039,
"frontend_question_id": 2925,
"is_new_question": false
},
@@ -5696,8 +6294,8 @@
"question__title": "Minimum Operations to Maximize Last Elements in Arrays",
"question__title_slug": "minimum-operations-to-maximize-last-elements-in-arrays",
"question__hide": false,
- "total_acs": 11688,
- "total_submitted": 26134,
+ "total_acs": 11845,
+ "total_submitted": 26452,
"frontend_question_id": 2934,
"is_new_question": false
},
@@ -5719,8 +6317,8 @@
"question__title": "Find Champion II",
"question__title_slug": "find-champion-ii",
"question__hide": false,
- "total_acs": 24480,
- "total_submitted": 42345,
+ "total_acs": 25004,
+ "total_submitted": 43085,
"frontend_question_id": 2924,
"is_new_question": false
},
@@ -5742,8 +6340,8 @@
"question__title": "Find Champion I",
"question__title_slug": "find-champion-i",
"question__hide": false,
- "total_acs": 34605,
- "total_submitted": 47331,
+ "total_acs": 35349,
+ "total_submitted": 48298,
"frontend_question_id": 2923,
"is_new_question": false
},
@@ -5765,8 +6363,8 @@
"question__title": "Maximum Profitable Triplets With Increasing Prices I",
"question__title_slug": "maximum-profitable-triplets-with-increasing-prices-i",
"question__hide": false,
- "total_acs": 1007,
- "total_submitted": 1764,
+ "total_acs": 1049,
+ "total_submitted": 1837,
"frontend_question_id": 2907,
"is_new_question": false
},
@@ -5788,8 +6386,8 @@
"question__title": "Minimum Sum of Mountain Triplets II",
"question__title_slug": "minimum-sum-of-mountain-triplets-ii",
"question__hide": false,
- "total_acs": 22684,
- "total_submitted": 42056,
+ "total_acs": 22958,
+ "total_submitted": 42472,
"frontend_question_id": 2909,
"is_new_question": false
},
@@ -5811,8 +6409,8 @@
"question__title": "Maximum Balanced Subsequence Sum",
"question__title_slug": "maximum-balanced-subsequence-sum",
"question__hide": false,
- "total_acs": 5219,
- "total_submitted": 22049,
+ "total_acs": 5347,
+ "total_submitted": 22500,
"frontend_question_id": 2926,
"is_new_question": false
},
@@ -5834,8 +6432,8 @@
"question__title": "Find the K-or of an Array",
"question__title_slug": "find-the-k-or-of-an-array",
"question__hide": false,
- "total_acs": 24459,
- "total_submitted": 32805,
+ "total_acs": 24944,
+ "total_submitted": 33434,
"frontend_question_id": 2917,
"is_new_question": false
},
@@ -5857,8 +6455,8 @@
"question__title": "Maximum Linear Stock Score",
"question__title_slug": "maximum-linear-stock-score",
"question__hide": false,
- "total_acs": 663,
- "total_submitted": 972,
+ "total_acs": 679,
+ "total_submitted": 994,
"frontend_question_id": 2898,
"is_new_question": false
},
@@ -5880,8 +6478,8 @@
"question__title": "Find Building Where Alice and Bob Can Meet",
"question__title_slug": "find-building-where-alice-and-bob-can-meet",
"question__hide": false,
- "total_acs": 6375,
- "total_submitted": 18099,
+ "total_acs": 6512,
+ "total_submitted": 18457,
"frontend_question_id": 2940,
"is_new_question": false
},
@@ -5903,8 +6501,8 @@
"question__title": "Maximum Points After Collecting Coins From All Nodes",
"question__title_slug": "maximum-points-after-collecting-coins-from-all-nodes",
"question__hide": false,
- "total_acs": 7067,
- "total_submitted": 18956,
+ "total_acs": 7241,
+ "total_submitted": 19379,
"frontend_question_id": 2920,
"is_new_question": false
},
@@ -5926,8 +6524,8 @@
"question__title": "Minimum Increment Operations to Make Array Beautiful",
"question__title_slug": "minimum-increment-operations-to-make-array-beautiful",
"question__hide": false,
- "total_acs": 12996,
- "total_submitted": 38127,
+ "total_acs": 13253,
+ "total_submitted": 38738,
"frontend_question_id": 2919,
"is_new_question": false
},
@@ -5949,8 +6547,8 @@
"question__title": "Minimizing Array After Replacing Pairs With Their Product",
"question__title_slug": "minimizing-array-after-replacing-pairs-with-their-product",
"question__hide": false,
- "total_acs": 672,
- "total_submitted": 1671,
+ "total_acs": 698,
+ "total_submitted": 1735,
"frontend_question_id": 2892,
"is_new_question": false
},
@@ -5972,8 +6570,8 @@
"question__title": "Minimum Sum of Mountain Triplets I",
"question__title_slug": "minimum-sum-of-mountain-triplets-i",
"question__hide": false,
- "total_acs": 32602,
- "total_submitted": 50441,
+ "total_acs": 33154,
+ "total_submitted": 51219,
"frontend_question_id": 2908,
"is_new_question": false
},
@@ -5995,8 +6593,8 @@
"question__title": "Minimum Number of Changes to Make Binary String Beautiful",
"question__title_slug": "minimum-number-of-changes-to-make-binary-string-beautiful",
"question__hide": false,
- "total_acs": 18236,
- "total_submitted": 30621,
+ "total_acs": 18480,
+ "total_submitted": 30945,
"frontend_question_id": 2914,
"is_new_question": false
},
@@ -6018,8 +6616,8 @@
"question__title": "The Wording Game",
"question__title_slug": "the-wording-game",
"question__hide": false,
- "total_acs": 418,
- "total_submitted": 682,
+ "total_acs": 436,
+ "total_submitted": 718,
"frontend_question_id": 2868,
"is_new_question": false
},
@@ -6041,8 +6639,8 @@
"question__title": "Divisible and Non-divisible Sums Difference",
"question__title_slug": "divisible-and-non-divisible-sums-difference",
"question__hide": false,
- "total_acs": 75410,
- "total_submitted": 85091,
+ "total_acs": 78809,
+ "total_submitted": 88795,
"frontend_question_id": 2894,
"is_new_question": false
},
@@ -6064,8 +6662,8 @@
"question__title": "Minimum Equal Sum of Two Arrays After Replacing Zeros",
"question__title_slug": "minimum-equal-sum-of-two-arrays-after-replacing-zeros",
"question__hide": false,
- "total_acs": 23888,
- "total_submitted": 69335,
+ "total_acs": 24542,
+ "total_submitted": 70848,
"frontend_question_id": 2918,
"is_new_question": false
},
@@ -6087,8 +6685,8 @@
"question__title": "Find Indices With Index and Value Difference II",
"question__title_slug": "find-indices-with-index-and-value-difference-ii",
"question__hide": false,
- "total_acs": 17310,
- "total_submitted": 53879,
+ "total_acs": 17494,
+ "total_submitted": 54450,
"frontend_question_id": 2905,
"is_new_question": false
},
@@ -6110,8 +6708,8 @@
"question__title": "Minimum Number of Groups to Create a Valid Assignment",
"question__title_slug": "minimum-number-of-groups-to-create-a-valid-assignment",
"question__hide": false,
- "total_acs": 12122,
- "total_submitted": 48236,
+ "total_acs": 12249,
+ "total_submitted": 48858,
"frontend_question_id": 2910,
"is_new_question": false
},
@@ -6133,8 +6731,8 @@
"question__title": "Find Indices With Index and Value Difference I",
"question__title_slug": "find-indices-with-index-and-value-difference-i",
"question__hide": false,
- "total_acs": 37446,
- "total_submitted": 60420,
+ "total_acs": 38147,
+ "total_submitted": 61548,
"frontend_question_id": 2903,
"is_new_question": false
},
@@ -6156,8 +6754,8 @@
"question__title": "Last Visited Integers",
"question__title_slug": "last-visited-integers",
"question__hide": false,
- "total_acs": 25391,
- "total_submitted": 38560,
+ "total_acs": 25748,
+ "total_submitted": 39046,
"frontend_question_id": 2899,
"is_new_question": false
},
@@ -6179,8 +6777,8 @@
"question__title": "Subarrays Distinct Element Sum of Squares I",
"question__title_slug": "subarrays-distinct-element-sum-of-squares-i",
"question__hide": false,
- "total_acs": 30771,
- "total_submitted": 37271,
+ "total_acs": 31630,
+ "total_submitted": 38239,
"frontend_question_id": 2913,
"is_new_question": false
},
@@ -6202,8 +6800,8 @@
"question__title": "Calculate Orders Within Each Interval",
"question__title_slug": "calculate-orders-within-each-interval",
"question__hide": false,
- "total_acs": 1744,
- "total_submitted": 2584,
+ "total_acs": 1836,
+ "total_submitted": 2710,
"frontend_question_id": 2893,
"is_new_question": false
},
@@ -6225,8 +6823,8 @@
"question__title": "Maximum Length of Semi-Decreasing Subarrays",
"question__title_slug": "maximum-length-of-semi-decreasing-subarrays",
"question__hide": false,
- "total_acs": 9935,
- "total_submitted": 13912,
+ "total_acs": 10825,
+ "total_submitted": 15172,
"frontend_question_id": 2863,
"is_new_question": false
},
@@ -6248,8 +6846,8 @@
"question__title": "Rolling Average Steps",
"question__title_slug": "rolling-average-steps",
"question__hide": false,
- "total_acs": 1849,
- "total_submitted": 2830,
+ "total_acs": 1958,
+ "total_submitted": 2964,
"frontend_question_id": 2854,
"is_new_question": false
},
@@ -6271,8 +6869,8 @@
"question__title": "Highest Salaries Difference",
"question__title_slug": "highest-salaries-difference",
"question__hide": false,
- "total_acs": 2483,
- "total_submitted": 3369,
+ "total_acs": 2626,
+ "total_submitted": 3546,
"frontend_question_id": 2853,
"is_new_question": false
},
@@ -6294,8 +6892,8 @@
"question__title": "Maximum Value of an Ordered Triplet I",
"question__title_slug": "maximum-value-of-an-ordered-triplet-i",
"question__hide": false,
- "total_acs": 36122,
- "total_submitted": 79501,
+ "total_acs": 36628,
+ "total_submitted": 80359,
"frontend_question_id": 2873,
"is_new_question": false
},
@@ -6317,8 +6915,8 @@
"question__title": "Apply Operations on Array to Maximize Sum of Squares",
"question__title_slug": "apply-operations-on-array-to-maximize-sum-of-squares",
"question__hide": false,
- "total_acs": 6558,
- "total_submitted": 13954,
+ "total_acs": 6650,
+ "total_submitted": 14097,
"frontend_question_id": 2897,
"is_new_question": false
},
@@ -6340,8 +6938,8 @@
"question__title": "Maximum Value of an Ordered Triplet II",
"question__title_slug": "maximum-value-of-an-ordered-triplet-ii",
"question__hide": false,
- "total_acs": 25300,
- "total_submitted": 61250,
+ "total_acs": 25520,
+ "total_submitted": 61715,
"frontend_question_id": 2874,
"is_new_question": false
},
@@ -6363,8 +6961,8 @@
"question__title": "Minimum Processing Time",
"question__title_slug": "minimum-processing-time",
"question__hide": false,
- "total_acs": 31293,
- "total_submitted": 45554,
+ "total_acs": 31755,
+ "total_submitted": 46148,
"frontend_question_id": 2895,
"is_new_question": false
},
@@ -6386,8 +6984,8 @@
"question__title": "Shortest and Lexicographically Smallest Beautiful String",
"question__title_slug": "shortest-and-lexicographically-smallest-beautiful-string",
"question__hide": false,
- "total_acs": 24375,
- "total_submitted": 62987,
+ "total_acs": 24620,
+ "total_submitted": 63456,
"frontend_question_id": 2904,
"is_new_question": false
},
@@ -6409,8 +7007,8 @@
"question__title": "Sum of Remoteness of All Cells",
"question__title_slug": "sum-of-remoteness-of-all-cells",
"question__hide": false,
- "total_acs": 1042,
- "total_submitted": 1599,
+ "total_acs": 1069,
+ "total_submitted": 1646,
"frontend_question_id": 2852,
"is_new_question": false
},
@@ -6432,8 +7030,8 @@
"question__title": "Longest Unequal Adjacent Groups Subsequence I",
"question__title_slug": "longest-unequal-adjacent-groups-subsequence-i",
"question__hide": false,
- "total_acs": 24822,
- "total_submitted": 39024,
+ "total_acs": 25809,
+ "total_submitted": 40699,
"frontend_question_id": 2900,
"is_new_question": false
},
@@ -6455,8 +7053,8 @@
"question__title": "Longest Unequal Adjacent Groups Subsequence II",
"question__title_slug": "longest-unequal-adjacent-groups-subsequence-ii",
"question__hide": false,
- "total_acs": 10326,
- "total_submitted": 38070,
+ "total_acs": 10437,
+ "total_submitted": 38382,
"frontend_question_id": 2901,
"is_new_question": false
},
@@ -6478,8 +7076,8 @@
"question__title": "Minimum Size Subarray in Infinite Array",
"question__title_slug": "minimum-size-subarray-in-infinite-array",
"question__hide": false,
- "total_acs": 18586,
- "total_submitted": 60434,
+ "total_acs": 18849,
+ "total_submitted": 61230,
"frontend_question_id": 2875,
"is_new_question": false
},
@@ -6501,8 +7099,8 @@
"question__title": "Count Visited Nodes in a Directed Graph",
"question__title_slug": "count-visited-nodes-in-a-directed-graph",
"question__hide": false,
- "total_acs": 9634,
- "total_submitted": 29509,
+ "total_acs": 9807,
+ "total_submitted": 29930,
"frontend_question_id": 2876,
"is_new_question": false
},
@@ -6524,8 +7122,8 @@
"question__title": "Subarrays Distinct Element Sum of Squares II",
"question__title_slug": "subarrays-distinct-element-sum-of-squares-ii",
"question__hide": false,
- "total_acs": 2838,
- "total_submitted": 14035,
+ "total_acs": 3000,
+ "total_submitted": 14307,
"frontend_question_id": 2916,
"is_new_question": false
},
@@ -6547,8 +7145,8 @@
"question__title": "Beautiful Towers I",
"question__title_slug": "beautiful-towers-i",
"question__hide": false,
- "total_acs": 22843,
- "total_submitted": 52536,
+ "total_acs": 23285,
+ "total_submitted": 53481,
"frontend_question_id": 2865,
"is_new_question": false
},
@@ -6570,8 +7168,8 @@
"question__title": "Beautiful Towers II",
"question__title_slug": "beautiful-towers-ii",
"question__hide": false,
- "total_acs": 12506,
- "total_submitted": 36211,
+ "total_acs": 12674,
+ "total_submitted": 36592,
"frontend_question_id": 2866,
"is_new_question": false
},
@@ -6593,8 +7191,8 @@
"question__title": "Count Valid Paths in a Tree",
"question__title_slug": "count-valid-paths-in-a-tree",
"question__hide": false,
- "total_acs": 6316,
- "total_submitted": 18173,
+ "total_acs": 6415,
+ "total_submitted": 18409,
"frontend_question_id": 2867,
"is_new_question": false
},
@@ -6616,8 +7214,8 @@
"question__title": "Smallest Number With Given Digit Product",
"question__title_slug": "smallest-number-with-given-digit-product",
"question__hide": false,
- "total_acs": 823,
- "total_submitted": 1891,
+ "total_acs": 841,
+ "total_submitted": 1938,
"frontend_question_id": 2847,
"is_new_question": false
},
@@ -6639,8 +7237,8 @@
"question__title": "Maximum Spending After Buying Items",
"question__title_slug": "maximum-spending-after-buying-items",
"question__hide": false,
- "total_acs": 9647,
- "total_submitted": 14841,
+ "total_acs": 10084,
+ "total_submitted": 15444,
"frontend_question_id": 2931,
"is_new_question": false
},
@@ -6662,8 +7260,8 @@
"question__title": "Length of the Longest Subsequence That Sums to Target",
"question__title_slug": "length-of-the-longest-subsequence-that-sums-to-target",
"question__hide": false,
- "total_acs": 18387,
- "total_submitted": 52766,
+ "total_acs": 18898,
+ "total_submitted": 53957,
"frontend_question_id": 2915,
"is_new_question": false
},
@@ -6685,8 +7283,8 @@
"question__title": "Minimum Edge Reversals So Every Node Is Reachable",
"question__title_slug": "minimum-edge-reversals-so-every-node-is-reachable",
"question__hide": false,
- "total_acs": 7502,
- "total_submitted": 12810,
+ "total_acs": 7703,
+ "total_submitted": 13133,
"frontend_question_id": 2858,
"is_new_question": false
},
@@ -6708,8 +7306,8 @@
"question__title": "Happy Students",
"question__title_slug": "happy-students",
"question__hide": false,
- "total_acs": 21141,
- "total_submitted": 40689,
+ "total_acs": 21333,
+ "total_submitted": 40975,
"frontend_question_id": 2860,
"is_new_question": false
},
@@ -6731,8 +7329,8 @@
"question__title": "Maximum Coins Heroes Can Collect",
"question__title_slug": "maximum-coins-heroes-can-collect",
"question__hide": false,
- "total_acs": 1125,
- "total_submitted": 1635,
+ "total_acs": 1181,
+ "total_submitted": 1715,
"frontend_question_id": 2838,
"is_new_question": false
},
@@ -6754,8 +7352,8 @@
"question__title": "Total Traveled Distance",
"question__title_slug": "total-traveled-distance",
"question__hide": false,
- "total_acs": 2328,
- "total_submitted": 3146,
+ "total_acs": 2453,
+ "total_submitted": 3285,
"frontend_question_id": 2837,
"is_new_question": false
},
@@ -6777,8 +7375,8 @@
"question__title": "Maximum Number of Alloys",
"question__title_slug": "maximum-number-of-alloys",
"question__hide": false,
- "total_acs": 13624,
- "total_submitted": 35654,
+ "total_acs": 13808,
+ "total_submitted": 36060,
"frontend_question_id": 2861,
"is_new_question": false
},
@@ -6800,8 +7398,8 @@
"question__title": "Minimum Number of Operations to Make Array Empty",
"question__title_slug": "minimum-number-of-operations-to-make-array-empty",
"question__hide": false,
- "total_acs": 175288,
- "total_submitted": 283067,
+ "total_acs": 177683,
+ "total_submitted": 286754,
"frontend_question_id": 2870,
"is_new_question": false
},
@@ -6823,8 +7421,8 @@
"question__title": "Sum of Values at Indices With K Set Bits",
"question__title_slug": "sum-of-values-at-indices-with-k-set-bits",
"question__hide": false,
- "total_acs": 65458,
- "total_submitted": 75750,
+ "total_acs": 67125,
+ "total_submitted": 77627,
"frontend_question_id": 2859,
"is_new_question": false
},
@@ -6846,8 +7444,8 @@
"question__title": "Minimum Moves to Spread Stones Over Grid",
"question__title_slug": "minimum-moves-to-spread-stones-over-grid",
"question__hide": false,
- "total_acs": 20816,
- "total_submitted": 47399,
+ "total_acs": 21229,
+ "total_submitted": 48132,
"frontend_question_id": 2850,
"is_new_question": false
},
@@ -6869,8 +7467,8 @@
"question__title": "Count of Sub-Multisets With Bounded Sum",
"question__title_slug": "count-of-sub-multisets-with-bounded-sum",
"question__hide": false,
- "total_acs": 3865,
- "total_submitted": 18793,
+ "total_acs": 3957,
+ "total_submitted": 19095,
"frontend_question_id": 2902,
"is_new_question": false
},
@@ -6892,8 +7490,8 @@
"question__title": "Maximal Range That Each Element Is Maximum in It",
"question__title_slug": "maximal-range-that-each-element-is-maximum-in-it",
"question__hide": false,
- "total_acs": 1179,
- "total_submitted": 1600,
+ "total_acs": 1207,
+ "total_submitted": 1640,
"frontend_question_id": 2832,
"is_new_question": false
},
@@ -6915,8 +7513,8 @@
"question__title": "Minimum Array Length After Pair Removals",
"question__title_slug": "minimum-array-length-after-pair-removals",
"question__hide": false,
- "total_acs": 21360,
- "total_submitted": 99015,
+ "total_acs": 21773,
+ "total_submitted": 99678,
"frontend_question_id": 2856,
"is_new_question": false
},
@@ -6938,8 +7536,8 @@
"question__title": "Split Array Into Maximum Number of Subarrays",
"question__title_slug": "split-array-into-maximum-number-of-subarrays",
"question__hide": false,
- "total_acs": 15684,
- "total_submitted": 35810,
+ "total_acs": 15840,
+ "total_submitted": 36112,
"frontend_question_id": 2871,
"is_new_question": false
},
@@ -6961,8 +7559,8 @@
"question__title": "Minimum Edge Weight Equilibrium Queries in a Tree",
"question__title_slug": "minimum-edge-weight-equilibrium-queries-in-a-tree",
"question__hide": false,
- "total_acs": 5529,
- "total_submitted": 12610,
+ "total_acs": 5616,
+ "total_submitted": 12748,
"frontend_question_id": 2846,
"is_new_question": false
},
@@ -6984,8 +7582,8 @@
"question__title": "Election Results",
"question__title_slug": "election-results",
"question__hide": false,
- "total_acs": 1827,
- "total_submitted": 2807,
+ "total_acs": 1919,
+ "total_submitted": 2916,
"frontend_question_id": 2820,
"is_new_question": false
},
@@ -7007,8 +7605,8 @@
"question__title": "Minimum Relative Loss After Buying Chocolates",
"question__title_slug": "minimum-relative-loss-after-buying-chocolates",
"question__hide": false,
- "total_acs": 353,
- "total_submitted": 669,
+ "total_acs": 366,
+ "total_submitted": 702,
"frontend_question_id": 2819,
"is_new_question": false
},
@@ -7030,8 +7628,8 @@
"question__title": "Get the Size of a DataFrame",
"question__title_slug": "get-the-size-of-a-dataframe",
"question__hide": false,
- "total_acs": 63946,
- "total_submitted": 75493,
+ "total_acs": 69898,
+ "total_submitted": 82530,
"frontend_question_id": 2878,
"is_new_question": false
},
@@ -7053,8 +7651,8 @@
"question__title": "Drop Missing Data",
"question__title_slug": "drop-missing-data",
"question__hide": false,
- "total_acs": 41135,
- "total_submitted": 64102,
+ "total_acs": 45173,
+ "total_submitted": 70554,
"frontend_question_id": 2883,
"is_new_question": false
},
@@ -7076,8 +7674,8 @@
"question__title": "Select Data",
"question__title_slug": "select-data",
"question__hide": false,
- "total_acs": 53018,
- "total_submitted": 67406,
+ "total_acs": 58052,
+ "total_submitted": 73760,
"frontend_question_id": 2880,
"is_new_question": false
},
@@ -7099,8 +7697,8 @@
"question__title": "Reshape Data: Melt",
"question__title_slug": "reshape-data-melt",
"question__hide": false,
- "total_acs": 30022,
- "total_submitted": 35359,
+ "total_acs": 33029,
+ "total_submitted": 38849,
"frontend_question_id": 2890,
"is_new_question": false
},
@@ -7122,8 +7720,8 @@
"question__title": "Reshape Data: Pivot",
"question__title_slug": "reshape-data-pivot",
"question__hide": false,
- "total_acs": 31643,
- "total_submitted": 39480,
+ "total_acs": 34902,
+ "total_submitted": 43325,
"frontend_question_id": 2889,
"is_new_question": false
},
@@ -7145,8 +7743,8 @@
"question__title": "Drop Duplicate Rows",
"question__title_slug": "drop-duplicate-rows",
"question__hide": false,
- "total_acs": 44168,
- "total_submitted": 52089,
+ "total_acs": 48499,
+ "total_submitted": 57144,
"frontend_question_id": 2882,
"is_new_question": false
},
@@ -7168,8 +7766,8 @@
"question__title": "Fill Missing Data",
"question__title_slug": "fill-missing-data",
"question__hide": false,
- "total_acs": 36336,
- "total_submitted": 50624,
+ "total_acs": 39888,
+ "total_submitted": 55637,
"frontend_question_id": 2887,
"is_new_question": false
},
@@ -7191,8 +7789,8 @@
"question__title": "Change Data Type",
"question__title_slug": "change-data-type",
"question__hide": false,
- "total_acs": 37823,
- "total_submitted": 43546,
+ "total_acs": 41581,
+ "total_submitted": 47887,
"frontend_question_id": 2886,
"is_new_question": false
},
@@ -7214,8 +7812,8 @@
"question__title": "Rename Columns",
"question__title_slug": "rename-columns",
"question__hide": false,
- "total_acs": 38857,
- "total_submitted": 45817,
+ "total_acs": 42693,
+ "total_submitted": 50374,
"frontend_question_id": 2885,
"is_new_question": false
},
@@ -7237,8 +7835,8 @@
"question__title": "Modify Columns",
"question__title_slug": "modify-columns",
"question__hide": false,
- "total_acs": 45428,
- "total_submitted": 49672,
+ "total_acs": 49799,
+ "total_submitted": 54378,
"frontend_question_id": 2884,
"is_new_question": false
},
@@ -7260,8 +7858,8 @@
"question__title": "Create a New Column",
"question__title_slug": "create-a-new-column",
"question__hide": false,
- "total_acs": 49916,
- "total_submitted": 55513,
+ "total_acs": 54730,
+ "total_submitted": 60835,
"frontend_question_id": 2881,
"is_new_question": false
},
@@ -7283,8 +7881,8 @@
"question__title": "Display the First Three Rows",
"question__title_slug": "display-the-first-three-rows",
"question__hide": false,
- "total_acs": 68045,
- "total_submitted": 73496,
+ "total_acs": 74137,
+ "total_submitted": 80009,
"frontend_question_id": 2879,
"is_new_question": false
},
@@ -7306,8 +7904,8 @@
"question__title": "Reshape Data: Concatenate",
"question__title_slug": "reshape-data-concatenate",
"question__hide": false,
- "total_acs": 38125,
- "total_submitted": 42234,
+ "total_acs": 41916,
+ "total_submitted": 46451,
"frontend_question_id": 2888,
"is_new_question": false
},
@@ -7329,8 +7927,8 @@
"question__title": "Method Chaining",
"question__title_slug": "method-chaining",
"question__hide": false,
- "total_acs": 31418,
- "total_submitted": 41923,
+ "total_acs": 34582,
+ "total_submitted": 46081,
"frontend_question_id": 2891,
"is_new_question": false
},
@@ -7352,8 +7950,8 @@
"question__title": "Create a DataFrame from List",
"question__title_slug": "create-a-dataframe-from-list",
"question__hide": false,
- "total_acs": 82914,
- "total_submitted": 102178,
+ "total_acs": 90326,
+ "total_submitted": 111433,
"frontend_question_id": 2877,
"is_new_question": false
},
@@ -7375,8 +7973,8 @@
"question__title": "Maximum Number of K-Divisible Components",
"question__title_slug": "maximum-number-of-k-divisible-components",
"question__hide": false,
- "total_acs": 10197,
- "total_submitted": 17527,
+ "total_acs": 10313,
+ "total_submitted": 17735,
"frontend_question_id": 2872,
"is_new_question": false
},
@@ -7398,8 +7996,8 @@
"question__title": "Count K-Subsequences of a String With Maximum Beauty",
"question__title_slug": "count-k-subsequences-of-a-string-with-maximum-beauty",
"question__hide": false,
- "total_acs": 11951,
- "total_submitted": 40958,
+ "total_acs": 12062,
+ "total_submitted": 41276,
"frontend_question_id": 2842,
"is_new_question": false
},
@@ -7421,8 +8019,8 @@
"question__title": "Determine if a Cell Is Reachable at a Given Time",
"question__title_slug": "determine-if-a-cell-is-reachable-at-a-given-time",
"question__hide": false,
- "total_acs": 97944,
- "total_submitted": 274387,
+ "total_acs": 98117,
+ "total_submitted": 274963,
"frontend_question_id": 2849,
"is_new_question": false
},
@@ -7444,8 +8042,8 @@
"question__title": "Maximum Odd Binary Number",
"question__title_slug": "maximum-odd-binary-number",
"question__hide": false,
- "total_acs": 192094,
- "total_submitted": 231310,
+ "total_acs": 196203,
+ "total_submitted": 235861,
"frontend_question_id": 2864,
"is_new_question": false
},
@@ -7467,8 +8065,8 @@
"question__title": "Maximum Element-Sum of a Complete Subset of Indices",
"question__title_slug": "maximum-element-sum-of-a-complete-subset-of-indices",
"question__hide": false,
- "total_acs": 7255,
- "total_submitted": 16636,
+ "total_acs": 7391,
+ "total_submitted": 16854,
"frontend_question_id": 2862,
"is_new_question": false
},
@@ -7490,8 +8088,8 @@
"question__title": "Minimum Operations to Make a Special Number",
"question__title_slug": "minimum-operations-to-make-a-special-number",
"question__hide": false,
- "total_acs": 25123,
- "total_submitted": 66165,
+ "total_acs": 25300,
+ "total_submitted": 66561,
"frontend_question_id": 2844,
"is_new_question": false
},
@@ -7513,8 +8111,8 @@
"question__title": "Minimum Right Shifts to Sort the Array",
"question__title_slug": "minimum-right-shifts-to-sort-the-array",
"question__hide": false,
- "total_acs": 32568,
- "total_submitted": 56364,
+ "total_acs": 33071,
+ "total_submitted": 57112,
"frontend_question_id": 2855,
"is_new_question": false
},
@@ -7536,8 +8134,8 @@
"question__title": "Minimum Operations to Collect Elements",
"question__title_slug": "minimum-operations-to-collect-elements",
"question__hide": false,
- "total_acs": 34096,
- "total_submitted": 56985,
+ "total_acs": 34749,
+ "total_submitted": 57893,
"frontend_question_id": 2869,
"is_new_question": false
},
@@ -7559,8 +8157,8 @@
"question__title": "Minimum Time Takes to Reach Destination Without Drowning",
"question__title_slug": "minimum-time-takes-to-reach-destination-without-drowning",
"question__hide": false,
- "total_acs": 791,
- "total_submitted": 1258,
+ "total_acs": 818,
+ "total_submitted": 1288,
"frontend_question_id": 2814,
"is_new_question": false
},
@@ -7582,8 +8180,8 @@
"question__title": "Points That Intersect With Cars",
"question__title_slug": "points-that-intersect-with-cars",
"question__hide": false,
- "total_acs": 45143,
- "total_submitted": 60166,
+ "total_acs": 46164,
+ "total_submitted": 61441,
"frontend_question_id": 2848,
"is_new_question": false
},
@@ -7605,8 +8203,8 @@
"question__title": "Apply Operations to Make Two Strings Equal",
"question__title_slug": "apply-operations-to-make-two-strings-equal",
"question__hide": false,
- "total_acs": 11961,
- "total_submitted": 45084,
+ "total_acs": 12156,
+ "total_submitted": 45560,
"frontend_question_id": 2896,
"is_new_question": false
},
@@ -7628,8 +8226,8 @@
"question__title": "Maximize Value of Function in a Ball Passing Game",
"question__title_slug": "maximize-value-of-function-in-a-ball-passing-game",
"question__hide": false,
- "total_acs": 4456,
- "total_submitted": 14621,
+ "total_acs": 4531,
+ "total_submitted": 14751,
"frontend_question_id": 2836,
"is_new_question": false
},
@@ -7651,8 +8249,8 @@
"question__title": "Construct Product Matrix",
"question__title_slug": "construct-product-matrix",
"question__hide": false,
- "total_acs": 11524,
- "total_submitted": 37384,
+ "total_acs": 11655,
+ "total_submitted": 37791,
"frontend_question_id": 2906,
"is_new_question": false
},
@@ -7674,8 +8272,8 @@
"question__title": "Find The K-th Lucky Number",
"question__title_slug": "find-the-k-th-lucky-number",
"question__hide": false,
- "total_acs": 4346,
- "total_submitted": 5522,
+ "total_acs": 4689,
+ "total_submitted": 6010,
"frontend_question_id": 2802,
"is_new_question": false
},
@@ -7697,8 +8295,8 @@
"question__title": "Find the Minimum Possible Sum of a Beautiful Array",
"question__title_slug": "find-the-minimum-possible-sum-of-a-beautiful-array",
"question__hide": false,
- "total_acs": 29971,
- "total_submitted": 77250,
+ "total_acs": 30086,
+ "total_submitted": 77843,
"frontend_question_id": 2834,
"is_new_question": false
},
@@ -7720,8 +8318,8 @@
"question__title": "Minimum Operations to Form Subsequence With Target Sum",
"question__title_slug": "minimum-operations-to-form-subsequence-with-target-sum",
"question__hide": false,
- "total_acs": 11677,
- "total_submitted": 36318,
+ "total_acs": 11780,
+ "total_submitted": 36518,
"frontend_question_id": 2835,
"is_new_question": false
},
@@ -7743,8 +8341,8 @@
"question__title": "String Transformation",
"question__title_slug": "string-transformation",
"question__hide": false,
- "total_acs": 3516,
- "total_submitted": 12129,
+ "total_acs": 3666,
+ "total_submitted": 12556,
"frontend_question_id": 2851,
"is_new_question": false
},
@@ -7766,8 +8364,8 @@
"question__title": "Furthest Point From Origin",
"question__title_slug": "furthest-point-from-origin",
"question__hide": false,
- "total_acs": 45950,
- "total_submitted": 71321,
+ "total_acs": 46469,
+ "total_submitted": 72010,
"frontend_question_id": 2833,
"is_new_question": false
},
@@ -7789,8 +8387,8 @@
"question__title": "Make String a Subsequence Using Cyclic Increments",
"question__title_slug": "make-string-a-subsequence-using-cyclic-increments",
"question__hide": false,
- "total_acs": 34103,
- "total_submitted": 69559,
+ "total_acs": 34421,
+ "total_submitted": 70017,
"frontend_question_id": 2825,
"is_new_question": false
},
@@ -7812,8 +8410,8 @@
"question__title": "Number of Beautiful Integers in the Range",
"question__title_slug": "number-of-beautiful-integers-in-the-range",
"question__hide": false,
- "total_acs": 8722,
- "total_submitted": 49287,
+ "total_acs": 8900,
+ "total_submitted": 49908,
"frontend_question_id": 2827,
"is_new_question": false
},
@@ -7835,8 +8433,8 @@
"question__title": "Count Nodes That Are Great Enough",
"question__title_slug": "count-nodes-that-are-great-enough",
"question__hide": false,
- "total_acs": 702,
- "total_submitted": 1198,
+ "total_acs": 728,
+ "total_submitted": 1238,
"frontend_question_id": 2792,
"is_new_question": false
},
@@ -7858,8 +8456,8 @@
"question__title": "Status of Flight Tickets",
"question__title_slug": "status-of-flight-tickets",
"question__hide": false,
- "total_acs": 1512,
- "total_submitted": 2050,
+ "total_acs": 1569,
+ "total_submitted": 2118,
"frontend_question_id": 2793,
"is_new_question": false
},
@@ -7881,8 +8479,8 @@
"question__title": "Flight Occupancy and Waitlist Analysis",
"question__title_slug": "flight-occupancy-and-waitlist-analysis",
"question__hide": false,
- "total_acs": 2170,
- "total_submitted": 5892,
+ "total_acs": 2273,
+ "total_submitted": 6150,
"frontend_question_id": 2783,
"is_new_question": false
},
@@ -7904,8 +8502,8 @@
"question__title": "Apply Operations to Maximize Score",
"question__title_slug": "apply-operations-to-maximize-score",
"question__hide": false,
- "total_acs": 6571,
- "total_submitted": 20157,
+ "total_acs": 6675,
+ "total_submitted": 20366,
"frontend_question_id": 2818,
"is_new_question": false
},
@@ -7927,8 +8525,8 @@
"question__title": "Minimum Absolute Difference Between Elements With Constraint",
"question__title_slug": "minimum-absolute-difference-between-elements-with-constraint",
"question__hide": false,
- "total_acs": 24784,
- "total_submitted": 73932,
+ "total_acs": 25163,
+ "total_submitted": 74775,
"frontend_question_id": 2817,
"is_new_question": false
},
@@ -7950,8 +8548,8 @@
"question__title": "Check if Strings Can be Made Equal With Operations I",
"question__title_slug": "check-if-strings-can-be-made-equal-with-operations-i",
"question__hide": false,
- "total_acs": 36717,
- "total_submitted": 78251,
+ "total_acs": 37051,
+ "total_submitted": 78841,
"frontend_question_id": 2839,
"is_new_question": false
},
@@ -7973,8 +8571,8 @@
"question__title": " Count Symmetric Integers",
"question__title_slug": "count-symmetric-integers",
"question__hide": false,
- "total_acs": 43741,
- "total_submitted": 58966,
+ "total_acs": 44492,
+ "total_submitted": 59907,
"frontend_question_id": 2843,
"is_new_question": false
},
@@ -7996,8 +8594,8 @@
"question__title": "Number of Unique Categories",
"question__title_slug": "number-of-unique-categories",
"question__hide": false,
- "total_acs": 1963,
- "total_submitted": 2353,
+ "total_acs": 2018,
+ "total_submitted": 2427,
"frontend_question_id": 2782,
"is_new_question": false
},
@@ -8019,8 +8617,8 @@
"question__title": "Maximize the Profit as the Salesman",
"question__title_slug": "maximize-the-profit-as-the-salesman",
"question__hide": false,
- "total_acs": 20954,
- "total_submitted": 58138,
+ "total_acs": 21235,
+ "total_submitted": 58685,
"frontend_question_id": 2830,
"is_new_question": false
},
@@ -8042,8 +8640,8 @@
"question__title": "Check if Strings Can be Made Equal With Operations II",
"question__title_slug": "check-if-strings-can-be-made-equal-with-operations-ii",
"question__hide": false,
- "total_acs": 26035,
- "total_submitted": 46871,
+ "total_acs": 26194,
+ "total_submitted": 47098,
"frontend_question_id": 2840,
"is_new_question": false
},
@@ -8065,8 +8663,8 @@
"question__title": "Check if a String Is an Acronym of Words",
"question__title_slug": "check-if-a-string-is-an-acronym-of-words",
"question__hide": false,
- "total_acs": 86310,
- "total_submitted": 104013,
+ "total_acs": 88849,
+ "total_submitted": 107035,
"frontend_question_id": 2828,
"is_new_question": false
},
@@ -8088,8 +8686,8 @@
"question__title": "Account Balance After Rounded Purchase",
"question__title_slug": "account-balance-after-rounded-purchase",
"question__hide": false,
- "total_acs": 40846,
- "total_submitted": 78347,
+ "total_acs": 41415,
+ "total_submitted": 79230,
"frontend_question_id": 2806,
"is_new_question": false
},
@@ -8111,8 +8709,8 @@
"question__title": "Maximum Sum of Almost Unique Subarray",
"question__title_slug": "maximum-sum-of-almost-unique-subarray",
"question__hide": false,
- "total_acs": 23976,
- "total_submitted": 63509,
+ "total_acs": 24237,
+ "total_submitted": 63995,
"frontend_question_id": 2841,
"is_new_question": false
},
@@ -8134,8 +8732,8 @@
"question__title": "Count Pairs of Points With Distance k",
"question__title_slug": "count-pairs-of-points-with-distance-k",
"question__hide": false,
- "total_acs": 10368,
- "total_submitted": 32355,
+ "total_acs": 10495,
+ "total_submitted": 32711,
"frontend_question_id": 2857,
"is_new_question": false
},
@@ -8157,8 +8755,8 @@
"question__title": "Minimum Time to Make Array Sum At Most x",
"question__title_slug": "minimum-time-to-make-array-sum-at-most-x",
"question__hide": false,
- "total_acs": 3610,
- "total_submitted": 14219,
+ "total_acs": 3695,
+ "total_submitted": 14385,
"frontend_question_id": 2809,
"is_new_question": false
},
@@ -8180,8 +8778,8 @@
"question__title": "Height of Special Binary Tree",
"question__title_slug": "height-of-special-binary-tree",
"question__hide": false,
- "total_acs": 680,
- "total_submitted": 927,
+ "total_acs": 717,
+ "total_submitted": 967,
"frontend_question_id": 2773,
"is_new_question": false
},
@@ -8203,8 +8801,8 @@
"question__title": "Inversion of Object",
"question__title_slug": "inversion-of-object",
"question__hide": false,
- "total_acs": 715,
- "total_submitted": 1209,
+ "total_acs": 740,
+ "total_submitted": 1264,
"frontend_question_id": 2822,
"is_new_question": false
},
@@ -8226,8 +8824,8 @@
"question__title": "Count Stepping Numbers in Range",
"question__title_slug": "count-stepping-numbers-in-range",
"question__hide": false,
- "total_acs": 7472,
- "total_submitted": 27142,
+ "total_acs": 7575,
+ "total_submitted": 27368,
"frontend_question_id": 2801,
"is_new_question": false
},
@@ -8249,8 +8847,8 @@
"question__title": "Minimum Seconds to Equalize a Circular Array",
"question__title_slug": "minimum-seconds-to-equalize-a-circular-array",
"question__hide": false,
- "total_acs": 15031,
- "total_submitted": 56552,
+ "total_acs": 15162,
+ "total_submitted": 56791,
"frontend_question_id": 2808,
"is_new_question": false
},
@@ -8272,8 +8870,8 @@
"question__title": "Maximum Number of Groups With Increasing Length",
"question__title_slug": "maximum-number-of-groups-with-increasing-length",
"question__hide": false,
- "total_acs": 8816,
- "total_submitted": 44708,
+ "total_acs": 8914,
+ "total_submitted": 44993,
"frontend_question_id": 2790,
"is_new_question": false
},
@@ -8295,8 +8893,8 @@
"question__title": "Is Array a Preorder of Some Binary Tree",
"question__title_slug": "is-array-a-preorder-of-some-binary-tree",
"question__hide": false,
- "total_acs": 1001,
- "total_submitted": 1499,
+ "total_acs": 1036,
+ "total_submitted": 1551,
"frontend_question_id": 2764,
"is_new_question": false
},
@@ -8318,8 +8916,8 @@
"question__title": "Count Pairs Whose Sum is Less than Target",
"question__title_slug": "count-pairs-whose-sum-is-less-than-target",
"question__hide": false,
- "total_acs": 136663,
- "total_submitted": 156857,
+ "total_acs": 143542,
+ "total_submitted": 164563,
"frontend_question_id": 2824,
"is_new_question": false
},
@@ -8341,8 +8939,8 @@
"question__title": "Check if it is Possible to Split Array",
"question__title_slug": "check-if-it-is-possible-to-split-array",
"question__hide": false,
- "total_acs": 28482,
- "total_submitted": 84891,
+ "total_acs": 28672,
+ "total_submitted": 85272,
"frontend_question_id": 2811,
"is_new_question": false
},
@@ -8364,8 +8962,8 @@
"question__title": "Count of Interesting Subarrays",
"question__title_slug": "count-of-interesting-subarrays",
"question__hide": false,
- "total_acs": 13316,
- "total_submitted": 38239,
+ "total_acs": 13727,
+ "total_submitted": 39081,
"frontend_question_id": 2845,
"is_new_question": false
},
@@ -8387,8 +8985,8 @@
"question__title": "Find the Safest Path in a Grid",
"question__title_slug": "find-the-safest-path-in-a-grid",
"question__hide": false,
- "total_acs": 90231,
- "total_submitted": 183698,
+ "total_acs": 91271,
+ "total_submitted": 185883,
"frontend_question_id": 2812,
"is_new_question": false
},
@@ -8410,8 +9008,8 @@
"question__title": "Deep Object Filter",
"question__title_slug": "deep-object-filter",
"question__hide": false,
- "total_acs": 330,
- "total_submitted": 590,
+ "total_acs": 340,
+ "total_submitted": 614,
"frontend_question_id": 2823,
"is_new_question": false
},
@@ -8433,8 +9031,8 @@
"question__title": "Delay the Resolution of Each Promise",
"question__title_slug": "delay-the-resolution-of-each-promise",
"question__hide": false,
- "total_acs": 558,
- "total_submitted": 861,
+ "total_acs": 574,
+ "total_submitted": 879,
"frontend_question_id": 2821,
"is_new_question": false
},
@@ -8456,8 +9054,8 @@
"question__title": "Custom Interval",
"question__title_slug": "custom-interval",
"question__hide": false,
- "total_acs": 377,
- "total_submitted": 464,
+ "total_acs": 393,
+ "total_submitted": 481,
"frontend_question_id": 2805,
"is_new_question": false
},
@@ -8479,8 +9077,8 @@
"question__title": "Array Prototype ForEach",
"question__title_slug": "array-prototype-foreach",
"question__hide": false,
- "total_acs": 781,
- "total_submitted": 880,
+ "total_acs": 809,
+ "total_submitted": 914,
"frontend_question_id": 2804,
"is_new_question": false
},
@@ -8502,8 +9100,8 @@
"question__title": "Count Paths That Can Form a Palindrome in a Tree",
"question__title_slug": "count-paths-that-can-form-a-palindrome-in-a-tree",
"question__hide": false,
- "total_acs": 5849,
- "total_submitted": 12314,
+ "total_acs": 6062,
+ "total_submitted": 12671,
"frontend_question_id": 2791,
"is_new_question": false
},
@@ -8525,8 +9123,8 @@
"question__title": "Sorting Three Groups",
"question__title_slug": "sorting-three-groups",
"question__hide": false,
- "total_acs": 18995,
- "total_submitted": 45205,
+ "total_acs": 19262,
+ "total_submitted": 45776,
"frontend_question_id": 2826,
"is_new_question": false
},
@@ -8548,8 +9146,8 @@
"question__title": "Insert Greatest Common Divisors in Linked List",
"question__title_slug": "insert-greatest-common-divisors-in-linked-list",
"question__hide": false,
- "total_acs": 69995,
- "total_submitted": 79109,
+ "total_acs": 72452,
+ "total_submitted": 81803,
"frontend_question_id": 2807,
"is_new_question": false
},
@@ -8571,8 +9169,8 @@
"question__title": "Max Pair Sum in an Array",
"question__title_slug": "max-pair-sum-in-an-array",
"question__hide": false,
- "total_acs": 43944,
- "total_submitted": 76241,
+ "total_acs": 44549,
+ "total_submitted": 77072,
"frontend_question_id": 2815,
"is_new_question": false
},
@@ -8594,8 +9192,8 @@
"question__title": "Factorial Generator",
"question__title_slug": "factorial-generator",
"question__hide": false,
- "total_acs": 800,
- "total_submitted": 929,
+ "total_acs": 817,
+ "total_submitted": 949,
"frontend_question_id": 2803,
"is_new_question": false
},
@@ -8617,8 +9215,8 @@
"question__title": "Partial Function with Placeholders",
"question__title_slug": "partial-function-with-placeholders",
"question__hide": false,
- "total_acs": 898,
- "total_submitted": 978,
+ "total_acs": 919,
+ "total_submitted": 999,
"frontend_question_id": 2797,
"is_new_question": false
},
@@ -8640,8 +9238,8 @@
"question__title": "Repeat String",
"question__title_slug": "repeat-string",
"question__hide": false,
- "total_acs": 2074,
- "total_submitted": 2238,
+ "total_acs": 2153,
+ "total_submitted": 2322,
"frontend_question_id": 2796,
"is_new_question": false
},
@@ -8663,8 +9261,8 @@
"question__title": "Parallel Execution of Promises for Individual Results Retrieval",
"question__title_slug": "parallel-execution-of-promises-for-individual-results-retrieval",
"question__hide": false,
- "total_acs": 526,
- "total_submitted": 596,
+ "total_acs": 541,
+ "total_submitted": 616,
"frontend_question_id": 2795,
"is_new_question": false
},
@@ -8686,8 +9284,8 @@
"question__title": "Count Houses in a Circular Street II",
"question__title_slug": "count-houses-in-a-circular-street-ii",
"question__hide": false,
- "total_acs": 655,
- "total_submitted": 933,
+ "total_acs": 665,
+ "total_submitted": 952,
"frontend_question_id": 2753,
"is_new_question": false
},
@@ -8709,8 +9307,8 @@
"question__title": "Maximum Elegance of a K-Length Subsequence",
"question__title_slug": "maximum-elegance-of-a-k-length-subsequence",
"question__hide": false,
- "total_acs": 5826,
- "total_submitted": 18279,
+ "total_acs": 6290,
+ "total_submitted": 19217,
"frontend_question_id": 2813,
"is_new_question": false
},
@@ -8732,8 +9330,8 @@
"question__title": "Visit Array Positions to Maximize Score",
"question__title_slug": "visit-array-positions-to-maximize-score",
"question__hide": false,
- "total_acs": 18718,
- "total_submitted": 52349,
+ "total_acs": 19049,
+ "total_submitted": 52980,
"frontend_question_id": 2786,
"is_new_question": false
},
@@ -8755,8 +9353,8 @@
"question__title": "Check if Array is Good",
"question__title_slug": "check-if-array-is-good",
"question__hide": false,
- "total_acs": 47284,
- "total_submitted": 95649,
+ "total_acs": 47953,
+ "total_submitted": 97155,
"frontend_question_id": 2784,
"is_new_question": false
},
@@ -8778,8 +9376,8 @@
"question__title": "Maximum Beauty of an Array After Applying Operation",
"question__title_slug": "maximum-beauty-of-an-array-after-applying-operation",
"question__hide": false,
- "total_acs": 24471,
- "total_submitted": 64723,
+ "total_acs": 24935,
+ "total_submitted": 65506,
"frontend_question_id": 2779,
"is_new_question": false
},
@@ -8795,14 +9393,14 @@
{
"stat": {
"question_id": 2890,
- "question__article__live": null,
- "question__article__slug": null,
- "question__article__has_video_solution": null,
+ "question__article__live": true,
+ "question__article__slug": "count-substrings-without-repeating-character",
+ "question__article__has_video_solution": false,
"question__title": "Count Substrings Without Repeating Character",
"question__title_slug": "count-substrings-without-repeating-character",
"question__hide": false,
- "total_acs": 1847,
- "total_submitted": 2607,
+ "total_acs": 4835,
+ "total_submitted": 6254,
"frontend_question_id": 2743,
"is_new_question": false
},
@@ -8824,8 +9422,8 @@
"question__title": "Number of Black Blocks",
"question__title_slug": "number-of-black-blocks",
"question__hide": false,
- "total_acs": 7648,
- "total_submitted": 21191,
+ "total_acs": 7724,
+ "total_submitted": 21414,
"frontend_question_id": 2768,
"is_new_question": false
},
@@ -8847,8 +9445,8 @@
"question__title": "Minimum Index of a Valid Split",
"question__title_slug": "minimum-index-of-a-valid-split",
"question__hide": false,
- "total_acs": 22940,
- "total_submitted": 37015,
+ "total_acs": 23135,
+ "total_submitted": 37282,
"frontend_question_id": 2780,
"is_new_question": false
},
@@ -8870,8 +9468,8 @@
"question__title": "Sort Vowels in a String",
"question__title_slug": "sort-vowels-in-a-string",
"question__hide": false,
- "total_acs": 128354,
- "total_submitted": 157678,
+ "total_acs": 129922,
+ "total_submitted": 159677,
"frontend_question_id": 2785,
"is_new_question": false
},
@@ -8893,8 +9491,8 @@
"question__title": "Faulty Keyboard",
"question__title_slug": "faulty-keyboard",
"question__hide": false,
- "total_acs": 73537,
- "total_submitted": 88150,
+ "total_acs": 75793,
+ "total_submitted": 90762,
"frontend_question_id": 2810,
"is_new_question": false
},
@@ -8916,8 +9514,8 @@
"question__title": "Count Occurrences in Text",
"question__title_slug": "count-occurrences-in-text",
"question__hide": false,
- "total_acs": 4155,
- "total_submitted": 7452,
+ "total_acs": 4393,
+ "total_submitted": 7869,
"frontend_question_id": 2738,
"is_new_question": false
},
@@ -8939,8 +9537,8 @@
"question__title": "Length of the Longest Valid Substring",
"question__title_slug": "length-of-the-longest-valid-substring",
"question__hide": false,
- "total_acs": 26587,
- "total_submitted": 71820,
+ "total_acs": 28366,
+ "total_submitted": 75905,
"frontend_question_id": 2781,
"is_new_question": false
},
@@ -8962,8 +9560,8 @@
"question__title": "Partition String Into Minimum Beautiful Substrings",
"question__title_slug": "partition-string-into-minimum-beautiful-substrings",
"question__hide": false,
- "total_acs": 15465,
- "total_submitted": 29241,
+ "total_acs": 15760,
+ "total_submitted": 29706,
"frontend_question_id": 2767,
"is_new_question": false
},
@@ -8985,8 +9583,8 @@
"question__title": "Ways to Express an Integer as Sum of Powers",
"question__title_slug": "ways-to-express-an-integer-as-sum-of-powers",
"question__hide": false,
- "total_acs": 17843,
- "total_submitted": 53119,
+ "total_acs": 18104,
+ "total_submitted": 53700,
"frontend_question_id": 2787,
"is_new_question": false
},
@@ -9008,8 +9606,8 @@
"question__title": "Split Strings by Separator",
"question__title_slug": "split-strings-by-separator",
"question__hide": false,
- "total_acs": 51492,
- "total_submitted": 69718,
+ "total_acs": 52530,
+ "total_submitted": 71016,
"frontend_question_id": 2788,
"is_new_question": false
},
@@ -9031,8 +9629,8 @@
"question__title": "Find the Closest Marked Node",
"question__title_slug": "find-the-closest-marked-node",
"question__hide": false,
- "total_acs": 1417,
- "total_submitted": 2549,
+ "total_acs": 1589,
+ "total_submitted": 2776,
"frontend_question_id": 2737,
"is_new_question": false
},
@@ -9054,8 +9652,8 @@
"question__title": "Minimum Changes to Make K Semi-palindromes",
"question__title_slug": "minimum-changes-to-make-k-semi-palindromes",
"question__hide": false,
- "total_acs": 3671,
- "total_submitted": 10256,
+ "total_acs": 3700,
+ "total_submitted": 10329,
"frontend_question_id": 2911,
"is_new_question": false
},
@@ -9077,8 +9675,8 @@
"question__title": "Apply Operations to Make All Array Elements Equal to Zero",
"question__title_slug": "apply-operations-to-make-all-array-elements-equal-to-zero",
"question__hide": false,
- "total_acs": 11945,
- "total_submitted": 36634,
+ "total_acs": 12410,
+ "total_submitted": 37729,
"frontend_question_id": 2772,
"is_new_question": false
},
@@ -9100,8 +9698,8 @@
"question__title": "Shortest String That Contains Three Strings",
"question__title_slug": "shortest-string-that-contains-three-strings",
"question__hide": false,
- "total_acs": 15159,
- "total_submitted": 50058,
+ "total_acs": 15287,
+ "total_submitted": 50364,
"frontend_question_id": 2800,
"is_new_question": false
},
@@ -9123,8 +9721,8 @@
"question__title": "Number of Employees Who Met the Target",
"question__title_slug": "number-of-employees-who-met-the-target",
"question__hide": false,
- "total_acs": 147614,
- "total_submitted": 168398,
+ "total_acs": 152758,
+ "total_submitted": 174176,
"frontend_question_id": 2798,
"is_new_question": false
},
@@ -9146,8 +9744,8 @@
"question__title": "Count Houses in a Circular Street",
"question__title_slug": "count-houses-in-a-circular-street",
"question__hide": false,
- "total_acs": 1912,
- "total_submitted": 2266,
+ "total_acs": 1945,
+ "total_submitted": 2306,
"frontend_question_id": 2728,
"is_new_question": false
},
@@ -9169,8 +9767,8 @@
"question__title": "Popularity Percentage",
"question__title_slug": "popularity-percentage",
"question__hide": false,
- "total_acs": 1555,
- "total_submitted": 3140,
+ "total_acs": 1628,
+ "total_submitted": 3259,
"frontend_question_id": 2720,
"is_new_question": false
},
@@ -9192,8 +9790,8 @@
"question__title": "Prime Pairs With Target Sum",
"question__title_slug": "prime-pairs-with-target-sum",
"question__hide": false,
- "total_acs": 28386,
- "total_submitted": 83976,
+ "total_acs": 28904,
+ "total_submitted": 84950,
"frontend_question_id": 2761,
"is_new_question": false
},
@@ -9215,8 +9813,8 @@
"question__title": "Largest Element in an Array after Merge Operations",
"question__title_slug": "largest-element-in-an-array-after-merge-operations",
"question__hide": false,
- "total_acs": 29461,
- "total_submitted": 62761,
+ "total_acs": 29712,
+ "total_submitted": 63183,
"frontend_question_id": 2789,
"is_new_question": false
},
@@ -9238,8 +9836,8 @@
"question__title": "Double a Number Represented as a Linked List",
"question__title_slug": "double-a-number-represented-as-a-linked-list",
"question__hide": false,
- "total_acs": 161691,
- "total_submitted": 262305,
+ "total_acs": 163242,
+ "total_submitted": 264927,
"frontend_question_id": 2816,
"is_new_question": false
},
@@ -9261,8 +9859,8 @@
"question__title": "Longest Alternating Subarray",
"question__title_slug": "longest-alternating-subarray",
"question__hide": false,
- "total_acs": 23728,
- "total_submitted": 70014,
+ "total_acs": 24195,
+ "total_submitted": 71103,
"frontend_question_id": 2765,
"is_new_question": false
},
@@ -9284,8 +9882,8 @@
"question__title": "Longest Non-decreasing Subarray From Two Arrays",
"question__title_slug": "longest-non-decreasing-subarray-from-two-arrays",
"question__hide": false,
- "total_acs": 22973,
- "total_submitted": 79114,
+ "total_acs": 23377,
+ "total_submitted": 80169,
"frontend_question_id": 2771,
"is_new_question": false
},
@@ -9307,8 +9905,8 @@
"question__title": "Continuous Subarrays",
"question__title_slug": "continuous-subarrays",
"question__hide": false,
- "total_acs": 18820,
- "total_submitted": 46084,
+ "total_acs": 19192,
+ "total_submitted": 46894,
"frontend_question_id": 2762,
"is_new_question": false
},
@@ -9330,8 +9928,8 @@
"question__title": "Ways to Split Array Into Good Subarrays",
"question__title_slug": "ways-to-split-array-into-good-subarrays",
"question__hide": false,
- "total_acs": 20318,
- "total_submitted": 60256,
+ "total_acs": 20950,
+ "total_submitted": 61692,
"frontend_question_id": 2750,
"is_new_question": false
},
@@ -9353,8 +9951,8 @@
"question__title": "Longest Even Odd Subarray With Threshold",
"question__title_slug": "longest-even-odd-subarray-with-threshold",
"question__hide": false,
- "total_acs": 34105,
- "total_submitted": 115684,
+ "total_acs": 34678,
+ "total_submitted": 117288,
"frontend_question_id": 2760,
"is_new_question": false
},
@@ -9376,8 +9974,8 @@
"question__title": "Find Shortest Path with K Hops",
"question__title_slug": "find-shortest-path-with-k-hops",
"question__hide": false,
- "total_acs": 819,
- "total_submitted": 1350,
+ "total_acs": 921,
+ "total_submitted": 1472,
"frontend_question_id": 2714,
"is_new_question": false
},
@@ -9399,8 +9997,8 @@
"question__title": "Is Object Empty",
"question__title_slug": "is-object-empty",
"question__hide": false,
- "total_acs": 53113,
- "total_submitted": 66825,
+ "total_acs": 55843,
+ "total_submitted": 70130,
"frontend_question_id": 2727,
"is_new_question": false
},
@@ -9422,8 +10020,8 @@
"question__title": "Calculator with Method Chaining",
"question__title_slug": "calculator-with-method-chaining",
"question__hide": false,
- "total_acs": 23228,
- "total_submitted": 31118,
+ "total_acs": 24509,
+ "total_submitted": 32722,
"frontend_question_id": 2726,
"is_new_question": false
},
@@ -9445,8 +10043,8 @@
"question__title": "Interval Cancellation",
"question__title_slug": "interval-cancellation",
"question__hide": false,
- "total_acs": 33608,
- "total_submitted": 42436,
+ "total_acs": 35617,
+ "total_submitted": 44701,
"frontend_question_id": 2725,
"is_new_question": false
},
@@ -9468,8 +10066,8 @@
"question__title": "Create Object from Two Arrays",
"question__title_slug": "create-object-from-two-arrays",
"question__hide": false,
- "total_acs": 906,
- "total_submitted": 1431,
+ "total_acs": 939,
+ "total_submitted": 1477,
"frontend_question_id": 2794,
"is_new_question": false
},
@@ -9491,8 +10089,8 @@
"question__title": "Sort By",
"question__title_slug": "sort-by",
"question__hide": false,
- "total_acs": 33676,
- "total_submitted": 41057,
+ "total_acs": 35464,
+ "total_submitted": 43170,
"frontend_question_id": 2724,
"is_new_question": false
},
@@ -9514,8 +10112,8 @@
"question__title": "Add Two Promises",
"question__title_slug": "add-two-promises",
"question__hide": false,
- "total_acs": 78720,
- "total_submitted": 86445,
+ "total_acs": 83058,
+ "total_submitted": 91160,
"frontend_question_id": 2723,
"is_new_question": false
},
@@ -9537,8 +10135,8 @@
"question__title": "Join Two Arrays by ID",
"question__title_slug": "join-two-arrays-by-id",
"question__hide": false,
- "total_acs": 25288,
- "total_submitted": 46823,
+ "total_acs": 26609,
+ "total_submitted": 49252,
"frontend_question_id": 2722,
"is_new_question": false
},
@@ -9560,8 +10158,8 @@
"question__title": "Total Distance Traveled",
"question__title_slug": "total-distance-traveled",
"question__hide": false,
- "total_acs": 41547,
- "total_submitted": 106391,
+ "total_acs": 42096,
+ "total_submitted": 107666,
"frontend_question_id": 2739,
"is_new_question": false
},
@@ -9583,8 +10181,8 @@
"question__title": "Count Complete Subarrays in an Array",
"question__title_slug": "count-complete-subarrays-in-an-array",
"question__hide": false,
- "total_acs": 37940,
- "total_submitted": 58651,
+ "total_acs": 38623,
+ "total_submitted": 59521,
"frontend_question_id": 2799,
"is_new_question": false
},
@@ -9606,8 +10204,8 @@
"question__title": "Maximum Number of Jumps to Reach the Last Index",
"question__title_slug": "maximum-number-of-jumps-to-reach-the-last-index",
"question__hide": false,
- "total_acs": 25800,
- "total_submitted": 84347,
+ "total_acs": 26293,
+ "total_submitted": 85323,
"frontend_question_id": 2770,
"is_new_question": false
},
@@ -9629,8 +10227,8 @@
"question__title": "Decremental String Concatenation",
"question__title_slug": "decremental-string-concatenation",
"question__hide": false,
- "total_acs": 7866,
- "total_submitted": 29733,
+ "total_acs": 8035,
+ "total_submitted": 30204,
"frontend_question_id": 2746,
"is_new_question": false
},
@@ -9652,8 +10250,8 @@
"question__title": "Consecutive Transactions with Increasing Amounts",
"question__title_slug": "consecutive-transactions-with-increasing-amounts",
"question__hide": false,
- "total_acs": 2196,
- "total_submitted": 7034,
+ "total_acs": 2374,
+ "total_submitted": 7495,
"frontend_question_id": 2701,
"is_new_question": false
},
@@ -9675,8 +10273,8 @@
"question__title": "Customers with Maximum Number of Transactions on Consecutive Days",
"question__title_slug": "customers-with-maximum-number-of-transactions-on-consecutive-days",
"question__hide": false,
- "total_acs": 1314,
- "total_submitted": 3571,
+ "total_acs": 1369,
+ "total_submitted": 3711,
"frontend_question_id": 2752,
"is_new_question": false
},
@@ -9698,8 +10296,8 @@
"question__title": "Convert JSON String to Object",
"question__title_slug": "convert-json-string-to-object",
"question__hide": false,
- "total_acs": 404,
- "total_submitted": 621,
+ "total_acs": 427,
+ "total_submitted": 679,
"frontend_question_id": 2759,
"is_new_question": false
},
@@ -9721,8 +10319,8 @@
"question__title": "Construct the Longest New String",
"question__title_slug": "construct-the-longest-new-string",
"question__hide": false,
- "total_acs": 18944,
- "total_submitted": 35418,
+ "total_acs": 19244,
+ "total_submitted": 35894,
"frontend_question_id": 2745,
"is_new_question": false
},
@@ -9744,8 +10342,8 @@
"question__title": "Sum of Imbalance Numbers of All Subarrays",
"question__title_slug": "sum-of-imbalance-numbers-of-all-subarrays",
"question__hide": false,
- "total_acs": 7372,
- "total_submitted": 15979,
+ "total_acs": 7501,
+ "total_submitted": 16169,
"frontend_question_id": 2763,
"is_new_question": false
},
@@ -9767,8 +10365,8 @@
"question__title": "Special Permutations",
"question__title_slug": "special-permutations",
"question__hide": false,
- "total_acs": 13672,
- "total_submitted": 48712,
+ "total_acs": 13832,
+ "total_submitted": 49128,
"frontend_question_id": 2741,
"is_new_question": false
},
@@ -9790,8 +10388,8 @@
"question__title": "Find Maximum Number of String Pairs",
"question__title_slug": "find-maximum-number-of-string-pairs",
"question__hide": false,
- "total_acs": 61395,
- "total_submitted": 75724,
+ "total_acs": 63672,
+ "total_submitted": 78325,
"frontend_question_id": 2744,
"is_new_question": false
},
@@ -9813,8 +10411,8 @@
"question__title": "Robot Collisions",
"question__title_slug": "robot-collisions",
"question__hide": false,
- "total_acs": 9609,
- "total_submitted": 23717,
+ "total_acs": 9759,
+ "total_submitted": 23978,
"frontend_question_id": 2751,
"is_new_question": false
},
@@ -9836,8 +10434,8 @@
"question__title": "Find the Value of the Partition",
"question__title_slug": "find-the-value-of-the-partition",
"question__hide": false,
- "total_acs": 32062,
- "total_submitted": 49283,
+ "total_acs": 32421,
+ "total_submitted": 49750,
"frontend_question_id": 2740,
"is_new_question": false
},
@@ -9859,8 +10457,8 @@
"question__title": "Sum of Squares of Special Elements ",
"question__title_slug": "sum-of-squares-of-special-elements",
"question__hide": false,
- "total_acs": 62941,
- "total_submitted": 77996,
+ "total_acs": 66654,
+ "total_submitted": 82105,
"frontend_question_id": 2778,
"is_new_question": false
},
@@ -9882,8 +10480,8 @@
"question__title": "Extract Kth Character From The Rope Tree",
"question__title_slug": "extract-kth-character-from-the-rope-tree",
"question__hide": false,
- "total_acs": 2509,
- "total_submitted": 3387,
+ "total_acs": 2608,
+ "total_submitted": 3508,
"frontend_question_id": 2689,
"is_new_question": false
},
@@ -9905,8 +10503,8 @@
"question__title": "Find Active Users",
"question__title_slug": "find-active-users",
"question__hide": false,
- "total_acs": 2846,
- "total_submitted": 6904,
+ "total_acs": 2944,
+ "total_submitted": 7110,
"frontend_question_id": 2688,
"is_new_question": false
},
@@ -9928,8 +10526,8 @@
"question__title": "Bikes Last Time Used ",
"question__title_slug": "bikes-last-time-used",
"question__hide": false,
- "total_acs": 3118,
- "total_submitted": 3880,
+ "total_acs": 3235,
+ "total_submitted": 4022,
"frontend_question_id": 2687,
"is_new_question": false
},
@@ -9951,8 +10549,8 @@
"question__title": "Immediate Food Delivery III",
"question__title_slug": "immediate-food-delivery-iii",
"question__hide": false,
- "total_acs": 2648,
- "total_submitted": 4026,
+ "total_acs": 2838,
+ "total_submitted": 4282,
"frontend_question_id": 2686,
"is_new_question": false
},
@@ -9974,8 +10572,8 @@
"question__title": "Maximum Sum Queries",
"question__title_slug": "maximum-sum-queries",
"question__hide": false,
- "total_acs": 5338,
- "total_submitted": 18512,
+ "total_acs": 5426,
+ "total_submitted": 18737,
"frontend_question_id": 2736,
"is_new_question": false
},
@@ -9997,8 +10595,8 @@
"question__title": "Sum of Matrix After Queries",
"question__title_slug": "sum-of-matrix-after-queries",
"question__hide": false,
- "total_acs": 20504,
- "total_submitted": 66827,
+ "total_acs": 20638,
+ "total_submitted": 67193,
"frontend_question_id": 2718,
"is_new_question": false
},
@@ -10020,8 +10618,8 @@
"question__title": "Minimum Operations to Make the Integer Zero",
"question__title_slug": "minimum-operations-to-make-the-integer-zero",
"question__hide": false,
- "total_acs": 9124,
- "total_submitted": 31019,
+ "total_acs": 9233,
+ "total_submitted": 31262,
"frontend_question_id": 2749,
"is_new_question": false
},
@@ -10043,8 +10641,8 @@
"question__title": "Neither Minimum nor Maximum",
"question__title_slug": "neither-minimum-nor-maximum",
"question__hide": false,
- "total_acs": 87415,
- "total_submitted": 114203,
+ "total_acs": 89389,
+ "total_submitted": 116820,
"frontend_question_id": 2733,
"is_new_question": false
},
@@ -10066,8 +10664,8 @@
"question__title": "Split a Circular Linked List",
"question__title_slug": "split-a-circular-linked-list",
"question__hide": false,
- "total_acs": 1292,
- "total_submitted": 1772,
+ "total_acs": 1336,
+ "total_submitted": 1823,
"frontend_question_id": 2674,
"is_new_question": false
},
@@ -10089,8 +10687,8 @@
"question__title": "Relocate Marbles",
"question__title_slug": "relocate-marbles",
"question__hide": false,
- "total_acs": 19519,
- "total_submitted": 37916,
+ "total_acs": 19725,
+ "total_submitted": 38224,
"frontend_question_id": 2766,
"is_new_question": false
},
@@ -10112,8 +10710,8 @@
"question__title": "Count Zero Request Servers",
"question__title_slug": "count-zero-request-servers",
"question__hide": false,
- "total_acs": 5822,
- "total_submitted": 17912,
+ "total_acs": 5930,
+ "total_submitted": 18251,
"frontend_question_id": 2747,
"is_new_question": false
},
@@ -10135,8 +10733,8 @@
"question__title": "Find the Longest Equal Subarray",
"question__title_slug": "find-the-longest-equal-subarray",
"question__hide": false,
- "total_acs": 19173,
- "total_submitted": 53942,
+ "total_acs": 19470,
+ "total_submitted": 54554,
"frontend_question_id": 2831,
"is_new_question": false
},
@@ -10158,8 +10756,8 @@
"question__title": "Number of Beautiful Pairs",
"question__title_slug": "number-of-beautiful-pairs",
"question__hide": false,
- "total_acs": 33107,
- "total_submitted": 66399,
+ "total_acs": 33722,
+ "total_submitted": 67429,
"frontend_question_id": 2748,
"is_new_question": false
},
@@ -10181,8 +10779,8 @@
"question__title": "Count Artist Occurrences On Spotify Ranking List",
"question__title_slug": "count-artist-occurrences-on-spotify-ranking-list",
"question__hide": false,
- "total_acs": 2944,
- "total_submitted": 4116,
+ "total_acs": 3068,
+ "total_submitted": 4289,
"frontend_question_id": 2669,
"is_new_question": false
},
@@ -10204,8 +10802,8 @@
"question__title": "Find Latest Salaries",
"question__title_slug": "find-latest-salaries",
"question__hide": false,
- "total_acs": 3218,
- "total_submitted": 4547,
+ "total_acs": 3367,
+ "total_submitted": 4726,
"frontend_question_id": 2668,
"is_new_question": false
},
@@ -10227,8 +10825,8 @@
"question__title": "Lexicographically Smallest String After Substring Operation",
"question__title_slug": "lexicographically-smallest-string-after-substring-operation",
"question__hide": false,
- "total_acs": 26061,
- "total_submitted": 85610,
+ "total_acs": 26297,
+ "total_submitted": 85950,
"frontend_question_id": 2734,
"is_new_question": false
},
@@ -10244,14 +10842,14 @@
{
"stat": {
"question_id": 2827,
- "question__article__live": null,
- "question__article__slug": null,
- "question__article__has_video_solution": null,
+ "question__article__live": true,
+ "question__article__slug": "greatest-common-divisor-traversal",
+ "question__article__has_video_solution": false,
"question__title": "Greatest Common Divisor Traversal",
"question__title_slug": "greatest-common-divisor-traversal",
"question__hide": false,
- "total_acs": 69052,
- "total_submitted": 161793,
+ "total_acs": 69430,
+ "total_submitted": 162852,
"frontend_question_id": 2709,
"is_new_question": false
},
@@ -10273,8 +10871,8 @@
"question__title": "Find a Good Subset of the Matrix",
"question__title_slug": "find-a-good-subset-of-the-matrix",
"question__hide": false,
- "total_acs": 6556,
- "total_submitted": 14559,
+ "total_acs": 6638,
+ "total_submitted": 14686,
"frontend_question_id": 2732,
"is_new_question": false
},
@@ -10296,8 +10894,8 @@
"question__title": "Minimize String Length",
"question__title_slug": "minimize-string-length",
"question__hide": false,
- "total_acs": 52487,
- "total_submitted": 69544,
+ "total_acs": 53585,
+ "total_submitted": 70903,
"frontend_question_id": 2716,
"is_new_question": false
},
@@ -10319,8 +10917,8 @@
"question__title": "Check if The Number is Fascinating",
"question__title_slug": "check-if-the-number-is-fascinating",
"question__hide": false,
- "total_acs": 42730,
- "total_submitted": 82383,
+ "total_acs": 43419,
+ "total_submitted": 83582,
"frontend_question_id": 2729,
"is_new_question": false
},
@@ -10342,8 +10940,8 @@
"question__title": "The Knight’s Tour",
"question__title_slug": "the-knights-tour",
"question__hide": false,
- "total_acs": 1319,
- "total_submitted": 1990,
+ "total_acs": 1360,
+ "total_submitted": 2052,
"frontend_question_id": 2664,
"is_new_question": false
},
@@ -10365,8 +10963,8 @@
"question__title": "Next Day",
"question__title_slug": "next-day",
"question__hide": false,
- "total_acs": 852,
- "total_submitted": 983,
+ "total_acs": 872,
+ "total_submitted": 1003,
"frontend_question_id": 2758,
"is_new_question": false
},
@@ -10388,8 +10986,8 @@
"question__title": "Timeout Cancellation",
"question__title_slug": "timeout-cancellation",
"question__hide": false,
- "total_acs": 41426,
- "total_submitted": 46895,
+ "total_acs": 43865,
+ "total_submitted": 49580,
"frontend_question_id": 2715,
"is_new_question": false
},
@@ -10411,8 +11009,8 @@
"question__title": "Return Length of Arguments Passed",
"question__title_slug": "return-length-of-arguments-passed",
"question__hide": false,
- "total_acs": 130266,
- "total_submitted": 138444,
+ "total_acs": 137310,
+ "total_submitted": 145831,
"frontend_question_id": 2703,
"is_new_question": false
},
@@ -10434,8 +11032,8 @@
"question__title": "Remove Trailing Zeros From a String",
"question__title_slug": "remove-trailing-zeros-from-a-string",
"question__hide": false,
- "total_acs": 61231,
- "total_submitted": 78018,
+ "total_acs": 62556,
+ "total_submitted": 79626,
"frontend_question_id": 2710,
"is_new_question": false
},
@@ -10457,8 +11055,8 @@
"question__title": "Maximum Strictly Increasing Cells in a Matrix",
"question__title_slug": "maximum-strictly-increasing-cells-in-a-matrix",
"question__hide": false,
- "total_acs": 12335,
- "total_submitted": 40590,
+ "total_acs": 12579,
+ "total_submitted": 41166,
"frontend_question_id": 2713,
"is_new_question": false
},
@@ -10480,8 +11078,8 @@
"question__title": "Minimum Cost to Make All Characters Equal",
"question__title_slug": "minimum-cost-to-make-all-characters-equal",
"question__hide": false,
- "total_acs": 17945,
- "total_submitted": 33142,
+ "total_acs": 18132,
+ "total_submitted": 33399,
"frontend_question_id": 2712,
"is_new_question": false
},
@@ -10503,8 +11101,8 @@
"question__title": "Lexicographically Smallest Palindrome",
"question__title_slug": "lexicographically-smallest-palindrome",
"question__hide": false,
- "total_acs": 48973,
- "total_submitted": 60081,
+ "total_acs": 50433,
+ "total_submitted": 61759,
"frontend_question_id": 2697,
"is_new_question": false
},
@@ -10526,8 +11124,8 @@
"question__title": "Find Maximal Uncovered Ranges",
"question__title_slug": "find-maximal-uncovered-ranges",
"question__hide": false,
- "total_acs": 1208,
- "total_submitted": 2272,
+ "total_acs": 1244,
+ "total_submitted": 2345,
"frontend_question_id": 2655,
"is_new_question": false
},
@@ -10549,8 +11147,8 @@
"question__title": "Generate Circular Array Values",
"question__title_slug": "generate-circular-array-values",
"question__hide": false,
- "total_acs": 358,
- "total_submitted": 501,
+ "total_acs": 369,
+ "total_submitted": 517,
"frontend_question_id": 2757,
"is_new_question": false
},
@@ -10572,8 +11170,8 @@
"question__title": "To Be Or Not To Be",
"question__title_slug": "to-be-or-not-to-be",
"question__hide": false,
- "total_acs": 150657,
- "total_submitted": 243286,
+ "total_acs": 159417,
+ "total_submitted": 256772,
"frontend_question_id": 2704,
"is_new_question": false
},
@@ -10595,8 +11193,8 @@
"question__title": "Find the Maximum Achievable Number",
"question__title_slug": "find-the-maximum-achievable-number",
"question__hide": false,
- "total_acs": 90663,
- "total_submitted": 100692,
+ "total_acs": 95342,
+ "total_submitted": 105693,
"frontend_question_id": 2769,
"is_new_question": false
},
@@ -10618,8 +11216,8 @@
"question__title": "Determine the Minimum Sum of a k-avoiding Array",
"question__title_slug": "determine-the-minimum-sum-of-a-k-avoiding-array",
"question__hide": false,
- "total_acs": 33996,
- "total_submitted": 55615,
+ "total_acs": 34195,
+ "total_submitted": 55881,
"frontend_question_id": 2829,
"is_new_question": false
},
@@ -10641,8 +11239,8 @@
"question__title": "Collecting Chocolates",
"question__title_slug": "collecting-chocolates",
"question__hide": false,
- "total_acs": 11490,
- "total_submitted": 34745,
+ "total_acs": 11602,
+ "total_submitted": 34969,
"frontend_question_id": 2735,
"is_new_question": false
},
@@ -10664,8 +11262,8 @@
"question__title": "Create Hello World Function",
"question__title_slug": "create-hello-world-function",
"question__hide": false,
- "total_acs": 380843,
- "total_submitted": 468904,
+ "total_acs": 399953,
+ "total_submitted": 492487,
"frontend_question_id": 2667,
"is_new_question": false
},
@@ -10687,8 +11285,8 @@
"question__title": "Painting the Walls",
"question__title_slug": "painting-the-walls",
"question__hide": false,
- "total_acs": 62939,
- "total_submitted": 123541,
+ "total_acs": 63475,
+ "total_submitted": 124640,
"frontend_question_id": 2742,
"is_new_question": false
},
@@ -10710,8 +11308,8 @@
"question__title": "Execute Asynchronous Functions in Parallel",
"question__title_slug": "execute-asynchronous-functions-in-parallel",
"question__hide": false,
- "total_acs": 21490,
- "total_submitted": 28974,
+ "total_acs": 22770,
+ "total_submitted": 30577,
"frontend_question_id": 2721,
"is_new_question": false
},
@@ -10733,8 +11331,8 @@
"question__title": "Query Batching",
"question__title_slug": "query-batching",
"question__hide": false,
- "total_acs": 264,
- "total_submitted": 427,
+ "total_acs": 278,
+ "total_submitted": 444,
"frontend_question_id": 2756,
"is_new_question": false
},
@@ -10756,8 +11354,8 @@
"question__title": "Array Wrapper",
"question__title_slug": "array-wrapper",
"question__hide": false,
- "total_acs": 34483,
- "total_submitted": 39315,
+ "total_acs": 35935,
+ "total_submitted": 40908,
"frontend_question_id": 2695,
"is_new_question": false
},
@@ -10779,8 +11377,8 @@
"question__title": "Compact Object",
"question__title_slug": "compact-object",
"question__hide": false,
- "total_acs": 19266,
- "total_submitted": 30055,
+ "total_acs": 20323,
+ "total_submitted": 31507,
"frontend_question_id": 2705,
"is_new_question": false
},
@@ -10802,8 +11400,8 @@
"question__title": "Modify Graph Edge Weights",
"question__title_slug": "modify-graph-edge-weights",
"question__hide": false,
- "total_acs": 4733,
- "total_submitted": 19707,
+ "total_acs": 4797,
+ "total_submitted": 19896,
"frontend_question_id": 2699,
"is_new_question": false
},
@@ -10825,8 +11423,8 @@
"question__title": "Find the Punishment Number of an Integer",
"question__title_slug": "find-the-punishment-number-of-an-integer",
"question__hide": false,
- "total_acs": 19289,
- "total_submitted": 31013,
+ "total_acs": 19498,
+ "total_submitted": 31259,
"frontend_question_id": 2698,
"is_new_question": false
},
@@ -10848,8 +11446,8 @@
"question__title": "Difference of Number of Distinct Values on Diagonals",
"question__title_slug": "difference-of-number-of-distinct-values-on-diagonals",
"question__hide": false,
- "total_acs": 19132,
- "total_submitted": 26971,
+ "total_acs": 19285,
+ "total_submitted": 27169,
"frontend_question_id": 2711,
"is_new_question": false
},
@@ -10871,8 +11469,8 @@
"question__title": "Minimum String Length After Removing Substrings",
"question__title_slug": "minimum-string-length-after-removing-substrings",
"question__hide": false,
- "total_acs": 47655,
- "total_submitted": 68609,
+ "total_acs": 48857,
+ "total_submitted": 70300,
"frontend_question_id": 2696,
"is_new_question": false
},
@@ -10894,8 +11492,8 @@
"question__title": "Date Range Generator",
"question__title_slug": "date-range-generator",
"question__hide": false,
- "total_acs": 349,
- "total_submitted": 428,
+ "total_acs": 365,
+ "total_submitted": 451,
"frontend_question_id": 2777,
"is_new_question": false
},
@@ -10917,8 +11515,8 @@
"question__title": "Chunk Array",
"question__title_slug": "chunk-array",
"question__hide": false,
- "total_acs": 54087,
- "total_submitted": 65170,
+ "total_acs": 56420,
+ "total_submitted": 67885,
"frontend_question_id": 2677,
"is_new_question": false
},
@@ -10940,8 +11538,8 @@
"question__title": "Event Emitter",
"question__title_slug": "event-emitter",
"question__hide": false,
- "total_acs": 21865,
- "total_submitted": 29257,
+ "total_acs": 22762,
+ "total_submitted": 30578,
"frontend_question_id": 2694,
"is_new_question": false
},
@@ -10963,8 +11561,8 @@
"question__title": "Allow One Function Call",
"question__title_slug": "allow-one-function-call",
"question__hide": false,
- "total_acs": 92244,
- "total_submitted": 107337,
+ "total_acs": 96627,
+ "total_submitted": 112373,
"frontend_question_id": 2666,
"is_new_question": false
},
@@ -10986,8 +11584,8 @@
"question__title": "Deep Merge of Two Objects",
"question__title_slug": "deep-merge-of-two-objects",
"question__hide": false,
- "total_acs": 472,
- "total_submitted": 732,
+ "total_acs": 488,
+ "total_submitted": 751,
"frontend_question_id": 2755,
"is_new_question": false
},
@@ -11009,8 +11607,8 @@
"question__title": "Maximum Number of Moves in a Grid",
"question__title_slug": "maximum-number-of-moves-in-a-grid",
"question__hide": false,
- "total_acs": 23388,
- "total_submitted": 51212,
+ "total_acs": 23617,
+ "total_submitted": 51640,
"frontend_question_id": 2684,
"is_new_question": false
},
@@ -11032,8 +11630,8 @@
"question__title": "Count the Number of Complete Components",
"question__title_slug": "count-the-number-of-complete-components",
"question__hide": false,
- "total_acs": 25516,
- "total_submitted": 39075,
+ "total_acs": 26424,
+ "total_submitted": 40337,
"frontend_question_id": 2685,
"is_new_question": false
},
@@ -11055,8 +11653,8 @@
"question__title": "Neighboring Bitwise XOR",
"question__title_slug": "neighboring-bitwise-xor",
"question__hide": false,
- "total_acs": 21424,
- "total_submitted": 34813,
+ "total_acs": 21652,
+ "total_submitted": 35108,
"frontend_question_id": 2683,
"is_new_question": false
},
@@ -11078,8 +11676,8 @@
"question__title": "Find the Losers of the Circular Game",
"question__title_slug": "find-the-losers-of-the-circular-game",
"question__hide": false,
- "total_acs": 26559,
- "total_submitted": 54433,
+ "total_acs": 26906,
+ "total_submitted": 54997,
"frontend_question_id": 2682,
"is_new_question": false
},
@@ -11101,8 +11699,8 @@
"question__title": "Call Function with Custom Context",
"question__title_slug": "call-function-with-custom-context",
"question__hide": false,
- "total_acs": 9755,
- "total_submitted": 12151,
+ "total_acs": 9870,
+ "total_submitted": 12311,
"frontend_question_id": 2693,
"is_new_question": false
},
@@ -11124,8 +11722,8 @@
"question__title": "Counter II",
"question__title_slug": "counter-ii",
"question__hide": false,
- "total_acs": 177003,
- "total_submitted": 222350,
+ "total_acs": 185888,
+ "total_submitted": 232958,
"frontend_question_id": 2665,
"is_new_question": false
},
@@ -11147,8 +11745,8 @@
"question__title": "Design Cancellable Function",
"question__title_slug": "design-cancellable-function",
"question__hide": false,
- "total_acs": 1909,
- "total_submitted": 3741,
+ "total_acs": 1957,
+ "total_submitted": 3833,
"frontend_question_id": 2650,
"is_new_question": false
},
@@ -11170,8 +11768,8 @@
"question__title": "Movement of Robots",
"question__title_slug": "movement-of-robots",
"question__hide": false,
- "total_acs": 12839,
- "total_submitted": 46132,
+ "total_acs": 13077,
+ "total_submitted": 46875,
"frontend_question_id": 2731,
"is_new_question": false
},
@@ -11193,8 +11791,8 @@
"question__title": "Find the Longest Semi-Repetitive Substring",
"question__title_slug": "find-the-longest-semi-repetitive-substring",
"question__hide": false,
- "total_acs": 22436,
- "total_submitted": 61755,
+ "total_acs": 22811,
+ "total_submitted": 62430,
"frontend_question_id": 2730,
"is_new_question": false
},
@@ -11216,8 +11814,8 @@
"question__title": "Semi-Ordered Permutation",
"question__title_slug": "semi-ordered-permutation",
"question__hide": false,
- "total_acs": 30369,
- "total_submitted": 47829,
+ "total_acs": 30643,
+ "total_submitted": 48166,
"frontend_question_id": 2717,
"is_new_question": false
},
@@ -11239,8 +11837,8 @@
"question__title": "Power of Heroes",
"question__title_slug": "power-of-heroes",
"question__hide": false,
- "total_acs": 8652,
- "total_submitted": 28358,
+ "total_acs": 8770,
+ "total_submitted": 28643,
"frontend_question_id": 2681,
"is_new_question": false
},
@@ -11262,8 +11860,8 @@
"question__title": "Nested Array Generator",
"question__title_slug": "nested-array-generator",
"question__hide": false,
- "total_acs": 11765,
- "total_submitted": 14898,
+ "total_acs": 11949,
+ "total_submitted": 15124,
"frontend_question_id": 2649,
"is_new_question": false
},
@@ -11285,8 +11883,8 @@
"question__title": "Convert Callback Based Function to Promise Based Function",
"question__title_slug": "convert-callback-based-function-to-promise-based-function",
"question__hide": false,
- "total_acs": 618,
- "total_submitted": 674,
+ "total_acs": 646,
+ "total_submitted": 703,
"frontend_question_id": 2776,
"is_new_question": false
},
@@ -11308,8 +11906,8 @@
"question__title": "Undefined to Null",
"question__title_slug": "undefined-to-null",
"question__hide": false,
- "total_acs": 503,
- "total_submitted": 742,
+ "total_acs": 520,
+ "total_submitted": 763,
"frontend_question_id": 2775,
"is_new_question": false
},
@@ -11331,8 +11929,8 @@
"question__title": "Make Costs of Paths Equal in a Binary Tree",
"question__title_slug": "make-costs-of-paths-equal-in-a-binary-tree",
"question__hide": false,
- "total_acs": 15629,
- "total_submitted": 26504,
+ "total_acs": 15896,
+ "total_submitted": 26952,
"frontend_question_id": 2673,
"is_new_question": false
},
@@ -11354,8 +11952,8 @@
"question__title": "Number of Adjacent Elements With the Same Color",
"question__title_slug": "number-of-adjacent-elements-with-the-same-color",
"question__hide": false,
- "total_acs": 15120,
- "total_submitted": 27777,
+ "total_acs": 15327,
+ "total_submitted": 28060,
"frontend_question_id": 2672,
"is_new_question": false
},
@@ -11377,8 +11975,8 @@
"question__title": "Frequency Tracker",
"question__title_slug": "frequency-tracker",
"question__hide": false,
- "total_acs": 21123,
- "total_submitted": 71330,
+ "total_acs": 21379,
+ "total_submitted": 71983,
"frontend_question_id": 2671,
"is_new_question": false
},
@@ -11400,8 +11998,8 @@
"question__title": "Find the Distinct Difference Array",
"question__title_slug": "find-the-distinct-difference-array",
"question__hide": false,
- "total_acs": 36752,
- "total_submitted": 47532,
+ "total_acs": 37408,
+ "total_submitted": 48310,
"frontend_question_id": 2670,
"is_new_question": false
},
@@ -11423,8 +12021,8 @@
"question__title": "Make Object Immutable",
"question__title_slug": "make-object-immutable",
"question__hide": false,
- "total_acs": 357,
- "total_submitted": 558,
+ "total_acs": 368,
+ "total_submitted": 590,
"frontend_question_id": 2692,
"is_new_question": false
},
@@ -11446,8 +12044,8 @@
"question__title": "Generate Fibonacci Sequence",
"question__title_slug": "generate-fibonacci-sequence",
"question__hide": false,
- "total_acs": 26125,
- "total_submitted": 31580,
+ "total_acs": 26859,
+ "total_submitted": 32407,
"frontend_question_id": 2648,
"is_new_question": false
},
@@ -11469,8 +12067,8 @@
"question__title": "Differences Between Two Objects",
"question__title_slug": "differences-between-two-objects",
"question__hide": false,
- "total_acs": 7026,
- "total_submitted": 9107,
+ "total_acs": 7144,
+ "total_submitted": 9288,
"frontend_question_id": 2700,
"is_new_question": false
},
@@ -11492,8 +12090,8 @@
"question__title": "Immutability Helper",
"question__title_slug": "immutability-helper",
"question__hide": false,
- "total_acs": 176,
- "total_submitted": 450,
+ "total_acs": 185,
+ "total_submitted": 473,
"frontend_question_id": 2691,
"is_new_question": false
},
@@ -11515,8 +12113,8 @@
"question__title": "Infinite Method Object",
"question__title_slug": "infinite-method-object",
"question__hide": false,
- "total_acs": 1116,
- "total_submitted": 1205,
+ "total_acs": 1142,
+ "total_submitted": 1232,
"frontend_question_id": 2690,
"is_new_question": false
},
@@ -11538,8 +12136,8 @@
"question__title": "Throttle",
"question__title_slug": "throttle",
"question__hide": false,
- "total_acs": 8986,
- "total_submitted": 10868,
+ "total_acs": 9113,
+ "total_submitted": 11011,
"frontend_question_id": 2676,
"is_new_question": false
},
@@ -11561,8 +12159,8 @@
"question__title": "Bind Function to Context",
"question__title_slug": "bind-function-to-context",
"question__hide": false,
- "total_acs": 539,
- "total_submitted": 621,
+ "total_acs": 565,
+ "total_submitted": 651,
"frontend_question_id": 2754,
"is_new_question": false
},
@@ -11584,8 +12182,8 @@
"question__title": "Array of Objects to Matrix",
"question__title_slug": "array-of-objects-to-matrix",
"question__hide": false,
- "total_acs": 5844,
- "total_submitted": 8437,
+ "total_acs": 5862,
+ "total_submitted": 8478,
"frontend_question_id": 2675,
"is_new_question": false
},
@@ -11607,8 +12205,8 @@
"question__title": "Array Upper Bound",
"question__title_slug": "array-upper-bound",
"question__hide": false,
- "total_acs": 1217,
- "total_submitted": 1498,
+ "total_acs": 1255,
+ "total_submitted": 1540,
"frontend_question_id": 2774,
"is_new_question": false
},
@@ -11630,8 +12228,8 @@
"question__title": "Maximum Sum With Exactly K Elements ",
"question__title_slug": "maximum-sum-with-exactly-k-elements",
"question__hide": false,
- "total_acs": 67917,
- "total_submitted": 82807,
+ "total_acs": 69843,
+ "total_submitted": 85074,
"frontend_question_id": 2656,
"is_new_question": false
},
@@ -11653,8 +12251,8 @@
"question__title": "Find the Prefix Common Array of Two Arrays",
"question__title_slug": "find-the-prefix-common-array-of-two-arrays",
"question__hide": false,
- "total_acs": 39838,
- "total_submitted": 49197,
+ "total_acs": 40781,
+ "total_submitted": 50267,
"frontend_question_id": 2657,
"is_new_question": false
},
@@ -11676,8 +12274,8 @@
"question__title": "Make Array Empty",
"question__title_slug": "make-array-empty",
"question__hide": false,
- "total_acs": 10337,
- "total_submitted": 40988,
+ "total_acs": 10503,
+ "total_submitted": 41527,
"frontend_question_id": 2659,
"is_new_question": false
},
@@ -11699,8 +12297,8 @@
"question__title": "Maximum Number of Fish in a Grid",
"question__title_slug": "maximum-number-of-fish-in-a-grid",
"question__hide": false,
- "total_acs": 25196,
- "total_submitted": 42257,
+ "total_acs": 25667,
+ "total_submitted": 42968,
"frontend_question_id": 2658,
"is_new_question": false
},
@@ -11722,8 +12320,8 @@
"question__title": "Cache With Time Limit",
"question__title_slug": "cache-with-time-limit",
"question__hide": false,
- "total_acs": 39317,
- "total_submitted": 53209,
+ "total_acs": 40868,
+ "total_submitted": 55271,
"frontend_question_id": 2622,
"is_new_question": false
},
@@ -11745,8 +12343,8 @@
"question__title": "Array Reduce Transformation",
"question__title_slug": "array-reduce-transformation",
"question__hide": false,
- "total_acs": 138941,
- "total_submitted": 164931,
+ "total_acs": 145163,
+ "total_submitted": 172023,
"frontend_question_id": 2626,
"is_new_question": false
},
@@ -11768,8 +12366,8 @@
"question__title": "Snail Traversal",
"question__title_slug": "snail-traversal",
"question__hide": false,
- "total_acs": 9729,
- "total_submitted": 14925,
+ "total_acs": 9958,
+ "total_submitted": 15234,
"frontend_question_id": 2624,
"is_new_question": false
},
@@ -11791,8 +12389,8 @@
"question__title": "Flatten Deeply Nested Array",
"question__title_slug": "flatten-deeply-nested-array",
"question__hide": false,
- "total_acs": 37172,
- "total_submitted": 58483,
+ "total_acs": 38708,
+ "total_submitted": 60926,
"frontend_question_id": 2625,
"is_new_question": false
},
@@ -11814,8 +12412,8 @@
"question__title": "Check if Object Instance of Class",
"question__title_slug": "check-if-object-instance-of-class",
"question__hide": false,
- "total_acs": 21832,
- "total_submitted": 78930,
+ "total_acs": 22259,
+ "total_submitted": 80595,
"frontend_question_id": 2618,
"is_new_question": false
},
@@ -11837,8 +12435,8 @@
"question__title": "Count of Integers",
"question__title_slug": "count-of-integers",
"question__hide": false,
- "total_acs": 10497,
- "total_submitted": 30569,
+ "total_acs": 10638,
+ "total_submitted": 30912,
"frontend_question_id": 2719,
"is_new_question": false
},
@@ -11860,8 +12458,8 @@
"question__title": "Buy Two Chocolates",
"question__title_slug": "buy-two-chocolates",
"question__hide": false,
- "total_acs": 177026,
- "total_submitted": 255311,
+ "total_acs": 179103,
+ "total_submitted": 258453,
"frontend_question_id": 2706,
"is_new_question": false
},
@@ -11883,8 +12481,8 @@
"question__title": "Extra Characters in a String",
"question__title_slug": "extra-characters-in-a-string",
"question__hide": false,
- "total_acs": 85210,
- "total_submitted": 162167,
+ "total_acs": 85729,
+ "total_submitted": 163155,
"frontend_question_id": 2707,
"is_new_question": false
},
@@ -11906,8 +12504,8 @@
"question__title": "Maximum Strength of a Group",
"question__title_slug": "maximum-strength-of-a-group",
"question__hide": false,
- "total_acs": 27048,
- "total_submitted": 112705,
+ "total_acs": 27417,
+ "total_submitted": 114116,
"frontend_question_id": 2708,
"is_new_question": false
},
@@ -11929,8 +12527,8 @@
"question__title": "Minimum Number of Operations to Make All Array Elements Equal to 1",
"question__title_slug": "minimum-number-of-operations-to-make-all-array-elements-equal-to-1",
"question__hide": false,
- "total_acs": 12323,
- "total_submitted": 35155,
+ "total_acs": 12445,
+ "total_submitted": 35414,
"frontend_question_id": 2654,
"is_new_question": false
},
@@ -11952,8 +12550,8 @@
"question__title": "Sum Multiples",
"question__title_slug": "sum-multiples",
"question__hide": false,
- "total_acs": 101846,
- "total_submitted": 119349,
+ "total_acs": 104681,
+ "total_submitted": 122558,
"frontend_question_id": 2652,
"is_new_question": false
},
@@ -11975,8 +12573,8 @@
"question__title": "Sliding Subarray Beauty",
"question__title_slug": "sliding-subarray-beauty",
"question__hide": false,
- "total_acs": 19640,
- "total_submitted": 59713,
+ "total_acs": 20019,
+ "total_submitted": 60500,
"frontend_question_id": 2653,
"is_new_question": false
},
@@ -11998,8 +12596,8 @@
"question__title": "Promise Pool",
"question__title_slug": "promise-pool",
"question__hide": false,
- "total_acs": 12017,
- "total_submitted": 15018,
+ "total_acs": 12193,
+ "total_submitted": 15231,
"frontend_question_id": 2636,
"is_new_question": false
},
@@ -12021,8 +12619,8 @@
"question__title": "Promise Time Limit",
"question__title_slug": "promise-time-limit",
"question__hide": false,
- "total_acs": 47642,
- "total_submitted": 58553,
+ "total_acs": 49547,
+ "total_submitted": 60825,
"frontend_question_id": 2637,
"is_new_question": false
},
@@ -12044,8 +12642,8 @@
"question__title": "Calculate Delayed Arrival Time",
"question__title_slug": "calculate-delayed-arrival-time",
"question__hide": false,
- "total_acs": 53277,
- "total_submitted": 67838,
+ "total_acs": 54264,
+ "total_submitted": 69111,
"frontend_question_id": 2651,
"is_new_question": false
},
@@ -12067,8 +12665,8 @@
"question__title": "Apply Transform Over Each Element in Array",
"question__title_slug": "apply-transform-over-each-element-in-array",
"question__hide": false,
- "total_acs": 163041,
- "total_submitted": 190494,
+ "total_acs": 170552,
+ "total_submitted": 199196,
"frontend_question_id": 2635,
"is_new_question": false
},
@@ -12090,8 +12688,8 @@
"question__title": "Filter Elements from Array",
"question__title_slug": "filter-elements-from-array",
"question__hide": false,
- "total_acs": 148298,
- "total_submitted": 175790,
+ "total_acs": 155233,
+ "total_submitted": 183881,
"frontend_question_id": 2634,
"is_new_question": false
},
@@ -12113,8 +12711,8 @@
"question__title": "Convert Object to JSON String",
"question__title_slug": "convert-object-to-json-string",
"question__hide": false,
- "total_acs": 11460,
- "total_submitted": 14793,
+ "total_acs": 11559,
+ "total_submitted": 14940,
"frontend_question_id": 2633,
"is_new_question": false
},
@@ -12136,8 +12734,8 @@
"question__title": "Memoize II",
"question__title_slug": "memoize-ii",
"question__hide": false,
- "total_acs": 4884,
- "total_submitted": 15786,
+ "total_acs": 4973,
+ "total_submitted": 16108,
"frontend_question_id": 2630,
"is_new_question": false
},
@@ -12159,8 +12757,8 @@
"question__title": "Debounce",
"question__title_slug": "debounce",
"question__hide": false,
- "total_acs": 42121,
- "total_submitted": 46543,
+ "total_acs": 43890,
+ "total_submitted": 48431,
"frontend_question_id": 2627,
"is_new_question": false
},
@@ -12182,8 +12780,8 @@
"question__title": "Group By",
"question__title_slug": "group-by",
"question__hide": false,
- "total_acs": 37507,
- "total_submitted": 46514,
+ "total_acs": 39108,
+ "total_submitted": 48488,
"frontend_question_id": 2631,
"is_new_question": false
},
@@ -12205,8 +12803,8 @@
"question__title": "Function Composition",
"question__title_slug": "function-composition",
"question__hide": false,
- "total_acs": 117334,
- "total_submitted": 136755,
+ "total_acs": 122495,
+ "total_submitted": 142506,
"frontend_question_id": 2629,
"is_new_question": false
},
@@ -12228,8 +12826,8 @@
"question__title": "Curry",
"question__title_slug": "curry",
"question__hide": false,
- "total_acs": 16129,
- "total_submitted": 18042,
+ "total_acs": 16257,
+ "total_submitted": 18186,
"frontend_question_id": 2632,
"is_new_question": false
},
@@ -12251,8 +12849,8 @@
"question__title": "Minimize the Total Price of the Trips",
"question__title_slug": "minimize-the-total-price-of-the-trips",
"question__hide": false,
- "total_acs": 9490,
- "total_submitted": 21073,
+ "total_acs": 9599,
+ "total_submitted": 21268,
"frontend_question_id": 2646,
"is_new_question": false
},
@@ -12274,8 +12872,8 @@
"question__title": "Count the Number of K-Free Subsets",
"question__title_slug": "count-the-number-of-k-free-subsets",
"question__hide": false,
- "total_acs": 3002,
- "total_submitted": 6409,
+ "total_acs": 3216,
+ "total_submitted": 6764,
"frontend_question_id": 2638,
"is_new_question": false
},
@@ -12297,8 +12895,8 @@
"question__title": "Row With Maximum Ones",
"question__title_slug": "row-with-maximum-ones",
"question__hide": false,
- "total_acs": 57938,
- "total_submitted": 76786,
+ "total_acs": 59703,
+ "total_submitted": 79132,
"frontend_question_id": 2643,
"is_new_question": false
},
@@ -12320,8 +12918,8 @@
"question__title": "Minimum Additions to Make Valid String",
"question__title_slug": "minimum-additions-to-make-valid-string",
"question__hide": false,
- "total_acs": 27902,
- "total_submitted": 55408,
+ "total_acs": 28248,
+ "total_submitted": 56019,
"frontend_question_id": 2645,
"is_new_question": false
},
@@ -12343,8 +12941,8 @@
"question__title": "JSON Deep Equal",
"question__title_slug": "json-deep-equal",
"question__hide": false,
- "total_acs": 12256,
- "total_submitted": 31766,
+ "total_acs": 12376,
+ "total_submitted": 32059,
"frontend_question_id": 2628,
"is_new_question": false
},
@@ -12366,8 +12964,8 @@
"question__title": "Array Prototype Last",
"question__title_slug": "array-prototype-last",
"question__hide": false,
- "total_acs": 124544,
- "total_submitted": 170521,
+ "total_acs": 128217,
+ "total_submitted": 175157,
"frontend_question_id": 2619,
"is_new_question": false
},
@@ -12389,8 +12987,8 @@
"question__title": "Sleep",
"question__title_slug": "sleep",
"question__hide": false,
- "total_acs": 123020,
- "total_submitted": 142182,
+ "total_acs": 127678,
+ "total_submitted": 147341,
"frontend_question_id": 2621,
"is_new_question": false
},
@@ -12412,8 +13010,8 @@
"question__title": "Counter",
"question__title_slug": "counter",
"question__hide": false,
- "total_acs": 341828,
- "total_submitted": 423754,
+ "total_acs": 356802,
+ "total_submitted": 441519,
"frontend_question_id": 2620,
"is_new_question": false
},
@@ -12435,8 +13033,8 @@
"question__title": "Memoize",
"question__title_slug": "memoize",
"question__hide": false,
- "total_acs": 88556,
- "total_submitted": 142130,
+ "total_acs": 92374,
+ "total_submitted": 147997,
"frontend_question_id": 2623,
"is_new_question": false
},
@@ -12458,8 +13056,8 @@
"question__title": "Maximum OR",
"question__title_slug": "maximum-or",
"question__hide": false,
- "total_acs": 13201,
- "total_submitted": 32490,
+ "total_acs": 13347,
+ "total_submitted": 32798,
"frontend_question_id": 2680,
"is_new_question": false
},
@@ -12481,8 +13079,8 @@
"question__title": "Minimum Operations to Make Numbers Non-positive",
"question__title_slug": "minimum-operations-to-make-numbers-non-positive",
"question__hide": false,
- "total_acs": 953,
- "total_submitted": 1829,
+ "total_acs": 983,
+ "total_submitted": 1871,
"frontend_question_id": 2702,
"is_new_question": false
},
@@ -12504,8 +13102,8 @@
"question__title": "Sum in a Matrix",
"question__title_slug": "sum-in-a-matrix",
"question__hide": false,
- "total_acs": 32357,
- "total_submitted": 54273,
+ "total_acs": 33009,
+ "total_submitted": 55301,
"frontend_question_id": 2679,
"is_new_question": false
},
@@ -12527,8 +13125,8 @@
"question__title": "Number of Senior Citizens",
"question__title_slug": "number-of-senior-citizens",
"question__hide": false,
- "total_acs": 57082,
- "total_submitted": 74608,
+ "total_acs": 58725,
+ "total_submitted": 76695,
"frontend_question_id": 2678,
"is_new_question": false
},
@@ -12550,8 +13148,8 @@
"question__title": "Minimum Reverse Operations",
"question__title_slug": "minimum-reverse-operations",
"question__hide": false,
- "total_acs": 4706,
- "total_submitted": 28793,
+ "total_acs": 4763,
+ "total_submitted": 29123,
"frontend_question_id": 2612,
"is_new_question": false
},
@@ -12573,8 +13171,8 @@
"question__title": "Mice and Cheese",
"question__title_slug": "mice-and-cheese",
"question__hide": false,
- "total_acs": 24719,
- "total_submitted": 54409,
+ "total_acs": 25408,
+ "total_submitted": 55534,
"frontend_question_id": 2611,
"is_new_question": false
},
@@ -12596,8 +13194,8 @@
"question__title": "Convert an Array Into a 2D Array With Conditions",
"question__title_slug": "convert-an-array-into-a-2d-array-with-conditions",
"question__hide": false,
- "total_acs": 193452,
- "total_submitted": 221910,
+ "total_acs": 195479,
+ "total_submitted": 224212,
"frontend_question_id": 2610,
"is_new_question": false
},
@@ -12619,8 +13217,8 @@
"question__title": "Find the Longest Balanced Substring of a Binary String",
"question__title_slug": "find-the-longest-balanced-substring-of-a-binary-string",
"question__hide": false,
- "total_acs": 30147,
- "total_submitted": 65364,
+ "total_acs": 30544,
+ "total_submitted": 65999,
"frontend_question_id": 2609,
"is_new_question": false
},
@@ -12642,8 +13240,8 @@
"question__title": "Prime In Diagonal",
"question__title_slug": "prime-in-diagonal",
"question__hide": false,
- "total_acs": 41741,
- "total_submitted": 123553,
+ "total_acs": 42685,
+ "total_submitted": 125836,
"frontend_question_id": 2614,
"is_new_question": false
},
@@ -12665,8 +13263,8 @@
"question__title": "Sum of Distances",
"question__title_slug": "sum-of-distances",
"question__hide": false,
- "total_acs": 19174,
- "total_submitted": 62360,
+ "total_acs": 19490,
+ "total_submitted": 63211,
"frontend_question_id": 2615,
"is_new_question": false
},
@@ -12688,8 +13286,8 @@
"question__title": "Minimize the Maximum Difference of Pairs",
"question__title_slug": "minimize-the-maximum-difference-of-pairs",
"question__hide": false,
- "total_acs": 70568,
- "total_submitted": 160466,
+ "total_acs": 71052,
+ "total_submitted": 161435,
"frontend_question_id": 2616,
"is_new_question": false
},
@@ -12711,8 +13309,8 @@
"question__title": "Beautiful Pairs",
"question__title_slug": "beautiful-pairs",
"question__hide": false,
- "total_acs": 509,
- "total_submitted": 1130,
+ "total_acs": 515,
+ "total_submitted": 1142,
"frontend_question_id": 2613,
"is_new_question": false
},
@@ -12734,8 +13332,8 @@
"question__title": "Minimum Operations to Make All Array Elements Equal",
"question__title_slug": "minimum-operations-to-make-all-array-elements-equal",
"question__hide": false,
- "total_acs": 17112,
- "total_submitted": 48637,
+ "total_acs": 17490,
+ "total_submitted": 49543,
"frontend_question_id": 2602,
"is_new_question": false
},
@@ -12757,8 +13355,8 @@
"question__title": "Collect Coins in a Tree",
"question__title_slug": "collect-coins-in-a-tree",
"question__hide": false,
- "total_acs": 6917,
- "total_submitted": 18617,
+ "total_acs": 7089,
+ "total_submitted": 19022,
"frontend_question_id": 2603,
"is_new_question": false
},
@@ -12780,8 +13378,8 @@
"question__title": "Prime Subtraction Operation",
"question__title_slug": "prime-subtraction-operation",
"question__hide": false,
- "total_acs": 16294,
- "total_submitted": 43263,
+ "total_acs": 16470,
+ "total_submitted": 43652,
"frontend_question_id": 2601,
"is_new_question": false
},
@@ -12803,8 +13401,8 @@
"question__title": "K Items With the Maximum Sum",
"question__title_slug": "k-items-with-the-maximum-sum",
"question__hide": false,
- "total_acs": 38445,
- "total_submitted": 62497,
+ "total_acs": 39050,
+ "total_submitted": 63381,
"frontend_question_id": 2600,
"is_new_question": false
},
@@ -12826,8 +13424,8 @@
"question__title": "Left and Right Sum Differences",
"question__title_slug": "left-and-right-sum-differences",
"question__hide": false,
- "total_acs": 129242,
- "total_submitted": 149681,
+ "total_acs": 133296,
+ "total_submitted": 154097,
"frontend_question_id": 2574,
"is_new_question": false
},
@@ -12849,8 +13447,8 @@
"question__title": "Find the Divisibility Array of a String",
"question__title_slug": "find-the-divisibility-array-of-a-string",
"question__hide": false,
- "total_acs": 27088,
- "total_submitted": 83478,
+ "total_acs": 27693,
+ "total_submitted": 84721,
"frontend_question_id": 2575,
"is_new_question": false
},
@@ -12872,8 +13470,8 @@
"question__title": "Find the Maximum Number of Marked Indices",
"question__title_slug": "find-the-maximum-number-of-marked-indices",
"question__hide": false,
- "total_acs": 19427,
- "total_submitted": 50765,
+ "total_acs": 19755,
+ "total_submitted": 51302,
"frontend_question_id": 2576,
"is_new_question": false
},
@@ -12895,8 +13493,8 @@
"question__title": "Minimum Time to Visit a Cell In a Grid",
"question__title_slug": "minimum-time-to-visit-a-cell-in-a-grid",
"question__hide": false,
- "total_acs": 11149,
- "total_submitted": 31374,
+ "total_acs": 11296,
+ "total_submitted": 31972,
"frontend_question_id": 2577,
"is_new_question": false
},
@@ -12918,8 +13516,8 @@
"question__title": "Minimum Operations to Reduce an Integer to 0",
"question__title_slug": "minimum-operations-to-reduce-an-integer-to-0",
"question__hide": false,
- "total_acs": 27719,
- "total_submitted": 50574,
+ "total_acs": 28042,
+ "total_submitted": 51059,
"frontend_question_id": 2571,
"is_new_question": false
},
@@ -12941,8 +13539,8 @@
"question__title": "Count the Number of Square-Free Subsets",
"question__title_slug": "count-the-number-of-square-free-subsets",
"question__hide": false,
- "total_acs": 9117,
- "total_submitted": 39653,
+ "total_acs": 9233,
+ "total_submitted": 40132,
"frontend_question_id": 2572,
"is_new_question": false
},
@@ -12964,8 +13562,8 @@
"question__title": "Find the String with LCP",
"question__title_slug": "find-the-string-with-lcp",
"question__hide": false,
- "total_acs": 4712,
- "total_submitted": 14814,
+ "total_acs": 4763,
+ "total_submitted": 15129,
"frontend_question_id": 2573,
"is_new_question": false
},
@@ -12987,8 +13585,8 @@
"question__title": "Merge Two 2D Arrays by Summing Values",
"question__title_slug": "merge-two-2d-arrays-by-summing-values",
"question__hide": false,
- "total_acs": 40950,
- "total_submitted": 55722,
+ "total_acs": 41699,
+ "total_submitted": 56659,
"frontend_question_id": 2570,
"is_new_question": false
},
@@ -13010,8 +13608,8 @@
"question__title": "Minimum Score by Changing Two Elements",
"question__title_slug": "minimum-score-by-changing-two-elements",
"question__hide": false,
- "total_acs": 16520,
- "total_submitted": 34584,
+ "total_acs": 16679,
+ "total_submitted": 34877,
"frontend_question_id": 2567,
"is_new_question": false
},
@@ -13033,8 +13631,8 @@
"question__title": "Minimum Impossible OR",
"question__title_slug": "minimum-impossible-or",
"question__hide": false,
- "total_acs": 15089,
- "total_submitted": 26266,
+ "total_acs": 15267,
+ "total_submitted": 26558,
"frontend_question_id": 2568,
"is_new_question": false
},
@@ -13056,8 +13654,8 @@
"question__title": "Maximum Difference by Remapping a Digit",
"question__title_slug": "maximum-difference-by-remapping-a-digit",
"question__hide": false,
- "total_acs": 24477,
- "total_submitted": 41008,
+ "total_acs": 24740,
+ "total_submitted": 41417,
"frontend_question_id": 2566,
"is_new_question": false
},
@@ -13079,8 +13677,8 @@
"question__title": "Handling Sum Queries After Update",
"question__title_slug": "handling-sum-queries-after-update",
"question__hide": false,
- "total_acs": 5249,
- "total_submitted": 19065,
+ "total_acs": 5491,
+ "total_submitted": 19621,
"frontend_question_id": 2569,
"is_new_question": false
},
@@ -13102,8 +13700,8 @@
"question__title": "Maximum Number of Integers to Choose From a Range II",
"question__title_slug": "maximum-number-of-integers-to-choose-from-a-range-ii",
"question__hide": false,
- "total_acs": 1465,
- "total_submitted": 3557,
+ "total_acs": 1502,
+ "total_submitted": 3664,
"frontend_question_id": 2557,
"is_new_question": false
},
@@ -13125,8 +13723,8 @@
"question__title": "Subsequence With the Minimum Score",
"question__title_slug": "subsequence-with-the-minimum-score",
"question__hide": false,
- "total_acs": 6868,
- "total_submitted": 21766,
+ "total_acs": 6937,
+ "total_submitted": 22170,
"frontend_question_id": 2565,
"is_new_question": false
},
@@ -13148,8 +13746,8 @@
"question__title": "Substring XOR Queries",
"question__title_slug": "substring-xor-queries",
"question__hide": false,
- "total_acs": 12286,
- "total_submitted": 36738,
+ "total_acs": 12388,
+ "total_submitted": 36998,
"frontend_question_id": 2564,
"is_new_question": false
},
@@ -13171,8 +13769,8 @@
"question__title": "Count the Number of Fair Pairs",
"question__title_slug": "count-the-number-of-fair-pairs",
"question__hide": false,
- "total_acs": 24531,
- "total_submitted": 74965,
+ "total_acs": 24866,
+ "total_submitted": 75830,
"frontend_question_id": 2563,
"is_new_question": false
},
@@ -13194,8 +13792,8 @@
"question__title": "Find the Array Concatenation Value",
"question__title_slug": "find-the-array-concatenation-value",
"question__hide": false,
- "total_acs": 47329,
- "total_submitted": 67880,
+ "total_acs": 47922,
+ "total_submitted": 68684,
"frontend_question_id": 2562,
"is_new_question": false
},
@@ -13217,8 +13815,8 @@
"question__title": "Minimum Number of Visited Cells in a Grid",
"question__title_slug": "minimum-number-of-visited-cells-in-a-grid",
"question__hide": false,
- "total_acs": 8185,
- "total_submitted": 33083,
+ "total_acs": 8286,
+ "total_submitted": 33674,
"frontend_question_id": 2617,
"is_new_question": false
},
@@ -13240,8 +13838,8 @@
"question__title": "The Number of Beautiful Subsets",
"question__title_slug": "the-number-of-beautiful-subsets",
"question__hide": false,
- "total_acs": 111905,
- "total_submitted": 218350,
+ "total_acs": 113128,
+ "total_submitted": 220714,
"frontend_question_id": 2597,
"is_new_question": false
},
@@ -13263,8 +13861,8 @@
"question__title": "Find Score of an Array After Marking All Elements",
"question__title_slug": "find-score-of-an-array-after-marking-all-elements",
"question__hide": false,
- "total_acs": 17788,
- "total_submitted": 34023,
+ "total_acs": 18096,
+ "total_submitted": 34565,
"frontend_question_id": 2593,
"is_new_question": false
},
@@ -13286,8 +13884,8 @@
"question__title": "Find the Maximum Divisibility Score",
"question__title_slug": "find-the-maximum-divisibility-score",
"question__hide": false,
- "total_acs": 30231,
- "total_submitted": 61624,
+ "total_acs": 30636,
+ "total_submitted": 62373,
"frontend_question_id": 2644,
"is_new_question": false
},
@@ -13309,8 +13907,8 @@
"question__title": "Maximum Price to Fill a Bag",
"question__title_slug": "maximum-price-to-fill-a-bag",
"question__hide": false,
- "total_acs": 1261,
- "total_submitted": 1925,
+ "total_acs": 1276,
+ "total_submitted": 1949,
"frontend_question_id": 2548,
"is_new_question": false
},
@@ -13332,8 +13930,8 @@
"question__title": "Take Gifts From the Richest Pile",
"question__title_slug": "take-gifts-from-the-richest-pile",
"question__hide": false,
- "total_acs": 45563,
- "total_submitted": 68377,
+ "total_acs": 46281,
+ "total_submitted": 69395,
"frontend_question_id": 2558,
"is_new_question": false
},
@@ -13355,8 +13953,8 @@
"question__title": "Count Vowel Strings in Ranges",
"question__title_slug": "count-vowel-strings-in-ranges",
"question__hide": false,
- "total_acs": 27117,
- "total_submitted": 52300,
+ "total_acs": 27484,
+ "total_submitted": 52856,
"frontend_question_id": 2559,
"is_new_question": false
},
@@ -13378,8 +13976,8 @@
"question__title": "House Robber IV",
"question__title_slug": "house-robber-iv",
"question__hide": false,
- "total_acs": 17883,
- "total_submitted": 41564,
+ "total_acs": 18409,
+ "total_submitted": 42391,
"frontend_question_id": 2560,
"is_new_question": false
},
@@ -13401,8 +13999,8 @@
"question__title": "Rearranging Fruits",
"question__title_slug": "rearranging-fruits",
"question__hide": false,
- "total_acs": 9432,
- "total_submitted": 27758,
+ "total_acs": 9529,
+ "total_submitted": 28149,
"frontend_question_id": 2561,
"is_new_question": false
},
@@ -13424,8 +14022,8 @@
"question__title": "Design a Todo List",
"question__title_slug": "design-a-todo-list",
"question__hide": false,
- "total_acs": 1853,
- "total_submitted": 3176,
+ "total_acs": 1903,
+ "total_submitted": 3262,
"frontend_question_id": 2590,
"is_new_question": false
},
@@ -13447,8 +14045,8 @@
"question__title": "Lexicographically Smallest Beautiful String",
"question__title_slug": "lexicographically-smallest-beautiful-string",
"question__hide": false,
- "total_acs": 4828,
- "total_submitted": 13194,
+ "total_acs": 4978,
+ "total_submitted": 13539,
"frontend_question_id": 2663,
"is_new_question": false
},
@@ -13470,8 +14068,8 @@
"question__title": "Minimum Cost of a Path With Special Roads",
"question__title_slug": "minimum-cost-of-a-path-with-special-roads",
"question__hide": false,
- "total_acs": 12338,
- "total_submitted": 32184,
+ "total_acs": 12568,
+ "total_submitted": 32603,
"frontend_question_id": 2662,
"is_new_question": false
},
@@ -13493,8 +14091,8 @@
"question__title": "First Completely Painted Row or Column",
"question__title_slug": "first-completely-painted-row-or-column",
"question__hide": false,
- "total_acs": 22717,
- "total_submitted": 45173,
+ "total_acs": 22954,
+ "total_submitted": 45582,
"frontend_question_id": 2661,
"is_new_question": false
},
@@ -13516,8 +14114,8 @@
"question__title": "Determine the Winner of a Bowling Game",
"question__title_slug": "determine-the-winner-of-a-bowling-game",
"question__hide": false,
- "total_acs": 33244,
- "total_submitted": 98221,
+ "total_acs": 33556,
+ "total_submitted": 99760,
"frontend_question_id": 2660,
"is_new_question": false
},
@@ -13539,8 +14137,8 @@
"question__title": "Count the Number of Good Subsequences",
"question__title_slug": "count-the-number-of-good-subsequences",
"question__hide": false,
- "total_acs": 2200,
- "total_submitted": 4167,
+ "total_acs": 2217,
+ "total_submitted": 4200,
"frontend_question_id": 2539,
"is_new_question": false
},
@@ -13562,8 +14160,8 @@
"question__title": "Count Increasing Quadruplets",
"question__title_slug": "count-increasing-quadruplets",
"question__hide": false,
- "total_acs": 9024,
- "total_submitted": 26928,
+ "total_acs": 9086,
+ "total_submitted": 27242,
"frontend_question_id": 2552,
"is_new_question": false
},
@@ -13585,8 +14183,8 @@
"question__title": "Put Marbles in Bags",
"question__title_slug": "put-marbles-in-bags",
"question__hide": false,
- "total_acs": 57406,
- "total_submitted": 86142,
+ "total_acs": 57850,
+ "total_submitted": 86854,
"frontend_question_id": 2551,
"is_new_question": false
},
@@ -13608,8 +14206,8 @@
"question__title": "Count Collisions of Monkeys on a Polygon",
"question__title_slug": "count-collisions-of-monkeys-on-a-polygon",
"question__hide": false,
- "total_acs": 19463,
- "total_submitted": 70923,
+ "total_acs": 19749,
+ "total_submitted": 71739,
"frontend_question_id": 2550,
"is_new_question": false
},
@@ -13631,8 +14229,8 @@
"question__title": "Count Distinct Numbers on Board",
"question__title_slug": "count-distinct-numbers-on-board",
"question__hide": false,
- "total_acs": 40331,
- "total_submitted": 67057,
+ "total_acs": 40849,
+ "total_submitted": 67839,
"frontend_question_id": 2549,
"is_new_question": false
},
@@ -13654,8 +14252,8 @@
"question__title": "Design Graph With Shortest Path Calculator",
"question__title_slug": "design-graph-with-shortest-path-calculator",
"question__hide": false,
- "total_acs": 66023,
- "total_submitted": 93365,
+ "total_acs": 66446,
+ "total_submitted": 94042,
"frontend_question_id": 2642,
"is_new_question": false
},
@@ -13677,8 +14275,8 @@
"question__title": "Cousins in Binary Tree II",
"question__title_slug": "cousins-in-binary-tree-ii",
"question__hide": false,
- "total_acs": 19814,
- "total_submitted": 29228,
+ "total_acs": 20142,
+ "total_submitted": 29721,
"frontend_question_id": 2641,
"is_new_question": false
},
@@ -13700,8 +14298,8 @@
"question__title": "Find the Score of All Prefixes of an Array",
"question__title_slug": "find-the-score-of-all-prefixes-of-an-array",
"question__hide": false,
- "total_acs": 28184,
- "total_submitted": 40177,
+ "total_acs": 28739,
+ "total_submitted": 40924,
"frontend_question_id": 2640,
"is_new_question": false
},
@@ -13723,8 +14321,8 @@
"question__title": "Find the Width of Columns of a Grid",
"question__title_slug": "find-the-width-of-columns-of-a-grid",
"question__hide": false,
- "total_acs": 26645,
- "total_submitted": 39608,
+ "total_acs": 26983,
+ "total_submitted": 40011,
"frontend_question_id": 2639,
"is_new_question": false
},
@@ -13746,8 +14344,8 @@
"question__title": "Make the Prefix Sum Non-negative",
"question__title_slug": "make-the-prefix-sum-non-negative",
"question__hide": false,
- "total_acs": 1719,
- "total_submitted": 3366,
+ "total_acs": 1770,
+ "total_submitted": 3444,
"frontend_question_id": 2599,
"is_new_question": false
},
@@ -13769,8 +14367,8 @@
"question__title": "Maximize Win From Two Segments",
"question__title_slug": "maximize-win-from-two-segments",
"question__hide": false,
- "total_acs": 9984,
- "total_submitted": 30317,
+ "total_acs": 10089,
+ "total_submitted": 30567,
"frontend_question_id": 2555,
"is_new_question": false
},
@@ -13792,8 +14390,8 @@
"question__title": "Number of Good Binary Strings",
"question__title_slug": "number-of-good-binary-strings",
"question__hide": false,
- "total_acs": 5130,
- "total_submitted": 9910,
+ "total_acs": 5201,
+ "total_submitted": 10063,
"frontend_question_id": 2533,
"is_new_question": false
},
@@ -13815,8 +14413,8 @@
"question__title": "Shortest Cycle in a Graph",
"question__title_slug": "shortest-cycle-in-a-graph",
"question__hide": false,
- "total_acs": 16446,
- "total_submitted": 45141,
+ "total_acs": 16756,
+ "total_submitted": 46138,
"frontend_question_id": 2608,
"is_new_question": false
},
@@ -13838,8 +14436,8 @@
"question__title": "Make K-Subarray Sums Equal",
"question__title_slug": "make-k-subarray-sums-equal",
"question__hide": false,
- "total_acs": 10058,
- "total_submitted": 27571,
+ "total_acs": 10170,
+ "total_submitted": 27766,
"frontend_question_id": 2607,
"is_new_question": false
},
@@ -13861,8 +14459,8 @@
"question__title": "Find the Substring With Maximum Cost",
"question__title_slug": "find-the-substring-with-maximum-cost",
"question__hide": false,
- "total_acs": 23776,
- "total_submitted": 42133,
+ "total_acs": 24089,
+ "total_submitted": 42549,
"frontend_question_id": 2606,
"is_new_question": false
},
@@ -13884,8 +14482,8 @@
"question__title": "Form Smallest Number From Two Digit Arrays",
"question__title_slug": "form-smallest-number-from-two-digit-arrays",
"question__hide": false,
- "total_acs": 35754,
- "total_submitted": 66665,
+ "total_acs": 36361,
+ "total_submitted": 67621,
"frontend_question_id": 2605,
"is_new_question": false
},
@@ -13907,8 +14505,8 @@
"question__title": "Maximum Frequency Score of a Subarray",
"question__title_slug": "maximum-frequency-score-of-a-subarray",
"question__hide": false,
- "total_acs": 886,
- "total_submitted": 2204,
+ "total_acs": 900,
+ "total_submitted": 2240,
"frontend_question_id": 2524,
"is_new_question": false
},
@@ -13930,8 +14528,8 @@
"question__title": "Minimum Time to Eat All Grains",
"question__title_slug": "minimum-time-to-eat-all-grains",
"question__hide": false,
- "total_acs": 995,
- "total_submitted": 2410,
+ "total_acs": 1023,
+ "total_submitted": 2473,
"frontend_question_id": 2604,
"is_new_question": false
},
@@ -13953,8 +14551,8 @@
"question__title": "Minimum Time to Repair Cars",
"question__title_slug": "minimum-time-to-repair-cars",
"question__hide": false,
- "total_acs": 15775,
- "total_submitted": 35978,
+ "total_acs": 16848,
+ "total_submitted": 38001,
"frontend_question_id": 2594,
"is_new_question": false
},
@@ -13976,8 +14574,8 @@
"question__title": "Maximize Greatness of an Array",
"question__title_slug": "maximize-greatness-of-an-array",
"question__hide": false,
- "total_acs": 22532,
- "total_submitted": 39233,
+ "total_acs": 23181,
+ "total_submitted": 40203,
"frontend_question_id": 2592,
"is_new_question": false
},
@@ -13999,8 +14597,8 @@
"question__title": "Distribute Money to Maximum Children",
"question__title_slug": "distribute-money-to-maximum-children",
"question__hide": false,
- "total_acs": 28896,
- "total_submitted": 151096,
+ "total_acs": 29512,
+ "total_submitted": 154171,
"frontend_question_id": 2591,
"is_new_question": false
},
@@ -14022,8 +14620,8 @@
"question__title": "Check Knight Tour Configuration",
"question__title_slug": "check-knight-tour-configuration",
"question__hide": false,
- "total_acs": 27113,
- "total_submitted": 47737,
+ "total_acs": 27567,
+ "total_submitted": 48483,
"frontend_question_id": 2596,
"is_new_question": false
},
@@ -14045,8 +14643,8 @@
"question__title": "Smallest Missing Non-negative Integer After Operations",
"question__title_slug": "smallest-missing-non-negative-integer-after-operations",
"question__hide": false,
- "total_acs": 14693,
- "total_submitted": 37352,
+ "total_acs": 14905,
+ "total_submitted": 37809,
"frontend_question_id": 2598,
"is_new_question": false
},
@@ -14068,8 +14666,8 @@
"question__title": "Number of Even and Odd Bits",
"question__title_slug": "number-of-even-and-odd-bits",
"question__hide": false,
- "total_acs": 44033,
- "total_submitted": 60274,
+ "total_acs": 45134,
+ "total_submitted": 61652,
"frontend_question_id": 2595,
"is_new_question": false
},
@@ -14091,8 +14689,8 @@
"question__title": "Count the Number of K-Big Indices",
"question__title_slug": "count-the-number-of-k-big-indices",
"question__hide": false,
- "total_acs": 6844,
- "total_submitted": 12815,
+ "total_acs": 7030,
+ "total_submitted": 13151,
"frontend_question_id": 2519,
"is_new_question": false
},
@@ -14114,8 +14712,8 @@
"question__title": "Minimum Time to Complete All Tasks",
"question__title_slug": "minimum-time-to-complete-all-tasks",
"question__hide": false,
- "total_acs": 9160,
- "total_submitted": 23567,
+ "total_acs": 9343,
+ "total_submitted": 23950,
"frontend_question_id": 2589,
"is_new_question": false
},
@@ -14137,8 +14735,8 @@
"question__title": "Count the Number of Beautiful Subarrays",
"question__title_slug": "count-the-number-of-beautiful-subarrays",
"question__hide": false,
- "total_acs": 17105,
- "total_submitted": 34068,
+ "total_acs": 17424,
+ "total_submitted": 34611,
"frontend_question_id": 2588,
"is_new_question": false
},
@@ -14160,8 +14758,8 @@
"question__title": "Rearrange Array to Maximize Prefix Score",
"question__title_slug": "rearrange-array-to-maximize-prefix-score",
"question__hide": false,
- "total_acs": 28237,
- "total_submitted": 69061,
+ "total_acs": 28544,
+ "total_submitted": 69682,
"frontend_question_id": 2587,
"is_new_question": false
},
@@ -14183,8 +14781,8 @@
"question__title": "Count the Number of Vowel Strings in Range",
"question__title_slug": "count-the-number-of-vowel-strings-in-range",
"question__hide": false,
- "total_acs": 57905,
- "total_submitted": 78297,
+ "total_acs": 59063,
+ "total_submitted": 79766,
"frontend_question_id": 2586,
"is_new_question": false
},
@@ -14206,8 +14804,8 @@
"question__title": "Check if There is a Path With Equal Number of 0's And 1's",
"question__title_slug": "check-if-there-is-a-path-with-equal-number-of-0s-and-1s",
"question__hide": false,
- "total_acs": 4098,
- "total_submitted": 8174,
+ "total_acs": 4246,
+ "total_submitted": 8456,
"frontend_question_id": 2510,
"is_new_question": false
},
@@ -14229,8 +14827,8 @@
"question__title": "Count Number of Possible Root Nodes",
"question__title_slug": "count-number-of-possible-root-nodes",
"question__hide": false,
- "total_acs": 5762,
- "total_submitted": 12527,
+ "total_acs": 5890,
+ "total_submitted": 12817,
"frontend_question_id": 2581,
"is_new_question": false
},
@@ -14252,8 +14850,8 @@
"question__title": "Count Ways to Group Overlapping Ranges",
"question__title_slug": "count-ways-to-group-overlapping-ranges",
"question__hide": false,
- "total_acs": 15582,
- "total_submitted": 43424,
+ "total_acs": 15749,
+ "total_submitted": 43731,
"frontend_question_id": 2580,
"is_new_question": false
},
@@ -14275,8 +14873,8 @@
"question__title": "Split With Minimum Sum",
"question__title_slug": "split-with-minimum-sum",
"question__hide": false,
- "total_acs": 34096,
- "total_submitted": 48496,
+ "total_acs": 34746,
+ "total_submitted": 49296,
"frontend_question_id": 2578,
"is_new_question": false
},
@@ -14298,8 +14896,8 @@
"question__title": "Count Total Number of Colored Cells",
"question__title_slug": "count-total-number-of-colored-cells",
"question__hide": false,
- "total_acs": 25349,
- "total_submitted": 44065,
+ "total_acs": 25636,
+ "total_submitted": 44529,
"frontend_question_id": 2579,
"is_new_question": false
},
@@ -14321,8 +14919,8 @@
"question__title": "Number of Ways to Earn Points",
"question__title_slug": "number-of-ways-to-earn-points",
"question__hide": false,
- "total_acs": 15851,
- "total_submitted": 27701,
+ "total_acs": 16222,
+ "total_submitted": 28253,
"frontend_question_id": 2585,
"is_new_question": false
},
@@ -14344,8 +14942,8 @@
"question__title": "Split the Array to Make Coprime Products",
"question__title_slug": "split-the-array-to-make-coprime-products",
"question__hide": false,
- "total_acs": 11297,
- "total_submitted": 49603,
+ "total_acs": 11450,
+ "total_submitted": 50170,
"frontend_question_id": 2584,
"is_new_question": false
},
@@ -14367,8 +14965,8 @@
"question__title": "Kth Largest Sum in a Binary Tree",
"question__title_slug": "kth-largest-sum-in-a-binary-tree",
"question__hide": false,
- "total_acs": 36807,
- "total_submitted": 77772,
+ "total_acs": 37505,
+ "total_submitted": 79061,
"frontend_question_id": 2583,
"is_new_question": false
},
@@ -14390,8 +14988,8 @@
"question__title": "Pass the Pillow",
"question__title_slug": "pass-the-pillow",
"question__hide": false,
- "total_acs": 35223,
- "total_submitted": 76878,
+ "total_acs": 35733,
+ "total_submitted": 77804,
"frontend_question_id": 2582,
"is_new_question": false
},
@@ -14407,14 +15005,14 @@
{
"stat": {
"question_id": 2644,
- "question__article__live": true,
- "question__article__slug": "bitwise-or-of-all-subsequence-sums",
- "question__article__has_video_solution": false,
+ "question__article__live": null,
+ "question__article__slug": null,
+ "question__article__has_video_solution": null,
"question__title": "Bitwise OR of All Subsequence Sums",
"question__title_slug": "bitwise-or-of-all-subsequence-sums",
"question__hide": false,
- "total_acs": 3681,
- "total_submitted": 5370,
+ "total_acs": 3701,
+ "total_submitted": 5401,
"frontend_question_id": 2505,
"is_new_question": false
},
@@ -14436,8 +15034,8 @@
"question__title": "Concatenate the Name and the Profession",
"question__title_slug": "concatenate-the-name-and-the-profession",
"question__hide": false,
- "total_acs": 3975,
- "total_submitted": 5335,
+ "total_acs": 4105,
+ "total_submitted": 5473,
"frontend_question_id": 2504,
"is_new_question": false
},
@@ -14459,8 +15057,8 @@
"question__title": "Time to Cross a Bridge",
"question__title_slug": "time-to-cross-a-bridge",
"question__hide": false,
- "total_acs": 3954,
- "total_submitted": 8933,
+ "total_acs": 3990,
+ "total_submitted": 9149,
"frontend_question_id": 2532,
"is_new_question": false
},
@@ -14482,8 +15080,8 @@
"question__title": "Disconnect Path in a Binary Matrix by at Most One Flip",
"question__title_slug": "disconnect-path-in-a-binary-matrix-by-at-most-one-flip",
"question__hide": false,
- "total_acs": 13062,
- "total_submitted": 47839,
+ "total_acs": 13185,
+ "total_submitted": 48391,
"frontend_question_id": 2556,
"is_new_question": false
},
@@ -14505,8 +15103,8 @@
"question__title": "Maximum Number of Integers to Choose From a Range I",
"question__title_slug": "maximum-number-of-integers-to-choose-from-a-range-i",
"question__hide": false,
- "total_acs": 30146,
- "total_submitted": 56223,
+ "total_acs": 30571,
+ "total_submitted": 56871,
"frontend_question_id": 2554,
"is_new_question": false
},
@@ -14528,8 +15126,8 @@
"question__title": "Separate the Digits in an Array",
"question__title_slug": "separate-the-digits-in-an-array",
"question__hide": false,
- "total_acs": 68767,
- "total_submitted": 86854,
+ "total_acs": 70330,
+ "total_submitted": 88718,
"frontend_question_id": 2553,
"is_new_question": false
},
@@ -14551,8 +15149,8 @@
"question__title": "Number of Subarrays Having Even Product",
"question__title_slug": "number-of-subarrays-having-even-product",
"question__hide": false,
- "total_acs": 1721,
- "total_submitted": 2682,
+ "total_acs": 1752,
+ "total_submitted": 2728,
"frontend_question_id": 2495,
"is_new_question": false
},
@@ -14574,8 +15172,8 @@
"question__title": "Merge Overlapping Events in the Same Hall",
"question__title_slug": "merge-overlapping-events-in-the-same-hall",
"question__hide": false,
- "total_acs": 1713,
- "total_submitted": 5509,
+ "total_acs": 1749,
+ "total_submitted": 5595,
"frontend_question_id": 2494,
"is_new_question": false
},
@@ -14597,8 +15195,8 @@
"question__title": "Maximum Subsequence Score",
"question__title_slug": "maximum-subsequence-score",
"question__hide": false,
- "total_acs": 85526,
- "total_submitted": 159488,
+ "total_acs": 88384,
+ "total_submitted": 164701,
"frontend_question_id": 2542,
"is_new_question": false
},
@@ -14620,8 +15218,8 @@
"question__title": "Check if Point Is Reachable",
"question__title_slug": "check-if-point-is-reachable",
"question__hide": false,
- "total_acs": 7519,
- "total_submitted": 17915,
+ "total_acs": 7662,
+ "total_submitted": 18217,
"frontend_question_id": 2543,
"is_new_question": false
},
@@ -14643,8 +15241,8 @@
"question__title": "Minimum Common Value",
"question__title_slug": "minimum-common-value",
"question__hide": false,
- "total_acs": 226427,
- "total_submitted": 382512,
+ "total_acs": 229668,
+ "total_submitted": 388597,
"frontend_question_id": 2540,
"is_new_question": false
},
@@ -14666,8 +15264,8 @@
"question__title": "Minimum Cost to Split an Array",
"question__title_slug": "minimum-cost-to-split-an-array",
"question__hide": false,
- "total_acs": 11653,
- "total_submitted": 29110,
+ "total_acs": 11857,
+ "total_submitted": 29465,
"frontend_question_id": 2547,
"is_new_question": false
},
@@ -14689,8 +15287,8 @@
"question__title": "Apply Bitwise Operations to Make Strings Equal",
"question__title_slug": "apply-bitwise-operations-to-make-strings-equal",
"question__hide": false,
- "total_acs": 18592,
- "total_submitted": 45346,
+ "total_acs": 18716,
+ "total_submitted": 45590,
"frontend_question_id": 2546,
"is_new_question": false
},
@@ -14712,8 +15310,8 @@
"question__title": "Sort the Students by Their Kth Score",
"question__title_slug": "sort-the-students-by-their-kth-score",
"question__hide": false,
- "total_acs": 59682,
- "total_submitted": 69992,
+ "total_acs": 60930,
+ "total_submitted": 71440,
"frontend_question_id": 2545,
"is_new_question": false
},
@@ -14735,8 +15333,8 @@
"question__title": "Alternating Digit Sum",
"question__title_slug": "alternating-digit-sum",
"question__hide": false,
- "total_acs": 58798,
- "total_submitted": 86183,
+ "total_acs": 59749,
+ "total_submitted": 87548,
"frontend_question_id": 2544,
"is_new_question": false
},
@@ -14758,8 +15356,8 @@
"question__title": "Number of Substrings With Fixed Ratio",
"question__title_slug": "number-of-substrings-with-fixed-ratio",
"question__hide": false,
- "total_acs": 917,
- "total_submitted": 1580,
+ "total_acs": 934,
+ "total_submitted": 1613,
"frontend_question_id": 2489,
"is_new_question": false
},
@@ -14781,8 +15379,8 @@
"question__title": "Minimize the Maximum of Two Arrays",
"question__title_slug": "minimize-the-maximum-of-two-arrays",
"question__hide": false,
- "total_acs": 12419,
- "total_submitted": 41076,
+ "total_acs": 12764,
+ "total_submitted": 41991,
"frontend_question_id": 2513,
"is_new_question": false
},
@@ -14804,8 +15402,8 @@
"question__title": "Difference Between Maximum and Minimum Price Sum",
"question__title_slug": "difference-between-maximum-and-minimum-price-sum",
"question__hide": false,
- "total_acs": 7383,
- "total_submitted": 22871,
+ "total_acs": 7493,
+ "total_submitted": 23392,
"frontend_question_id": 2538,
"is_new_question": false
},
@@ -14827,8 +15425,8 @@
"question__title": "Count the Number of Good Subarrays",
"question__title_slug": "count-the-number-of-good-subarrays",
"question__hide": false,
- "total_acs": 19281,
- "total_submitted": 38278,
+ "total_acs": 19630,
+ "total_submitted": 38852,
"frontend_question_id": 2537,
"is_new_question": false
},
@@ -14850,8 +15448,8 @@
"question__title": "Increment Submatrices by One",
"question__title_slug": "increment-submatrices-by-one",
"question__hide": false,
- "total_acs": 20482,
- "total_submitted": 41598,
+ "total_acs": 20614,
+ "total_submitted": 41765,
"frontend_question_id": 2536,
"is_new_question": false
},
@@ -14873,8 +15471,8 @@
"question__title": "Difference Between Element Sum and Digit Sum of an Array",
"question__title_slug": "difference-between-element-sum-and-digit-sum-of-an-array",
"question__hide": false,
- "total_acs": 120916,
- "total_submitted": 143461,
+ "total_acs": 123702,
+ "total_submitted": 146709,
"frontend_question_id": 2535,
"is_new_question": false
},
@@ -14896,8 +15494,8 @@
"question__title": "Maximum XOR of Two Non-Overlapping Subtrees",
"question__title_slug": "maximum-xor-of-two-non-overlapping-subtrees",
"question__hide": false,
- "total_acs": 639,
- "total_submitted": 1302,
+ "total_acs": 656,
+ "total_submitted": 1324,
"frontend_question_id": 2479,
"is_new_question": false
},
@@ -14919,8 +15517,8 @@
"question__title": "Form a Chemical Bond",
"question__title_slug": "form-a-chemical-bond",
"question__hide": false,
- "total_acs": 4195,
- "total_submitted": 5592,
+ "total_acs": 4301,
+ "total_submitted": 5703,
"frontend_question_id": 2480,
"is_new_question": false
},
@@ -14942,8 +15540,8 @@
"question__title": "Find Xor-Beauty of Array",
"question__title_slug": "find-xor-beauty-of-array",
"question__hide": false,
- "total_acs": 18908,
- "total_submitted": 27759,
+ "total_acs": 19395,
+ "total_submitted": 28340,
"frontend_question_id": 2527,
"is_new_question": false
},
@@ -14965,8 +15563,8 @@
"question__title": "Find Consecutive Integers from a Data Stream",
"question__title_slug": "find-consecutive-integers-from-a-data-stream",
"question__hide": false,
- "total_acs": 25355,
- "total_submitted": 51574,
+ "total_acs": 25644,
+ "total_submitted": 52109,
"frontend_question_id": 2526,
"is_new_question": false
},
@@ -14988,8 +15586,8 @@
"question__title": "Categorize Box According to Criteria",
"question__title_slug": "categorize-box-according-to-criteria",
"question__hide": false,
- "total_acs": 32232,
- "total_submitted": 90825,
+ "total_acs": 32702,
+ "total_submitted": 91827,
"frontend_question_id": 2525,
"is_new_question": false
},
@@ -15011,8 +15609,8 @@
"question__title": "Maximize the Minimum Powered City",
"question__title_slug": "maximize-the-minimum-powered-city",
"question__hide": false,
- "total_acs": 6736,
- "total_submitted": 20798,
+ "total_acs": 6845,
+ "total_submitted": 21202,
"frontend_question_id": 2528,
"is_new_question": false
},
@@ -15034,8 +15632,8 @@
"question__title": "Time Taken to Cross the Door",
"question__title_slug": "time-taken-to-cross-the-door",
"question__hide": false,
- "total_acs": 6243,
- "total_submitted": 12588,
+ "total_acs": 6618,
+ "total_submitted": 13297,
"frontend_question_id": 2534,
"is_new_question": false
},
@@ -15057,8 +15655,8 @@
"question__title": "Maximal Score After Applying K Operations",
"question__title_slug": "maximal-score-after-applying-k-operations",
"question__hide": false,
- "total_acs": 27570,
- "total_submitted": 60405,
+ "total_acs": 27861,
+ "total_submitted": 60830,
"frontend_question_id": 2530,
"is_new_question": false
},
@@ -15080,8 +15678,8 @@
"question__title": "Make Number of Distinct Characters Equal",
"question__title_slug": "make-number-of-distinct-characters-equal",
"question__hide": false,
- "total_acs": 18400,
- "total_submitted": 70128,
+ "total_acs": 18559,
+ "total_submitted": 70615,
"frontend_question_id": 2531,
"is_new_question": false
},
@@ -15103,8 +15701,8 @@
"question__title": "Maximum Count of Positive Integer and Negative Integer",
"question__title_slug": "maximum-count-of-positive-integer-and-negative-integer",
"question__hide": false,
- "total_acs": 102158,
- "total_submitted": 143880,
+ "total_acs": 104435,
+ "total_submitted": 147132,
"frontend_question_id": 2529,
"is_new_question": false
},
@@ -15126,8 +15724,8 @@
"question__title": "Customers With Strictly Increasing Purchases",
"question__title_slug": "customers-with-strictly-increasing-purchases",
"question__hide": false,
- "total_acs": 2965,
- "total_submitted": 6669,
+ "total_acs": 3042,
+ "total_submitted": 6809,
"frontend_question_id": 2474,
"is_new_question": false
},
@@ -15149,8 +15747,8 @@
"question__title": "Minimum Cost to Buy Apples",
"question__title_slug": "minimum-cost-to-buy-apples",
"question__hide": false,
- "total_acs": 5848,
- "total_submitted": 8627,
+ "total_acs": 5886,
+ "total_submitted": 8700,
"frontend_question_id": 2473,
"is_new_question": false
},
@@ -15172,8 +15770,8 @@
"question__title": "Closest Prime Numbers in Range",
"question__title_slug": "closest-prime-numbers-in-range",
"question__hide": false,
- "total_acs": 22334,
- "total_submitted": 60120,
+ "total_acs": 22711,
+ "total_submitted": 60853,
"frontend_question_id": 2523,
"is_new_question": false
},
@@ -15195,8 +15793,8 @@
"question__title": "Distinct Prime Factors of Product of Array",
"question__title_slug": "distinct-prime-factors-of-product-of-array",
"question__hide": false,
- "total_acs": 29672,
- "total_submitted": 58212,
+ "total_acs": 30275,
+ "total_submitted": 59220,
"frontend_question_id": 2521,
"is_new_question": false
},
@@ -15218,8 +15816,8 @@
"question__title": "Count the Digits That Divide a Number",
"question__title_slug": "count-the-digits-that-divide-a-number",
"question__hide": false,
- "total_acs": 80617,
- "total_submitted": 95492,
+ "total_acs": 82524,
+ "total_submitted": 97646,
"frontend_question_id": 2520,
"is_new_question": false
},
@@ -15241,8 +15839,8 @@
"question__title": "Minimum Subarrays in a Valid Split",
"question__title_slug": "minimum-subarrays-in-a-valid-split",
"question__hide": false,
- "total_acs": 1116,
- "total_submitted": 2055,
+ "total_acs": 1132,
+ "total_submitted": 2080,
"frontend_question_id": 2464,
"is_new_question": false
},
@@ -15264,8 +15862,8 @@
"question__title": "Difference Between Ones and Zeros in Row and Column",
"question__title_slug": "difference-between-ones-and-zeros-in-row-and-column",
"question__hide": false,
- "total_acs": 124799,
- "total_submitted": 147707,
+ "total_acs": 125492,
+ "total_submitted": 148531,
"frontend_question_id": 2482,
"is_new_question": false
},
@@ -15287,8 +15885,8 @@
"question__title": "Count Anagrams",
"question__title_slug": "count-anagrams",
"question__hide": false,
- "total_acs": 10793,
- "total_submitted": 33098,
+ "total_acs": 11231,
+ "total_submitted": 34064,
"frontend_question_id": 2514,
"is_new_question": false
},
@@ -15310,8 +15908,8 @@
"question__title": "Minimum Operations to Make Array Equal II",
"question__title_slug": "minimum-operations-to-make-array-equal-ii",
"question__hide": false,
- "total_acs": 21656,
- "total_submitted": 68950,
+ "total_acs": 21859,
+ "total_submitted": 69504,
"frontend_question_id": 2541,
"is_new_question": false
},
@@ -15333,8 +15931,8 @@
"question__title": "Reward Top K Students",
"question__title_slug": "reward-top-k-students",
"question__hide": false,
- "total_acs": 19929,
- "total_submitted": 44194,
+ "total_acs": 20261,
+ "total_submitted": 44887,
"frontend_question_id": 2512,
"is_new_question": false
},
@@ -15356,8 +15954,8 @@
"question__title": "Maximum Enemy Forts That Can Be Captured",
"question__title_slug": "maximum-enemy-forts-that-can-be-captured",
"question__hide": false,
- "total_acs": 22919,
- "total_submitted": 59941,
+ "total_acs": 23232,
+ "total_submitted": 60681,
"frontend_question_id": 2511,
"is_new_question": false
},
@@ -15379,8 +15977,8 @@
"question__title": "Number of Great Partitions",
"question__title_slug": "number-of-great-partitions",
"question__hide": false,
- "total_acs": 8195,
- "total_submitted": 26243,
+ "total_acs": 8305,
+ "total_submitted": 26609,
"frontend_question_id": 2518,
"is_new_question": false
},
@@ -15402,8 +16000,8 @@
"question__title": "Maximum Tastiness of Candy Basket",
"question__title_slug": "maximum-tastiness-of-candy-basket",
"question__hide": false,
- "total_acs": 20145,
- "total_submitted": 31844,
+ "total_acs": 20774,
+ "total_submitted": 32686,
"frontend_question_id": 2517,
"is_new_question": false
},
@@ -15425,8 +16023,8 @@
"question__title": "Take K of Each Character From Left and Right",
"question__title_slug": "take-k-of-each-character-from-left-and-right",
"question__hide": false,
- "total_acs": 15939,
- "total_submitted": 46325,
+ "total_acs": 16118,
+ "total_submitted": 46830,
"frontend_question_id": 2516,
"is_new_question": false
},
@@ -15448,8 +16046,8 @@
"question__title": "Shortest Distance to Target String in a Circular Array",
"question__title_slug": "shortest-distance-to-target-string-in-a-circular-array",
"question__hide": false,
- "total_acs": 28689,
- "total_submitted": 58680,
+ "total_acs": 29027,
+ "total_submitted": 59256,
"frontend_question_id": 2515,
"is_new_question": false
},
@@ -15471,8 +16069,8 @@
"question__title": "Cycle Length Queries in a Tree",
"question__title_slug": "cycle-length-queries-in-a-tree",
"question__hide": false,
- "total_acs": 12527,
- "total_submitted": 22389,
+ "total_acs": 12799,
+ "total_submitted": 22814,
"frontend_question_id": 2509,
"is_new_question": false
},
@@ -15494,8 +16092,8 @@
"question__title": "Add Edges to Make Degrees of All Nodes Even",
"question__title_slug": "add-edges-to-make-degrees-of-all-nodes-even",
"question__hide": false,
- "total_acs": 11603,
- "total_submitted": 36878,
+ "total_acs": 12020,
+ "total_submitted": 37879,
"frontend_question_id": 2508,
"is_new_question": false
},
@@ -15517,8 +16115,8 @@
"question__title": "Smallest Value After Replacing With Sum of Prime Factors",
"question__title_slug": "smallest-value-after-replacing-with-sum-of-prime-factors",
"question__hide": false,
- "total_acs": 21815,
- "total_submitted": 45053,
+ "total_acs": 22179,
+ "total_submitted": 45741,
"frontend_question_id": 2507,
"is_new_question": false
},
@@ -15540,8 +16138,8 @@
"question__title": "Count Pairs Of Similar Strings",
"question__title_slug": "count-pairs-of-similar-strings",
"question__hide": false,
- "total_acs": 42935,
- "total_submitted": 61602,
+ "total_acs": 43863,
+ "total_submitted": 62756,
"frontend_question_id": 2506,
"is_new_question": false
},
@@ -15563,8 +16161,8 @@
"question__title": "Number of Distinct Binary Strings After Applying Operations",
"question__title_slug": "number-of-distinct-binary-strings-after-applying-operations",
"question__hide": false,
- "total_acs": 895,
- "total_submitted": 1394,
+ "total_acs": 925,
+ "total_submitted": 1464,
"frontend_question_id": 2450,
"is_new_question": false
},
@@ -15586,8 +16184,8 @@
"question__title": "Minimum Total Cost to Make Arrays Unequal",
"question__title_slug": "minimum-total-cost-to-make-arrays-unequal",
"question__hide": false,
- "total_acs": 4350,
- "total_submitted": 9951,
+ "total_acs": 4445,
+ "total_submitted": 10268,
"frontend_question_id": 2499,
"is_new_question": false
},
@@ -15609,8 +16207,8 @@
"question__title": "Frog Jump II",
"question__title_slug": "frog-jump-ii",
"question__hide": false,
- "total_acs": 20166,
- "total_submitted": 32613,
+ "total_acs": 20616,
+ "total_submitted": 33329,
"frontend_question_id": 2498,
"is_new_question": false
},
@@ -15632,8 +16230,8 @@
"question__title": "Maximum Star Sum of a Graph",
"question__title_slug": "maximum-star-sum-of-a-graph",
"question__hide": false,
- "total_acs": 18154,
- "total_submitted": 46520,
+ "total_acs": 18468,
+ "total_submitted": 47238,
"frontend_question_id": 2497,
"is_new_question": false
},
@@ -15655,8 +16253,8 @@
"question__title": "Maximum Value of a String in an Array",
"question__title_slug": "maximum-value-of-a-string-in-an-array",
"question__hide": false,
- "total_acs": 43015,
- "total_submitted": 59653,
+ "total_acs": 43755,
+ "total_submitted": 60603,
"frontend_question_id": 2496,
"is_new_question": false
},
@@ -15678,8 +16276,8 @@
"question__title": "Maximum Number of Points From Grid Queries",
"question__title_slug": "maximum-number-of-points-from-grid-queries",
"question__hide": false,
- "total_acs": 9084,
- "total_submitted": 24294,
+ "total_acs": 9194,
+ "total_submitted": 24611,
"frontend_question_id": 2503,
"is_new_question": false
},
@@ -15701,8 +16299,8 @@
"question__title": "Design Memory Allocator",
"question__title_slug": "design-memory-allocator",
"question__hide": false,
- "total_acs": 16298,
- "total_submitted": 30828,
+ "total_acs": 16626,
+ "total_submitted": 31379,
"frontend_question_id": 2502,
"is_new_question": false
},
@@ -15724,8 +16322,8 @@
"question__title": "Longest Square Streak in an Array",
"question__title_slug": "longest-square-streak-in-an-array",
"question__hide": false,
- "total_acs": 25570,
- "total_submitted": 64600,
+ "total_acs": 25871,
+ "total_submitted": 65228,
"frontend_question_id": 2501,
"is_new_question": false
},
@@ -15747,8 +16345,8 @@
"question__title": "Delete Greatest Value in Each Row",
"question__title_slug": "delete-greatest-value-in-each-row",
"question__hide": false,
- "total_acs": 57807,
- "total_submitted": 74168,
+ "total_acs": 59117,
+ "total_submitted": 75735,
"frontend_question_id": 2500,
"is_new_question": false
},
@@ -15770,8 +16368,8 @@
"question__title": "Number of Nodes With Value One",
"question__title_slug": "number-of-nodes-with-value-one",
"question__hide": false,
- "total_acs": 1957,
- "total_submitted": 2843,
+ "total_acs": 1985,
+ "total_submitted": 2890,
"frontend_question_id": 2445,
"is_new_question": false
},
@@ -15793,8 +16391,8 @@
"question__title": "Divide Nodes Into the Maximum Number of Groups",
"question__title_slug": "divide-nodes-into-the-maximum-number-of-groups",
"question__hide": false,
- "total_acs": 7770,
- "total_submitted": 20199,
+ "total_acs": 7895,
+ "total_submitted": 20578,
"frontend_question_id": 2493,
"is_new_question": false
},
@@ -15816,8 +16414,8 @@
"question__title": "Minimum Score of a Path Between Two Cities",
"question__title_slug": "minimum-score-of-a-path-between-two-cities",
"question__hide": false,
- "total_acs": 84171,
- "total_submitted": 146490,
+ "total_acs": 84881,
+ "total_submitted": 147812,
"frontend_question_id": 2492,
"is_new_question": false
},
@@ -15839,8 +16437,8 @@
"question__title": "Divide Players Into Teams of Equal Skill",
"question__title_slug": "divide-players-into-teams-of-equal-skill",
"question__hide": false,
- "total_acs": 35498,
- "total_submitted": 59475,
+ "total_acs": 36003,
+ "total_submitted": 60201,
"frontend_question_id": 2491,
"is_new_question": false
},
@@ -15862,8 +16460,8 @@
"question__title": "Circular Sentence",
"question__title_slug": "circular-sentence",
"question__hide": false,
- "total_acs": 38967,
- "total_submitted": 62155,
+ "total_acs": 39410,
+ "total_submitted": 62853,
"frontend_question_id": 2490,
"is_new_question": false
},
@@ -15885,8 +16483,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": 2236,
- "total_submitted": 3132,
+ "total_acs": 2262,
+ "total_submitted": 3162,
"frontend_question_id": 2436,
"is_new_question": false
},
@@ -15908,8 +16506,8 @@
"question__title": "Count Palindromic Subsequences",
"question__title_slug": "count-palindromic-subsequences",
"question__hide": false,
- "total_acs": 9927,
- "total_submitted": 26308,
+ "total_acs": 10094,
+ "total_submitted": 26800,
"frontend_question_id": 2484,
"is_new_question": false
},
@@ -15926,13 +16524,13 @@
"stat": {
"question_id": 2576,
"question__article__live": true,
- "question__article__slug": "none",
+ "question__article__slug": "minimum-penalty-for-a-shop",
"question__article__has_video_solution": true,
"question__title": "Minimum Penalty for a Shop",
"question__title_slug": "minimum-penalty-for-a-shop",
"question__hide": false,
- "total_acs": 104226,
- "total_submitted": 154812,
+ "total_acs": 105396,
+ "total_submitted": 156507,
"frontend_question_id": 2483,
"is_new_question": false
},
@@ -15954,8 +16552,8 @@
"question__title": "Minimum Cuts to Divide a Circle",
"question__title_slug": "minimum-cuts-to-divide-a-circle",
"question__hide": false,
- "total_acs": 32869,
- "total_submitted": 61828,
+ "total_acs": 33422,
+ "total_submitted": 62774,
"frontend_question_id": 2481,
"is_new_question": false
},
@@ -15977,8 +16575,8 @@
"question__title": "Count Subarrays With Median K",
"question__title_slug": "count-subarrays-with-median-k",
"question__hide": false,
- "total_acs": 11865,
- "total_submitted": 26761,
+ "total_acs": 12066,
+ "total_submitted": 27225,
"frontend_question_id": 2488,
"is_new_question": false
},
@@ -16000,8 +16598,8 @@
"question__title": "Remove Nodes From Linked List",
"question__title_slug": "remove-nodes-from-linked-list",
"question__hide": false,
- "total_acs": 183115,
- "total_submitted": 246085,
+ "total_acs": 186159,
+ "total_submitted": 250190,
"frontend_question_id": 2487,
"is_new_question": false
},
@@ -16023,8 +16621,8 @@
"question__title": "Append Characters to String to Make Subsequence",
"question__title_slug": "append-characters-to-string-to-make-subsequence",
"question__hide": false,
- "total_acs": 175364,
- "total_submitted": 238919,
+ "total_acs": 183822,
+ "total_submitted": 251443,
"frontend_question_id": 2486,
"is_new_question": false
},
@@ -16046,8 +16644,8 @@
"question__title": "Find the Pivot Integer",
"question__title_slug": "find-the-pivot-integer",
"question__hide": false,
- "total_acs": 220735,
- "total_submitted": 262984,
+ "total_acs": 223550,
+ "total_submitted": 266264,
"frontend_question_id": 2485,
"is_new_question": false
},
@@ -16069,8 +16667,8 @@
"question__title": "Maximize Total Tastiness of Purchased Fruits",
"question__title_slug": "maximize-total-tastiness-of-purchased-fruits",
"question__hide": false,
- "total_acs": 2115,
- "total_submitted": 3277,
+ "total_acs": 2150,
+ "total_submitted": 3337,
"frontend_question_id": 2431,
"is_new_question": false
},
@@ -16092,8 +16690,8 @@
"question__title": "Number of Beautiful Partitions",
"question__title_slug": "number-of-beautiful-partitions",
"question__hide": false,
- "total_acs": 9928,
- "total_submitted": 32135,
+ "total_acs": 10038,
+ "total_submitted": 32463,
"frontend_question_id": 2478,
"is_new_question": false
},
@@ -16115,8 +16713,8 @@
"question__title": "Minimum Fuel Cost to Report to the Capital",
"question__title_slug": "minimum-fuel-cost-to-report-to-the-capital",
"question__hide": false,
- "total_acs": 68261,
- "total_submitted": 105531,
+ "total_acs": 68971,
+ "total_submitted": 106791,
"frontend_question_id": 2477,
"is_new_question": false
},
@@ -16138,8 +16736,8 @@
"question__title": "Closest Nodes Queries in a Binary Search Tree",
"question__title_slug": "closest-nodes-queries-in-a-binary-search-tree",
"question__hide": false,
- "total_acs": 21881,
- "total_submitted": 52728,
+ "total_acs": 22368,
+ "total_submitted": 53850,
"frontend_question_id": 2476,
"is_new_question": false
},
@@ -16161,8 +16759,8 @@
"question__title": "Number of Unequal Triplets in Array",
"question__title_slug": "number-of-unequal-triplets-in-array",
"question__hide": false,
- "total_acs": 41135,
- "total_submitted": 57739,
+ "total_acs": 41745,
+ "total_submitted": 58533,
"frontend_question_id": 2475,
"is_new_question": false
},
@@ -16184,8 +16782,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": 11296,
- "total_submitted": 16282,
+ "total_acs": 11663,
+ "total_submitted": 16816,
"frontend_question_id": 2422,
"is_new_question": false
},
@@ -16207,8 +16805,8 @@
"question__title": "Most Profitable Path in a Tree",
"question__title_slug": "most-profitable-path-in-a-tree",
"question__hide": false,
- "total_acs": 12222,
- "total_submitted": 24921,
+ "total_acs": 12467,
+ "total_submitted": 25332,
"frontend_question_id": 2467,
"is_new_question": false
},
@@ -16230,8 +16828,8 @@
"question__title": "Split Message Based on Limit",
"question__title_slug": "split-message-based-on-limit",
"question__hide": false,
- "total_acs": 9794,
- "total_submitted": 22062,
+ "total_acs": 10331,
+ "total_submitted": 23251,
"frontend_question_id": 2468,
"is_new_question": false
},
@@ -16253,8 +16851,8 @@
"question__title": "Count Ways To Build Good Strings",
"question__title_slug": "count-ways-to-build-good-strings",
"question__hide": false,
- "total_acs": 74699,
- "total_submitted": 136818,
+ "total_acs": 75455,
+ "total_submitted": 138310,
"frontend_question_id": 2466,
"is_new_question": false
},
@@ -16276,8 +16874,8 @@
"question__title": "Number of Distinct Averages",
"question__title_slug": "number-of-distinct-averages",
"question__hide": false,
- "total_acs": 41955,
- "total_submitted": 72588,
+ "total_acs": 42822,
+ "total_submitted": 73938,
"frontend_question_id": 2465,
"is_new_question": false
},
@@ -16299,8 +16897,8 @@
"question__title": "Closest Fair Integer",
"question__title_slug": "closest-fair-integer",
"question__hide": false,
- "total_acs": 1057,
- "total_submitted": 2359,
+ "total_acs": 1084,
+ "total_submitted": 2398,
"frontend_question_id": 2417,
"is_new_question": false
},
@@ -16322,8 +16920,8 @@
"question__title": "Maximum Number of Non-overlapping Palindrome Substrings",
"question__title_slug": "maximum-number-of-non-overlapping-palindrome-substrings",
"question__hide": false,
- "total_acs": 15202,
- "total_submitted": 37801,
+ "total_acs": 15421,
+ "total_submitted": 38341,
"frontend_question_id": 2472,
"is_new_question": false
},
@@ -16345,8 +16943,8 @@
"question__title": "Minimum Number of Operations to Sort a Binary Tree by Level",
"question__title_slug": "minimum-number-of-operations-to-sort-a-binary-tree-by-level",
"question__hide": false,
- "total_acs": 21198,
- "total_submitted": 34277,
+ "total_acs": 21430,
+ "total_submitted": 34634,
"frontend_question_id": 2471,
"is_new_question": false
},
@@ -16368,8 +16966,8 @@
"question__title": "Number of Subarrays With LCM Equal to K",
"question__title_slug": "number-of-subarrays-with-lcm-equal-to-k",
"question__hide": false,
- "total_acs": 22120,
- "total_submitted": 57059,
+ "total_acs": 22281,
+ "total_submitted": 57401,
"frontend_question_id": 2470,
"is_new_question": false
},
@@ -16391,8 +16989,8 @@
"question__title": "Convert the Temperature",
"question__title_slug": "convert-the-temperature",
"question__hide": false,
- "total_acs": 174830,
- "total_submitted": 195595,
+ "total_acs": 179669,
+ "total_submitted": 200858,
"frontend_question_id": 2469,
"is_new_question": false
},
@@ -16414,8 +17012,8 @@
"question__title": "Design SQL",
"question__title_slug": "design-sql",
"question__hide": false,
- "total_acs": 6089,
- "total_submitted": 7790,
+ "total_acs": 6412,
+ "total_submitted": 8185,
"frontend_question_id": 2408,
"is_new_question": false
},
@@ -16437,8 +17035,8 @@
"question__title": "Minimum Total Distance Traveled",
"question__title_slug": "minimum-total-distance-traveled",
"question__hide": false,
- "total_acs": 8160,
- "total_submitted": 20088,
+ "total_acs": 8263,
+ "total_submitted": 20333,
"frontend_question_id": 2463,
"is_new_question": false
},
@@ -16460,8 +17058,8 @@
"question__title": "Total Cost to Hire K Workers",
"question__title_slug": "total-cost-to-hire-k-workers",
"question__hide": false,
- "total_acs": 95003,
- "total_submitted": 220842,
+ "total_acs": 97125,
+ "total_submitted": 225973,
"frontend_question_id": 2462,
"is_new_question": false
},
@@ -16483,8 +17081,8 @@
"question__title": "Maximum Sum of Distinct Subarrays With Length K",
"question__title_slug": "maximum-sum-of-distinct-subarrays-with-length-k",
"question__hide": false,
- "total_acs": 53977,
- "total_submitted": 158839,
+ "total_acs": 56252,
+ "total_submitted": 165147,
"frontend_question_id": 2461,
"is_new_question": false
},
@@ -16506,8 +17104,8 @@
"question__title": "Apply Operations to an Array",
"question__title_slug": "apply-operations-to-an-array",
"question__hide": false,
- "total_acs": 60838,
- "total_submitted": 90197,
+ "total_acs": 62184,
+ "total_submitted": 92069,
"frontend_question_id": 2460,
"is_new_question": false
},
@@ -16529,8 +17127,8 @@
"question__title": "Words Within Two Edits of Dictionary",
"question__title_slug": "words-within-two-edits-of-dictionary",
"question__hide": false,
- "total_acs": 21131,
- "total_submitted": 34864,
+ "total_acs": 21472,
+ "total_submitted": 35360,
"frontend_question_id": 2452,
"is_new_question": false
},
@@ -16552,8 +17150,8 @@
"question__title": "Next Greater Element IV",
"question__title_slug": "next-greater-element-iv",
"question__hide": false,
- "total_acs": 10044,
- "total_submitted": 25915,
+ "total_acs": 10246,
+ "total_submitted": 26445,
"frontend_question_id": 2454,
"is_new_question": false
},
@@ -16575,8 +17173,8 @@
"question__title": "Destroy Sequential Targets",
"question__title_slug": "destroy-sequential-targets",
"question__hide": false,
- "total_acs": 17126,
- "total_submitted": 43781,
+ "total_acs": 17348,
+ "total_submitted": 44236,
"frontend_question_id": 2453,
"is_new_question": false
},
@@ -16598,8 +17196,8 @@
"question__title": "Odd String Difference",
"question__title_slug": "odd-string-difference",
"question__hide": false,
- "total_acs": 28887,
- "total_submitted": 48859,
+ "total_acs": 29212,
+ "total_submitted": 49384,
"frontend_question_id": 2451,
"is_new_question": false
},
@@ -16621,8 +17219,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": 25380,
- "total_submitted": 50814,
+ "total_acs": 25657,
+ "total_submitted": 51283,
"frontend_question_id": 2447,
"is_new_question": false
},
@@ -16644,8 +17242,8 @@
"question__title": "Height of Binary Tree After Subtree Removal Queries",
"question__title_slug": "height-of-binary-tree-after-subtree-removal-queries",
"question__hide": false,
- "total_acs": 24827,
- "total_submitted": 61530,
+ "total_acs": 25219,
+ "total_submitted": 62389,
"frontend_question_id": 2458,
"is_new_question": false
},
@@ -16667,8 +17265,8 @@
"question__title": "Minimum Addition to Make Integer Beautiful",
"question__title_slug": "minimum-addition-to-make-integer-beautiful",
"question__hide": false,
- "total_acs": 19555,
- "total_submitted": 52046,
+ "total_acs": 19695,
+ "total_submitted": 52463,
"frontend_question_id": 2457,
"is_new_question": false
},
@@ -16690,8 +17288,8 @@
"question__title": "Most Popular Video Creator",
"question__title_slug": "most-popular-video-creator",
"question__hide": false,
- "total_acs": 21793,
- "total_submitted": 49884,
+ "total_acs": 21952,
+ "total_submitted": 50182,
"frontend_question_id": 2456,
"is_new_question": false
},
@@ -16713,8 +17311,8 @@
"question__title": "Average Value of Even Numbers That Are Divisible by Three",
"question__title_slug": "average-value-of-even-numbers-that-are-divisible-by-three",
"question__hide": false,
- "total_acs": 55463,
- "total_submitted": 92136,
+ "total_acs": 56428,
+ "total_submitted": 93547,
"frontend_question_id": 2455,
"is_new_question": false
},
@@ -16736,8 +17334,8 @@
"question__title": "Sum of Number and Its Reverse",
"question__title_slug": "sum-of-number-and-its-reverse",
"question__hide": false,
- "total_acs": 35389,
- "total_submitted": 74939,
+ "total_acs": 35752,
+ "total_submitted": 75607,
"frontend_question_id": 2443,
"is_new_question": false
},
@@ -16759,8 +17357,8 @@
"question__title": "Color the Triangle Red",
"question__title_slug": "color-the-triangle-red",
"question__hide": false,
- "total_acs": 300,
- "total_submitted": 450,
+ "total_acs": 307,
+ "total_submitted": 458,
"frontend_question_id": 2647,
"is_new_question": false
},
@@ -16782,8 +17380,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": 12287,
- "total_submitted": 19887,
+ "total_acs": 12528,
+ "total_submitted": 20266,
"frontend_question_id": 2449,
"is_new_question": false
},
@@ -16805,8 +17403,8 @@
"question__title": "Minimum Cost to Make Array Equal",
"question__title_slug": "minimum-cost-to-make-array-equal",
"question__hide": false,
- "total_acs": 65705,
- "total_submitted": 143073,
+ "total_acs": 66125,
+ "total_submitted": 143918,
"frontend_question_id": 2448,
"is_new_question": false
},
@@ -16828,8 +17426,8 @@
"question__title": "Minimum Time to Kill All Monsters",
"question__title_slug": "minimum-time-to-kill-all-monsters",
"question__hide": false,
- "total_acs": 1299,
- "total_submitted": 2319,
+ "total_acs": 1321,
+ "total_submitted": 2360,
"frontend_question_id": 2403,
"is_new_question": false
},
@@ -16851,8 +17449,8 @@
"question__title": "Determine if Two Events Have Conflict",
"question__title_slug": "determine-if-two-events-have-conflict",
"question__hide": false,
- "total_acs": 43489,
- "total_submitted": 85472,
+ "total_acs": 44126,
+ "total_submitted": 86602,
"frontend_question_id": 2446,
"is_new_question": false
},
@@ -16874,8 +17472,8 @@
"question__title": "Count Strictly Increasing Subarrays",
"question__title_slug": "count-strictly-increasing-subarrays",
"question__hide": false,
- "total_acs": 6439,
- "total_submitted": 8582,
+ "total_acs": 6510,
+ "total_submitted": 8684,
"frontend_question_id": 2393,
"is_new_question": false
},
@@ -16897,8 +17495,8 @@
"question__title": "Employees With Deductions",
"question__title_slug": "employees-with-deductions",
"question__hide": false,
- "total_acs": 4137,
- "total_submitted": 10256,
+ "total_acs": 4247,
+ "total_submitted": 10508,
"frontend_question_id": 2394,
"is_new_question": false
},
@@ -16920,8 +17518,8 @@
"question__title": "Bitwise XOR of All Pairings",
"question__title_slug": "bitwise-xor-of-all-pairings",
"question__hide": false,
- "total_acs": 19506,
- "total_submitted": 33635,
+ "total_acs": 19786,
+ "total_submitted": 34056,
"frontend_question_id": 2425,
"is_new_question": false
},
@@ -16943,8 +17541,8 @@
"question__title": "Remove Letter To Equalize Frequency",
"question__title_slug": "remove-letter-to-equalize-frequency",
"question__hide": false,
- "total_acs": 44692,
- "total_submitted": 258193,
+ "total_acs": 45855,
+ "total_submitted": 264111,
"frontend_question_id": 2423,
"is_new_question": false
},
@@ -16966,8 +17564,8 @@
"question__title": "Create Components With Same Value",
"question__title_slug": "create-components-with-same-value",
"question__hide": false,
- "total_acs": 6443,
- "total_submitted": 12188,
+ "total_acs": 6596,
+ "total_submitted": 12490,
"frontend_question_id": 2440,
"is_new_question": false
},
@@ -16989,8 +17587,8 @@
"question__title": "Minimize Maximum of Array",
"question__title_slug": "minimize-maximum-of-array",
"question__hide": false,
- "total_acs": 81284,
- "total_submitted": 174632,
+ "total_acs": 81831,
+ "total_submitted": 175793,
"frontend_question_id": 2439,
"is_new_question": false
},
@@ -17012,8 +17610,8 @@
"question__title": "Range Product Queries of Powers",
"question__title_slug": "range-product-queries-of-powers",
"question__hide": false,
- "total_acs": 15973,
- "total_submitted": 39802,
+ "total_acs": 16164,
+ "total_submitted": 40163,
"frontend_question_id": 2438,
"is_new_question": false
},
@@ -17035,8 +17633,8 @@
"question__title": "Number of Valid Clock Times",
"question__title_slug": "number-of-valid-clock-times",
"question__hide": false,
- "total_acs": 30759,
- "total_submitted": 66042,
+ "total_acs": 31224,
+ "total_submitted": 66873,
"frontend_question_id": 2437,
"is_new_question": false
},
@@ -17058,8 +17656,8 @@
"question__title": "Count Subarrays With Fixed Bounds",
"question__title_slug": "count-subarrays-with-fixed-bounds",
"question__hide": false,
- "total_acs": 141545,
- "total_submitted": 208009,
+ "total_acs": 142658,
+ "total_submitted": 209698,
"frontend_question_id": 2444,
"is_new_question": false
},
@@ -17081,8 +17679,8 @@
"question__title": "Longest Increasing Subsequence II",
"question__title_slug": "longest-increasing-subsequence-ii",
"question__hide": false,
- "total_acs": 14380,
- "total_submitted": 60688,
+ "total_acs": 14925,
+ "total_submitted": 62384,
"frontend_question_id": 2407,
"is_new_question": false
},
@@ -17104,8 +17702,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": 60662,
- "total_submitted": 76516,
+ "total_acs": 62112,
+ "total_submitted": 78201,
"frontend_question_id": 2442,
"is_new_question": false
},
@@ -17127,8 +17725,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": 216839,
- "total_submitted": 288389,
+ "total_acs": 219327,
+ "total_submitted": 291779,
"frontend_question_id": 2441,
"is_new_question": false
},
@@ -17150,8 +17748,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": 4157,
- "total_submitted": 8270,
+ "total_acs": 4240,
+ "total_submitted": 8416,
"frontend_question_id": 2388,
"is_new_question": false
},
@@ -17173,8 +17771,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": 3100,
- "total_submitted": 4363,
+ "total_acs": 3174,
+ "total_submitted": 4469,
"frontend_question_id": 2387,
"is_new_question": false
},
@@ -17196,8 +17794,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": 22298,
- "total_submitted": 52171,
+ "total_acs": 22630,
+ "total_submitted": 52832,
"frontend_question_id": 2435,
"is_new_question": false
},
@@ -17219,8 +17817,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": 18263,
- "total_submitted": 45961,
+ "total_acs": 18532,
+ "total_submitted": 46527,
"frontend_question_id": 2434,
"is_new_question": false
},
@@ -17242,8 +17840,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": 144887,
- "total_submitted": 164498,
+ "total_acs": 146888,
+ "total_submitted": 166777,
"frontend_question_id": 2433,
"is_new_question": false
},
@@ -17265,8 +17863,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": 34420,
- "total_submitted": 68797,
+ "total_acs": 34724,
+ "total_submitted": 69316,
"frontend_question_id": 2432,
"is_new_question": false
},
@@ -17288,8 +17886,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": 1376,
- "total_submitted": 2370,
+ "total_acs": 1433,
+ "total_submitted": 2445,
"frontend_question_id": 2378,
"is_new_question": false
},
@@ -17311,8 +17909,8 @@
"question__title": "Sort the Olympic Table",
"question__title_slug": "sort-the-olympic-table",
"question__hide": false,
- "total_acs": 5852,
- "total_submitted": 7444,
+ "total_acs": 5961,
+ "total_submitted": 7579,
"frontend_question_id": 2377,
"is_new_question": false
},
@@ -17334,8 +17932,8 @@
"question__title": "Calculate the Influence of Each Salesperson",
"question__title_slug": "calculate-the-influence-of-each-salesperson",
"question__hide": false,
- "total_acs": 5171,
- "total_submitted": 6250,
+ "total_acs": 5265,
+ "total_submitted": 6351,
"frontend_question_id": 2372,
"is_new_question": false
},
@@ -17357,8 +17955,8 @@
"question__title": "Number of Pairs Satisfying Inequality",
"question__title_slug": "number-of-pairs-satisfying-inequality",
"question__hide": false,
- "total_acs": 12927,
- "total_submitted": 29368,
+ "total_acs": 13104,
+ "total_submitted": 29744,
"frontend_question_id": 2426,
"is_new_question": false
},
@@ -17380,8 +17978,8 @@
"question__title": "Longest Uploaded Prefix",
"question__title_slug": "longest-uploaded-prefix",
"question__hide": false,
- "total_acs": 20628,
- "total_submitted": 37303,
+ "total_acs": 20887,
+ "total_submitted": 37748,
"frontend_question_id": 2424,
"is_new_question": false
},
@@ -17403,8 +18001,8 @@
"question__title": "Partition String Into Substrings With Values at Most K",
"question__title_slug": "partition-string-into-substrings-with-values-at-most-k",
"question__hide": false,
- "total_acs": 20814,
- "total_submitted": 45122,
+ "total_acs": 21085,
+ "total_submitted": 45619,
"frontend_question_id": 2522,
"is_new_question": false
},
@@ -17426,8 +18024,8 @@
"question__title": "Maximum Deletions on a String",
"question__title_slug": "maximum-deletions-on-a-string",
"question__hide": false,
- "total_acs": 13056,
- "total_submitted": 39400,
+ "total_acs": 13214,
+ "total_submitted": 39713,
"frontend_question_id": 2430,
"is_new_question": false
},
@@ -17449,8 +18047,8 @@
"question__title": "Minimize XOR",
"question__title_slug": "minimize-xor",
"question__hide": false,
- "total_acs": 21689,
- "total_submitted": 49249,
+ "total_acs": 21860,
+ "total_submitted": 49546,
"frontend_question_id": 2429,
"is_new_question": false
},
@@ -17472,8 +18070,8 @@
"question__title": "Maximum Sum of an Hourglass",
"question__title_slug": "maximum-sum-of-an-hourglass",
"question__hide": false,
- "total_acs": 37886,
- "total_submitted": 50657,
+ "total_acs": 38398,
+ "total_submitted": 51282,
"frontend_question_id": 2428,
"is_new_question": false
},
@@ -17495,8 +18093,8 @@
"question__title": "Number of Common Factors",
"question__title_slug": "number-of-common-factors",
"question__hide": false,
- "total_acs": 84315,
- "total_submitted": 106743,
+ "total_acs": 86141,
+ "total_submitted": 109067,
"frontend_question_id": 2427,
"is_new_question": false
},
@@ -17518,8 +18116,8 @@
"question__title": "Minimize Maximum Value in a Grid",
"question__title_slug": "minimize-maximum-value-in-a-grid",
"question__hide": false,
- "total_acs": 2681,
- "total_submitted": 4081,
+ "total_acs": 2765,
+ "total_submitted": 4194,
"frontend_question_id": 2371,
"is_new_question": false
},
@@ -17541,8 +18139,8 @@
"question__title": "Number of Good Paths",
"question__title_slug": "number-of-good-paths",
"question__hide": false,
- "total_acs": 55154,
- "total_submitted": 97841,
+ "total_acs": 55442,
+ "total_submitted": 98389,
"frontend_question_id": 2421,
"is_new_question": false
},
@@ -17564,8 +18162,8 @@
"question__title": "Find All Good Indices",
"question__title_slug": "find-all-good-indices",
"question__hide": false,
- "total_acs": 23288,
- "total_submitted": 60266,
+ "total_acs": 23499,
+ "total_submitted": 60704,
"frontend_question_id": 2420,
"is_new_question": false
},
@@ -17587,8 +18185,8 @@
"question__title": "Longest Subarray With Maximum Bitwise AND",
"question__title_slug": "longest-subarray-with-maximum-bitwise-and",
"question__hide": false,
- "total_acs": 27561,
- "total_submitted": 55862,
+ "total_acs": 27821,
+ "total_submitted": 56289,
"frontend_question_id": 2419,
"is_new_question": false
},
@@ -17610,8 +18208,8 @@
"question__title": "Sort the People",
"question__title_slug": "sort-the-people",
"question__hide": false,
- "total_acs": 138157,
- "total_submitted": 172516,
+ "total_acs": 141079,
+ "total_submitted": 176117,
"frontend_question_id": 2418,
"is_new_question": false
},
@@ -17633,8 +18231,8 @@
"question__title": "Generate the Invoice",
"question__title_slug": "generate-the-invoice",
"question__hide": false,
- "total_acs": 3404,
- "total_submitted": 4629,
+ "total_acs": 3483,
+ "total_submitted": 4719,
"frontend_question_id": 2362,
"is_new_question": false
},
@@ -17656,8 +18254,8 @@
"question__title": "Minimum Costs Using the Train Line",
"question__title_slug": "minimum-costs-using-the-train-line",
"question__hide": false,
- "total_acs": 10189,
- "total_submitted": 12928,
+ "total_acs": 10285,
+ "total_submitted": 13045,
"frontend_question_id": 2361,
"is_new_question": false
},
@@ -17679,8 +18277,8 @@
"question__title": "Minimum Money Required Before Transactions",
"question__title_slug": "minimum-money-required-before-transactions",
"question__hide": false,
- "total_acs": 10474,
- "total_submitted": 26053,
+ "total_acs": 10602,
+ "total_submitted": 26312,
"frontend_question_id": 2412,
"is_new_question": false
},
@@ -17702,8 +18300,8 @@
"question__title": "Smallest Subarrays With Maximum Bitwise OR",
"question__title_slug": "smallest-subarrays-with-maximum-bitwise-or",
"question__hide": false,
- "total_acs": 12636,
- "total_submitted": 28718,
+ "total_acs": 12786,
+ "total_submitted": 28974,
"frontend_question_id": 2411,
"is_new_question": false
},
@@ -17725,8 +18323,8 @@
"question__title": "Maximum Matching of Players With Trainers",
"question__title_slug": "maximum-matching-of-players-with-trainers",
"question__hide": false,
- "total_acs": 34135,
- "total_submitted": 54412,
+ "total_acs": 35821,
+ "total_submitted": 56663,
"frontend_question_id": 2410,
"is_new_question": false
},
@@ -17748,8 +18346,8 @@
"question__title": "Count Days Spent Together",
"question__title_slug": "count-days-spent-together",
"question__hide": false,
- "total_acs": 22533,
- "total_submitted": 50171,
+ "total_acs": 22799,
+ "total_submitted": 50672,
"frontend_question_id": 2409,
"is_new_question": false
},
@@ -17771,8 +18369,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": 157677,
- "total_submitted": 179384,
+ "total_acs": 168488,
+ "total_submitted": 191441,
"frontend_question_id": 2356,
"is_new_question": false
},
@@ -17794,8 +18392,8 @@
"question__title": "Sum of Prefix Scores of Strings",
"question__title_slug": "sum-of-prefix-scores-of-strings",
"question__hide": false,
- "total_acs": 25483,
- "total_submitted": 55503,
+ "total_acs": 25744,
+ "total_submitted": 55935,
"frontend_question_id": 2416,
"is_new_question": false
},
@@ -17817,8 +18415,8 @@
"question__title": "Reverse Odd Levels of Binary Tree",
"question__title_slug": "reverse-odd-levels-of-binary-tree",
"question__hide": false,
- "total_acs": 50848,
- "total_submitted": 65502,
+ "total_acs": 51764,
+ "total_submitted": 66611,
"frontend_question_id": 2415,
"is_new_question": false
},
@@ -17840,8 +18438,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": 44789,
- "total_submitted": 77086,
+ "total_acs": 45283,
+ "total_submitted": 77791,
"frontend_question_id": 2414,
"is_new_question": false
},
@@ -17863,8 +18461,8 @@
"question__title": "Smallest Even Multiple",
"question__title_slug": "smallest-even-multiple",
"question__hide": false,
- "total_acs": 166769,
- "total_submitted": 190189,
+ "total_acs": 170700,
+ "total_submitted": 194577,
"frontend_question_id": 2413,
"is_new_question": false
},
@@ -17886,8 +18484,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": 10785,
- "total_submitted": 26573,
+ "total_acs": 10972,
+ "total_submitted": 27037,
"frontend_question_id": 2355,
"is_new_question": false
},
@@ -17909,8 +18507,8 @@
"question__title": "Sort Array by Moving Items to Empty Space",
"question__title_slug": "sort-array-by-moving-items-to-empty-space",
"question__hide": false,
- "total_acs": 1664,
- "total_submitted": 3592,
+ "total_acs": 1730,
+ "total_submitted": 3758,
"frontend_question_id": 2459,
"is_new_question": false
},
@@ -17932,8 +18530,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": 26290,
- "total_submitted": 55943,
+ "total_acs": 26592,
+ "total_submitted": 56466,
"frontend_question_id": 2406,
"is_new_question": false
},
@@ -17955,8 +18553,8 @@
"question__title": "Optimal Partition of String",
"question__title_slug": "optimal-partition-of-string",
"question__hide": false,
- "total_acs": 190333,
- "total_submitted": 243898,
+ "total_acs": 194495,
+ "total_submitted": 249398,
"frontend_question_id": 2405,
"is_new_question": false
},
@@ -17978,8 +18576,8 @@
"question__title": "Most Frequent Even Element",
"question__title_slug": "most-frequent-even-element",
"question__hide": false,
- "total_acs": 79722,
- "total_submitted": 158092,
+ "total_acs": 81232,
+ "total_submitted": 160826,
"frontend_question_id": 2404,
"is_new_question": false
},
@@ -18001,8 +18599,8 @@
"question__title": "Finding the Number of Visible Mountains",
"question__title_slug": "finding-the-number-of-visible-mountains",
"question__hide": false,
- "total_acs": 8040,
- "total_submitted": 21260,
+ "total_acs": 8282,
+ "total_submitted": 21797,
"frontend_question_id": 2345,
"is_new_question": false
},
@@ -18024,8 +18622,8 @@
"question__title": "Compute the Rank as a Percentage",
"question__title_slug": "compute-the-rank-as-a-percentage",
"question__hide": false,
- "total_acs": 4569,
- "total_submitted": 13633,
+ "total_acs": 4665,
+ "total_submitted": 13920,
"frontend_question_id": 2346,
"is_new_question": false
},
@@ -18047,8 +18645,8 @@
"question__title": "Task Scheduler II",
"question__title_slug": "task-scheduler-ii",
"question__hide": false,
- "total_acs": 34493,
- "total_submitted": 66114,
+ "total_acs": 35226,
+ "total_submitted": 67352,
"frontend_question_id": 2365,
"is_new_question": false
},
@@ -18070,8 +18668,8 @@
"question__title": "Maximum Rows Covered by Columns",
"question__title_slug": "maximum-rows-covered-by-columns",
"question__hide": false,
- "total_acs": 14714,
- "total_submitted": 26840,
+ "total_acs": 14820,
+ "total_submitted": 26985,
"frontend_question_id": 2397,
"is_new_question": false
},
@@ -18093,8 +18691,8 @@
"question__title": "Strictly Palindromic Number",
"question__title_slug": "strictly-palindromic-number",
"question__hide": false,
- "total_acs": 85858,
- "total_submitted": 98111,
+ "total_acs": 87770,
+ "total_submitted": 100265,
"frontend_question_id": 2396,
"is_new_question": false
},
@@ -18116,8 +18714,8 @@
"question__title": "Find Subarrays With Equal Sum",
"question__title_slug": "find-subarrays-with-equal-sum",
"question__hide": false,
- "total_acs": 49437,
- "total_submitted": 75989,
+ "total_acs": 50085,
+ "total_submitted": 76877,
"frontend_question_id": 2395,
"is_new_question": false
},
@@ -18139,8 +18737,8 @@
"question__title": "Meeting Rooms III",
"question__title_slug": "meeting-rooms-iii",
"question__hide": false,
- "total_acs": 113290,
- "total_submitted": 254321,
+ "total_acs": 114923,
+ "total_submitted": 258590,
"frontend_question_id": 2402,
"is_new_question": false
},
@@ -18162,8 +18760,8 @@
"question__title": "Longest Nice Subarray",
"question__title_slug": "longest-nice-subarray",
"question__hide": false,
- "total_acs": 31773,
- "total_submitted": 62004,
+ "total_acs": 32475,
+ "total_submitted": 63207,
"frontend_question_id": 2401,
"is_new_question": false
},
@@ -18185,8 +18783,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": 30496,
- "total_submitted": 86845,
+ "total_acs": 30821,
+ "total_submitted": 87583,
"frontend_question_id": 2400,
"is_new_question": false
},
@@ -18208,8 +18806,8 @@
"question__title": "Check Distances Between Same Letters",
"question__title_slug": "check-distances-between-same-letters",
"question__hide": false,
- "total_acs": 48047,
- "total_submitted": 68178,
+ "total_acs": 48646,
+ "total_submitted": 68973,
"frontend_question_id": 2399,
"is_new_question": false
},
@@ -18231,8 +18829,8 @@
"question__title": "Largest Palindromic Number",
"question__title_slug": "largest-palindromic-number",
"question__hide": false,
- "total_acs": 36842,
- "total_submitted": 105701,
+ "total_acs": 38193,
+ "total_submitted": 108700,
"frontend_question_id": 2384,
"is_new_question": false
},
@@ -18254,8 +18852,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": 24395,
- "total_submitted": 33692,
+ "total_acs": 26851,
+ "total_submitted": 36996,
"frontend_question_id": 2340,
"is_new_question": false
},
@@ -18277,8 +18875,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": 47075,
- "total_submitted": 85818,
+ "total_acs": 47777,
+ "total_submitted": 86882,
"frontend_question_id": 2342,
"is_new_question": false
},
@@ -18300,8 +18898,8 @@
"question__title": "Build a Matrix With Conditions",
"question__title_slug": "build-a-matrix-with-conditions",
"question__hide": false,
- "total_acs": 14364,
- "total_submitted": 23429,
+ "total_acs": 14547,
+ "total_submitted": 23686,
"frontend_question_id": 2392,
"is_new_question": false
},
@@ -18323,8 +18921,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": 129276,
- "total_submitted": 151524,
+ "total_acs": 130698,
+ "total_submitted": 153163,
"frontend_question_id": 2391,
"is_new_question": false
},
@@ -18346,8 +18944,8 @@
"question__title": "Removing Stars From a String",
"question__title_slug": "removing-stars-from-a-string",
"question__hide": false,
- "total_acs": 300042,
- "total_submitted": 398907,
+ "total_acs": 311955,
+ "total_submitted": 413474,
"frontend_question_id": 2390,
"is_new_question": false
},
@@ -18369,8 +18967,8 @@
"question__title": "Longest Subsequence With Limited Sum",
"question__title_slug": "longest-subsequence-with-limited-sum",
"question__hide": false,
- "total_acs": 109145,
- "total_submitted": 152246,
+ "total_acs": 111012,
+ "total_submitted": 154664,
"frontend_question_id": 2389,
"is_new_question": false
},
@@ -18392,8 +18990,8 @@
"question__title": "Valid Palindrome IV",
"question__title_slug": "valid-palindrome-iv",
"question__hide": false,
- "total_acs": 11185,
- "total_submitted": 14750,
+ "total_acs": 11632,
+ "total_submitted": 15312,
"frontend_question_id": 2330,
"is_new_question": false
},
@@ -18415,8 +19013,8 @@
"question__title": "Maximum Segment Sum After Removals",
"question__title_slug": "maximum-segment-sum-after-removals",
"question__hide": false,
- "total_acs": 8721,
- "total_submitted": 17865,
+ "total_acs": 8850,
+ "total_submitted": 18066,
"frontend_question_id": 2382,
"is_new_question": false
},
@@ -18438,8 +19036,8 @@
"question__title": "Shifting Letters II",
"question__title_slug": "shifting-letters-ii",
"question__hide": false,
- "total_acs": 21072,
- "total_submitted": 56673,
+ "total_acs": 21464,
+ "total_submitted": 57454,
"frontend_question_id": 2381,
"is_new_question": false
},
@@ -18461,8 +19059,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": 29343,
- "total_submitted": 58866,
+ "total_acs": 29679,
+ "total_submitted": 59478,
"frontend_question_id": 2380,
"is_new_question": false
},
@@ -18484,8 +19082,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": 52343,
- "total_submitted": 89087,
+ "total_acs": 53311,
+ "total_submitted": 90605,
"frontend_question_id": 2379,
"is_new_question": false
},
@@ -18507,8 +19105,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": 8796,
- "total_submitted": 22708,
+ "total_acs": 8859,
+ "total_submitted": 22862,
"frontend_question_id": 2386,
"is_new_question": false
},
@@ -18530,8 +19128,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": 134216,
- "total_submitted": 213749,
+ "total_acs": 136471,
+ "total_submitted": 217553,
"frontend_question_id": 2385,
"is_new_question": false
},
@@ -18553,8 +19151,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": 31659,
- "total_submitted": 77054,
+ "total_acs": 31958,
+ "total_submitted": 77722,
"frontend_question_id": 2383,
"is_new_question": false
},
@@ -18576,8 +19174,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": 7323,
- "total_submitted": 11053,
+ "total_acs": 7654,
+ "total_submitted": 11561,
"frontend_question_id": 2323,
"is_new_question": false
},
@@ -18599,8 +19197,8 @@
"question__title": "Count Special Integers",
"question__title_slug": "count-special-integers",
"question__hide": false,
- "total_acs": 11698,
- "total_submitted": 30447,
+ "total_acs": 11809,
+ "total_submitted": 30675,
"frontend_question_id": 2376,
"is_new_question": false
},
@@ -18622,8 +19220,8 @@
"question__title": "Construct Smallest Number From DI String",
"question__title_slug": "construct-smallest-number-from-di-string",
"question__hide": false,
- "total_acs": 32463,
- "total_submitted": 42797,
+ "total_acs": 33047,
+ "total_submitted": 43518,
"frontend_question_id": 2375,
"is_new_question": false
},
@@ -18645,8 +19243,8 @@
"question__title": "Node With Highest Edge Score",
"question__title_slug": "node-with-highest-edge-score",
"question__hide": false,
- "total_acs": 33071,
- "total_submitted": 69724,
+ "total_acs": 33433,
+ "total_submitted": 70361,
"frontend_question_id": 2374,
"is_new_question": false
},
@@ -18668,8 +19266,8 @@
"question__title": "Largest Local Values in a Matrix",
"question__title_slug": "largest-local-values-in-a-matrix",
"question__hide": false,
- "total_acs": 153452,
- "total_submitted": 174010,
+ "total_acs": 156515,
+ "total_submitted": 177619,
"frontend_question_id": 2373,
"is_new_question": false
},
@@ -18691,8 +19289,8 @@
"question__title": "All the Matches of the League",
"question__title_slug": "all-the-matches-of-the-league",
"question__hide": false,
- "total_acs": 7639,
- "total_submitted": 8724,
+ "total_acs": 7787,
+ "total_submitted": 8880,
"frontend_question_id": 2339,
"is_new_question": false
},
@@ -18714,8 +19312,8 @@
"question__title": "Product Sales Analysis V",
"question__title_slug": "product-sales-analysis-v",
"question__hide": false,
- "total_acs": 6970,
- "total_submitted": 10030,
+ "total_acs": 7109,
+ "total_submitted": 10229,
"frontend_question_id": 2329,
"is_new_question": false
},
@@ -18737,8 +19335,8 @@
"question__title": "Product Sales Analysis IV",
"question__title_slug": "product-sales-analysis-iv",
"question__hide": false,
- "total_acs": 7056,
- "total_submitted": 9568,
+ "total_acs": 7210,
+ "total_submitted": 9742,
"frontend_question_id": 2324,
"is_new_question": false
},
@@ -18760,8 +19358,8 @@
"question__title": "Minimum Replacements to Sort the Array",
"question__title_slug": "minimum-replacements-to-sort-the-array",
"question__hide": false,
- "total_acs": 65362,
- "total_submitted": 121803,
+ "total_acs": 65677,
+ "total_submitted": 122444,
"frontend_question_id": 2366,
"is_new_question": false
},
@@ -18783,8 +19381,8 @@
"question__title": "Maximum Number of Robots Within Budget",
"question__title_slug": "maximum-number-of-robots-within-budget",
"question__hide": false,
- "total_acs": 20689,
- "total_submitted": 60283,
+ "total_acs": 21057,
+ "total_submitted": 61124,
"frontend_question_id": 2398,
"is_new_question": false
},
@@ -18806,8 +19404,8 @@
"question__title": "Count Number of Bad Pairs",
"question__title_slug": "count-number-of-bad-pairs",
"question__hide": false,
- "total_acs": 31137,
- "total_submitted": 75011,
+ "total_acs": 31907,
+ "total_submitted": 76572,
"frontend_question_id": 2364,
"is_new_question": false
},
@@ -18829,8 +19427,8 @@
"question__title": "Merge Similar Items",
"question__title_slug": "merge-similar-items",
"question__hide": false,
- "total_acs": 56221,
- "total_submitted": 74387,
+ "total_acs": 57084,
+ "total_submitted": 75433,
"frontend_question_id": 2363,
"is_new_question": false
},
@@ -18852,8 +19450,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": 5430,
- "total_submitted": 7597,
+ "total_acs": 5526,
+ "total_submitted": 7737,
"frontend_question_id": 2314,
"is_new_question": false
},
@@ -18875,8 +19473,8 @@
"question__title": "Reachable Nodes With Restrictions",
"question__title_slug": "reachable-nodes-with-restrictions",
"question__hide": false,
- "total_acs": 53253,
- "total_submitted": 90740,
+ "total_acs": 54226,
+ "total_submitted": 92326,
"frontend_question_id": 2368,
"is_new_question": false
},
@@ -18898,8 +19496,8 @@
"question__title": "Longest Ideal Subsequence",
"question__title_slug": "longest-ideal-subsequence",
"question__hide": false,
- "total_acs": 112107,
- "total_submitted": 235726,
+ "total_acs": 112771,
+ "total_submitted": 237547,
"frontend_question_id": 2370,
"is_new_question": false
},
@@ -18921,8 +19519,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": 86899,
- "total_submitted": 167730,
+ "total_acs": 87378,
+ "total_submitted": 168591,
"frontend_question_id": 2369,
"is_new_question": false
},
@@ -18944,8 +19542,8 @@
"question__title": "Number of Arithmetic Triplets",
"question__title_slug": "number-of-arithmetic-triplets",
"question__hide": false,
- "total_acs": 123015,
- "total_submitted": 146418,
+ "total_acs": 127187,
+ "total_submitted": 151113,
"frontend_question_id": 2367,
"is_new_question": false
},
@@ -18967,8 +19565,8 @@
"question__title": "Arrange Table by Gender",
"question__title_slug": "arrange-table-by-gender",
"question__hide": false,
- "total_acs": 5656,
- "total_submitted": 8239,
+ "total_acs": 5775,
+ "total_submitted": 8400,
"frontend_question_id": 2308,
"is_new_question": false
},
@@ -18990,8 +19588,8 @@
"question__title": "Tasks Count in the Weekend",
"question__title_slug": "tasks-count-in-the-weekend",
"question__hide": false,
- "total_acs": 6002,
- "total_submitted": 7397,
+ "total_acs": 6122,
+ "total_submitted": 7536,
"frontend_question_id": 2298,
"is_new_question": false
},
@@ -19013,8 +19611,8 @@
"question__title": "Longest Cycle in a Graph",
"question__title_slug": "longest-cycle-in-a-graph",
"question__hide": false,
- "total_acs": 74123,
- "total_submitted": 148663,
+ "total_acs": 74689,
+ "total_submitted": 149883,
"frontend_question_id": 2360,
"is_new_question": false
},
@@ -19036,8 +19634,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": 76522,
- "total_submitted": 168184,
+ "total_acs": 77011,
+ "total_submitted": 169291,
"frontend_question_id": 2359,
"is_new_question": false
},
@@ -19059,8 +19657,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": 36952,
- "total_submitted": 54441,
+ "total_acs": 37392,
+ "total_submitted": 55019,
"frontend_question_id": 2358,
"is_new_question": false
},
@@ -19082,8 +19680,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": 109249,
- "total_submitted": 150940,
+ "total_acs": 110902,
+ "total_submitted": 153143,
"frontend_question_id": 2357,
"is_new_question": false
},
@@ -19105,8 +19703,8 @@
"question__title": "Shortest Impossible Sequence of Rolls",
"question__title_slug": "shortest-impossible-sequence-of-rolls",
"question__hide": false,
- "total_acs": 14644,
- "total_submitted": 21412,
+ "total_acs": 14798,
+ "total_submitted": 21668,
"frontend_question_id": 2350,
"is_new_question": false
},
@@ -19128,8 +19726,8 @@
"question__title": "Design a Number Container System",
"question__title_slug": "design-a-number-container-system",
"question__hide": false,
- "total_acs": 22854,
- "total_submitted": 51074,
+ "total_acs": 23030,
+ "total_submitted": 51414,
"frontend_question_id": 2349,
"is_new_question": false
},
@@ -19151,8 +19749,8 @@
"question__title": "Best Poker Hand",
"question__title_slug": "best-poker-hand",
"question__hide": false,
- "total_acs": 40588,
- "total_submitted": 67116,
+ "total_acs": 41049,
+ "total_submitted": 67818,
"frontend_question_id": 2347,
"is_new_question": false
},
@@ -19174,8 +19772,8 @@
"question__title": "Number of Zero-Filled Subarrays",
"question__title_slug": "number-of-zero-filled-subarrays",
"question__hide": false,
- "total_acs": 124577,
- "total_submitted": 186756,
+ "total_acs": 125565,
+ "total_submitted": 188177,
"frontend_question_id": 2348,
"is_new_question": false
},
@@ -19197,8 +19795,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": 6707,
- "total_submitted": 17148,
+ "total_acs": 6866,
+ "total_submitted": 17550,
"frontend_question_id": 2292,
"is_new_question": false
},
@@ -19220,8 +19818,8 @@
"question__title": "Number of Excellent Pairs",
"question__title_slug": "number-of-excellent-pairs",
"question__hide": false,
- "total_acs": 14621,
- "total_submitted": 31033,
+ "total_acs": 14768,
+ "total_submitted": 31306,
"frontend_question_id": 2354,
"is_new_question": false
},
@@ -19243,8 +19841,8 @@
"question__title": "Design a Food Rating System",
"question__title_slug": "design-a-food-rating-system",
"question__hide": false,
- "total_acs": 83332,
- "total_submitted": 184178,
+ "total_acs": 83700,
+ "total_submitted": 185009,
"frontend_question_id": 2353,
"is_new_question": false
},
@@ -19266,8 +19864,8 @@
"question__title": "Equal Row and Column Pairs",
"question__title_slug": "equal-row-and-column-pairs",
"question__hide": false,
- "total_acs": 210430,
- "total_submitted": 298680,
+ "total_acs": 217168,
+ "total_submitted": 308365,
"frontend_question_id": 2352,
"is_new_question": false
},
@@ -19289,8 +19887,8 @@
"question__title": "First Letter to Appear Twice",
"question__title_slug": "first-letter-to-appear-twice",
"question__hide": false,
- "total_acs": 116444,
- "total_submitted": 158355,
+ "total_acs": 119087,
+ "total_submitted": 161892,
"frontend_question_id": 2351,
"is_new_question": false
},
@@ -19312,8 +19910,8 @@
"question__title": "Maximum Profit From Trading Stocks",
"question__title_slug": "maximum-profit-from-trading-stocks",
"question__hide": false,
- "total_acs": 8682,
- "total_submitted": 19166,
+ "total_acs": 8929,
+ "total_submitted": 19684,
"frontend_question_id": 2291,
"is_new_question": false
},
@@ -19335,8 +19933,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": 1749,
- "total_submitted": 3623,
+ "total_acs": 1770,
+ "total_submitted": 3668,
"frontend_question_id": 2282,
"is_new_question": false
},
@@ -19358,8 +19956,8 @@
"question__title": "Minimum Deletions to Make Array Divisible",
"question__title_slug": "minimum-deletions-to-make-array-divisible",
"question__hide": false,
- "total_acs": 27438,
- "total_submitted": 48995,
+ "total_acs": 27820,
+ "total_submitted": 49628,
"frontend_question_id": 2344,
"is_new_question": false
},
@@ -19381,8 +19979,8 @@
"question__title": "Query Kth Smallest Trimmed Number",
"question__title_slug": "query-kth-smallest-trimmed-number",
"question__hide": false,
- "total_acs": 29144,
- "total_submitted": 66501,
+ "total_acs": 29460,
+ "total_submitted": 67113,
"frontend_question_id": 2343,
"is_new_question": false
},
@@ -19404,8 +20002,8 @@
"question__title": "Maximum Number of Pairs in Array",
"question__title_slug": "maximum-number-of-pairs-in-array",
"question__hide": false,
- "total_acs": 67588,
- "total_submitted": 89825,
+ "total_acs": 68488,
+ "total_submitted": 91030,
"frontend_question_id": 2341,
"is_new_question": false
},
@@ -19427,8 +20025,8 @@
"question__title": "Closest Node to Path in Tree",
"question__title_slug": "closest-node-to-path-in-tree",
"question__hide": false,
- "total_acs": 4717,
- "total_submitted": 7568,
+ "total_acs": 4814,
+ "total_submitted": 7706,
"frontend_question_id": 2277,
"is_new_question": false
},
@@ -19450,8 +20048,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": 8500,
- "total_submitted": 19851,
+ "total_acs": 8682,
+ "total_submitted": 20226,
"frontend_question_id": 2334,
"is_new_question": false
},
@@ -19473,8 +20071,8 @@
"question__title": "Minimum Sum of Squared Difference",
"question__title_slug": "minimum-sum-of-squared-difference",
"question__hide": false,
- "total_acs": 13959,
- "total_submitted": 54967,
+ "total_acs": 14080,
+ "total_submitted": 55402,
"frontend_question_id": 2333,
"is_new_question": false
},
@@ -19496,8 +20094,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": 23359,
- "total_submitted": 86810,
+ "total_acs": 23852,
+ "total_submitted": 88071,
"frontend_question_id": 2332,
"is_new_question": false
},
@@ -19519,8 +20117,8 @@
"question__title": "Evaluate Boolean Binary Tree",
"question__title_slug": "evaluate-boolean-binary-tree",
"question__hide": false,
- "total_acs": 181996,
- "total_submitted": 219303,
+ "total_acs": 184296,
+ "total_submitted": 222194,
"frontend_question_id": 2331,
"is_new_question": false
},
@@ -19542,8 +20140,8 @@
"question__title": "Count the Number of Ideal Arrays",
"question__title_slug": "count-the-number-of-ideal-arrays",
"question__hide": false,
- "total_acs": 6113,
- "total_submitted": 22805,
+ "total_acs": 6176,
+ "total_submitted": 22990,
"frontend_question_id": 2338,
"is_new_question": false
},
@@ -19565,8 +20163,8 @@
"question__title": "Move Pieces to Obtain a String",
"question__title_slug": "move-pieces-to-obtain-a-string",
"question__hide": false,
- "total_acs": 25227,
- "total_submitted": 53045,
+ "total_acs": 25454,
+ "total_submitted": 53525,
"frontend_question_id": 2337,
"is_new_question": false
},
@@ -19588,8 +20186,8 @@
"question__title": "Smallest Number in Infinite Set",
"question__title_slug": "smallest-number-in-infinite-set",
"question__hide": false,
- "total_acs": 136614,
- "total_submitted": 190512,
+ "total_acs": 139832,
+ "total_submitted": 195021,
"frontend_question_id": 2336,
"is_new_question": false
},
@@ -19611,8 +20209,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": 46855,
- "total_submitted": 81319,
+ "total_acs": 47494,
+ "total_submitted": 82288,
"frontend_question_id": 2335,
"is_new_question": false
},
@@ -19634,8 +20232,8 @@
"question__title": "Spiral Matrix IV",
"question__title_slug": "spiral-matrix-iv",
"question__hide": false,
- "total_acs": 40638,
- "total_submitted": 54104,
+ "total_acs": 41384,
+ "total_submitted": 55039,
"frontend_question_id": 2326,
"is_new_question": false
},
@@ -19657,8 +20255,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": 67105,
- "total_submitted": 114807,
+ "total_acs": 67585,
+ "total_submitted": 115755,
"frontend_question_id": 2328,
"is_new_question": false
},
@@ -19680,8 +20278,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": 23450,
- "total_submitted": 51429,
+ "total_acs": 23714,
+ "total_submitted": 51970,
"frontend_question_id": 2327,
"is_new_question": false
},
@@ -19703,8 +20301,8 @@
"question__title": "Decode the Message",
"question__title_slug": "decode-the-message",
"question__hide": false,
- "total_acs": 97756,
- "total_submitted": 116221,
+ "total_acs": 102471,
+ "total_submitted": 121376,
"frontend_question_id": 2325,
"is_new_question": false
},
@@ -19726,8 +20324,8 @@
"question__title": "Minimum Number of Keypresses",
"question__title_slug": "minimum-number-of-keypresses",
"question__hide": false,
- "total_acs": 25417,
- "total_submitted": 35837,
+ "total_acs": 27233,
+ "total_submitted": 38296,
"frontend_question_id": 2268,
"is_new_question": false
},
@@ -19749,8 +20347,8 @@
"question__title": "Number of Distinct Roll Sequences",
"question__title_slug": "number-of-distinct-roll-sequences",
"question__hide": false,
- "total_acs": 10651,
- "total_submitted": 18703,
+ "total_acs": 10745,
+ "total_submitted": 18847,
"frontend_question_id": 2318,
"is_new_question": false
},
@@ -19772,8 +20370,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": 87375,
- "total_submitted": 177089,
+ "total_acs": 88921,
+ "total_submitted": 180479,
"frontend_question_id": 2316,
"is_new_question": false
},
@@ -19795,8 +20393,8 @@
"question__title": "Maximum XOR After Operations ",
"question__title_slug": "maximum-xor-after-operations",
"question__hide": false,
- "total_acs": 24594,
- "total_submitted": 30975,
+ "total_acs": 24952,
+ "total_submitted": 31384,
"frontend_question_id": 2317,
"is_new_question": false
},
@@ -19818,8 +20416,8 @@
"question__title": "Count Asterisks",
"question__title_slug": "count-asterisks",
"question__hide": false,
- "total_acs": 69855,
- "total_submitted": 84975,
+ "total_acs": 71155,
+ "total_submitted": 86489,
"frontend_question_id": 2315,
"is_new_question": false
},
@@ -19841,8 +20439,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": 7194,
- "total_submitted": 13783,
+ "total_acs": 7285,
+ "total_submitted": 13936,
"frontend_question_id": 2322,
"is_new_question": false
},
@@ -19864,8 +20462,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": 3212,
- "total_submitted": 5410,
+ "total_acs": 3287,
+ "total_submitted": 5552,
"frontend_question_id": 2313,
"is_new_question": false
},
@@ -19887,8 +20485,8 @@
"question__title": "Check if Matrix Is X-Matrix",
"question__title_slug": "check-if-matrix-is-x-matrix",
"question__hide": false,
- "total_acs": 51838,
- "total_submitted": 79507,
+ "total_acs": 52373,
+ "total_submitted": 80311,
"frontend_question_id": 2319,
"is_new_question": false
},
@@ -19910,8 +20508,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": 26915,
- "total_submitted": 64425,
+ "total_acs": 27147,
+ "total_submitted": 64909,
"frontend_question_id": 2320,
"is_new_question": false
},
@@ -19933,8 +20531,8 @@
"question__title": "Design Video Sharing Platform",
"question__title_slug": "design-video-sharing-platform",
"question__hide": false,
- "total_acs": 3246,
- "total_submitted": 5044,
+ "total_acs": 3322,
+ "total_submitted": 5162,
"frontend_question_id": 2254,
"is_new_question": false
},
@@ -19956,8 +20554,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": 21861,
- "total_submitted": 57806,
+ "total_acs": 22069,
+ "total_submitted": 58222,
"frontend_question_id": 2311,
"is_new_question": false
},
@@ -19979,8 +20577,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": 28086,
- "total_submitted": 51557,
+ "total_acs": 29030,
+ "total_submitted": 53096,
"frontend_question_id": 2302,
"is_new_question": false
},
@@ -20002,8 +20600,8 @@
"question__title": "Match Substring After Replacement",
"question__title_slug": "match-substring-after-replacement",
"question__hide": false,
- "total_acs": 14051,
- "total_submitted": 34440,
+ "total_acs": 14148,
+ "total_submitted": 34649,
"frontend_question_id": 2301,
"is_new_question": false
},
@@ -20025,8 +20623,8 @@
"question__title": "Successful Pairs of Spells and Potions",
"question__title_slug": "successful-pairs-of-spells-and-potions",
"question__hide": false,
- "total_acs": 149363,
- "total_submitted": 347890,
+ "total_acs": 154497,
+ "total_submitted": 358145,
"frontend_question_id": 2300,
"is_new_question": false
},
@@ -20048,8 +20646,8 @@
"question__title": "Strong Password Checker II",
"question__title_slug": "strong-password-checker-ii",
"question__hide": false,
- "total_acs": 41128,
- "total_submitted": 75099,
+ "total_acs": 41675,
+ "total_submitted": 76019,
"frontend_question_id": 2299,
"is_new_question": false
},
@@ -20071,8 +20669,8 @@
"question__title": "Naming a Company",
"question__title_slug": "naming-a-company",
"question__hide": false,
- "total_acs": 60221,
- "total_submitted": 129639,
+ "total_acs": 60412,
+ "total_submitted": 130056,
"frontend_question_id": 2306,
"is_new_question": false
},
@@ -20094,8 +20692,8 @@
"question__title": "Design a Text Editor",
"question__title_slug": "design-a-text-editor",
"question__hide": false,
- "total_acs": 23745,
- "total_submitted": 53305,
+ "total_acs": 24251,
+ "total_submitted": 54154,
"frontend_question_id": 2296,
"is_new_question": false
},
@@ -20117,8 +20715,8 @@
"question__title": "Replace Elements in an Array",
"question__title_slug": "replace-elements-in-an-array",
"question__hide": false,
- "total_acs": 35350,
- "total_submitted": 61038,
+ "total_acs": 35614,
+ "total_submitted": 61496,
"frontend_question_id": 2295,
"is_new_question": false
},
@@ -20140,8 +20738,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": 40974,
- "total_submitted": 55726,
+ "total_acs": 42185,
+ "total_submitted": 57196,
"frontend_question_id": 2294,
"is_new_question": false
},
@@ -20163,8 +20761,8 @@
"question__title": "Min Max Game",
"question__title_slug": "min-max-game",
"question__hide": false,
- "total_acs": 47547,
- "total_submitted": 75405,
+ "total_acs": 48106,
+ "total_submitted": 76234,
"frontend_question_id": 2293,
"is_new_question": false
},
@@ -20186,8 +20784,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": 3021,
- "total_submitted": 4739,
+ "total_acs": 3069,
+ "total_submitted": 4809,
"frontend_question_id": 2237,
"is_new_question": false
},
@@ -20209,8 +20807,8 @@
"question__title": "Root Equals Sum of Children",
"question__title_slug": "root-equals-sum-of-children",
"question__hide": false,
- "total_acs": 222585,
- "total_submitted": 263996,
+ "total_acs": 227376,
+ "total_submitted": 269539,
"frontend_question_id": 2236,
"is_new_question": false
},
@@ -20232,8 +20830,8 @@
"question__title": "Add Two Integers",
"question__title_slug": "add-two-integers",
"question__hide": false,
- "total_acs": 501227,
- "total_submitted": 571244,
+ "total_acs": 512382,
+ "total_submitted": 583590,
"frontend_question_id": 2235,
"is_new_question": false
},
@@ -20255,8 +20853,8 @@
"question__title": "Dynamic Unpivoting of a Table",
"question__title_slug": "dynamic-unpivoting-of-a-table",
"question__hide": false,
- "total_acs": 898,
- "total_submitted": 1323,
+ "total_acs": 915,
+ "total_submitted": 1362,
"frontend_question_id": 2253,
"is_new_question": false
},
@@ -20278,8 +20876,8 @@
"question__title": "Dynamic Pivoting of a Table",
"question__title_slug": "dynamic-pivoting-of-a-table",
"question__hide": false,
- "total_acs": 1515,
- "total_submitted": 2724,
+ "total_acs": 1534,
+ "total_submitted": 2751,
"frontend_question_id": 2252,
"is_new_question": false
},
@@ -20301,8 +20899,8 @@
"question__title": "Booking Concert Tickets in Groups",
"question__title_slug": "booking-concert-tickets-in-groups",
"question__hide": false,
- "total_acs": 6600,
- "total_submitted": 38215,
+ "total_acs": 6803,
+ "total_submitted": 38636,
"frontend_question_id": 2286,
"is_new_question": false
},
@@ -20324,8 +20922,8 @@
"question__title": "Maximum Total Importance of Roads",
"question__title_slug": "maximum-total-importance-of-roads",
"question__hide": false,
- "total_acs": 33220,
- "total_submitted": 54453,
+ "total_acs": 33640,
+ "total_submitted": 55062,
"frontend_question_id": 2285,
"is_new_question": false
},
@@ -20347,8 +20945,8 @@
"question__title": "Sender With Largest Word Count",
"question__title_slug": "sender-with-largest-word-count",
"question__hide": false,
- "total_acs": 33326,
- "total_submitted": 58740,
+ "total_acs": 33615,
+ "total_submitted": 59189,
"frontend_question_id": 2284,
"is_new_question": false
},
@@ -20370,8 +20968,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": 56327,
- "total_submitted": 78079,
+ "total_acs": 57234,
+ "total_submitted": 79268,
"frontend_question_id": 2283,
"is_new_question": false
},
@@ -20393,8 +20991,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": 7576,
- "total_submitted": 10669,
+ "total_acs": 7712,
+ "total_submitted": 10851,
"frontend_question_id": 2238,
"is_new_question": false
},
@@ -20416,8 +21014,8 @@
"question__title": "Minimum Obstacle Removal to Reach Corner",
"question__title_slug": "minimum-obstacle-removal-to-reach-corner",
"question__hide": false,
- "total_acs": 24531,
- "total_submitted": 45763,
+ "total_acs": 25452,
+ "total_submitted": 47169,
"frontend_question_id": 2290,
"is_new_question": false
},
@@ -20439,8 +21037,8 @@
"question__title": "Steps to Make Array Non-decreasing",
"question__title_slug": "steps-to-make-array-non-decreasing",
"question__hide": false,
- "total_acs": 20917,
- "total_submitted": 96046,
+ "total_acs": 21282,
+ "total_submitted": 97109,
"frontend_question_id": 2289,
"is_new_question": false
},
@@ -20462,8 +21060,8 @@
"question__title": "Apply Discount to Prices",
"question__title_slug": "apply-discount-to-prices",
"question__hide": false,
- "total_acs": 22702,
- "total_submitted": 75227,
+ "total_acs": 23503,
+ "total_submitted": 76699,
"frontend_question_id": 2288,
"is_new_question": false
},
@@ -20485,8 +21083,8 @@
"question__title": "Rearrange Characters to Make Target String",
"question__title_slug": "rearrange-characters-to-make-target-string",
"question__hide": false,
- "total_acs": 40302,
- "total_submitted": 68275,
+ "total_acs": 40700,
+ "total_submitted": 68867,
"frontend_question_id": 2287,
"is_new_question": false
},
@@ -20508,8 +21106,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": 5201,
- "total_submitted": 10461,
+ "total_acs": 5273,
+ "total_submitted": 10585,
"frontend_question_id": 2230,
"is_new_question": false
},
@@ -20531,8 +21129,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": 7832,
- "total_submitted": 17533,
+ "total_acs": 7985,
+ "total_submitted": 17876,
"frontend_question_id": 2228,
"is_new_question": false
},
@@ -20554,8 +21152,8 @@
"question__title": "Maximum Sum Score of Array",
"question__title_slug": "maximum-sum-score-of-array",
"question__hide": false,
- "total_acs": 4050,
- "total_submitted": 6520,
+ "total_acs": 4124,
+ "total_submitted": 6629,
"frontend_question_id": 2219,
"is_new_question": false
},
@@ -20577,8 +21175,8 @@
"question__title": "Sum of Total Strength of Wizards",
"question__title_slug": "sum-of-total-strength-of-wizards",
"question__hide": false,
- "total_acs": 19122,
- "total_submitted": 68691,
+ "total_acs": 19446,
+ "total_submitted": 69864,
"frontend_question_id": 2281,
"is_new_question": false
},
@@ -20600,8 +21198,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": 26003,
- "total_submitted": 103269,
+ "total_acs": 26273,
+ "total_submitted": 104129,
"frontend_question_id": 2280,
"is_new_question": false
},
@@ -20623,8 +21221,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": 94016,
- "total_submitted": 139373,
+ "total_acs": 94745,
+ "total_submitted": 140410,
"frontend_question_id": 2279,
"is_new_question": false
},
@@ -20646,8 +21244,8 @@
"question__title": "Percentage of Letter in String",
"question__title_slug": "percentage-of-letter-in-string",
"question__hide": false,
- "total_acs": 72458,
- "total_submitted": 97920,
+ "total_acs": 73461,
+ "total_submitted": 99224,
"frontend_question_id": 2278,
"is_new_question": false
},
@@ -20669,8 +21267,8 @@
"question__title": "Longest Path With Different Adjacent Characters",
"question__title_slug": "longest-path-with-different-adjacent-characters",
"question__hide": false,
- "total_acs": 72472,
- "total_submitted": 132774,
+ "total_acs": 72960,
+ "total_submitted": 133686,
"frontend_question_id": 2246,
"is_new_question": false
},
@@ -20692,8 +21290,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": 7933,
- "total_submitted": 22053,
+ "total_acs": 8003,
+ "total_submitted": 22181,
"frontend_question_id": 2245,
"is_new_question": false
},
@@ -20715,8 +21313,8 @@
"question__title": "Minimum Rounds to Complete All Tasks",
"question__title_slug": "minimum-rounds-to-complete-all-tasks",
"question__hide": false,
- "total_acs": 150233,
- "total_submitted": 238800,
+ "total_acs": 150911,
+ "total_submitted": 239892,
"frontend_question_id": 2244,
"is_new_question": false
},
@@ -20738,8 +21336,8 @@
"question__title": "Calculate Digit Sum of a String",
"question__title_slug": "calculate-digit-sum-of-a-string",
"question__hide": false,
- "total_acs": 38827,
- "total_submitted": 58887,
+ "total_acs": 39288,
+ "total_submitted": 59515,
"frontend_question_id": 2243,
"is_new_question": false
},
@@ -20761,8 +21359,8 @@
"question__title": "Substring With Largest Variance",
"question__title_slug": "substring-with-largest-variance",
"question__hide": false,
- "total_acs": 67976,
- "total_submitted": 146961,
+ "total_acs": 68231,
+ "total_submitted": 147535,
"frontend_question_id": 2272,
"is_new_question": false
},
@@ -20784,8 +21382,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": 16297,
- "total_submitted": 48404,
+ "total_acs": 16415,
+ "total_submitted": 48726,
"frontend_question_id": 2271,
"is_new_question": false
},
@@ -20807,8 +21405,8 @@
"question__title": "Number of Ways to Split Array",
"question__title_slug": "number-of-ways-to-split-array",
"question__hide": false,
- "total_acs": 39946,
- "total_submitted": 83919,
+ "total_acs": 41024,
+ "total_submitted": 85889,
"frontend_question_id": 2270,
"is_new_question": false
},
@@ -20830,8 +21428,8 @@
"question__title": "Count Integers in Intervals",
"question__title_slug": "count-integers-in-intervals",
"question__hide": false,
- "total_acs": 17738,
- "total_submitted": 50376,
+ "total_acs": 17989,
+ "total_submitted": 50963,
"frontend_question_id": 2276,
"is_new_question": false
},
@@ -20853,8 +21451,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": 26677,
- "total_submitted": 36701,
+ "total_acs": 27090,
+ "total_submitted": 37246,
"frontend_question_id": 2275,
"is_new_question": false
},
@@ -20876,8 +21474,8 @@
"question__title": "Maximum Consecutive Floors Without Special Floors",
"question__title_slug": "maximum-consecutive-floors-without-special-floors",
"question__hide": false,
- "total_acs": 31709,
- "total_submitted": 61256,
+ "total_acs": 32000,
+ "total_submitted": 61783,
"frontend_question_id": 2274,
"is_new_question": false
},
@@ -20899,8 +21497,8 @@
"question__title": "Minimum Health to Beat Game",
"question__title_slug": "minimum-health-to-beat-game",
"question__hide": false,
- "total_acs": 30824,
- "total_submitted": 53470,
+ "total_acs": 30968,
+ "total_submitted": 53737,
"frontend_question_id": 2214,
"is_new_question": false
},
@@ -20922,8 +21520,8 @@
"question__title": "Maximum Score of a Node Sequence",
"question__title_slug": "maximum-score-of-a-node-sequence",
"question__hide": false,
- "total_acs": 11807,
- "total_submitted": 30814,
+ "total_acs": 11986,
+ "total_submitted": 31128,
"frontend_question_id": 2242,
"is_new_question": false
},
@@ -20945,8 +21543,8 @@
"question__title": "Design an ATM Machine",
"question__title_slug": "design-an-atm-machine",
"question__hide": false,
- "total_acs": 20976,
- "total_submitted": 50650,
+ "total_acs": 21315,
+ "total_submitted": 51241,
"frontend_question_id": 2241,
"is_new_question": false
},
@@ -20968,8 +21566,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": 26905,
- "total_submitted": 47221,
+ "total_acs": 27191,
+ "total_submitted": 47673,
"frontend_question_id": 2240,
"is_new_question": false
},
@@ -20991,8 +21589,8 @@
"question__title": "Find Closest Number to Zero",
"question__title_slug": "find-closest-number-to-zero",
"question__hide": false,
- "total_acs": 57838,
- "total_submitted": 128913,
+ "total_acs": 58834,
+ "total_submitted": 130948,
"frontend_question_id": 2239,
"is_new_question": false
},
@@ -21014,8 +21612,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": 15286,
- "total_submitted": 39599,
+ "total_acs": 15452,
+ "total_submitted": 39933,
"frontend_question_id": 2267,
"is_new_question": false
},
@@ -21037,8 +21635,8 @@
"question__title": "Count Number of Texts",
"question__title_slug": "count-number-of-texts",
"question__hide": false,
- "total_acs": 20028,
- "total_submitted": 41979,
+ "total_acs": 20314,
+ "total_submitted": 42529,
"frontend_question_id": 2266,
"is_new_question": false
},
@@ -21060,8 +21658,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": 144798,
- "total_submitted": 167814,
+ "total_acs": 147028,
+ "total_submitted": 170371,
"frontend_question_id": 2265,
"is_new_question": false
},
@@ -21083,8 +21681,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": 144235,
- "total_submitted": 209115,
+ "total_acs": 145782,
+ "total_submitted": 211324,
"frontend_question_id": 2264,
"is_new_question": false
},
@@ -21106,8 +21704,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": 41259,
- "total_submitted": 63367,
+ "total_acs": 41700,
+ "total_submitted": 63992,
"frontend_question_id": 2224,
"is_new_question": false
},
@@ -21129,8 +21727,8 @@
"question__title": "Escape the Spreading Fire",
"question__title_slug": "escape-the-spreading-fire",
"question__hide": false,
- "total_acs": 10717,
- "total_submitted": 30442,
+ "total_acs": 10922,
+ "total_submitted": 31084,
"frontend_question_id": 2258,
"is_new_question": false
},
@@ -21152,8 +21750,8 @@
"question__title": "Count Unguarded Cells in the Grid",
"question__title_slug": "count-unguarded-cells-in-the-grid",
"question__hide": false,
- "total_acs": 16521,
- "total_submitted": 31495,
+ "total_acs": 16690,
+ "total_submitted": 31782,
"frontend_question_id": 2257,
"is_new_question": false
},
@@ -21175,8 +21773,8 @@
"question__title": "Minimum Average Difference",
"question__title_slug": "minimum-average-difference",
"question__hide": false,
- "total_acs": 83959,
- "total_submitted": 194744,
+ "total_acs": 84664,
+ "total_submitted": 196243,
"frontend_question_id": 2256,
"is_new_question": false
},
@@ -21198,8 +21796,8 @@
"question__title": "Count Prefixes of a Given String",
"question__title_slug": "count-prefixes-of-a-given-string",
"question__hide": false,
- "total_acs": 60665,
- "total_submitted": 83599,
+ "total_acs": 61622,
+ "total_submitted": 84892,
"frontend_question_id": 2255,
"is_new_question": false
},
@@ -21221,8 +21819,8 @@
"question__title": "Total Appeal of A String",
"question__title_slug": "total-appeal-of-a-string",
"question__hide": false,
- "total_acs": 32405,
- "total_submitted": 58348,
+ "total_acs": 32921,
+ "total_submitted": 59258,
"frontend_question_id": 2262,
"is_new_question": false
},
@@ -21244,8 +21842,8 @@
"question__title": "K Divisible Elements Subarrays",
"question__title_slug": "k-divisible-elements-subarrays",
"question__hide": false,
- "total_acs": 32171,
- "total_submitted": 62835,
+ "total_acs": 33326,
+ "total_submitted": 64676,
"frontend_question_id": 2261,
"is_new_question": false
},
@@ -21267,8 +21865,8 @@
"question__title": "Minimum Consecutive Cards to Pick Up",
"question__title_slug": "minimum-consecutive-cards-to-pick-up",
"question__hide": false,
- "total_acs": 70753,
- "total_submitted": 137991,
+ "total_acs": 72574,
+ "total_submitted": 141444,
"frontend_question_id": 2260,
"is_new_question": false
},
@@ -21290,8 +21888,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": 81884,
- "total_submitted": 180825,
+ "total_acs": 83832,
+ "total_submitted": 184634,
"frontend_question_id": 2259,
"is_new_question": false
},
@@ -21313,8 +21911,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": 6017,
- "total_submitted": 12085,
+ "total_acs": 6084,
+ "total_submitted": 12215,
"frontend_question_id": 2205,
"is_new_question": false
},
@@ -21336,8 +21934,8 @@
"question__title": "Finding the Topic of Each Post",
"question__title_slug": "finding-the-topic-of-each-post",
"question__hide": false,
- "total_acs": 2995,
- "total_submitted": 6168,
+ "total_acs": 3047,
+ "total_submitted": 6264,
"frontend_question_id": 2199,
"is_new_question": false
},
@@ -21359,8 +21957,8 @@
"question__title": "Number of Flowers in Full Bloom",
"question__title_slug": "number-of-flowers-in-full-bloom",
"question__hide": false,
- "total_acs": 79138,
- "total_submitted": 139595,
+ "total_acs": 79848,
+ "total_submitted": 140735,
"frontend_question_id": 2251,
"is_new_question": false
},
@@ -21382,8 +21980,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": 15898,
- "total_submitted": 45826,
+ "total_acs": 16392,
+ "total_submitted": 46714,
"frontend_question_id": 2250,
"is_new_question": false
},
@@ -21405,8 +22003,8 @@
"question__title": "Count Lattice Points Inside a Circle",
"question__title_slug": "count-lattice-points-inside-a-circle",
"question__hide": false,
- "total_acs": 23925,
- "total_submitted": 45462,
+ "total_acs": 24227,
+ "total_submitted": 45890,
"frontend_question_id": 2249,
"is_new_question": false
},
@@ -21428,8 +22026,8 @@
"question__title": "Intersection of Multiple Arrays",
"question__title_slug": "intersection-of-multiple-arrays",
"question__hide": false,
- "total_acs": 78086,
- "total_submitted": 114850,
+ "total_acs": 79999,
+ "total_submitted": 117516,
"frontend_question_id": 2248,
"is_new_question": false
},
@@ -21451,8 +22049,8 @@
"question__title": "Maximum Total Beauty of the Gardens",
"question__title_slug": "maximum-total-beauty-of-the-gardens",
"question__hide": false,
- "total_acs": 7138,
- "total_submitted": 24352,
+ "total_acs": 7212,
+ "total_submitted": 24567,
"frontend_question_id": 2234,
"is_new_question": false
},
@@ -21474,8 +22072,8 @@
"question__title": "Maximum Product After K Increments",
"question__title_slug": "maximum-product-after-k-increments",
"question__hide": false,
- "total_acs": 29870,
- "total_submitted": 72205,
+ "total_acs": 32500,
+ "total_submitted": 78115,
"frontend_question_id": 2233,
"is_new_question": false
},
@@ -21497,8 +22095,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": 20291,
- "total_submitted": 30160,
+ "total_acs": 20518,
+ "total_submitted": 30442,
"frontend_question_id": 2232,
"is_new_question": false
},
@@ -21520,8 +22118,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": 42894,
- "total_submitted": 69695,
+ "total_acs": 43433,
+ "total_submitted": 70477,
"frontend_question_id": 2231,
"is_new_question": false
},
@@ -21543,8 +22141,8 @@
"question__title": "Sum of Scores of Built Strings",
"question__title_slug": "sum-of-scores-of-built-strings",
"question__hide": false,
- "total_acs": 8043,
- "total_submitted": 20152,
+ "total_acs": 8140,
+ "total_submitted": 20356,
"frontend_question_id": 2223,
"is_new_question": false
},
@@ -21566,8 +22164,8 @@
"question__title": "Number of Ways to Select Buildings",
"question__title_slug": "number-of-ways-to-select-buildings",
"question__hide": false,
- "total_acs": 35634,
- "total_submitted": 70431,
+ "total_acs": 36144,
+ "total_submitted": 71400,
"frontend_question_id": 2222,
"is_new_question": false
},
@@ -21589,8 +22187,8 @@
"question__title": "Find Triangular Sum of an Array",
"question__title_slug": "find-triangular-sum-of-an-array",
"question__hide": false,
- "total_acs": 77867,
- "total_submitted": 98921,
+ "total_acs": 78820,
+ "total_submitted": 100137,
"frontend_question_id": 2221,
"is_new_question": false
},
@@ -21612,8 +22210,8 @@
"question__title": "Minimum Bit Flips to Convert Number",
"question__title_slug": "minimum-bit-flips-to-convert-number",
"question__hide": false,
- "total_acs": 83491,
- "total_submitted": 98985,
+ "total_acs": 89041,
+ "total_submitted": 105147,
"frontend_question_id": 2220,
"is_new_question": false
},
@@ -21635,8 +22233,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": 7277,
- "total_submitted": 14755,
+ "total_acs": 7664,
+ "total_submitted": 15525,
"frontend_question_id": 2184,
"is_new_question": false
},
@@ -21658,8 +22256,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": 11714,
- "total_submitted": 31738,
+ "total_acs": 11820,
+ "total_submitted": 32007,
"frontend_question_id": 2203,
"is_new_question": false
},
@@ -21681,8 +22279,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": 39116,
- "total_submitted": 59544,
+ "total_acs": 39588,
+ "total_submitted": 60160,
"frontend_question_id": 2200,
"is_new_question": false
},
@@ -21704,8 +22302,8 @@
"question__title": "Longest Substring of One Repeating Character",
"question__title_slug": "longest-substring-of-one-repeating-character",
"question__hide": false,
- "total_acs": 4643,
- "total_submitted": 14461,
+ "total_acs": 4704,
+ "total_submitted": 14641,
"frontend_question_id": 2213,
"is_new_question": false
},
@@ -21727,8 +22325,8 @@
"question__title": "Maximum Points in an Archery Competition",
"question__title_slug": "maximum-points-in-an-archery-competition",
"question__hide": false,
- "total_acs": 15231,
- "total_submitted": 30510,
+ "total_acs": 15349,
+ "total_submitted": 30716,
"frontend_question_id": 2212,
"is_new_question": false
},
@@ -21750,8 +22348,8 @@
"question__title": "Count Collisions on a Road",
"question__title_slug": "count-collisions-on-a-road",
"question__hide": false,
- "total_acs": 27592,
- "total_submitted": 63057,
+ "total_acs": 27912,
+ "total_submitted": 63755,
"frontend_question_id": 2211,
"is_new_question": false
},
@@ -21773,8 +22371,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": 47649,
- "total_submitted": 78760,
+ "total_acs": 48830,
+ "total_submitted": 80443,
"frontend_question_id": 2210,
"is_new_question": false
},
@@ -21796,8 +22394,8 @@
"question__title": "The Change in Global Rankings",
"question__title_slug": "the-change-in-global-rankings",
"question__hide": false,
- "total_acs": 6133,
- "total_submitted": 10146,
+ "total_acs": 6213,
+ "total_submitted": 10259,
"frontend_question_id": 2175,
"is_new_question": false
},
@@ -21819,8 +22417,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": 4960,
- "total_submitted": 7334,
+ "total_acs": 4978,
+ "total_submitted": 7361,
"frontend_question_id": 2174,
"is_new_question": false
},
@@ -21842,8 +22440,8 @@
"question__title": "Longest Winning Streak",
"question__title_slug": "longest-winning-streak",
"question__hide": false,
- "total_acs": 4393,
- "total_submitted": 8401,
+ "total_acs": 4487,
+ "total_submitted": 8520,
"frontend_question_id": 2173,
"is_new_question": false
},
@@ -21865,8 +22463,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": 35448,
- "total_submitted": 60137,
+ "total_acs": 35869,
+ "total_submitted": 60870,
"frontend_question_id": 2190,
"is_new_question": false
},
@@ -21888,8 +22486,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": 11911,
- "total_submitted": 32794,
+ "total_acs": 12074,
+ "total_submitted": 33080,
"frontend_question_id": 2209,
"is_new_question": false
},
@@ -21911,8 +22509,8 @@
"question__title": "Minimum Operations to Halve Array Sum",
"question__title_slug": "minimum-operations-to-halve-array-sum",
"question__hide": false,
- "total_acs": 29783,
- "total_submitted": 64011,
+ "total_acs": 30339,
+ "total_submitted": 65031,
"frontend_question_id": 2208,
"is_new_question": false
},
@@ -21934,8 +22532,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": 19115,
- "total_submitted": 55278,
+ "total_acs": 19265,
+ "total_submitted": 55593,
"frontend_question_id": 2207,
"is_new_question": false
},
@@ -21957,8 +22555,8 @@
"question__title": "Divide Array Into Equal Pairs",
"question__title_slug": "divide-array-into-equal-pairs",
"question__hide": false,
- "total_acs": 78942,
- "total_submitted": 107504,
+ "total_acs": 80187,
+ "total_submitted": 109141,
"frontend_question_id": 2206,
"is_new_question": false
},
@@ -21980,8 +22578,8 @@
"question__title": "Replace Non-Coprime Numbers in Array",
"question__title_slug": "replace-non-coprime-numbers-in-array",
"question__hide": false,
- "total_acs": 14041,
- "total_submitted": 36163,
+ "total_acs": 14157,
+ "total_submitted": 36402,
"frontend_question_id": 2197,
"is_new_question": false
},
@@ -22003,8 +22601,8 @@
"question__title": "Create Binary Tree From Descriptions",
"question__title_slug": "create-binary-tree-from-descriptions",
"question__hide": false,
- "total_acs": 33983,
- "total_submitted": 46825,
+ "total_acs": 34374,
+ "total_submitted": 47299,
"frontend_question_id": 2196,
"is_new_question": false
},
@@ -22026,8 +22624,8 @@
"question__title": "Append K Integers With Minimal Sum",
"question__title_slug": "append-k-integers-with-minimal-sum",
"question__hide": false,
- "total_acs": 31771,
- "total_submitted": 125328,
+ "total_acs": 32077,
+ "total_submitted": 126277,
"frontend_question_id": 2195,
"is_new_question": false
},
@@ -22049,8 +22647,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": 69260,
- "total_submitted": 82507,
+ "total_acs": 70206,
+ "total_submitted": 83579,
"frontend_question_id": 2194,
"is_new_question": false
},
@@ -22072,8 +22670,8 @@
"question__title": "Unique Substrings With Equal Digit Frequency",
"question__title_slug": "unique-substrings-with-equal-digit-frequency",
"question__hide": false,
- "total_acs": 2587,
- "total_submitted": 4335,
+ "total_acs": 2637,
+ "total_submitted": 4401,
"frontend_question_id": 2168,
"is_new_question": false
},
@@ -22095,8 +22693,8 @@
"question__title": "Order Two Columns Independently",
"question__title_slug": "order-two-columns-independently",
"question__hide": false,
- "total_acs": 7604,
- "total_submitted": 12660,
+ "total_acs": 7690,
+ "total_submitted": 12812,
"frontend_question_id": 2159,
"is_new_question": false
},
@@ -22118,8 +22716,8 @@
"question__title": "Count Array Pairs Divisible by K",
"question__title_slug": "count-array-pairs-divisible-by-k",
"question__hide": false,
- "total_acs": 16267,
- "total_submitted": 54981,
+ "total_acs": 16539,
+ "total_submitted": 55991,
"frontend_question_id": 2183,
"is_new_question": false
},
@@ -22141,8 +22739,8 @@
"question__title": "Construct String With Repeat Limit",
"question__title_slug": "construct-string-with-repeat-limit",
"question__hide": false,
- "total_acs": 21635,
- "total_submitted": 40068,
+ "total_acs": 21901,
+ "total_submitted": 40466,
"frontend_question_id": 2182,
"is_new_question": false
},
@@ -22164,8 +22762,8 @@
"question__title": "Merge Nodes in Between Zeros",
"question__title_slug": "merge-nodes-in-between-zeros",
"question__hide": false,
- "total_acs": 114686,
- "total_submitted": 133727,
+ "total_acs": 116830,
+ "total_submitted": 136113,
"frontend_question_id": 2181,
"is_new_question": false
},
@@ -22187,8 +22785,8 @@
"question__title": "Count Integers With Even Digit Sum",
"question__title_slug": "count-integers-with-even-digit-sum",
"question__hide": false,
- "total_acs": 59945,
- "total_submitted": 89551,
+ "total_acs": 60724,
+ "total_submitted": 90617,
"frontend_question_id": 2180,
"is_new_question": false
},
@@ -22210,8 +22808,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": 29546,
- "total_submitted": 53509,
+ "total_acs": 29733,
+ "total_submitted": 53810,
"frontend_question_id": 2158,
"is_new_question": false
},
@@ -22233,8 +22831,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": 2918,
- "total_submitted": 7300,
+ "total_acs": 2951,
+ "total_submitted": 7352,
"frontend_question_id": 2153,
"is_new_question": false
},
@@ -22256,8 +22854,8 @@
"question__title": "Minimum Time to Finish the Race",
"question__title_slug": "minimum-time-to-finish-the-race",
"question__hide": false,
- "total_acs": 11658,
- "total_submitted": 28046,
+ "total_acs": 11750,
+ "total_submitted": 28246,
"frontend_question_id": 2188,
"is_new_question": false
},
@@ -22279,8 +22877,8 @@
"question__title": "Minimum Time to Complete Trips",
"question__title_slug": "minimum-time-to-complete-trips",
"question__hide": false,
- "total_acs": 113204,
- "total_submitted": 291536,
+ "total_acs": 114509,
+ "total_submitted": 294961,
"frontend_question_id": 2187,
"is_new_question": false
},
@@ -22302,8 +22900,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": 42416,
- "total_submitted": 58443,
+ "total_acs": 42825,
+ "total_submitted": 58991,
"frontend_question_id": 2186,
"is_new_question": false
},
@@ -22325,8 +22923,8 @@
"question__title": "Counting Words With a Given Prefix",
"question__title_slug": "counting-words-with-a-given-prefix",
"question__hide": false,
- "total_acs": 93935,
- "total_submitted": 120401,
+ "total_acs": 95516,
+ "total_submitted": 122321,
"frontend_question_id": 2185,
"is_new_question": false
},
@@ -22348,8 +22946,8 @@
"question__title": "Maximum AND Sum of Array",
"question__title_slug": "maximum-and-sum-of-array",
"question__hide": false,
- "total_acs": 13532,
- "total_submitted": 27686,
+ "total_acs": 13646,
+ "total_submitted": 27866,
"frontend_question_id": 2172,
"is_new_question": false
},
@@ -22371,8 +22969,8 @@
"question__title": "Removing Minimum Number of Magic Beans",
"question__title_slug": "removing-minimum-number-of-magic-beans",
"question__hide": false,
- "total_acs": 26181,
- "total_submitted": 61284,
+ "total_acs": 26492,
+ "total_submitted": 61934,
"frontend_question_id": 2171,
"is_new_question": false
},
@@ -22394,8 +22992,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": 22134,
- "total_submitted": 66462,
+ "total_acs": 22272,
+ "total_submitted": 66837,
"frontend_question_id": 2170,
"is_new_question": false
},
@@ -22417,8 +23015,8 @@
"question__title": "Count Operations to Obtain Zero",
"question__title_slug": "count-operations-to-obtain-zero",
"question__hide": false,
- "total_acs": 73000,
- "total_submitted": 98115,
+ "total_acs": 73952,
+ "total_submitted": 99324,
"frontend_question_id": 2169,
"is_new_question": false
},
@@ -22440,8 +23038,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": 1969,
- "total_submitted": 4435,
+ "total_acs": 1978,
+ "total_submitted": 4467,
"frontend_question_id": 2152,
"is_new_question": false
},
@@ -22463,8 +23061,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": 12182,
- "total_submitted": 29519,
+ "total_acs": 12388,
+ "total_submitted": 30009,
"frontend_question_id": 2167,
"is_new_question": false
},
@@ -22486,8 +23084,8 @@
"question__title": "Design Bitset",
"question__title_slug": "design-bitset",
"question__hide": false,
- "total_acs": 22548,
- "total_submitted": 69539,
+ "total_acs": 22673,
+ "total_submitted": 69875,
"frontend_question_id": 2166,
"is_new_question": false
},
@@ -22509,8 +23107,8 @@
"question__title": "Smallest Value of the Rearranged Number",
"question__title_slug": "smallest-value-of-the-rearranged-number",
"question__hide": false,
- "total_acs": 35114,
- "total_submitted": 67459,
+ "total_acs": 35401,
+ "total_submitted": 67983,
"frontend_question_id": 2165,
"is_new_question": false
},
@@ -22532,8 +23130,8 @@
"question__title": "Sort Even and Odd Indices Independently",
"question__title_slug": "sort-even-and-odd-indices-independently",
"question__hide": false,
- "total_acs": 60658,
- "total_submitted": 96844,
+ "total_acs": 61551,
+ "total_submitted": 98304,
"frontend_question_id": 2164,
"is_new_question": false
},
@@ -22555,8 +23153,8 @@
"question__title": "Choose Numbers From Two Arrays in Range",
"question__title_slug": "choose-numbers-from-two-arrays-in-range",
"question__hide": false,
- "total_acs": 1019,
- "total_submitted": 2009,
+ "total_acs": 1033,
+ "total_submitted": 2028,
"frontend_question_id": 2143,
"is_new_question": false
},
@@ -22578,8 +23176,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": 8759,
- "total_submitted": 18214,
+ "total_acs": 8854,
+ "total_submitted": 18377,
"frontend_question_id": 2142,
"is_new_question": false
},
@@ -22601,8 +23199,8 @@
"question__title": "Count Good Triplets in an Array",
"question__title_slug": "count-good-triplets-in-an-array",
"question__hide": false,
- "total_acs": 7998,
- "total_submitted": 19546,
+ "total_acs": 8081,
+ "total_submitted": 19697,
"frontend_question_id": 2179,
"is_new_question": false
},
@@ -22624,8 +23222,8 @@
"question__title": "Maximum Split of Positive Even Integers",
"question__title_slug": "maximum-split-of-positive-even-integers",
"question__hide": false,
- "total_acs": 45401,
- "total_submitted": 76687,
+ "total_acs": 45703,
+ "total_submitted": 77205,
"frontend_question_id": 2178,
"is_new_question": false
},
@@ -22647,8 +23245,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": 45949,
- "total_submitted": 71311,
+ "total_acs": 46513,
+ "total_submitted": 72110,
"frontend_question_id": 2177,
"is_new_question": false
},
@@ -22670,8 +23268,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": 76050,
- "total_submitted": 95702,
+ "total_acs": 77157,
+ "total_submitted": 97077,
"frontend_question_id": 2176,
"is_new_question": false
},
@@ -22693,8 +23291,8 @@
"question__title": "Groups of Strings",
"question__title_slug": "groups-of-strings",
"question__hide": false,
- "total_acs": 9327,
- "total_submitted": 35772,
+ "total_acs": 9402,
+ "total_submitted": 36019,
"frontend_question_id": 2157,
"is_new_question": false
},
@@ -22716,8 +23314,8 @@
"question__title": "Find Substring With Given Hash Value",
"question__title_slug": "find-substring-with-given-hash-value",
"question__hide": false,
- "total_acs": 13131,
- "total_submitted": 55991,
+ "total_acs": 13205,
+ "total_submitted": 56217,
"frontend_question_id": 2156,
"is_new_question": false
},
@@ -22739,8 +23337,8 @@
"question__title": "Keep Multiplying Found Values by Two",
"question__title_slug": "keep-multiplying-found-values-by-two",
"question__hide": false,
- "total_acs": 92206,
- "total_submitted": 129335,
+ "total_acs": 93455,
+ "total_submitted": 131060,
"frontend_question_id": 2154,
"is_new_question": false
},
@@ -22762,8 +23360,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": 2425,
- "total_submitted": 3582,
+ "total_acs": 2469,
+ "total_submitted": 3640,
"frontend_question_id": 2137,
"is_new_question": false
},
@@ -22785,8 +23383,8 @@
"question__title": "Maximum Good People Based on Statements",
"question__title_slug": "maximum-good-people-based-on-statements",
"question__hide": false,
- "total_acs": 13099,
- "total_submitted": 26231,
+ "total_acs": 13193,
+ "total_submitted": 26417,
"frontend_question_id": 2151,
"is_new_question": false
},
@@ -22808,8 +23406,8 @@
"question__title": "Rearrange Array Elements by Sign",
"question__title_slug": "rearrange-array-elements-by-sign",
"question__hide": false,
- "total_acs": 343933,
- "total_submitted": 409413,
+ "total_acs": 359248,
+ "total_submitted": 427352,
"frontend_question_id": 2149,
"is_new_question": false
},
@@ -22831,8 +23429,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": 47410,
- "total_submitted": 78118,
+ "total_acs": 48061,
+ "total_submitted": 79130,
"frontend_question_id": 2150,
"is_new_question": false
},
@@ -22854,8 +23452,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": 57204,
- "total_submitted": 96325,
+ "total_acs": 57843,
+ "total_submitted": 97424,
"frontend_question_id": 2148,
"is_new_question": false
},
@@ -22877,8 +23475,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": 33240,
- "total_submitted": 43590,
+ "total_acs": 33312,
+ "total_submitted": 43687,
"frontend_question_id": 2128,
"is_new_question": false
},
@@ -22900,8 +23498,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": 9916,
- "total_submitted": 20692,
+ "total_acs": 10024,
+ "total_submitted": 20900,
"frontend_question_id": 2163,
"is_new_question": false
},
@@ -22923,8 +23521,8 @@
"question__title": "Minimum Cost to Set Cooking Time",
"question__title_slug": "minimum-cost-to-set-cooking-time",
"question__hide": false,
- "total_acs": 15771,
- "total_submitted": 38423,
+ "total_acs": 15843,
+ "total_submitted": 38570,
"frontend_question_id": 2162,
"is_new_question": false
},
@@ -22946,8 +23544,8 @@
"question__title": "Partition Array According to Given Pivot",
"question__title_slug": "partition-array-according-to-given-pivot",
"question__hide": false,
- "total_acs": 75636,
- "total_submitted": 89142,
+ "total_acs": 76895,
+ "total_submitted": 90566,
"frontend_question_id": 2161,
"is_new_question": false
},
@@ -22969,8 +23567,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": 127925,
- "total_submitted": 148551,
+ "total_acs": 129661,
+ "total_submitted": 150531,
"frontend_question_id": 2160,
"is_new_question": false
},
@@ -22992,8 +23590,8 @@
"question__title": "Maximum Running Time of N Computers",
"question__title_slug": "maximum-running-time-of-n-computers",
"question__hide": false,
- "total_acs": 59980,
- "total_submitted": 119980,
+ "total_acs": 60289,
+ "total_submitted": 120612,
"frontend_question_id": 2141,
"is_new_question": false
},
@@ -23015,8 +23613,8 @@
"question__title": "Solving Questions With Brainpower",
"question__title_slug": "solving-questions-with-brainpower",
"question__hide": false,
- "total_acs": 100576,
- "total_submitted": 182939,
+ "total_acs": 101622,
+ "total_submitted": 184770,
"frontend_question_id": 2140,
"is_new_question": false
},
@@ -23038,8 +23636,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": 29491,
- "total_submitted": 45980,
+ "total_acs": 29767,
+ "total_submitted": 46336,
"frontend_question_id": 2155,
"is_new_question": false
},
@@ -23061,8 +23659,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": 46560,
- "total_submitted": 69911,
+ "total_acs": 47042,
+ "total_submitted": 70579,
"frontend_question_id": 2138,
"is_new_question": false
},
@@ -23084,8 +23682,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": 888,
- "total_submitted": 2146,
+ "total_acs": 898,
+ "total_submitted": 2164,
"frontend_question_id": 2123,
"is_new_question": false
},
@@ -23107,8 +23705,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": 1915,
- "total_submitted": 2602,
+ "total_acs": 1931,
+ "total_submitted": 2620,
"frontend_question_id": 2113,
"is_new_question": false
},
@@ -23130,8 +23728,8 @@
"question__title": "Earliest Possible Day of Full Bloom",
"question__title_slug": "earliest-possible-day-of-full-bloom",
"question__hide": false,
- "total_acs": 53426,
- "total_submitted": 74431,
+ "total_acs": 54091,
+ "total_submitted": 75342,
"frontend_question_id": 2136,
"is_new_question": false
},
@@ -23153,8 +23751,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": 33855,
- "total_submitted": 78848,
+ "total_acs": 34057,
+ "total_submitted": 79243,
"frontend_question_id": 2135,
"is_new_question": false
},
@@ -23176,8 +23774,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": 27903,
- "total_submitted": 53225,
+ "total_acs": 28347,
+ "total_submitted": 53984,
"frontend_question_id": 2134,
"is_new_question": false
},
@@ -23199,8 +23797,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": 72952,
- "total_submitted": 141067,
+ "total_acs": 74341,
+ "total_submitted": 143722,
"frontend_question_id": 2133,
"is_new_question": false
},
@@ -23222,8 +23820,8 @@
"question__title": "Build the Equation",
"question__title_slug": "build-the-equation",
"question__hide": false,
- "total_acs": 2512,
- "total_submitted": 4539,
+ "total_acs": 2562,
+ "total_submitted": 4617,
"frontend_question_id": 2118,
"is_new_question": false
},
@@ -23245,8 +23843,8 @@
"question__title": "The Airport With the Most Traffic",
"question__title_slug": "the-airport-with-the-most-traffic",
"question__hide": false,
- "total_acs": 8358,
- "total_submitted": 11989,
+ "total_acs": 8482,
+ "total_submitted": 12154,
"frontend_question_id": 2112,
"is_new_question": false
},
@@ -23268,8 +23866,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": 67185,
- "total_submitted": 135685,
+ "total_acs": 67388,
+ "total_submitted": 136207,
"frontend_question_id": 2147,
"is_new_question": false
},
@@ -23291,8 +23889,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": 15398,
- "total_submitted": 35935,
+ "total_acs": 15545,
+ "total_submitted": 36197,
"frontend_question_id": 2146,
"is_new_question": false
},
@@ -23314,8 +23912,8 @@
"question__title": "Count the Hidden Sequences",
"question__title_slug": "count-the-hidden-sequences",
"question__hide": false,
- "total_acs": 17647,
- "total_submitted": 46347,
+ "total_acs": 17848,
+ "total_submitted": 46746,
"frontend_question_id": 2145,
"is_new_question": false
},
@@ -23337,8 +23935,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": 48884,
- "total_submitted": 79997,
+ "total_acs": 49615,
+ "total_submitted": 81035,
"frontend_question_id": 2144,
"is_new_question": false
},
@@ -23360,8 +23958,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": 3250,
- "total_submitted": 5849,
+ "total_acs": 3281,
+ "total_submitted": 5914,
"frontend_question_id": 2107,
"is_new_question": false
},
@@ -23383,8 +23981,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": 12866,
- "total_submitted": 34698,
+ "total_acs": 13045,
+ "total_submitted": 35108,
"frontend_question_id": 2127,
"is_new_question": false
},
@@ -23406,8 +24004,8 @@
"question__title": "Destroying Asteroids",
"question__title_slug": "destroying-asteroids",
"question__hide": false,
- "total_acs": 43444,
- "total_submitted": 84333,
+ "total_acs": 44136,
+ "total_submitted": 85602,
"frontend_question_id": 2126,
"is_new_question": false
},
@@ -23429,8 +24027,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": 205178,
- "total_submitted": 239473,
+ "total_acs": 206846,
+ "total_submitted": 241475,
"frontend_question_id": 2125,
"is_new_question": false
},
@@ -23452,8 +24050,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": 76778,
- "total_submitted": 107528,
+ "total_acs": 78113,
+ "total_submitted": 109341,
"frontend_question_id": 2124,
"is_new_question": false
},
@@ -23475,8 +24073,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": 3048,
- "total_submitted": 8353,
+ "total_acs": 3077,
+ "total_submitted": 8420,
"frontend_question_id": 2098,
"is_new_question": false
},
@@ -23498,8 +24096,8 @@
"question__title": "Recover the Original Array",
"question__title_slug": "recover-the-original-array",
"question__hide": false,
- "total_acs": 10569,
- "total_submitted": 27057,
+ "total_acs": 10663,
+ "total_submitted": 27233,
"frontend_question_id": 2122,
"is_new_question": false
},
@@ -23521,8 +24119,8 @@
"question__title": "Intervals Between Identical Elements",
"question__title_slug": "intervals-between-identical-elements",
"question__hide": false,
- "total_acs": 19532,
- "total_submitted": 44225,
+ "total_acs": 20159,
+ "total_submitted": 45461,
"frontend_question_id": 2121,
"is_new_question": false
},
@@ -23544,8 +24142,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": 30922,
- "total_submitted": 37451,
+ "total_acs": 31174,
+ "total_submitted": 37743,
"frontend_question_id": 2120,
"is_new_question": false
},
@@ -23567,8 +24165,8 @@
"question__title": "A Number After a Double Reversal",
"question__title_slug": "a-number-after-a-double-reversal",
"question__hide": false,
- "total_acs": 86795,
- "total_submitted": 108800,
+ "total_acs": 88221,
+ "total_submitted": 110428,
"frontend_question_id": 2119,
"is_new_question": false
},
@@ -23590,8 +24188,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": 116491,
- "total_submitted": 242379,
+ "total_acs": 117164,
+ "total_submitted": 243710,
"frontend_question_id": 2131,
"is_new_question": false
},
@@ -23613,8 +24211,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": 280129,
- "total_submitted": 346234,
+ "total_acs": 287558,
+ "total_submitted": 355433,
"frontend_question_id": 2130,
"is_new_question": false
},
@@ -23636,8 +24234,8 @@
"question__title": "Capitalize the Title",
"question__title_slug": "capitalize-the-title",
"question__hide": false,
- "total_acs": 62194,
- "total_submitted": 96913,
+ "total_acs": 63192,
+ "total_submitted": 98209,
"frontend_question_id": 2129,
"is_new_question": false
},
@@ -23659,8 +24257,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": 12655,
- "total_submitted": 32862,
+ "total_acs": 12734,
+ "total_submitted": 33047,
"frontend_question_id": 2111,
"is_new_question": false
},
@@ -23682,8 +24280,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": 36471,
- "total_submitted": 61889,
+ "total_acs": 36801,
+ "total_submitted": 62394,
"frontend_question_id": 2110,
"is_new_question": false
},
@@ -23705,8 +24303,8 @@
"question__title": "Adding Spaces to a String",
"question__title_slug": "adding-spaces-to-a-string",
"question__hide": false,
- "total_acs": 43865,
- "total_submitted": 74689,
+ "total_acs": 44613,
+ "total_submitted": 75747,
"frontend_question_id": 2109,
"is_new_question": false
},
@@ -23728,8 +24326,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": 278432,
- "total_submitted": 331933,
+ "total_acs": 284024,
+ "total_submitted": 338602,
"frontend_question_id": 2108,
"is_new_question": false
},
@@ -23751,8 +24349,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": 5723,
- "total_submitted": 10216,
+ "total_acs": 5788,
+ "total_submitted": 10337,
"frontend_question_id": 2093,
"is_new_question": false
},
@@ -23774,8 +24372,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": 10763,
- "total_submitted": 29778,
+ "total_acs": 10860,
+ "total_submitted": 30009,
"frontend_question_id": 2106,
"is_new_question": false
},
@@ -23797,8 +24395,8 @@
"question__title": "Watering Plants II",
"question__title_slug": "watering-plants-ii",
"question__hide": false,
- "total_acs": 19575,
- "total_submitted": 40431,
+ "total_acs": 19767,
+ "total_submitted": 40840,
"frontend_question_id": 2105,
"is_new_question": false
},
@@ -23820,8 +24418,8 @@
"question__title": "Sum of Subarray Ranges",
"question__title_slug": "sum-of-subarray-ranges",
"question__hide": false,
- "total_acs": 94683,
- "total_submitted": 154884,
+ "total_acs": 97325,
+ "total_submitted": 159022,
"frontend_question_id": 2104,
"is_new_question": false
},
@@ -23843,8 +24441,8 @@
"question__title": "Rings and Rods",
"question__title_slug": "rings-and-rods",
"question__hide": false,
- "total_acs": 73122,
- "total_submitted": 90550,
+ "total_acs": 73992,
+ "total_submitted": 91622,
"frontend_question_id": 2103,
"is_new_question": false
},
@@ -23860,14 +24458,14 @@
{
"stat": {
"question_id": 2225,
- "question__article__live": null,
- "question__article__slug": null,
- "question__article__has_video_solution": null,
+ "question__article__live": true,
+ "question__article__slug": "substrings-that-begin-and-end-with-the-same-letter",
+ "question__article__has_video_solution": false,
"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": 6491,
- "total_submitted": 9469,
+ "total_acs": 12405,
+ "total_submitted": 16696,
"frontend_question_id": 2083,
"is_new_question": false
},
@@ -23889,8 +24487,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": 10083,
- "total_submitted": 11643,
+ "total_acs": 10256,
+ "total_submitted": 11821,
"frontend_question_id": 2084,
"is_new_question": false
},
@@ -23912,8 +24510,8 @@
"question__title": "The Number of Rich Customers",
"question__title_slug": "the-number-of-rich-customers",
"question__hide": false,
- "total_acs": 22412,
- "total_submitted": 29013,
+ "total_acs": 22651,
+ "total_submitted": 29305,
"frontend_question_id": 2082,
"is_new_question": false
},
@@ -23935,8 +24533,8 @@
"question__title": "Abbreviating the Product of a Range",
"question__title_slug": "abbreviating-the-product-of-a-range",
"question__hide": false,
- "total_acs": 3376,
- "total_submitted": 12932,
+ "total_acs": 3407,
+ "total_submitted": 13056,
"frontend_question_id": 2117,
"is_new_question": false
},
@@ -23958,8 +24556,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": 25428,
- "total_submitted": 79891,
+ "total_acs": 25834,
+ "total_submitted": 81011,
"frontend_question_id": 2116,
"is_new_question": false
},
@@ -23981,8 +24579,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": 90393,
- "total_submitted": 181502,
+ "total_acs": 91825,
+ "total_submitted": 183921,
"frontend_question_id": 2115,
"is_new_question": false
},
@@ -24004,8 +24602,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": 286825,
- "total_submitted": 331766,
+ "total_acs": 291363,
+ "total_submitted": 336937,
"frontend_question_id": 2114,
"is_new_question": false
},
@@ -24027,8 +24625,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": 4361,
- "total_submitted": 7939,
+ "total_acs": 4414,
+ "total_submitted": 8031,
"frontend_question_id": 2077,
"is_new_question": false
},
@@ -24050,8 +24648,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": 98784,
- "total_submitted": 201997,
+ "total_acs": 99412,
+ "total_submitted": 203174,
"frontend_question_id": 2096,
"is_new_question": false
},
@@ -24073,8 +24671,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": 400609,
- "total_submitted": 678851,
+ "total_acs": 417796,
+ "total_submitted": 706701,
"frontend_question_id": 2095,
"is_new_question": false
},
@@ -24096,8 +24694,8 @@
"question__title": "Finding 3-Digit Even Numbers",
"question__title_slug": "finding-3-digit-even-numbers",
"question__hide": false,
- "total_acs": 30942,
- "total_submitted": 51407,
+ "total_acs": 31464,
+ "total_submitted": 52078,
"frontend_question_id": 2094,
"is_new_question": false
},
@@ -24119,8 +24717,8 @@
"question__title": "The Winner University",
"question__title_slug": "the-winner-university",
"question__hide": false,
- "total_acs": 10859,
- "total_submitted": 14758,
+ "total_acs": 10983,
+ "total_submitted": 14892,
"frontend_question_id": 2072,
"is_new_question": false
},
@@ -24142,8 +24740,8 @@
"question__title": "Find All People With Secret",
"question__title_slug": "find-all-people-with-secret",
"question__hide": false,
- "total_acs": 95706,
- "total_submitted": 208990,
+ "total_acs": 96519,
+ "total_submitted": 210928,
"frontend_question_id": 2092,
"is_new_question": false
},
@@ -24165,8 +24763,8 @@
"question__title": "Removing Minimum and Maximum From Array",
"question__title_slug": "removing-minimum-and-maximum-from-array",
"question__hide": false,
- "total_acs": 42470,
- "total_submitted": 77543,
+ "total_acs": 43144,
+ "total_submitted": 78629,
"frontend_question_id": 2091,
"is_new_question": false
},
@@ -24188,8 +24786,8 @@
"question__title": "K Radius Subarray Averages",
"question__title_slug": "k-radius-subarray-averages",
"question__hide": false,
- "total_acs": 121480,
- "total_submitted": 262610,
+ "total_acs": 123338,
+ "total_submitted": 266959,
"frontend_question_id": 2090,
"is_new_question": false
},
@@ -24211,8 +24809,8 @@
"question__title": "Find Target Indices After Sorting Array",
"question__title_slug": "find-target-indices-after-sorting-array",
"question__hide": false,
- "total_acs": 176327,
- "total_submitted": 231174,
+ "total_acs": 179879,
+ "total_submitted": 235735,
"frontend_question_id": 2089,
"is_new_question": false
},
@@ -24234,8 +24832,8 @@
"question__title": "Number of Equal Count Substrings",
"question__title_slug": "number-of-equal-count-substrings",
"question__hide": false,
- "total_acs": 2541,
- "total_submitted": 5395,
+ "total_acs": 2591,
+ "total_submitted": 5499,
"frontend_question_id": 2067,
"is_new_question": false
},
@@ -24257,8 +24855,8 @@
"question__title": "Account Balance",
"question__title_slug": "account-balance",
"question__hide": false,
- "total_acs": 9283,
- "total_submitted": 11313,
+ "total_acs": 9413,
+ "total_submitted": 11481,
"frontend_question_id": 2066,
"is_new_question": false
},
@@ -24280,8 +24878,8 @@
"question__title": "Sequentially Ordinal Rank Tracker",
"question__title_slug": "sequentially-ordinal-rank-tracker",
"question__hide": false,
- "total_acs": 15002,
- "total_submitted": 23203,
+ "total_acs": 15115,
+ "total_submitted": 23393,
"frontend_question_id": 2102,
"is_new_question": false
},
@@ -24303,8 +24901,8 @@
"question__title": "Detonate the Maximum Bombs",
"question__title_slug": "detonate-the-maximum-bombs",
"question__hide": false,
- "total_acs": 120957,
- "total_submitted": 248409,
+ "total_acs": 122719,
+ "total_submitted": 252060,
"frontend_question_id": 2101,
"is_new_question": false
},
@@ -24326,8 +24924,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": 26236,
- "total_submitted": 52952,
+ "total_acs": 26506,
+ "total_submitted": 53469,
"frontend_question_id": 2100,
"is_new_question": false
},
@@ -24349,8 +24947,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": 49610,
- "total_submitted": 113885,
+ "total_acs": 50489,
+ "total_submitted": 115699,
"frontend_question_id": 2099,
"is_new_question": false
},
@@ -24372,8 +24970,8 @@
"question__title": "Number of Spaces Cleaning Robot Cleaned",
"question__title_slug": "number-of-spaces-cleaning-robot-cleaned",
"question__hide": false,
- "total_acs": 8553,
- "total_submitted": 13684,
+ "total_acs": 8629,
+ "total_submitted": 13809,
"frontend_question_id": 2061,
"is_new_question": false
},
@@ -24395,8 +24993,8 @@
"question__title": "Sum of k-Mirror Numbers",
"question__title_slug": "sum-of-k-mirror-numbers",
"question__hide": false,
- "total_acs": 7150,
- "total_submitted": 16949,
+ "total_acs": 7208,
+ "total_submitted": 17063,
"frontend_question_id": 2081,
"is_new_question": false
},
@@ -24418,8 +25016,8 @@
"question__title": "Valid Arrangement of Pairs",
"question__title_slug": "valid-arrangement-of-pairs",
"question__hide": false,
- "total_acs": 10332,
- "total_submitted": 23892,
+ "total_acs": 10689,
+ "total_submitted": 24532,
"frontend_question_id": 2097,
"is_new_question": false
},
@@ -24441,8 +25039,8 @@
"question__title": "Stamping the Grid",
"question__title_slug": "stamping-the-grid",
"question__hide": false,
- "total_acs": 7065,
- "total_submitted": 21768,
+ "total_acs": 7121,
+ "total_submitted": 21928,
"frontend_question_id": 2132,
"is_new_question": false
},
@@ -24464,8 +25062,8 @@
"question__title": "Two Furthest Houses With Different Colors",
"question__title_slug": "two-furthest-houses-with-different-colors",
"question__hide": false,
- "total_acs": 53885,
- "total_submitted": 81497,
+ "total_acs": 54540,
+ "total_submitted": 82504,
"frontend_question_id": 2078,
"is_new_question": false
},
@@ -24487,8 +25085,8 @@
"question__title": "Process Restricted Friend Requests",
"question__title_slug": "process-restricted-friend-requests",
"question__hide": false,
- "total_acs": 17025,
- "total_submitted": 30965,
+ "total_acs": 17158,
+ "total_submitted": 31183,
"frontend_question_id": 2076,
"is_new_question": false
},
@@ -24510,8 +25108,8 @@
"question__title": "Decode the Slanted Ciphertext",
"question__title_slug": "decode-the-slanted-ciphertext",
"question__hide": false,
- "total_acs": 13779,
- "total_submitted": 28162,
+ "total_acs": 13876,
+ "total_submitted": 28336,
"frontend_question_id": 2075,
"is_new_question": false
},
@@ -24533,8 +25131,8 @@
"question__title": "Reverse Nodes in Even Length Groups",
"question__title_slug": "reverse-nodes-in-even-length-groups",
"question__hide": false,
- "total_acs": 25600,
- "total_submitted": 44389,
+ "total_acs": 26133,
+ "total_submitted": 45236,
"frontend_question_id": 2074,
"is_new_question": false
},
@@ -24556,8 +25154,8 @@
"question__title": "Time Needed to Buy Tickets",
"question__title_slug": "time-needed-to-buy-tickets",
"question__hide": false,
- "total_acs": 208118,
- "total_submitted": 298002,
+ "total_acs": 210844,
+ "total_submitted": 301811,
"frontend_question_id": 2073,
"is_new_question": false
},
@@ -24579,8 +25177,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": 7796,
- "total_submitted": 11135,
+ "total_acs": 7904,
+ "total_submitted": 11278,
"frontend_question_id": 2051,
"is_new_question": false
},
@@ -24602,8 +25200,8 @@
"question__title": "Count Fertile Pyramids in a Land",
"question__title_slug": "count-fertile-pyramids-in-a-land",
"question__hide": false,
- "total_acs": 9532,
- "total_submitted": 14770,
+ "total_acs": 9657,
+ "total_submitted": 14946,
"frontend_question_id": 2088,
"is_new_question": false
},
@@ -24625,8 +25223,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": 17674,
- "total_submitted": 34729,
+ "total_acs": 17874,
+ "total_submitted": 35133,
"frontend_question_id": 2087,
"is_new_question": false
},
@@ -24648,8 +25246,8 @@
"question__title": "Minimum Number of Food Buckets to Feed the Hamsters",
"question__title_slug": "minimum-number-of-food-buckets-to-feed-the-hamsters",
"question__hide": false,
- "total_acs": 19886,
- "total_submitted": 43118,
+ "total_acs": 20591,
+ "total_submitted": 44445,
"frontend_question_id": 2086,
"is_new_question": false
},
@@ -24671,8 +25269,8 @@
"question__title": "Count Common Words With One Occurrence",
"question__title_slug": "count-common-words-with-one-occurrence",
"question__hide": false,
- "total_acs": 65993,
- "total_submitted": 93909,
+ "total_acs": 67238,
+ "total_submitted": 95527,
"frontend_question_id": 2085,
"is_new_question": false
},
@@ -24694,8 +25292,8 @@
"question__title": "Maximum Path Quality of a Graph",
"question__title_slug": "maximum-path-quality-of-a-graph",
"question__hide": false,
- "total_acs": 21237,
- "total_submitted": 36368,
+ "total_acs": 21500,
+ "total_submitted": 36795,
"frontend_question_id": 2065,
"is_new_question": false
},
@@ -24717,8 +25315,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": 28172,
- "total_submitted": 53733,
+ "total_acs": 30426,
+ "total_submitted": 57352,
"frontend_question_id": 2064,
"is_new_question": false
},
@@ -24740,8 +25338,8 @@
"question__title": "Vowels of All Substrings",
"question__title_slug": "vowels-of-all-substrings",
"question__hide": false,
- "total_acs": 28748,
- "total_submitted": 53257,
+ "total_acs": 29131,
+ "total_submitted": 53965,
"frontend_question_id": 2063,
"is_new_question": false
},
@@ -24763,8 +25361,8 @@
"question__title": "Count Vowel Substrings of a String",
"question__title_slug": "count-vowel-substrings-of-a-string",
"question__hide": false,
- "total_acs": 40066,
- "total_submitted": 59187,
+ "total_acs": 40738,
+ "total_submitted": 60076,
"frontend_question_id": 2062,
"is_new_question": false
},
@@ -24786,8 +25384,8 @@
"question__title": "Accepted Candidates From the Interviews",
"question__title_slug": "accepted-candidates-from-the-interviews",
"question__hide": false,
- "total_acs": 9957,
- "total_submitted": 12730,
+ "total_acs": 10143,
+ "total_submitted": 12977,
"frontend_question_id": 2041,
"is_new_question": false
},
@@ -24809,8 +25407,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": 15797,
- "total_submitted": 36342,
+ "total_acs": 16161,
+ "total_submitted": 37064,
"frontend_question_id": 2060,
"is_new_question": false
},
@@ -24832,8 +25430,8 @@
"question__title": "Minimum Operations to Convert Number",
"question__title_slug": "minimum-operations-to-convert-number",
"question__hide": false,
- "total_acs": 16414,
- "total_submitted": 33462,
+ "total_acs": 16577,
+ "total_submitted": 33716,
"frontend_question_id": 2059,
"is_new_question": false
},
@@ -24855,8 +25453,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": 35685,
- "total_submitted": 61101,
+ "total_acs": 36503,
+ "total_submitted": 62354,
"frontend_question_id": 2058,
"is_new_question": false
},
@@ -24878,8 +25476,8 @@
"question__title": "Smallest Index With Equal Value",
"question__title_slug": "smallest-index-with-equal-value",
"question__hide": false,
- "total_acs": 62212,
- "total_submitted": 85473,
+ "total_acs": 63155,
+ "total_submitted": 86700,
"frontend_question_id": 2057,
"is_new_question": false
},
@@ -24901,8 +25499,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": 8805,
- "total_submitted": 26095,
+ "total_acs": 9118,
+ "total_submitted": 27161,
"frontend_question_id": 2071,
"is_new_question": false
},
@@ -24924,8 +25522,8 @@
"question__title": "Most Beautiful Item for Each Query",
"question__title_slug": "most-beautiful-item-for-each-query",
"question__hide": false,
- "total_acs": 16561,
- "total_submitted": 33474,
+ "total_acs": 16788,
+ "total_submitted": 33905,
"frontend_question_id": 2070,
"is_new_question": false
},
@@ -24947,8 +25545,8 @@
"question__title": "Walking Robot Simulation II",
"question__title_slug": "walking-robot-simulation-ii",
"question__hide": false,
- "total_acs": 10593,
- "total_submitted": 42770,
+ "total_acs": 10684,
+ "total_submitted": 43160,
"frontend_question_id": 2069,
"is_new_question": false
},
@@ -24970,8 +25568,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": 53841,
- "total_submitted": 84434,
+ "total_acs": 54570,
+ "total_submitted": 85537,
"frontend_question_id": 2068,
"is_new_question": false
},
@@ -24993,8 +25591,8 @@
"question__title": "Parallel Courses III",
"question__title_slug": "parallel-courses-iii",
"question__hide": false,
- "total_acs": 77876,
- "total_submitted": 115624,
+ "total_acs": 78756,
+ "total_submitted": 117010,
"frontend_question_id": 2050,
"is_new_question": false
},
@@ -25016,8 +25614,8 @@
"question__title": "Count Nodes With the Highest Score",
"question__title_slug": "count-nodes-with-the-highest-score",
"question__hide": false,
- "total_acs": 25725,
- "total_submitted": 52011,
+ "total_acs": 26115,
+ "total_submitted": 52753,
"frontend_question_id": 2049,
"is_new_question": false
},
@@ -25039,8 +25637,8 @@
"question__title": "Next Greater Numerically Balanced Number",
"question__title_slug": "next-greater-numerically-balanced-number",
"question__hide": false,
- "total_acs": 13447,
- "total_submitted": 27790,
+ "total_acs": 13552,
+ "total_submitted": 27979,
"frontend_question_id": 2048,
"is_new_question": false
},
@@ -25062,8 +25660,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": 29139,
- "total_submitted": 100453,
+ "total_acs": 29582,
+ "total_submitted": 101695,
"frontend_question_id": 2047,
"is_new_question": false
},
@@ -25085,8 +25683,8 @@
"question__title": "Low-Quality Problems",
"question__title_slug": "low-quality-problems",
"question__hide": false,
- "total_acs": 11884,
- "total_submitted": 14095,
+ "total_acs": 12013,
+ "total_submitted": 14248,
"frontend_question_id": 2026,
"is_new_question": false
},
@@ -25108,8 +25706,8 @@
"question__title": "Second Minimum Time to Reach Destination",
"question__title_slug": "second-minimum-time-to-reach-destination",
"question__hide": false,
- "total_acs": 11344,
- "total_submitted": 27897,
+ "total_acs": 11489,
+ "total_submitted": 28147,
"frontend_question_id": 2045,
"is_new_question": false
},
@@ -25131,8 +25729,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": 28176,
- "total_submitted": 36379,
+ "total_acs": 28581,
+ "total_submitted": 36858,
"frontend_question_id": 2044,
"is_new_question": false
},
@@ -25154,8 +25752,8 @@
"question__title": "Simple Bank System",
"question__title_slug": "simple-bank-system",
"question__hide": false,
- "total_acs": 26566,
- "total_submitted": 41462,
+ "total_acs": 27218,
+ "total_submitted": 42589,
"frontend_question_id": 2043,
"is_new_question": false
},
@@ -25177,8 +25775,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": 57264,
- "total_submitted": 82427,
+ "total_acs": 58173,
+ "total_submitted": 83640,
"frontend_question_id": 2042,
"is_new_question": false
},
@@ -25200,8 +25798,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": 10232,
- "total_submitted": 14293,
+ "total_acs": 10354,
+ "total_submitted": 14454,
"frontend_question_id": 2020,
"is_new_question": false
},
@@ -25223,8 +25821,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": 4122,
- "total_submitted": 7813,
+ "total_acs": 4139,
+ "total_submitted": 7843,
"frontend_question_id": 2056,
"is_new_question": false
},
@@ -25246,8 +25844,8 @@
"question__title": "Plates Between Candles",
"question__title_slug": "plates-between-candles",
"question__hide": false,
- "total_acs": 50728,
- "total_submitted": 113689,
+ "total_acs": 52324,
+ "total_submitted": 117005,
"frontend_question_id": 2055,
"is_new_question": false
},
@@ -25269,8 +25867,8 @@
"question__title": "Two Best Non-Overlapping Events",
"question__title_slug": "two-best-non-overlapping-events",
"question__hide": false,
- "total_acs": 18831,
- "total_submitted": 40465,
+ "total_acs": 19058,
+ "total_submitted": 41010,
"frontend_question_id": 2054,
"is_new_question": false
},
@@ -25292,8 +25890,8 @@
"question__title": "Kth Distinct String in an Array",
"question__title_slug": "kth-distinct-string-in-an-array",
"question__hide": false,
- "total_acs": 63442,
- "total_submitted": 87099,
+ "total_acs": 64469,
+ "total_submitted": 88407,
"frontend_question_id": 2053,
"is_new_question": false
},
@@ -25315,8 +25913,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": 24987,
- "total_submitted": 123597,
+ "total_acs": 25978,
+ "total_submitted": 127938,
"frontend_question_id": 2035,
"is_new_question": false
},
@@ -25338,8 +25936,8 @@
"question__title": "Stock Price Fluctuation ",
"question__title_slug": "stock-price-fluctuation",
"question__hide": false,
- "total_acs": 66751,
- "total_submitted": 137082,
+ "total_acs": 67311,
+ "total_submitted": 138249,
"frontend_question_id": 2034,
"is_new_question": false
},
@@ -25361,8 +25959,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": 22853,
- "total_submitted": 42928,
+ "total_acs": 23015,
+ "total_submitted": 43190,
"frontend_question_id": 2033,
"is_new_question": false
},
@@ -25384,8 +25982,8 @@
"question__title": "Two Out of Three",
"question__title_slug": "two-out-of-three",
"question__hide": false,
- "total_acs": 68428,
- "total_submitted": 91125,
+ "total_acs": 69432,
+ "total_submitted": 92321,
"frontend_question_id": 2032,
"is_new_question": false
},
@@ -25407,8 +26005,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": 5479,
- "total_submitted": 8839,
+ "total_acs": 5565,
+ "total_submitted": 8972,
"frontend_question_id": 2010,
"is_new_question": false
},
@@ -25430,8 +26028,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": 8520,
- "total_submitted": 21803,
+ "total_acs": 8600,
+ "total_submitted": 21969,
"frontend_question_id": 2030,
"is_new_question": false
},
@@ -25453,8 +26051,8 @@
"question__title": "Stone Game IX",
"question__title_slug": "stone-game-ix",
"question__hide": false,
- "total_acs": 8092,
- "total_submitted": 28722,
+ "total_acs": 8208,
+ "total_submitted": 29025,
"frontend_question_id": 2029,
"is_new_question": false
},
@@ -25476,8 +26074,8 @@
"question__title": "Find Missing Observations",
"question__title_slug": "find-missing-observations",
"question__hide": false,
- "total_acs": 31203,
- "total_submitted": 66948,
+ "total_acs": 31510,
+ "total_submitted": 67524,
"frontend_question_id": 2028,
"is_new_question": false
},
@@ -25499,8 +26097,8 @@
"question__title": "Minimum Moves to Convert String",
"question__title_slug": "minimum-moves-to-convert-string",
"question__hide": false,
- "total_acs": 36283,
- "total_submitted": 66540,
+ "total_acs": 37024,
+ "total_submitted": 67628,
"frontend_question_id": 2027,
"is_new_question": false
},
@@ -25522,8 +26120,8 @@
"question__title": "Subtree Removal Game with Fibonacci Tree",
"question__title_slug": "subtree-removal-game-with-fibonacci-tree",
"question__hide": false,
- "total_acs": 628,
- "total_submitted": 1066,
+ "total_acs": 633,
+ "total_submitted": 1072,
"frontend_question_id": 2005,
"is_new_question": false
},
@@ -25545,8 +26143,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": 8378,
- "total_submitted": 19533,
+ "total_acs": 8454,
+ "total_submitted": 19628,
"frontend_question_id": 2004,
"is_new_question": false
},
@@ -25568,8 +26166,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": 14156,
- "total_submitted": 27361,
+ "total_acs": 14351,
+ "total_submitted": 27700,
"frontend_question_id": 2039,
"is_new_question": false
},
@@ -25591,8 +26189,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": 11484,
- "total_submitted": 39469,
+ "total_acs": 11623,
+ "total_submitted": 39903,
"frontend_question_id": 2040,
"is_new_question": false
},
@@ -25614,8 +26212,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": 141846,
- "total_submitted": 225901,
+ "total_acs": 142514,
+ "total_submitted": 226942,
"frontend_question_id": 2038,
"is_new_question": false
},
@@ -25631,14 +26229,14 @@
{
"stat": {
"question_id": 2148,
- "question__article__live": null,
- "question__article__slug": null,
- "question__article__has_video_solution": null,
+ "question__article__live": true,
+ "question__article__slug": "minimum-number-of-moves-to-seat-everyone",
+ "question__article__has_video_solution": false,
"question__title": "Minimum Number of Moves to Seat Everyone",
"question__title_slug": "minimum-number-of-moves-to-seat-everyone",
"question__hide": false,
- "total_acs": 70926,
- "total_submitted": 86258,
+ "total_acs": 221381,
+ "total_submitted": 252167,
"frontend_question_id": 2037,
"is_new_question": false
},
@@ -25660,8 +26258,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": 7089,
- "total_submitted": 21095,
+ "total_acs": 7127,
+ "total_submitted": 21198,
"frontend_question_id": 2019,
"is_new_question": false
},
@@ -25683,8 +26281,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": 19839,
- "total_submitted": 40210,
+ "total_acs": 19938,
+ "total_submitted": 40415,
"frontend_question_id": 2018,
"is_new_question": false
},
@@ -25706,8 +26304,8 @@
"question__title": "Grid Game",
"question__title_slug": "grid-game",
"question__hide": false,
- "total_acs": 23974,
- "total_submitted": 52587,
+ "total_acs": 24291,
+ "total_submitted": 53173,
"frontend_question_id": 2017,
"is_new_question": false
},
@@ -25729,8 +26327,8 @@
"question__title": "Maximum Difference Between Increasing Elements",
"question__title_slug": "maximum-difference-between-increasing-elements",
"question__hide": false,
- "total_acs": 82622,
- "total_submitted": 146779,
+ "total_acs": 83980,
+ "total_submitted": 148998,
"frontend_question_id": 2016,
"is_new_question": false
},
@@ -25752,8 +26350,8 @@
"question__title": "Count the Number of Experiments",
"question__title_slug": "count-the-number-of-experiments",
"question__hide": false,
- "total_acs": 6956,
- "total_submitted": 14259,
+ "total_acs": 7046,
+ "total_submitted": 14422,
"frontend_question_id": 1990,
"is_new_question": false
},
@@ -25775,8 +26373,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": 1966,
- "total_submitted": 3317,
+ "total_acs": 1983,
+ "total_submitted": 3342,
"frontend_question_id": 2015,
"is_new_question": false
},
@@ -25798,8 +26396,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": 1638,
- "total_submitted": 3318,
+ "total_acs": 1663,
+ "total_submitted": 3360,
"frontend_question_id": 1999,
"is_new_question": false
},
@@ -25821,8 +26419,8 @@
"question__title": "Longest Subsequence Repeated k Times",
"question__title_slug": "longest-subsequence-repeated-k-times",
"question__hide": false,
- "total_acs": 7834,
- "total_submitted": 14120,
+ "total_acs": 7940,
+ "total_submitted": 14314,
"frontend_question_id": 2014,
"is_new_question": false
},
@@ -25844,8 +26442,8 @@
"question__title": "Detect Squares",
"question__title_slug": "detect-squares",
"question__hide": false,
- "total_acs": 65615,
- "total_submitted": 128895,
+ "total_acs": 67468,
+ "total_submitted": 132343,
"frontend_question_id": 2013,
"is_new_question": false
},
@@ -25867,8 +26465,8 @@
"question__title": "Sum of Beauty in the Array",
"question__title_slug": "sum-of-beauty-in-the-array",
"question__hide": false,
- "total_acs": 23161,
- "total_submitted": 48174,
+ "total_acs": 23350,
+ "total_submitted": 48541,
"frontend_question_id": 2012,
"is_new_question": false
},
@@ -25890,8 +26488,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": 376732,
- "total_submitted": 422934,
+ "total_acs": 384763,
+ "total_submitted": 431692,
"frontend_question_id": 2011,
"is_new_question": false
},
@@ -25913,8 +26511,8 @@
"question__title": "Find Cutoff Score for Each School",
"question__title_slug": "find-cutoff-score-for-each-school",
"question__hide": false,
- "total_acs": 11043,
- "total_submitted": 16516,
+ "total_acs": 11155,
+ "total_submitted": 16664,
"frontend_question_id": 1988,
"is_new_question": false
},
@@ -25936,8 +26534,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": 8751,
- "total_submitted": 25795,
+ "total_acs": 8875,
+ "total_submitted": 26047,
"frontend_question_id": 2025,
"is_new_question": false
},
@@ -25959,8 +26557,8 @@
"question__title": "Maximize the Confusion of an Exam",
"question__title_slug": "maximize-the-confusion-of-an-exam",
"question__hide": false,
- "total_acs": 104540,
- "total_submitted": 155612,
+ "total_acs": 106582,
+ "total_submitted": 158476,
"frontend_question_id": 2024,
"is_new_question": false
},
@@ -25982,8 +26580,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": 44810,
- "total_submitted": 59951,
+ "total_acs": 45399,
+ "total_submitted": 60700,
"frontend_question_id": 2023,
"is_new_question": false
},
@@ -26005,8 +26603,8 @@
"question__title": "Convert 1D Array Into 2D Array",
"question__title_slug": "convert-1d-array-into-2d-array",
"question__hide": false,
- "total_acs": 82782,
- "total_submitted": 134773,
+ "total_acs": 84012,
+ "total_submitted": 136449,
"frontend_question_id": 2022,
"is_new_question": false
},
@@ -26028,8 +26626,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": 8235,
- "total_submitted": 17725,
+ "total_acs": 8325,
+ "total_submitted": 17915,
"frontend_question_id": 2003,
"is_new_question": false
},
@@ -26051,8 +26649,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": 28452,
- "total_submitted": 47774,
+ "total_acs": 28885,
+ "total_submitted": 48351,
"frontend_question_id": 2002,
"is_new_question": false
},
@@ -26074,8 +26672,8 @@
"question__title": "Number of Pairs of Interchangeable Rectangles",
"question__title_slug": "number-of-pairs-of-interchangeable-rectangles",
"question__hide": false,
- "total_acs": 38925,
- "total_submitted": 78442,
+ "total_acs": 39658,
+ "total_submitted": 79692,
"frontend_question_id": 2001,
"is_new_question": false
},
@@ -26097,8 +26695,8 @@
"question__title": "Reverse Prefix of Word",
"question__title_slug": "reverse-prefix-of-word",
"question__hide": false,
- "total_acs": 252929,
- "total_submitted": 293519,
+ "total_acs": 258372,
+ "total_submitted": 299711,
"frontend_question_id": 2000,
"is_new_question": false
},
@@ -26120,8 +26718,8 @@
"question__title": "Employees Whose Manager Left the Company",
"question__title_slug": "employees-whose-manager-left-the-company",
"question__hide": false,
- "total_acs": 103761,
- "total_submitted": 216773,
+ "total_acs": 110910,
+ "total_submitted": 231241,
"frontend_question_id": 1978,
"is_new_question": false
},
@@ -26143,8 +26741,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": 13010,
- "total_submitted": 16923,
+ "total_acs": 13108,
+ "total_submitted": 17045,
"frontend_question_id": 1973,
"is_new_question": false
},
@@ -26166,8 +26764,8 @@
"question__title": "GCD Sort of an Array",
"question__title_slug": "gcd-sort-of-an-array",
"question__hide": false,
- "total_acs": 9023,
- "total_submitted": 19754,
+ "total_acs": 9141,
+ "total_submitted": 19966,
"frontend_question_id": 1998,
"is_new_question": false
},
@@ -26189,8 +26787,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": 9207,
- "total_submitted": 24680,
+ "total_acs": 9260,
+ "total_submitted": 24809,
"frontend_question_id": 1997,
"is_new_question": false
},
@@ -26212,8 +26810,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": 103047,
- "total_submitted": 234623,
+ "total_acs": 103436,
+ "total_submitted": 235423,
"frontend_question_id": 1996,
"is_new_question": false
},
@@ -26235,8 +26833,8 @@
"question__title": "Count Special Quadruplets",
"question__title_slug": "count-special-quadruplets",
"question__hide": false,
- "total_acs": 40772,
- "total_submitted": 66557,
+ "total_acs": 41256,
+ "total_submitted": 67256,
"frontend_question_id": 1995,
"is_new_question": false
},
@@ -26258,8 +26856,8 @@
"question__title": "Find if Path Exists in Graph",
"question__title_slug": "find-if-path-exists-in-graph",
"question__hide": false,
- "total_acs": 433748,
- "total_submitted": 800013,
+ "total_acs": 440017,
+ "total_submitted": 812334,
"frontend_question_id": 1971,
"is_new_question": false
},
@@ -26281,8 +26879,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": 9390,
- "total_submitted": 18723,
+ "total_acs": 9488,
+ "total_submitted": 18866,
"frontend_question_id": 1972,
"is_new_question": false
},
@@ -26304,8 +26902,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": 73432,
- "total_submitted": 139023,
+ "total_acs": 74076,
+ "total_submitted": 140290,
"frontend_question_id": 2009,
"is_new_question": false
},
@@ -26327,8 +26925,8 @@
"question__title": "Maximum Earnings From Taxi",
"question__title_slug": "maximum-earnings-from-taxi",
"question__hide": false,
- "total_acs": 30731,
- "total_submitted": 69471,
+ "total_acs": 31095,
+ "total_submitted": 70297,
"frontend_question_id": 2008,
"is_new_question": false
},
@@ -26350,8 +26948,8 @@
"question__title": "Find Original Array From Doubled Array",
"question__title_slug": "find-original-array-from-doubled-array",
"question__hide": false,
- "total_acs": 134178,
- "total_submitted": 331377,
+ "total_acs": 134860,
+ "total_submitted": 332981,
"frontend_question_id": 2007,
"is_new_question": false
},
@@ -26373,8 +26971,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": 150229,
- "total_submitted": 179257,
+ "total_acs": 152930,
+ "total_submitted": 182282,
"frontend_question_id": 2006,
"is_new_question": false
},
@@ -26396,8 +26994,8 @@
"question__title": "Number of Unique Good Subsequences",
"question__title_slug": "number-of-unique-good-subsequences",
"question__hide": false,
- "total_acs": 12179,
- "total_submitted": 23261,
+ "total_acs": 12291,
+ "total_submitted": 23470,
"frontend_question_id": 1987,
"is_new_question": false
},
@@ -26419,8 +27017,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": 25900,
- "total_submitted": 78073,
+ "total_acs": 26120,
+ "total_submitted": 78670,
"frontend_question_id": 1986,
"is_new_question": false
},
@@ -26442,8 +27040,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": 64922,
- "total_submitted": 142901,
+ "total_acs": 65982,
+ "total_submitted": 144924,
"frontend_question_id": 1985,
"is_new_question": false
},
@@ -26465,8 +27063,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": 75018,
- "total_submitted": 132195,
+ "total_acs": 76596,
+ "total_submitted": 134669,
"frontend_question_id": 1984,
"is_new_question": false
},
@@ -26488,8 +27086,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": 2740,
- "total_submitted": 4222,
+ "total_acs": 2756,
+ "total_submitted": 4244,
"frontend_question_id": 1966,
"is_new_question": false
},
@@ -26511,8 +27109,8 @@
"question__title": "Employees With Missing Information",
"question__title_slug": "employees-with-missing-information",
"question__hide": false,
- "total_acs": 120621,
- "total_submitted": 167119,
+ "total_acs": 122181,
+ "total_submitted": 169255,
"frontend_question_id": 1965,
"is_new_question": false
},
@@ -26534,8 +27132,8 @@
"question__title": "Find Array Given Subset Sums",
"question__title_slug": "find-array-given-subset-sums",
"question__hide": false,
- "total_acs": 5461,
- "total_submitted": 11186,
+ "total_acs": 5526,
+ "total_submitted": 11286,
"frontend_question_id": 1982,
"is_new_question": false
},
@@ -26557,8 +27155,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": 27141,
- "total_submitted": 78968,
+ "total_acs": 28137,
+ "total_submitted": 80889,
"frontend_question_id": 1981,
"is_new_question": false
},
@@ -26580,8 +27178,8 @@
"question__title": "Find Unique Binary String",
"question__title_slug": "find-unique-binary-string",
"question__hide": false,
- "total_acs": 138381,
- "total_submitted": 185451,
+ "total_acs": 139377,
+ "total_submitted": 186802,
"frontend_question_id": 1980,
"is_new_question": false
},
@@ -26603,8 +27201,8 @@
"question__title": "Find Greatest Common Divisor of Array",
"question__title_slug": "find-greatest-common-divisor-of-array",
"question__hide": false,
- "total_acs": 133137,
- "total_submitted": 171161,
+ "total_acs": 136112,
+ "total_submitted": 174717,
"frontend_question_id": 1979,
"is_new_question": false
},
@@ -26626,8 +27224,8 @@
"question__title": "The Number of Good Subsets",
"question__title_slug": "the-number-of-good-subsets",
"question__hide": false,
- "total_acs": 7707,
- "total_submitted": 22084,
+ "total_acs": 7768,
+ "total_submitted": 22247,
"frontend_question_id": 1994,
"is_new_question": false
},
@@ -26649,8 +27247,8 @@
"question__title": "Operations on Tree",
"question__title_slug": "operations-on-tree",
"question__hide": false,
- "total_acs": 15670,
- "total_submitted": 34324,
+ "total_acs": 15881,
+ "total_submitted": 34733,
"frontend_question_id": 1993,
"is_new_question": false
},
@@ -26672,8 +27270,8 @@
"question__title": "Find All Groups of Farmland",
"question__title_slug": "find-all-groups-of-farmland",
"question__hide": false,
- "total_acs": 126140,
- "total_submitted": 166268,
+ "total_acs": 126964,
+ "total_submitted": 167410,
"frontend_question_id": 1992,
"is_new_question": false
},
@@ -26695,8 +27293,8 @@
"question__title": "Find the Middle Index in Array",
"question__title_slug": "find-the-middle-index-in-array",
"question__hide": false,
- "total_acs": 94543,
- "total_submitted": 140228,
+ "total_acs": 96245,
+ "total_submitted": 142689,
"frontend_question_id": 1991,
"is_new_question": false
},
@@ -26718,8 +27316,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": 56051,
- "total_submitted": 90501,
+ "total_acs": 56327,
+ "total_submitted": 90969,
"frontend_question_id": 1970,
"is_new_question": false
},
@@ -26741,8 +27339,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": 11406,
- "total_submitted": 32217,
+ "total_acs": 11519,
+ "total_submitted": 32487,
"frontend_question_id": 1969,
"is_new_question": false
},
@@ -26764,8 +27362,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": 69357,
- "total_submitted": 85844,
+ "total_acs": 70520,
+ "total_submitted": 87211,
"frontend_question_id": 1967,
"is_new_question": false
},
@@ -26787,8 +27385,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": 11412,
- "total_submitted": 16577,
+ "total_acs": 11507,
+ "total_submitted": 16740,
"frontend_question_id": 1951,
"is_new_question": false
},
@@ -26810,8 +27408,8 @@
"question__title": "Strong Friendship",
"question__title_slug": "strong-friendship",
"question__hide": false,
- "total_acs": 11888,
- "total_submitted": 21833,
+ "total_acs": 11997,
+ "total_submitted": 22005,
"frontend_question_id": 1949,
"is_new_question": false
},
@@ -26833,8 +27431,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": 57269,
- "total_submitted": 90914,
+ "total_acs": 57612,
+ "total_submitted": 91532,
"frontend_question_id": 1964,
"is_new_question": false
},
@@ -26856,8 +27454,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": 73790,
- "total_submitted": 103064,
+ "total_acs": 75392,
+ "total_submitted": 105079,
"frontend_question_id": 1963,
"is_new_question": false
},
@@ -26879,8 +27477,8 @@
"question__title": "Remove Stones to Minimize the Total",
"question__title_slug": "remove-stones-to-minimize-the-total",
"question__hide": false,
- "total_acs": 98906,
- "total_submitted": 159269,
+ "total_acs": 100201,
+ "total_submitted": 160934,
"frontend_question_id": 1962,
"is_new_question": false
},
@@ -26902,8 +27500,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": 51626,
- "total_submitted": 97770,
+ "total_acs": 52539,
+ "total_submitted": 99495,
"frontend_question_id": 1961,
"is_new_question": false
},
@@ -26925,8 +27523,8 @@
"question__title": "Users That Actively Request Confirmation Messages",
"question__title_slug": "users-that-actively-request-confirmation-messages",
"question__hide": false,
- "total_acs": 11004,
- "total_submitted": 19525,
+ "total_acs": 11118,
+ "total_submitted": 19738,
"frontend_question_id": 1939,
"is_new_question": false
},
@@ -26948,8 +27546,8 @@
"question__title": "Number of Ways to Separate Numbers",
"question__title_slug": "number-of-ways-to-separate-numbers",
"question__hide": false,
- "total_acs": 6217,
- "total_submitted": 29875,
+ "total_acs": 6280,
+ "total_submitted": 30205,
"frontend_question_id": 1977,
"is_new_question": false
},
@@ -26971,8 +27569,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": 59100,
- "total_submitted": 211743,
+ "total_acs": 62429,
+ "total_submitted": 224743,
"frontend_question_id": 1976,
"is_new_question": false
},
@@ -26994,8 +27592,8 @@
"question__title": "Maximum Matrix Sum",
"question__title_slug": "maximum-matrix-sum",
"question__hide": false,
- "total_acs": 18283,
- "total_submitted": 36943,
+ "total_acs": 18429,
+ "total_submitted": 37199,
"frontend_question_id": 1975,
"is_new_question": false
},
@@ -27017,8 +27615,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": 42978,
- "total_submitted": 57173,
+ "total_acs": 43583,
+ "total_submitted": 57953,
"frontend_question_id": 1974,
"is_new_question": false
},
@@ -27040,8 +27638,8 @@
"question__title": "Confirmation Rate",
"question__title_slug": "confirmation-rate",
"question__hide": false,
- "total_acs": 177646,
- "total_submitted": 307610,
+ "total_acs": 190234,
+ "total_submitted": 327963,
"frontend_question_id": 1934,
"is_new_question": false
},
@@ -27063,8 +27661,8 @@
"question__title": "Count Number of Special Subsequences",
"question__title_slug": "count-number-of-special-subsequences",
"question__hide": false,
- "total_acs": 11442,
- "total_submitted": 22429,
+ "total_acs": 11560,
+ "total_submitted": 22626,
"frontend_question_id": 1955,
"is_new_question": false
},
@@ -27086,8 +27684,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": 35867,
- "total_submitted": 71608,
+ "total_acs": 36464,
+ "total_submitted": 72639,
"frontend_question_id": 1968,
"is_new_question": false
},
@@ -27109,8 +27707,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": 23318,
- "total_submitted": 57517,
+ "total_acs": 23519,
+ "total_submitted": 57933,
"frontend_question_id": 1953,
"is_new_question": false
},
@@ -27132,8 +27730,8 @@
"question__title": "Three Divisors",
"question__title_slug": "three-divisors",
"question__hide": false,
- "total_acs": 68384,
- "total_submitted": 112560,
+ "total_acs": 69633,
+ "total_submitted": 114488,
"frontend_question_id": 1952,
"is_new_question": false
},
@@ -27155,8 +27753,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": 1785,
- "total_submitted": 3615,
+ "total_acs": 1803,
+ "total_submitted": 3644,
"frontend_question_id": 2052,
"is_new_question": false
},
@@ -27178,8 +27776,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": 8216,
- "total_submitted": 19197,
+ "total_acs": 8293,
+ "total_submitted": 19348,
"frontend_question_id": 1959,
"is_new_question": false
},
@@ -27201,8 +27799,8 @@
"question__title": "Check if Move is Legal",
"question__title_slug": "check-if-move-is-legal",
"question__hide": false,
- "total_acs": 12894,
- "total_submitted": 27027,
+ "total_acs": 13120,
+ "total_submitted": 27403,
"frontend_question_id": 1958,
"is_new_question": false
},
@@ -27224,8 +27822,8 @@
"question__title": "Delete Duplicate Folders in System",
"question__title_slug": "delete-duplicate-folders-in-system",
"question__hide": false,
- "total_acs": 8722,
- "total_submitted": 15570,
+ "total_acs": 8807,
+ "total_submitted": 15710,
"frontend_question_id": 1948,
"is_new_question": false
},
@@ -27247,8 +27845,8 @@
"question__title": "Maximum Compatibility Score Sum",
"question__title_slug": "maximum-compatibility-score-sum",
"question__hide": false,
- "total_acs": 24416,
- "total_submitted": 39353,
+ "total_acs": 24647,
+ "total_submitted": 39676,
"frontend_question_id": 1947,
"is_new_question": false
},
@@ -27270,8 +27868,8 @@
"question__title": "Largest Number After Mutating Substring",
"question__title_slug": "largest-number-after-mutating-substring",
"question__hide": false,
- "total_acs": 20188,
- "total_submitted": 56505,
+ "total_acs": 20344,
+ "total_submitted": 56786,
"frontend_question_id": 1946,
"is_new_question": false
},
@@ -27293,8 +27891,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": 52777,
- "total_submitted": 84370,
+ "total_acs": 53289,
+ "total_submitted": 85102,
"frontend_question_id": 1945,
"is_new_question": false
},
@@ -27316,8 +27914,8 @@
"question__title": "Brightest Position on Street",
"question__title_slug": "brightest-position-on-street",
"question__hide": false,
- "total_acs": 5752,
- "total_submitted": 9263,
+ "total_acs": 5845,
+ "total_submitted": 9405,
"frontend_question_id": 2021,
"is_new_question": false
},
@@ -27339,8 +27937,8 @@
"question__title": "Erect the Fence II",
"question__title_slug": "erect-the-fence-ii",
"question__hide": false,
- "total_acs": 705,
- "total_submitted": 1370,
+ "total_acs": 714,
+ "total_submitted": 1386,
"frontend_question_id": 1924,
"is_new_question": false
},
@@ -27362,8 +27960,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": 951,
- "total_submitted": 2020,
+ "total_acs": 963,
+ "total_submitted": 2039,
"frontend_question_id": 1956,
"is_new_question": false
},
@@ -27385,8 +27983,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": 2935,
- "total_submitted": 5896,
+ "total_acs": 2958,
+ "total_submitted": 5944,
"frontend_question_id": 1950,
"is_new_question": false
},
@@ -27408,8 +28006,8 @@
"question__title": "Longest Common Subsequence Between Sorted Arrays",
"question__title_slug": "longest-common-subsequence-between-sorted-arrays",
"question__hide": false,
- "total_acs": 11009,
- "total_submitted": 13566,
+ "total_acs": 13009,
+ "total_submitted": 15986,
"frontend_question_id": 1940,
"is_new_question": false
},
@@ -27431,8 +28029,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": 3695,
- "total_submitted": 7305,
+ "total_acs": 3718,
+ "total_submitted": 7344,
"frontend_question_id": 1933,
"is_new_question": false
},
@@ -27454,8 +28052,8 @@
"question__title": "Kth Smallest Subarray Sum",
"question__title_slug": "kth-smallest-subarray-sum",
"question__hide": false,
- "total_acs": 4271,
- "total_submitted": 8095,
+ "total_acs": 4302,
+ "total_submitted": 8153,
"frontend_question_id": 1918,
"is_new_question": false
},
@@ -27477,8 +28075,8 @@
"question__title": "Maximum Genetic Difference Query",
"question__title_slug": "maximum-genetic-difference-query",
"question__hide": false,
- "total_acs": 5368,
- "total_submitted": 12698,
+ "total_acs": 5435,
+ "total_submitted": 12808,
"frontend_question_id": 1938,
"is_new_question": false
},
@@ -27500,8 +28098,8 @@
"question__title": "Maximum Number of Points with Cost",
"question__title_slug": "maximum-number-of-points-with-cost",
"question__hide": false,
- "total_acs": 59281,
- "total_submitted": 166082,
+ "total_acs": 59564,
+ "total_submitted": 166937,
"frontend_question_id": 1937,
"is_new_question": false
},
@@ -27523,8 +28121,8 @@
"question__title": "Add Minimum Number of Rungs",
"question__title_slug": "add-minimum-number-of-rungs",
"question__hide": false,
- "total_acs": 27774,
- "total_submitted": 64687,
+ "total_acs": 28116,
+ "total_submitted": 65517,
"frontend_question_id": 1936,
"is_new_question": false
},
@@ -27546,8 +28144,8 @@
"question__title": "Check for Contradictions in Equations",
"question__title_slug": "check-for-contradictions-in-equations",
"question__hide": false,
- "total_acs": 2976,
- "total_submitted": 6932,
+ "total_acs": 3091,
+ "total_submitted": 7158,
"frontend_question_id": 2307,
"is_new_question": false
},
@@ -27569,8 +28167,8 @@
"question__title": "Leetcodify Similar Friends",
"question__title_slug": "leetcodify-similar-friends",
"question__hide": false,
- "total_acs": 5369,
- "total_submitted": 12953,
+ "total_acs": 5433,
+ "total_submitted": 13088,
"frontend_question_id": 1919,
"is_new_question": false
},
@@ -27592,8 +28190,8 @@
"question__title": "Leetcodify Friends Recommendations",
"question__title_slug": "leetcodify-friends-recommendations",
"question__hide": false,
- "total_acs": 6262,
- "total_submitted": 23498,
+ "total_acs": 6339,
+ "total_submitted": 23713,
"frontend_question_id": 1917,
"is_new_question": false
},
@@ -27615,8 +28213,8 @@
"question__title": "Game of Nim",
"question__title_slug": "game-of-nim",
"question__hide": false,
- "total_acs": 4452,
- "total_submitted": 7055,
+ "total_acs": 4463,
+ "total_submitted": 7072,
"frontend_question_id": 1908,
"is_new_question": false
},
@@ -27638,8 +28236,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": 9274,
- "total_submitted": 16103,
+ "total_acs": 9354,
+ "total_submitted": 16237,
"frontend_question_id": 1931,
"is_new_question": false
},
@@ -27661,8 +28259,8 @@
"question__title": "Merge BSTs to Create Single BST",
"question__title_slug": "merge-bsts-to-create-single-bst",
"question__hide": false,
- "total_acs": 8518,
- "total_submitted": 23523,
+ "total_acs": 8641,
+ "total_submitted": 23867,
"frontend_question_id": 1932,
"is_new_question": false
},
@@ -27684,8 +28282,8 @@
"question__title": "Unique Length-3 Palindromic Subsequences",
"question__title_slug": "unique-length-3-palindromic-subsequences",
"question__hide": false,
- "total_acs": 105013,
- "total_submitted": 159023,
+ "total_acs": 105667,
+ "total_submitted": 159963,
"frontend_question_id": 1930,
"is_new_question": false
},
@@ -27707,8 +28305,8 @@
"question__title": "Concatenation of Array",
"question__title_slug": "concatenation-of-array",
"question__hide": false,
- "total_acs": 760302,
- "total_submitted": 846163,
+ "total_acs": 779958,
+ "total_submitted": 867556,
"frontend_question_id": 1929,
"is_new_question": false
},
@@ -27730,8 +28328,8 @@
"question__title": "Count Salary Categories",
"question__title_slug": "count-salary-categories",
"question__hide": false,
- "total_acs": 89680,
- "total_submitted": 154791,
+ "total_acs": 95669,
+ "total_submitted": 163554,
"frontend_question_id": 1907,
"is_new_question": false
},
@@ -27753,8 +28351,8 @@
"question__title": "Jump Game VIII",
"question__title_slug": "jump-game-viii",
"question__hide": false,
- "total_acs": 4512,
- "total_submitted": 9865,
+ "total_acs": 4700,
+ "total_submitted": 10291,
"frontend_question_id": 2297,
"is_new_question": false
},
@@ -27776,8 +28374,8 @@
"question__title": "Describe the Painting",
"question__title_slug": "describe-the-painting",
"question__hide": false,
- "total_acs": 12604,
- "total_submitted": 25362,
+ "total_acs": 12737,
+ "total_submitted": 25589,
"frontend_question_id": 1943,
"is_new_question": false
},
@@ -27799,8 +28397,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": 16917,
- "total_submitted": 40300,
+ "total_acs": 17079,
+ "total_submitted": 40623,
"frontend_question_id": 1942,
"is_new_question": false
},
@@ -27822,8 +28420,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": 95729,
- "total_submitted": 123579,
+ "total_acs": 97378,
+ "total_submitted": 125579,
"frontend_question_id": 1941,
"is_new_question": false
},
@@ -27845,8 +28443,8 @@
"question__title": "Depth of BST Given Insertion Order",
"question__title_slug": "depth-of-bst-given-insertion-order",
"question__hide": false,
- "total_acs": 2318,
- "total_submitted": 5211,
+ "total_acs": 2330,
+ "total_submitted": 5248,
"frontend_question_id": 1902,
"is_new_question": false
},
@@ -27868,8 +28466,8 @@
"question__title": "Longest Common Subpath",
"question__title_slug": "longest-common-subpath",
"question__hide": false,
- "total_acs": 7362,
- "total_submitted": 26157,
+ "total_acs": 7437,
+ "total_submitted": 26383,
"frontend_question_id": 1923,
"is_new_question": false
},
@@ -27891,8 +28489,8 @@
"question__title": "Count Good Numbers",
"question__title_slug": "count-good-numbers",
"question__hide": false,
- "total_acs": 58819,
- "total_submitted": 131356,
+ "total_acs": 62667,
+ "total_submitted": 138456,
"frontend_question_id": 1922,
"is_new_question": false
},
@@ -27914,8 +28512,8 @@
"question__title": "Eliminate Maximum Number of Monsters",
"question__title_slug": "eliminate-maximum-number-of-monsters",
"question__hide": false,
- "total_acs": 107894,
- "total_submitted": 211730,
+ "total_acs": 108275,
+ "total_submitted": 212565,
"frontend_question_id": 1921,
"is_new_question": false
},
@@ -27937,8 +28535,8 @@
"question__title": "Build Array from Permutation",
"question__title_slug": "build-array-from-permutation",
"question__hide": false,
- "total_acs": 519712,
- "total_submitted": 578822,
+ "total_acs": 529051,
+ "total_submitted": 588822,
"frontend_question_id": 1920,
"is_new_question": false
},
@@ -27960,8 +28558,8 @@
"question__title": "Find a Peak Element II",
"question__title_slug": "find-a-peak-element-ii",
"question__hide": false,
- "total_acs": 67571,
- "total_submitted": 131584,
+ "total_acs": 71600,
+ "total_submitted": 138681,
"frontend_question_id": 1901,
"is_new_question": false
},
@@ -27983,8 +28581,8 @@
"question__title": "Page Recommendations II",
"question__title_slug": "page-recommendations-ii",
"question__hide": false,
- "total_acs": 6891,
- "total_submitted": 15935,
+ "total_acs": 7010,
+ "total_submitted": 16162,
"frontend_question_id": 1892,
"is_new_question": false
},
@@ -28006,8 +28604,8 @@
"question__title": "Cutting Ribbons",
"question__title_slug": "cutting-ribbons",
"question__hide": false,
- "total_acs": 63012,
- "total_submitted": 127156,
+ "total_acs": 63384,
+ "total_submitted": 127803,
"frontend_question_id": 1891,
"is_new_question": false
},
@@ -28029,8 +28627,8 @@
"question__title": "Number of Wonderful Substrings",
"question__title_slug": "number-of-wonderful-substrings",
"question__hide": false,
- "total_acs": 80883,
- "total_submitted": 120427,
+ "total_acs": 81608,
+ "total_submitted": 121564,
"frontend_question_id": 1915,
"is_new_question": false
},
@@ -28052,8 +28650,8 @@
"question__title": "Cyclically Rotating a Grid",
"question__title_slug": "cyclically-rotating-a-grid",
"question__hide": false,
- "total_acs": 12557,
- "total_submitted": 25430,
+ "total_acs": 12641,
+ "total_submitted": 25542,
"frontend_question_id": 1914,
"is_new_question": false
},
@@ -28075,8 +28673,8 @@
"question__title": "Maximum Product Difference Between Two Pairs",
"question__title_slug": "maximum-product-difference-between-two-pairs",
"question__hide": false,
- "total_acs": 242536,
- "total_submitted": 292867,
+ "total_acs": 245310,
+ "total_submitted": 296174,
"frontend_question_id": 1913,
"is_new_question": false
},
@@ -28098,8 +28696,8 @@
"question__title": "The Latest Login in 2020",
"question__title_slug": "the-latest-login-in-2020",
"question__hide": false,
- "total_acs": 85819,
- "total_submitted": 111211,
+ "total_acs": 87305,
+ "total_submitted": 113090,
"frontend_question_id": 1890,
"is_new_question": false
},
@@ -28121,8 +28719,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": 18759,
- "total_submitted": 49528,
+ "total_acs": 18974,
+ "total_submitted": 50104,
"frontend_question_id": 1928,
"is_new_question": false
},
@@ -28144,8 +28742,8 @@
"question__title": "Sum Game",
"question__title_slug": "sum-game",
"question__hide": false,
- "total_acs": 11485,
- "total_submitted": 24044,
+ "total_acs": 11630,
+ "total_submitted": 24349,
"frontend_question_id": 1927,
"is_new_question": false
},
@@ -28167,8 +28765,8 @@
"question__title": "Nearest Exit from Entrance in Maze",
"question__title_slug": "nearest-exit-from-entrance-in-maze",
"question__hide": false,
- "total_acs": 144907,
- "total_submitted": 310954,
+ "total_acs": 148861,
+ "total_submitted": 319124,
"frontend_question_id": 1926,
"is_new_question": false
},
@@ -28190,8 +28788,8 @@
"question__title": "Count Square Sum Triples",
"question__title_slug": "count-square-sum-triples",
"question__hide": false,
- "total_acs": 44964,
- "total_submitted": 66313,
+ "total_acs": 45424,
+ "total_submitted": 66955,
"frontend_question_id": 1925,
"is_new_question": false
},
@@ -28213,8 +28811,8 @@
"question__title": "Count Pairs in Two Arrays",
"question__title_slug": "count-pairs-in-two-arrays",
"question__hide": false,
- "total_acs": 10526,
- "total_submitted": 17299,
+ "total_acs": 10650,
+ "total_submitted": 17498,
"frontend_question_id": 1885,
"is_new_question": false
},
@@ -28236,8 +28834,8 @@
"question__title": "Count Sub Islands",
"question__title_slug": "count-sub-islands",
"question__hide": false,
- "total_acs": 91890,
- "total_submitted": 136485,
+ "total_acs": 93157,
+ "total_submitted": 138201,
"frontend_question_id": 1905,
"is_new_question": false
},
@@ -28259,8 +28857,8 @@
"question__title": "Minimum Absolute Difference Queries",
"question__title_slug": "minimum-absolute-difference-queries",
"question__hide": false,
- "total_acs": 10992,
- "total_submitted": 24829,
+ "total_acs": 11111,
+ "total_submitted": 25064,
"frontend_question_id": 1906,
"is_new_question": false
},
@@ -28282,8 +28880,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": 21815,
- "total_submitted": 49580,
+ "total_acs": 21933,
+ "total_submitted": 49892,
"frontend_question_id": 1904,
"is_new_question": false
},
@@ -28305,8 +28903,8 @@
"question__title": "Largest Odd Number in String",
"question__title_slug": "largest-odd-number-in-string",
"question__hide": false,
- "total_acs": 250147,
- "total_submitted": 395942,
+ "total_acs": 258712,
+ "total_submitted": 408488,
"frontend_question_id": 1903,
"is_new_question": false
},
@@ -28328,8 +28926,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": 47464,
- "total_submitted": 65248,
+ "total_acs": 48052,
+ "total_submitted": 65981,
"frontend_question_id": 1884,
"is_new_question": false
},
@@ -28351,8 +28949,8 @@
"question__title": "Group Employees of the Same Salary",
"question__title_slug": "group-employees-of-the-same-salary",
"question__hide": false,
- "total_acs": 11717,
- "total_submitted": 17294,
+ "total_acs": 11855,
+ "total_submitted": 17509,
"frontend_question_id": 1875,
"is_new_question": false
},
@@ -28374,8 +28972,8 @@
"question__title": "Minimize Product Sum of Two Arrays",
"question__title_slug": "minimize-product-sum-of-two-arrays",
"question__hide": false,
- "total_acs": 19497,
- "total_submitted": 21822,
+ "total_acs": 19631,
+ "total_submitted": 21961,
"frontend_question_id": 1874,
"is_new_question": false
},
@@ -28397,8 +28995,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": 5407,
- "total_submitted": 10612,
+ "total_acs": 5433,
+ "total_submitted": 10664,
"frontend_question_id": 1900,
"is_new_question": false
},
@@ -28420,8 +29018,8 @@
"question__title": "Maximum Number of Removable Characters",
"question__title_slug": "maximum-number-of-removable-characters",
"question__hide": false,
- "total_acs": 29663,
- "total_submitted": 68040,
+ "total_acs": 30020,
+ "total_submitted": 68656,
"frontend_question_id": 1898,
"is_new_question": false
},
@@ -28443,8 +29041,8 @@
"question__title": "Merge Triplets to Form Target Triplet",
"question__title_slug": "merge-triplets-to-form-target-triplet",
"question__hide": false,
- "total_acs": 58890,
- "total_submitted": 89386,
+ "total_acs": 60602,
+ "total_submitted": 91810,
"frontend_question_id": 1899,
"is_new_question": false
},
@@ -28466,8 +29064,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": 137461,
- "total_submitted": 204270,
+ "total_acs": 138619,
+ "total_submitted": 206083,
"frontend_question_id": 1897,
"is_new_question": false
},
@@ -28489,8 +29087,8 @@
"question__title": "Calculate Special Bonus",
"question__title_slug": "calculate-special-bonus",
"question__hide": false,
- "total_acs": 236001,
- "total_submitted": 409632,
+ "total_acs": 238696,
+ "total_submitted": 414498,
"frontend_question_id": 1873,
"is_new_question": false
},
@@ -28512,8 +29110,8 @@
"question__title": "Design Movie Rental System",
"question__title_slug": "design-movie-rental-system",
"question__hide": false,
- "total_acs": 6439,
- "total_submitted": 17682,
+ "total_acs": 6521,
+ "total_submitted": 17871,
"frontend_question_id": 1912,
"is_new_question": false
},
@@ -28535,8 +29133,8 @@
"question__title": "Maximum Alternating Subsequence Sum",
"question__title_slug": "maximum-alternating-subsequence-sum",
"question__hide": false,
- "total_acs": 36352,
- "total_submitted": 61423,
+ "total_acs": 37121,
+ "total_submitted": 62751,
"frontend_question_id": 1911,
"is_new_question": false
},
@@ -28558,8 +29156,8 @@
"question__title": "Remove All Occurrences of a Substring",
"question__title_slug": "remove-all-occurrences-of-a-substring",
"question__hide": false,
- "total_acs": 115704,
- "total_submitted": 149792,
+ "total_acs": 119101,
+ "total_submitted": 153862,
"frontend_question_id": 1910,
"is_new_question": false
},
@@ -28581,8 +29179,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": 64382,
- "total_submitted": 235154,
+ "total_acs": 65384,
+ "total_submitted": 237831,
"frontend_question_id": 1909,
"is_new_question": false
},
@@ -28604,8 +29202,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": 41816,
- "total_submitted": 71502,
+ "total_acs": 43242,
+ "total_submitted": 73794,
"frontend_question_id": 1868,
"is_new_question": false
},
@@ -28627,8 +29225,8 @@
"question__title": "Minimum Space Wasted From Packaging",
"question__title_slug": "minimum-space-wasted-from-packaging",
"question__hide": false,
- "total_acs": 12664,
- "total_submitted": 40029,
+ "total_acs": 12747,
+ "total_submitted": 40245,
"frontend_question_id": 1889,
"is_new_question": false
},
@@ -28650,8 +29248,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": 26703,
- "total_submitted": 66916,
+ "total_acs": 27080,
+ "total_submitted": 67793,
"frontend_question_id": 1888,
"is_new_question": false
},
@@ -28673,8 +29271,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": 93918,
- "total_submitted": 128741,
+ "total_acs": 94221,
+ "total_submitted": 129187,
"frontend_question_id": 1887,
"is_new_question": false
},
@@ -28696,8 +29294,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": 68384,
- "total_submitted": 120414,
+ "total_acs": 69197,
+ "total_submitted": 121675,
"frontend_question_id": 1886,
"is_new_question": false
},
@@ -28719,8 +29317,8 @@
"question__title": "Orders With Maximum Quantity Above Average",
"question__title_slug": "orders-with-maximum-quantity-above-average",
"question__hide": false,
- "total_acs": 16022,
- "total_submitted": 22570,
+ "total_acs": 16129,
+ "total_submitted": 22706,
"frontend_question_id": 1867,
"is_new_question": false
},
@@ -28742,8 +29340,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": 6865,
- "total_submitted": 18171,
+ "total_acs": 6932,
+ "total_submitted": 18329,
"frontend_question_id": 1883,
"is_new_question": false
},
@@ -28765,8 +29363,8 @@
"question__title": "Process Tasks Using Servers",
"question__title_slug": "process-tasks-using-servers",
"question__hide": false,
- "total_acs": 32968,
- "total_submitted": 82131,
+ "total_acs": 33531,
+ "total_submitted": 83280,
"frontend_question_id": 1882,
"is_new_question": false
},
@@ -28788,8 +29386,8 @@
"question__title": "Maximum Value after Insertion",
"question__title_slug": "maximum-value-after-insertion",
"question__hide": false,
- "total_acs": 27876,
- "total_submitted": 73549,
+ "total_acs": 28026,
+ "total_submitted": 73926,
"frontend_question_id": 1881,
"is_new_question": false
},
@@ -28811,8 +29409,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": 66067,
- "total_submitted": 89147,
+ "total_acs": 66732,
+ "total_submitted": 89981,
"frontend_question_id": 1880,
"is_new_question": false
},
@@ -28834,8 +29432,8 @@
"question__title": "Longest Word With All Prefixes",
"question__title_slug": "longest-word-with-all-prefixes",
"question__hide": false,
- "total_acs": 7682,
- "total_submitted": 11233,
+ "total_acs": 7753,
+ "total_submitted": 11327,
"frontend_question_id": 1858,
"is_new_question": false
},
@@ -28857,8 +29455,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": 4039,
- "total_submitted": 7472,
+ "total_acs": 4072,
+ "total_submitted": 7527,
"frontend_question_id": 1896,
"is_new_question": false
},
@@ -28880,8 +29478,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": 1688,
- "total_submitted": 3409,
+ "total_acs": 1734,
+ "total_submitted": 3481,
"frontend_question_id": 2247,
"is_new_question": false
},
@@ -28903,8 +29501,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": 34911,
- "total_submitted": 77077,
+ "total_acs": 35246,
+ "total_submitted": 77731,
"frontend_question_id": 1894,
"is_new_question": false
},
@@ -28926,8 +29524,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": 43704,
- "total_submitted": 87586,
+ "total_acs": 44311,
+ "total_submitted": 88734,
"frontend_question_id": 1893,
"is_new_question": false
},
@@ -28949,8 +29547,8 @@
"question__title": "Convert Date Format",
"question__title_slug": "convert-date-format",
"question__hide": false,
- "total_acs": 12886,
- "total_submitted": 15026,
+ "total_acs": 12994,
+ "total_submitted": 15146,
"frontend_question_id": 1853,
"is_new_question": false
},
@@ -28972,8 +29570,8 @@
"question__title": "Distinct Numbers in Each Subarray",
"question__title_slug": "distinct-numbers-in-each-subarray",
"question__hide": false,
- "total_acs": 7294,
- "total_submitted": 10232,
+ "total_acs": 7366,
+ "total_submitted": 10326,
"frontend_question_id": 1852,
"is_new_question": false
},
@@ -28995,8 +29593,8 @@
"question__title": "Stone Game VIII",
"question__title_slug": "stone-game-viii",
"question__hide": false,
- "total_acs": 9392,
- "total_submitted": 17749,
+ "total_acs": 9499,
+ "total_submitted": 17957,
"frontend_question_id": 1872,
"is_new_question": false
},
@@ -29018,8 +29616,8 @@
"question__title": "Jump Game VII",
"question__title_slug": "jump-game-vii",
"question__hide": false,
- "total_acs": 45489,
- "total_submitted": 182938,
+ "total_acs": 46096,
+ "total_submitted": 185219,
"frontend_question_id": 1871,
"is_new_question": false
},
@@ -29041,8 +29639,8 @@
"question__title": "Minimum Speed to Arrive on Time",
"question__title_slug": "minimum-speed-to-arrive-on-time",
"question__hide": false,
- "total_acs": 99971,
- "total_submitted": 213925,
+ "total_acs": 101130,
+ "total_submitted": 216150,
"frontend_question_id": 1870,
"is_new_question": false
},
@@ -29064,8 +29662,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": 47623,
- "total_submitted": 78034,
+ "total_acs": 48075,
+ "total_submitted": 78701,
"frontend_question_id": 1869,
"is_new_question": false
},
@@ -29087,8 +29685,8 @@
"question__title": "Suspicious Bank Accounts",
"question__title_slug": "suspicious-bank-accounts",
"question__hide": false,
- "total_acs": 10997,
- "total_submitted": 24645,
+ "total_acs": 11128,
+ "total_submitted": 24874,
"frontend_question_id": 1843,
"is_new_question": false
},
@@ -29110,8 +29708,8 @@
"question__title": "Next Palindrome Using Same Digits",
"question__title_slug": "next-palindrome-using-same-digits",
"question__hide": false,
- "total_acs": 5655,
- "total_submitted": 10622,
+ "total_acs": 5702,
+ "total_submitted": 10702,
"frontend_question_id": 1842,
"is_new_question": false
},
@@ -29133,8 +29731,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": 14278,
- "total_submitted": 24990,
+ "total_acs": 14478,
+ "total_submitted": 25270,
"frontend_question_id": 1866,
"is_new_question": false
},
@@ -29156,8 +29754,8 @@
"question__title": "Finding Pairs With a Certain Sum",
"question__title_slug": "finding-pairs-with-a-certain-sum",
"question__hide": false,
- "total_acs": 25203,
- "total_submitted": 49471,
+ "total_acs": 25451,
+ "total_submitted": 49949,
"frontend_question_id": 1865,
"is_new_question": false
},
@@ -29179,8 +29777,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": 26891,
- "total_submitted": 62056,
+ "total_acs": 27098,
+ "total_submitted": 62528,
"frontend_question_id": 1864,
"is_new_question": false
},
@@ -29202,8 +29800,8 @@
"question__title": "Sum of All Subset XOR Totals",
"question__title_slug": "sum-of-all-subset-xor-totals",
"question__hide": false,
- "total_acs": 172286,
- "total_submitted": 196143,
+ "total_acs": 175276,
+ "total_submitted": 199538,
"frontend_question_id": 1863,
"is_new_question": false
},
@@ -29225,8 +29823,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": 8237,
- "total_submitted": 12278,
+ "total_acs": 8357,
+ "total_submitted": 12461,
"frontend_question_id": 2046,
"is_new_question": false
},
@@ -29248,8 +29846,8 @@
"question__title": "League Statistics",
"question__title_slug": "league-statistics",
"question__hide": false,
- "total_acs": 13408,
- "total_submitted": 25166,
+ "total_acs": 13507,
+ "total_submitted": 25307,
"frontend_question_id": 1841,
"is_new_question": false
},
@@ -29271,8 +29869,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": 15076,
- "total_submitted": 31631,
+ "total_acs": 15281,
+ "total_submitted": 31950,
"frontend_question_id": 1878,
"is_new_question": false
},
@@ -29294,8 +29892,8 @@
"question__title": "Minimum XOR Sum of Two Arrays",
"question__title_slug": "minimum-xor-sum-of-two-arrays",
"question__hide": false,
- "total_acs": 14041,
- "total_submitted": 29614,
+ "total_acs": 14248,
+ "total_submitted": 30010,
"frontend_question_id": 1879,
"is_new_question": false
},
@@ -29317,8 +29915,8 @@
"question__title": "Minimize Maximum Pair Sum in Array",
"question__title_slug": "minimize-maximum-pair-sum-in-array",
"question__hide": false,
- "total_acs": 174745,
- "total_submitted": 214560,
+ "total_acs": 176272,
+ "total_submitted": 216365,
"frontend_question_id": 1877,
"is_new_question": false
},
@@ -29340,8 +29938,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": 121129,
- "total_submitted": 164948,
+ "total_acs": 123665,
+ "total_submitted": 168090,
"frontend_question_id": 1876,
"is_new_question": false
},
@@ -29363,8 +29961,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": 64982,
- "total_submitted": 129555,
+ "total_acs": 65482,
+ "total_submitted": 130801,
"frontend_question_id": 1857,
"is_new_question": false
},
@@ -29386,8 +29984,8 @@
"question__title": "Maximum Subarray Min-Product",
"question__title_slug": "maximum-subarray-min-product",
"question__hide": false,
- "total_acs": 27395,
- "total_submitted": 72167,
+ "total_acs": 27751,
+ "total_submitted": 72991,
"frontend_question_id": 1856,
"is_new_question": false
},
@@ -29409,8 +30007,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": 49524,
- "total_submitted": 92673,
+ "total_acs": 49970,
+ "total_submitted": 93478,
"frontend_question_id": 1855,
"is_new_question": false
},
@@ -29432,8 +30030,8 @@
"question__title": "Maximum Population Year",
"question__title_slug": "maximum-population-year",
"question__hide": false,
- "total_acs": 68352,
- "total_submitted": 112643,
+ "total_acs": 69660,
+ "total_submitted": 114544,
"frontend_question_id": 1854,
"is_new_question": false
},
@@ -29455,8 +30053,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": 28399,
- "total_submitted": 39504,
+ "total_acs": 28627,
+ "total_submitted": 39822,
"frontend_question_id": 1836,
"is_new_question": false
},
@@ -29478,8 +30076,8 @@
"question__title": "Maximum Transaction Each Day",
"question__title_slug": "maximum-transaction-each-day",
"question__hide": false,
- "total_acs": 18623,
- "total_submitted": 22842,
+ "total_acs": 18938,
+ "total_submitted": 23204,
"frontend_question_id": 1831,
"is_new_question": false
},
@@ -29501,8 +30099,8 @@
"question__title": "Faulty Sensor",
"question__title_slug": "faulty-sensor",
"question__hide": false,
- "total_acs": 4461,
- "total_submitted": 8915,
+ "total_acs": 4508,
+ "total_submitted": 9013,
"frontend_question_id": 1826,
"is_new_question": false
},
@@ -29524,8 +30122,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": 2100,
- "total_submitted": 4080,
+ "total_acs": 2132,
+ "total_submitted": 4157,
"frontend_question_id": 1989,
"is_new_question": false
},
@@ -29547,8 +30145,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": 21506,
- "total_submitted": 30201,
+ "total_acs": 21755,
+ "total_submitted": 30520,
"frontend_question_id": 1850,
"is_new_question": false
},
@@ -29570,8 +30168,8 @@
"question__title": "Minimum Interval to Include Each Query",
"question__title_slug": "minimum-interval-to-include-each-query",
"question__hide": false,
- "total_acs": 32989,
- "total_submitted": 66527,
+ "total_acs": 34029,
+ "total_submitted": 68314,
"frontend_question_id": 1851,
"is_new_question": false
},
@@ -29593,8 +30191,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": 25857,
- "total_submitted": 72832,
+ "total_acs": 26277,
+ "total_submitted": 73634,
"frontend_question_id": 1849,
"is_new_question": false
},
@@ -29616,8 +30214,8 @@
"question__title": "Minimum Distance to the Target Element",
"question__title_slug": "minimum-distance-to-the-target-element",
"question__hide": false,
- "total_acs": 44673,
- "total_submitted": 81826,
+ "total_acs": 45200,
+ "total_submitted": 82846,
"frontend_question_id": 1848,
"is_new_question": false
},
@@ -29639,8 +30237,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": 23735,
- "total_submitted": 27002,
+ "total_acs": 24197,
+ "total_submitted": 27533,
"frontend_question_id": 1821,
"is_new_question": false
},
@@ -29662,8 +30260,8 @@
"question__title": "Rotating the Box",
"question__title_slug": "rotating-the-box",
"question__hide": false,
- "total_acs": 52762,
- "total_submitted": 78247,
+ "total_acs": 53123,
+ "total_submitted": 78705,
"frontend_question_id": 1861,
"is_new_question": false
},
@@ -29685,8 +30283,8 @@
"question__title": "Incremental Memory Leak",
"question__title_slug": "incremental-memory-leak",
"question__hide": false,
- "total_acs": 19100,
- "total_submitted": 26534,
+ "total_acs": 19275,
+ "total_submitted": 26774,
"frontend_question_id": 1860,
"is_new_question": false
},
@@ -29708,8 +30306,8 @@
"question__title": "Sorting the Sentence",
"question__title_slug": "sorting-the-sentence",
"question__hide": false,
- "total_acs": 164911,
- "total_submitted": 198427,
+ "total_acs": 167437,
+ "total_submitted": 201387,
"frontend_question_id": 1859,
"is_new_question": false
},
@@ -29731,8 +30329,8 @@
"question__title": "Maximum Number of Accepted Invitations",
"question__title_slug": "maximum-number-of-accepted-invitations",
"question__hide": false,
- "total_acs": 6978,
- "total_submitted": 14085,
+ "total_acs": 7364,
+ "total_submitted": 14775,
"frontend_question_id": 1820,
"is_new_question": false
},
@@ -29754,8 +30352,8 @@
"question__title": "Maximum Building Height",
"question__title_slug": "maximum-building-height",
"question__hide": false,
- "total_acs": 7182,
- "total_submitted": 19923,
+ "total_acs": 7244,
+ "total_submitted": 20041,
"frontend_question_id": 1840,
"is_new_question": false
},
@@ -29777,8 +30375,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": 31051,
- "total_submitted": 63005,
+ "total_acs": 31392,
+ "total_submitted": 63635,
"frontend_question_id": 1839,
"is_new_question": false
},
@@ -29800,8 +30398,8 @@
"question__title": "Frequency of the Most Frequent Element",
"question__title_slug": "frequency-of-the-most-frequent-element",
"question__hide": false,
- "total_acs": 141636,
- "total_submitted": 316502,
+ "total_acs": 145210,
+ "total_submitted": 325228,
"frontend_question_id": 1838,
"is_new_question": false
},
@@ -29823,8 +30421,8 @@
"question__title": "Sum of Digits in Base K",
"question__title_slug": "sum-of-digits-in-base-k",
"question__hide": false,
- "total_acs": 54094,
- "total_submitted": 69883,
+ "total_acs": 54755,
+ "total_submitted": 70665,
"frontend_question_id": 1837,
"is_new_question": false
},
@@ -29846,8 +30444,8 @@
"question__title": "Find Interview Candidates",
"question__title_slug": "find-interview-candidates",
"question__hide": false,
- "total_acs": 15219,
- "total_submitted": 25011,
+ "total_acs": 15363,
+ "total_submitted": 25242,
"frontend_question_id": 1811,
"is_new_question": false
},
@@ -29869,8 +30467,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": 19347,
- "total_submitted": 31677,
+ "total_acs": 19595,
+ "total_submitted": 32020,
"frontend_question_id": 1835,
"is_new_question": false
},
@@ -29892,8 +30490,8 @@
"question__title": "Single-Threaded CPU",
"question__title_slug": "single-threaded-cpu",
"question__hide": false,
- "total_acs": 105638,
- "total_submitted": 231949,
+ "total_acs": 106931,
+ "total_submitted": 234632,
"frontend_question_id": 1834,
"is_new_question": false
},
@@ -29915,8 +30513,8 @@
"question__title": "Maximum Ice Cream Bars",
"question__title_slug": "maximum-ice-cream-bars",
"question__hide": false,
- "total_acs": 157032,
- "total_submitted": 212813,
+ "total_acs": 158131,
+ "total_submitted": 214256,
"frontend_question_id": 1833,
"is_new_question": false
},
@@ -29938,8 +30536,8 @@
"question__title": "Check if the Sentence Is Pangram",
"question__title_slug": "check-if-the-sentence-is-pangram",
"question__hide": false,
- "total_acs": 336823,
- "total_submitted": 404650,
+ "total_acs": 342586,
+ "total_submitted": 411429,
"frontend_question_id": 1832,
"is_new_question": false
},
@@ -29961,8 +30559,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": 3066,
- "total_submitted": 5463,
+ "total_acs": 3135,
+ "total_submitted": 5569,
"frontend_question_id": 1810,
"is_new_question": false
},
@@ -29984,8 +30582,8 @@
"question__title": "Ad-Free Sessions",
"question__title_slug": "ad-free-sessions",
"question__hide": false,
- "total_acs": 15603,
- "total_submitted": 26705,
+ "total_acs": 15753,
+ "total_submitted": 26910,
"frontend_question_id": 1809,
"is_new_question": false
},
@@ -30007,8 +30605,8 @@
"question__title": "Closest Room",
"question__title_slug": "closest-room",
"question__hide": false,
- "total_acs": 8965,
- "total_submitted": 23758,
+ "total_acs": 9066,
+ "total_submitted": 23948,
"frontend_question_id": 1847,
"is_new_question": false
},
@@ -30030,8 +30628,8 @@
"question__title": "Maximum Element After Decreasing and Rearranging",
"question__title_slug": "maximum-element-after-decreasing-and-rearranging",
"question__hide": false,
- "total_acs": 103681,
- "total_submitted": 157358,
+ "total_acs": 104101,
+ "total_submitted": 158028,
"frontend_question_id": 1846,
"is_new_question": false
},
@@ -30053,8 +30651,8 @@
"question__title": "Seat Reservation Manager",
"question__title_slug": "seat-reservation-manager",
"question__hide": false,
- "total_acs": 121546,
- "total_submitted": 175588,
+ "total_acs": 122547,
+ "total_submitted": 176950,
"frontend_question_id": 1845,
"is_new_question": false
},
@@ -30076,8 +30674,8 @@
"question__title": "Replace All Digits with Characters",
"question__title_slug": "replace-all-digits-with-characters",
"question__hide": false,
- "total_acs": 86238,
- "total_submitted": 106213,
+ "total_acs": 87477,
+ "total_submitted": 107622,
"frontend_question_id": 1844,
"is_new_question": false
},
@@ -30099,8 +30697,8 @@
"question__title": "Finding MK Average",
"question__title_slug": "finding-mk-average",
"question__hide": false,
- "total_acs": 17825,
- "total_submitted": 48010,
+ "total_acs": 18409,
+ "total_submitted": 49408,
"frontend_question_id": 1825,
"is_new_question": false
},
@@ -30122,8 +30720,8 @@
"question__title": "Minimum Sideway Jumps",
"question__title_slug": "minimum-sideway-jumps",
"question__hide": false,
- "total_acs": 40967,
- "total_submitted": 82063,
+ "total_acs": 41837,
+ "total_submitted": 83686,
"frontend_question_id": 1824,
"is_new_question": false
},
@@ -30145,8 +30743,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": 133255,
- "total_submitted": 170056,
+ "total_acs": 135740,
+ "total_submitted": 173067,
"frontend_question_id": 1823,
"is_new_question": false
},
@@ -30168,8 +30766,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": 336760,
- "total_submitted": 515836,
+ "total_acs": 339688,
+ "total_submitted": 520296,
"frontend_question_id": 1822,
"is_new_question": false
},
@@ -30191,8 +30789,8 @@
"question__title": "Implement Trie II (Prefix Tree)",
"question__title_slug": "implement-trie-ii-prefix-tree",
"question__hide": false,
- "total_acs": 18233,
- "total_submitted": 29651,
+ "total_acs": 18376,
+ "total_submitted": 29945,
"frontend_question_id": 1804,
"is_new_question": false
},
@@ -30214,8 +30812,8 @@
"question__title": "Rearrange Products Table",
"question__title_slug": "rearrange-products-table",
"question__hide": false,
- "total_acs": 127781,
- "total_submitted": 149990,
+ "total_acs": 129784,
+ "total_submitted": 152286,
"frontend_question_id": 1795,
"is_new_question": false
},
@@ -30237,8 +30835,8 @@
"question__title": "Number of Different Subsequences GCDs",
"question__title_slug": "number-of-different-subsequences-gcds",
"question__hide": false,
- "total_acs": 9009,
- "total_submitted": 22224,
+ "total_acs": 9081,
+ "total_submitted": 22353,
"frontend_question_id": 1819,
"is_new_question": false
},
@@ -30260,8 +30858,8 @@
"question__title": "Minimum Absolute Sum Difference",
"question__title_slug": "minimum-absolute-sum-difference",
"question__hide": false,
- "total_acs": 24851,
- "total_submitted": 81274,
+ "total_acs": 25099,
+ "total_submitted": 81914,
"frontend_question_id": 1818,
"is_new_question": false
},
@@ -30283,8 +30881,8 @@
"question__title": "Finding the Users Active Minutes",
"question__title_slug": "finding-the-users-active-minutes",
"question__hide": false,
- "total_acs": 57841,
- "total_submitted": 71873,
+ "total_acs": 58301,
+ "total_submitted": 72418,
"frontend_question_id": 1817,
"is_new_question": false
},
@@ -30306,8 +30904,8 @@
"question__title": "Truncate Sentence",
"question__title_slug": "truncate-sentence",
"question__hide": false,
- "total_acs": 167305,
- "total_submitted": 196776,
+ "total_acs": 170560,
+ "total_submitted": 200359,
"frontend_question_id": 1816,
"is_new_question": false
},
@@ -30329,8 +30927,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": 1938,
- "total_submitted": 2970,
+ "total_acs": 1952,
+ "total_submitted": 2989,
"frontend_question_id": 1794,
"is_new_question": false
},
@@ -30352,8 +30950,8 @@
"question__title": "Primary Department for Each Employee",
"question__title_slug": "primary-department-for-each-employee",
"question__hide": false,
- "total_acs": 107218,
- "total_submitted": 167467,
+ "total_acs": 114125,
+ "total_submitted": 178017,
"frontend_question_id": 1789,
"is_new_question": false
},
@@ -30375,8 +30973,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": 3864,
- "total_submitted": 7838,
+ "total_acs": 3938,
+ "total_submitted": 7937,
"frontend_question_id": 1830,
"is_new_question": false
},
@@ -30398,8 +30996,8 @@
"question__title": "Maximum XOR for Each Query",
"question__title_slug": "maximum-xor-for-each-query",
"question__hide": false,
- "total_acs": 28759,
- "total_submitted": 37277,
+ "total_acs": 29178,
+ "total_submitted": 37774,
"frontend_question_id": 1829,
"is_new_question": false
},
@@ -30421,8 +31019,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": 76339,
- "total_submitted": 88507,
+ "total_acs": 77078,
+ "total_submitted": 89333,
"frontend_question_id": 1828,
"is_new_question": false
},
@@ -30444,8 +31042,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": 92815,
- "total_submitted": 116904,
+ "total_acs": 97347,
+ "total_submitted": 121866,
"frontend_question_id": 1827,
"is_new_question": false
},
@@ -30467,8 +31065,8 @@
"question__title": "Maximize the Beauty of the Garden",
"question__title_slug": "maximize-the-beauty-of-the-garden",
"question__hide": false,
- "total_acs": 2228,
- "total_submitted": 3314,
+ "total_acs": 2235,
+ "total_submitted": 3327,
"frontend_question_id": 1788,
"is_new_question": false
},
@@ -30490,8 +31088,8 @@
"question__title": "Maximize Number of Nice Divisors",
"question__title_slug": "maximize-number-of-nice-divisors",
"question__hide": false,
- "total_acs": 6909,
- "total_submitted": 21065,
+ "total_acs": 6974,
+ "total_submitted": 21213,
"frontend_question_id": 1808,
"is_new_question": false
},
@@ -30513,8 +31111,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": 18736,
- "total_submitted": 25832,
+ "total_acs": 18891,
+ "total_submitted": 26021,
"frontend_question_id": 1806,
"is_new_question": false
},
@@ -30536,8 +31134,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": 30303,
- "total_submitted": 45373,
+ "total_acs": 30581,
+ "total_submitted": 45736,
"frontend_question_id": 1807,
"is_new_question": false
},
@@ -30559,8 +31157,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": 47546,
- "total_submitted": 125620,
+ "total_acs": 48026,
+ "total_submitted": 126756,
"frontend_question_id": 1805,
"is_new_question": false
},
@@ -30582,8 +31180,8 @@
"question__title": "Grand Slam Titles",
"question__title_slug": "grand-slam-titles",
"question__hide": false,
- "total_acs": 24643,
- "total_submitted": 29508,
+ "total_acs": 25022,
+ "total_submitted": 29953,
"frontend_question_id": 1783,
"is_new_question": false
},
@@ -30605,8 +31203,8 @@
"question__title": "Shortest Path in a Hidden Grid",
"question__title_slug": "shortest-path-in-a-hidden-grid",
"question__hide": false,
- "total_acs": 6738,
- "total_submitted": 17074,
+ "total_acs": 7210,
+ "total_submitted": 18116,
"frontend_question_id": 1778,
"is_new_question": false
},
@@ -30628,8 +31226,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": 17080,
- "total_submitted": 29142,
+ "total_acs": 19384,
+ "total_submitted": 31958,
"frontend_question_id": 1798,
"is_new_question": false
},
@@ -30651,8 +31249,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": 72111,
- "total_submitted": 183845,
+ "total_acs": 72443,
+ "total_submitted": 184738,
"frontend_question_id": 1802,
"is_new_question": false
},
@@ -30674,8 +31272,8 @@
"question__title": "Number of Orders in the Backlog",
"question__title_slug": "number-of-orders-in-the-backlog",
"question__hide": false,
- "total_acs": 20723,
- "total_submitted": 41676,
+ "total_acs": 20925,
+ "total_submitted": 42116,
"frontend_question_id": 1801,
"is_new_question": false
},
@@ -30697,8 +31295,8 @@
"question__title": "Maximum Ascending Subarray Sum",
"question__title_slug": "maximum-ascending-subarray-sum",
"question__hide": false,
- "total_acs": 55959,
- "total_submitted": 90154,
+ "total_acs": 56740,
+ "total_submitted": 91453,
"frontend_question_id": 1800,
"is_new_question": false
},
@@ -30720,8 +31318,8 @@
"question__title": "Product's Price for Each Store",
"question__title_slug": "products-price-for-each-store",
"question__hide": false,
- "total_acs": 20001,
- "total_submitted": 24273,
+ "total_acs": 20309,
+ "total_submitted": 24623,
"frontend_question_id": 1777,
"is_new_question": false
},
@@ -30743,8 +31341,8 @@
"question__title": "Count Nice Pairs in an Array",
"question__title_slug": "count-nice-pairs-in-an-array",
"question__hide": false,
- "total_acs": 107995,
- "total_submitted": 220612,
+ "total_acs": 108594,
+ "total_submitted": 222090,
"frontend_question_id": 1814,
"is_new_question": false
},
@@ -30766,8 +31364,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": 6527,
- "total_submitted": 16362,
+ "total_acs": 6566,
+ "total_submitted": 16444,
"frontend_question_id": 1815,
"is_new_question": false
},
@@ -30789,8 +31387,8 @@
"question__title": "Sentence Similarity III",
"question__title_slug": "sentence-similarity-iii",
"question__hide": false,
- "total_acs": 16728,
- "total_submitted": 49963,
+ "total_acs": 16936,
+ "total_submitted": 50603,
"frontend_question_id": 1813,
"is_new_question": false
},
@@ -30812,8 +31410,8 @@
"question__title": "Determine Color of a Chessboard Square",
"question__title_slug": "determine-color-of-a-chessboard-square",
"question__hide": false,
- "total_acs": 81190,
- "total_submitted": 103663,
+ "total_acs": 82328,
+ "total_submitted": 105006,
"frontend_question_id": 1812,
"is_new_question": false
},
@@ -30835,8 +31433,8 @@
"question__title": "Sort Features by Popularity",
"question__title_slug": "sort-features-by-popularity",
"question__hide": false,
- "total_acs": 6028,
- "total_submitted": 9165,
+ "total_acs": 6061,
+ "total_submitted": 9212,
"frontend_question_id": 1772,
"is_new_question": false
},
@@ -30858,8 +31456,8 @@
"question__title": "Maximum Score of a Good Subarray",
"question__title_slug": "maximum-score-of-a-good-subarray",
"question__hide": false,
- "total_acs": 73741,
- "total_submitted": 114573,
+ "total_acs": 74222,
+ "total_submitted": 115383,
"frontend_question_id": 1793,
"is_new_question": false
},
@@ -30881,8 +31479,8 @@
"question__title": "Maximum Average Pass Ratio",
"question__title_slug": "maximum-average-pass-ratio",
"question__hide": false,
- "total_acs": 21772,
- "total_submitted": 40556,
+ "total_acs": 21949,
+ "total_submitted": 40787,
"frontend_question_id": 1792,
"is_new_question": false
},
@@ -30904,8 +31502,8 @@
"question__title": "Find Center of Star Graph",
"question__title_slug": "find-center-of-star-graph",
"question__hide": false,
- "total_acs": 189912,
- "total_submitted": 227050,
+ "total_acs": 193096,
+ "total_submitted": 230690,
"frontend_question_id": 1791,
"is_new_question": false
},
@@ -30927,8 +31525,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": 107376,
- "total_submitted": 234881,
+ "total_acs": 108692,
+ "total_submitted": 237875,
"frontend_question_id": 1790,
"is_new_question": false
},
@@ -30950,8 +31548,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": 12386,
- "total_submitted": 16017,
+ "total_acs": 12601,
+ "total_submitted": 16281,
"frontend_question_id": 1767,
"is_new_question": false
},
@@ -30973,8 +31571,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": 5171,
- "total_submitted": 13091,
+ "total_acs": 5232,
+ "total_submitted": 13238,
"frontend_question_id": 1787,
"is_new_question": false
},
@@ -30996,8 +31594,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": 23672,
- "total_submitted": 60501,
+ "total_acs": 23998,
+ "total_submitted": 61297,
"frontend_question_id": 1786,
"is_new_question": false
},
@@ -31019,8 +31617,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": 21256,
- "total_submitted": 49027,
+ "total_acs": 21471,
+ "total_submitted": 49441,
"frontend_question_id": 1785,
"is_new_question": false
},
@@ -31042,8 +31640,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": 42881,
- "total_submitted": 109421,
+ "total_acs": 43466,
+ "total_submitted": 110863,
"frontend_question_id": 1784,
"is_new_question": false
},
@@ -31065,8 +31663,8 @@
"question__title": "Buildings With an Ocean View",
"question__title_slug": "buildings-with-an-ocean-view",
"question__hide": false,
- "total_acs": 215124,
- "total_submitted": 269668,
+ "total_acs": 219051,
+ "total_submitted": 274435,
"frontend_question_id": 1762,
"is_new_question": false
},
@@ -31088,8 +31686,8 @@
"question__title": "Recyclable and Low Fat Products",
"question__title_slug": "recyclable-and-low-fat-products",
"question__hide": false,
- "total_acs": 1002882,
- "total_submitted": 1124805,
+ "total_acs": 1047488,
+ "total_submitted": 1174969,
"frontend_question_id": 1757,
"is_new_question": false
},
@@ -31111,8 +31709,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": 9140,
- "total_submitted": 18999,
+ "total_acs": 9225,
+ "total_submitted": 19166,
"frontend_question_id": 1803,
"is_new_question": false
},
@@ -31134,8 +31732,8 @@
"question__title": "Maximize Score After N Operations",
"question__title_slug": "maximize-score-after-n-operations",
"question__hide": false,
- "total_acs": 59598,
- "total_submitted": 103212,
+ "total_acs": 59913,
+ "total_submitted": 103755,
"frontend_question_id": 1799,
"is_new_question": false
},
@@ -31157,8 +31755,8 @@
"question__title": "Design Authentication Manager",
"question__title_slug": "design-authentication-manager",
"question__hide": false,
- "total_acs": 28761,
- "total_submitted": 50204,
+ "total_acs": 29459,
+ "total_submitted": 51349,
"frontend_question_id": 1797,
"is_new_question": false
},
@@ -31180,8 +31778,8 @@
"question__title": "Second Largest Digit in a String",
"question__title_slug": "second-largest-digit-in-a-string",
"question__hide": false,
- "total_acs": 56581,
- "total_submitted": 112557,
+ "total_acs": 57554,
+ "total_submitted": 114252,
"frontend_question_id": 1796,
"is_new_question": false
},
@@ -31203,8 +31801,8 @@
"question__title": "Design Most Recently Used Queue",
"question__title_slug": "design-most-recently-used-queue",
"question__hide": false,
- "total_acs": 16074,
- "total_submitted": 21260,
+ "total_acs": 16718,
+ "total_submitted": 22086,
"frontend_question_id": 1756,
"is_new_question": false
},
@@ -31226,8 +31824,8 @@
"question__title": "Car Fleet II",
"question__title_slug": "car-fleet-ii",
"question__hide": false,
- "total_acs": 25523,
- "total_submitted": 46404,
+ "total_acs": 25790,
+ "total_submitted": 46789,
"frontend_question_id": 1776,
"is_new_question": false
},
@@ -31249,8 +31847,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": 29295,
- "total_submitted": 54634,
+ "total_acs": 29482,
+ "total_submitted": 54969,
"frontend_question_id": 1775,
"is_new_question": false
},
@@ -31272,8 +31870,8 @@
"question__title": "Closest Dessert Cost",
"question__title_slug": "closest-dessert-cost",
"question__hide": false,
- "total_acs": 30183,
- "total_submitted": 63558,
+ "total_acs": 30455,
+ "total_submitted": 64032,
"frontend_question_id": 1774,
"is_new_question": false
},
@@ -31295,8 +31893,8 @@
"question__title": "Count Items Matching a Rule",
"question__title_slug": "count-items-matching-a-rule",
"question__hide": false,
- "total_acs": 221814,
- "total_submitted": 261384,
+ "total_acs": 225051,
+ "total_submitted": 265062,
"frontend_question_id": 1773,
"is_new_question": false
},
@@ -31318,8 +31916,8 @@
"question__title": "Leetflex Banned Accounts",
"question__title_slug": "leetflex-banned-accounts",
"question__hide": false,
- "total_acs": 21033,
- "total_submitted": 32915,
+ "total_acs": 21417,
+ "total_submitted": 33665,
"frontend_question_id": 1747,
"is_new_question": false
},
@@ -31341,8 +31939,8 @@
"question__title": "Maximize Palindrome Length From Subsequences",
"question__title_slug": "maximize-palindrome-length-from-subsequences",
"question__hide": false,
- "total_acs": 11071,
- "total_submitted": 30529,
+ "total_acs": 11149,
+ "total_submitted": 30802,
"frontend_question_id": 1771,
"is_new_question": false
},
@@ -31364,8 +31962,8 @@
"question__title": "Maximum Score from Performing Multiplication Operations",
"question__title_slug": "maximum-score-from-performing-multiplication-operations",
"question__hide": false,
- "total_acs": 111006,
- "total_submitted": 276057,
+ "total_acs": 111715,
+ "total_submitted": 277114,
"frontend_question_id": 1770,
"is_new_question": false
},
@@ -31387,8 +31985,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": 125895,
- "total_submitted": 146693,
+ "total_acs": 127282,
+ "total_submitted": 148253,
"frontend_question_id": 1769,
"is_new_question": false
},
@@ -31410,8 +32008,8 @@
"question__title": "Merge Strings Alternately",
"question__title_slug": "merge-strings-alternately",
"question__hide": false,
- "total_acs": 833854,
- "total_submitted": 1043786,
+ "total_acs": 870258,
+ "total_submitted": 1087471,
"frontend_question_id": 1768,
"is_new_question": false
},
@@ -31433,8 +32031,8 @@
"question__title": "Maximum Subarray Sum After One Operation",
"question__title_slug": "maximum-subarray-sum-after-one-operation",
"question__hide": false,
- "total_acs": 9078,
- "total_submitted": 14580,
+ "total_acs": 9129,
+ "total_submitted": 14652,
"frontend_question_id": 1746,
"is_new_question": false
},
@@ -31456,8 +32054,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": 133774,
- "total_submitted": 154016,
+ "total_acs": 136122,
+ "total_submitted": 156680,
"frontend_question_id": 1741,
"is_new_question": false
},
@@ -31479,8 +32077,8 @@
"question__title": "Count Pairs Of Nodes",
"question__title_slug": "count-pairs-of-nodes",
"question__hide": false,
- "total_acs": 6712,
- "total_submitted": 16765,
+ "total_acs": 6810,
+ "total_submitted": 16954,
"frontend_question_id": 1782,
"is_new_question": false
},
@@ -31502,8 +32100,8 @@
"question__title": "Sum of Beauty of All Substrings",
"question__title_slug": "sum-of-beauty-of-all-substrings",
"question__hide": false,
- "total_acs": 49651,
- "total_submitted": 76061,
+ "total_acs": 53337,
+ "total_submitted": 80982,
"frontend_question_id": 1781,
"is_new_question": false
},
@@ -31525,8 +32123,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": 41982,
- "total_submitted": 61956,
+ "total_acs": 42372,
+ "total_submitted": 62512,
"frontend_question_id": 1780,
"is_new_question": false
},
@@ -31548,8 +32146,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": 114528,
- "total_submitted": 167244,
+ "total_acs": 115135,
+ "total_submitted": 167977,
"frontend_question_id": 1779,
"is_new_question": false
},
@@ -31571,8 +32169,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": 22709,
- "total_submitted": 53687,
+ "total_acs": 22900,
+ "total_submitted": 54098,
"frontend_question_id": 1761,
"is_new_question": false
},
@@ -31594,8 +32192,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": 38767,
- "total_submitted": 64474,
+ "total_acs": 39419,
+ "total_submitted": 65432,
"frontend_question_id": 1760,
"is_new_question": false
},
@@ -31617,8 +32215,8 @@
"question__title": "Count Number of Homogenous Substrings",
"question__title_slug": "count-number-of-homogenous-substrings",
"question__hide": false,
- "total_acs": 111245,
- "total_submitted": 192737,
+ "total_acs": 111680,
+ "total_submitted": 193511,
"frontend_question_id": 1759,
"is_new_question": false
},
@@ -31640,8 +32238,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": 144585,
- "total_submitted": 226721,
+ "total_acs": 145572,
+ "total_submitted": 228254,
"frontend_question_id": 1758,
"is_new_question": false
},
@@ -31663,8 +32261,8 @@
"question__title": "Find Distance in a Binary Tree",
"question__title_slug": "find-distance-in-a-binary-tree",
"question__hide": false,
- "total_acs": 25169,
- "total_submitted": 35297,
+ "total_acs": 25419,
+ "total_submitted": 35596,
"frontend_question_id": 1740,
"is_new_question": false
},
@@ -31686,8 +32284,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": 119785,
- "total_submitted": 254460,
+ "total_acs": 127421,
+ "total_submitted": 268274,
"frontend_question_id": 1731,
"is_new_question": false
},
@@ -31709,8 +32307,8 @@
"question__title": "Closest Subsequence Sum",
"question__title_slug": "closest-subsequence-sum",
"question__hide": false,
- "total_acs": 17286,
- "total_submitted": 44160,
+ "total_acs": 17606,
+ "total_submitted": 44868,
"frontend_question_id": 1755,
"is_new_question": false
},
@@ -31732,8 +32330,8 @@
"question__title": "Largest Merge Of Two Strings",
"question__title_slug": "largest-merge-of-two-strings",
"question__hide": false,
- "total_acs": 22564,
- "total_submitted": 47001,
+ "total_acs": 22961,
+ "total_submitted": 47586,
"frontend_question_id": 1754,
"is_new_question": false
},
@@ -31755,8 +32353,8 @@
"question__title": "Maximum Score From Removing Stones",
"question__title_slug": "maximum-score-from-removing-stones",
"question__hide": false,
- "total_acs": 40452,
- "total_submitted": 59962,
+ "total_acs": 41127,
+ "total_submitted": 61035,
"frontend_question_id": 1753,
"is_new_question": false
},
@@ -31778,8 +32376,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": 223965,
- "total_submitted": 439769,
+ "total_acs": 239168,
+ "total_submitted": 468496,
"frontend_question_id": 1752,
"is_new_question": false
},
@@ -31801,8 +32399,8 @@
"question__title": "Find Followers Count",
"question__title_slug": "find-followers-count",
"question__hide": false,
- "total_acs": 180505,
- "total_submitted": 261508,
+ "total_acs": 189129,
+ "total_submitted": 273947,
"frontend_question_id": 1729,
"is_new_question": false
},
@@ -31824,8 +32422,8 @@
"question__title": "Map of Highest Peak",
"question__title_slug": "map-of-highest-peak",
"question__hide": false,
- "total_acs": 27347,
- "total_submitted": 43818,
+ "total_acs": 27597,
+ "total_submitted": 44178,
"frontend_question_id": 1765,
"is_new_question": false
},
@@ -31847,8 +32445,8 @@
"question__title": "Tree of Coprimes",
"question__title_slug": "tree-of-coprimes",
"question__hide": false,
- "total_acs": 9553,
- "total_submitted": 23383,
+ "total_acs": 9678,
+ "total_submitted": 23631,
"frontend_question_id": 1766,
"is_new_question": false
},
@@ -31870,8 +32468,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": 15428,
- "total_submitted": 28862,
+ "total_acs": 15613,
+ "total_submitted": 29165,
"frontend_question_id": 1764,
"is_new_question": false
},
@@ -31893,8 +32491,8 @@
"question__title": "Longest Nice Substring",
"question__title_slug": "longest-nice-substring",
"question__hide": false,
- "total_acs": 54392,
- "total_submitted": 89934,
+ "total_acs": 55312,
+ "total_submitted": 91323,
"frontend_question_id": 1763,
"is_new_question": false
},
@@ -31916,8 +32514,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": 10547,
- "total_submitted": 31031,
+ "total_acs": 10655,
+ "total_submitted": 31247,
"frontend_question_id": 1744,
"is_new_question": false
},
@@ -31939,8 +32537,8 @@
"question__title": "Palindrome Partitioning IV",
"question__title_slug": "palindrome-partitioning-iv",
"question__hide": false,
- "total_acs": 24715,
- "total_submitted": 55838,
+ "total_acs": 24987,
+ "total_submitted": 56437,
"frontend_question_id": 1745,
"is_new_question": false
},
@@ -31962,8 +32560,8 @@
"question__title": "Restore the Array From Adjacent Pairs",
"question__title_slug": "restore-the-array-from-adjacent-pairs",
"question__hide": false,
- "total_acs": 106815,
- "total_submitted": 142814,
+ "total_acs": 107131,
+ "total_submitted": 143283,
"frontend_question_id": 1743,
"is_new_question": false
},
@@ -31985,8 +32583,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": 2932,
- "total_submitted": 5697,
+ "total_acs": 2961,
+ "total_submitted": 5746,
"frontend_question_id": 1724,
"is_new_question": false
},
@@ -32008,8 +32606,8 @@
"question__title": "Count Apples and Oranges",
"question__title_slug": "count-apples-and-oranges",
"question__hide": false,
- "total_acs": 15265,
- "total_submitted": 20224,
+ "total_acs": 15400,
+ "total_submitted": 20409,
"frontend_question_id": 1715,
"is_new_question": false
},
@@ -32031,8 +32629,8 @@
"question__title": "Building Boxes",
"question__title_slug": "building-boxes",
"question__hide": false,
- "total_acs": 7185,
- "total_submitted": 13765,
+ "total_acs": 7286,
+ "total_submitted": 13937,
"frontend_question_id": 1739,
"is_new_question": false
},
@@ -32054,8 +32652,8 @@
"question__title": "Find Kth Largest XOR Coordinate Value",
"question__title_slug": "find-kth-largest-xor-coordinate-value",
"question__hide": false,
- "total_acs": 22010,
- "total_submitted": 35635,
+ "total_acs": 22269,
+ "total_submitted": 35998,
"frontend_question_id": 1738,
"is_new_question": false
},
@@ -32077,8 +32675,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": 13560,
- "total_submitted": 37105,
+ "total_acs": 13651,
+ "total_submitted": 37285,
"frontend_question_id": 1737,
"is_new_question": false
},
@@ -32100,8 +32698,8 @@
"question__title": "Latest Time by Replacing Hidden Digits",
"question__title_slug": "latest-time-by-replacing-hidden-digits",
"question__hide": false,
- "total_acs": 35995,
- "total_submitted": 84268,
+ "total_acs": 36360,
+ "total_submitted": 85104,
"frontend_question_id": 1736,
"is_new_question": false
},
@@ -32123,8 +32721,8 @@
"question__title": "Biggest Window Between Visits",
"question__title_slug": "biggest-window-between-visits",
"question__hide": false,
- "total_acs": 22784,
- "total_submitted": 32255,
+ "total_acs": 23106,
+ "total_submitted": 32714,
"frontend_question_id": 1709,
"is_new_question": false
},
@@ -32146,8 +32744,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": 74587,
- "total_submitted": 120703,
+ "total_acs": 74992,
+ "total_submitted": 121500,
"frontend_question_id": 1751,
"is_new_question": false
},
@@ -32169,8 +32767,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": 159929,
- "total_submitted": 285486,
+ "total_acs": 160951,
+ "total_submitted": 287341,
"frontend_question_id": 1750,
"is_new_question": false
},
@@ -32192,8 +32790,8 @@
"question__title": "Maximum Absolute Sum of Any Subarray",
"question__title_slug": "maximum-absolute-sum-of-any-subarray",
"question__hide": false,
- "total_acs": 39073,
- "total_submitted": 65309,
+ "total_acs": 39557,
+ "total_submitted": 65967,
"frontend_question_id": 1749,
"is_new_question": false
},
@@ -32215,8 +32813,8 @@
"question__title": "Sum of Unique Elements",
"question__title_slug": "sum-of-unique-elements",
"question__hide": false,
- "total_acs": 169193,
- "total_submitted": 217741,
+ "total_acs": 172184,
+ "total_submitted": 221252,
"frontend_question_id": 1748,
"is_new_question": false
},
@@ -32238,8 +32836,8 @@
"question__title": "Largest Subarray Length K",
"question__title_slug": "largest-subarray-length-k",
"question__hide": false,
- "total_acs": 8499,
- "total_submitted": 13116,
+ "total_acs": 8566,
+ "total_submitted": 13214,
"frontend_question_id": 1708,
"is_new_question": false
},
@@ -32261,8 +32859,8 @@
"question__title": "Largest Submatrix With Rearrangements",
"question__title_slug": "largest-submatrix-with-rearrangements",
"question__hide": false,
- "total_acs": 71509,
- "total_submitted": 94951,
+ "total_acs": 71810,
+ "total_submitted": 95366,
"frontend_question_id": 1727,
"is_new_question": false
},
@@ -32284,8 +32882,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": 63812,
- "total_submitted": 86920,
+ "total_acs": 64420,
+ "total_submitted": 87702,
"frontend_question_id": 1742,
"is_new_question": false
},
@@ -32307,8 +32905,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": 70393,
- "total_submitted": 89460,
+ "total_acs": 71226,
+ "total_submitted": 90480,
"frontend_question_id": 1725,
"is_new_question": false
},
@@ -32330,8 +32928,8 @@
"question__title": "Number of Calls Between Two Persons",
"question__title_slug": "number-of-calls-between-two-persons",
"question__hide": false,
- "total_acs": 41652,
- "total_submitted": 51338,
+ "total_acs": 42020,
+ "total_submitted": 51796,
"frontend_question_id": 1699,
"is_new_question": false
},
@@ -32353,8 +32951,8 @@
"question__title": "Minimize Hamming Distance After Swap Operations",
"question__title_slug": "minimize-hamming-distance-after-swap-operations",
"question__hide": false,
- "total_acs": 17889,
- "total_submitted": 36665,
+ "total_acs": 18043,
+ "total_submitted": 36925,
"frontend_question_id": 1722,
"is_new_question": false
},
@@ -32376,8 +32974,8 @@
"question__title": "Decode XORed Array",
"question__title_slug": "decode-xored-array",
"question__hide": false,
- "total_acs": 153262,
- "total_submitted": 177501,
+ "total_acs": 154886,
+ "total_submitted": 179273,
"frontend_question_id": 1720,
"is_new_question": false
},
@@ -32399,8 +32997,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": 10770,
- "total_submitted": 16842,
+ "total_acs": 10874,
+ "total_submitted": 16976,
"frontend_question_id": 1698,
"is_new_question": false
},
@@ -32422,8 +33020,8 @@
"question__title": "Daily Leads and Partners",
"question__title_slug": "daily-leads-and-partners",
"question__hide": false,
- "total_acs": 123109,
- "total_submitted": 142257,
+ "total_acs": 125394,
+ "total_submitted": 144873,
"frontend_question_id": 1693,
"is_new_question": false
},
@@ -32445,8 +33043,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": 5874,
- "total_submitted": 11431,
+ "total_acs": 5949,
+ "total_submitted": 11545,
"frontend_question_id": 1735,
"is_new_question": false
},
@@ -32468,8 +33066,8 @@
"question__title": "Decode XORed Permutation",
"question__title_slug": "decode-xored-permutation",
"question__hide": false,
- "total_acs": 15080,
- "total_submitted": 23324,
+ "total_acs": 15218,
+ "total_submitted": 23493,
"frontend_question_id": 1734,
"is_new_question": false
},
@@ -32491,8 +33089,8 @@
"question__title": "Minimum Number of People to Teach",
"question__title_slug": "minimum-number-of-people-to-teach",
"question__hide": false,
- "total_acs": 9236,
- "total_submitted": 21760,
+ "total_acs": 9355,
+ "total_submitted": 22019,
"frontend_question_id": 1733,
"is_new_question": false
},
@@ -32514,8 +33112,8 @@
"question__title": "Find the Highest Altitude",
"question__title_slug": "find-the-highest-altitude",
"question__hide": false,
- "total_acs": 386561,
- "total_submitted": 464790,
+ "total_acs": 398754,
+ "total_submitted": 479067,
"frontend_question_id": 1732,
"is_new_question": false
},
@@ -32537,8 +33135,8 @@
"question__title": "Minimum Operations to Make a Subsequence",
"question__title_slug": "minimum-operations-to-make-a-subsequence",
"question__hide": false,
- "total_acs": 11747,
- "total_submitted": 24732,
+ "total_acs": 11984,
+ "total_submitted": 25184,
"frontend_question_id": 1713,
"is_new_question": false
},
@@ -32560,8 +33158,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": 32573,
- "total_submitted": 98891,
+ "total_acs": 32787,
+ "total_submitted": 99421,
"frontend_question_id": 1712,
"is_new_question": false
},
@@ -32583,8 +33181,8 @@
"question__title": "Count Good Meals",
"question__title_slug": "count-good-meals",
"question__hide": false,
- "total_acs": 38567,
- "total_submitted": 127629,
+ "total_acs": 38951,
+ "total_submitted": 128552,
"frontend_question_id": 1711,
"is_new_question": false
},
@@ -32606,8 +33204,8 @@
"question__title": "Maximum Units on a Truck",
"question__title_slug": "maximum-units-on-a-truck",
"question__hide": false,
- "total_acs": 303236,
- "total_submitted": 411807,
+ "total_acs": 305409,
+ "total_submitted": 414542,
"frontend_question_id": 1710,
"is_new_question": false
},
@@ -32629,8 +33227,8 @@
"question__title": "Count Ways to Distribute Candies",
"question__title_slug": "count-ways-to-distribute-candies",
"question__hide": false,
- "total_acs": 2545,
- "total_submitted": 4040,
+ "total_acs": 2581,
+ "total_submitted": 4093,
"frontend_question_id": 1692,
"is_new_question": false
},
@@ -32652,8 +33250,8 @@
"question__title": "Invalid Tweets",
"question__title_slug": "invalid-tweets",
"question__hide": false,
- "total_acs": 471210,
- "total_submitted": 553208,
+ "total_acs": 502723,
+ "total_submitted": 590260,
"frontend_question_id": 1683,
"is_new_question": false
},
@@ -32675,8 +33273,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": 22090,
- "total_submitted": 44467,
+ "total_acs": 22927,
+ "total_submitted": 45730,
"frontend_question_id": 1707,
"is_new_question": false
},
@@ -32698,8 +33296,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": 27087,
- "total_submitted": 63916,
+ "total_acs": 27350,
+ "total_submitted": 64499,
"frontend_question_id": 1723,
"is_new_question": false
},
@@ -32721,8 +33319,8 @@
"question__title": "Maximum Number of Eaten Apples",
"question__title_slug": "maximum-number-of-eaten-apples",
"question__hide": false,
- "total_acs": 22828,
- "total_submitted": 58480,
+ "total_acs": 22987,
+ "total_submitted": 58798,
"frontend_question_id": 1705,
"is_new_question": false
},
@@ -32744,8 +33342,8 @@
"question__title": "Determine if String Halves Are Alike",
"question__title_slug": "determine-if-string-halves-are-alike",
"question__hide": false,
- "total_acs": 353096,
- "total_submitted": 448834,
+ "total_acs": 356872,
+ "total_submitted": 453655,
"frontend_question_id": 1704,
"is_new_question": false
},
@@ -32767,8 +33365,8 @@
"question__title": "Longest Palindromic Subsequence II",
"question__title_slug": "longest-palindromic-subsequence-ii",
"question__hide": false,
- "total_acs": 5428,
- "total_submitted": 10874,
+ "total_acs": 5460,
+ "total_submitted": 10917,
"frontend_question_id": 1682,
"is_new_question": false
},
@@ -32790,8 +33388,8 @@
"question__title": "Product's Worth Over Invoices",
"question__title_slug": "products-worth-over-invoices",
"question__hide": false,
- "total_acs": 16917,
- "total_submitted": 44385,
+ "total_acs": 17040,
+ "total_submitted": 44701,
"frontend_question_id": 1677,
"is_new_question": false
},
@@ -32813,8 +33411,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": 4345,
- "total_submitted": 9822,
+ "total_acs": 4387,
+ "total_submitted": 9908,
"frontend_question_id": 1719,
"is_new_question": false
},
@@ -32836,8 +33434,8 @@
"question__title": "Construct the Lexicographically Largest Valid Sequence",
"question__title_slug": "construct-the-lexicographically-largest-valid-sequence",
"question__hide": false,
- "total_acs": 13724,
- "total_submitted": 25636,
+ "total_acs": 13841,
+ "total_submitted": 25831,
"frontend_question_id": 1718,
"is_new_question": false
},
@@ -32859,8 +33457,8 @@
"question__title": "Maximum Score From Removing Substrings",
"question__title_slug": "maximum-score-from-removing-substrings",
"question__hide": false,
- "total_acs": 14846,
- "total_submitted": 31586,
+ "total_acs": 15008,
+ "total_submitted": 31861,
"frontend_question_id": 1717,
"is_new_question": false
},
@@ -32882,8 +33480,8 @@
"question__title": "Calculate Money in Leetcode Bank",
"question__title_slug": "calculate-money-in-leetcode-bank",
"question__hide": false,
- "total_acs": 158608,
- "total_submitted": 202632,
+ "total_acs": 159525,
+ "total_submitted": 203737,
"frontend_question_id": 1716,
"is_new_question": false
},
@@ -32905,8 +33503,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": 42736,
- "total_submitted": 54456,
+ "total_acs": 43469,
+ "total_submitted": 55354,
"frontend_question_id": 1676,
"is_new_question": false
},
@@ -32928,8 +33526,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": 50411,
- "total_submitted": 80759,
+ "total_acs": 50700,
+ "total_submitted": 81231,
"frontend_question_id": 1697,
"is_new_question": false
},
@@ -32951,8 +33549,8 @@
"question__title": "Jump Game VI",
"question__title_slug": "jump-game-vi",
"question__hide": false,
- "total_acs": 107296,
- "total_submitted": 234783,
+ "total_acs": 107816,
+ "total_submitted": 236020,
"frontend_question_id": 1696,
"is_new_question": false
},
@@ -32974,8 +33572,8 @@
"question__title": "Maximum Erasure Value",
"question__title_slug": "maximum-erasure-value",
"question__hide": false,
- "total_acs": 128351,
- "total_submitted": 220434,
+ "total_acs": 129355,
+ "total_submitted": 221986,
"frontend_question_id": 1695,
"is_new_question": false
},
@@ -32997,8 +33595,8 @@
"question__title": "Reformat Phone Number",
"question__title_slug": "reformat-phone-number",
"question__hide": false,
- "total_acs": 37954,
- "total_submitted": 57899,
+ "total_acs": 38502,
+ "total_submitted": 58594,
"frontend_question_id": 1694,
"is_new_question": false
},
@@ -33020,8 +33618,8 @@
"question__title": "Fix Names in a Table",
"question__title_slug": "fix-names-in-a-table",
"question__hide": false,
- "total_acs": 216504,
- "total_submitted": 351594,
+ "total_acs": 223396,
+ "total_submitted": 363345,
"frontend_question_id": 1667,
"is_new_question": false
},
@@ -33043,8 +33641,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": 4696,
- "total_submitted": 6368,
+ "total_acs": 4771,
+ "total_submitted": 6457,
"frontend_question_id": 1666,
"is_new_question": false
},
@@ -33066,8 +33664,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": 1383,
- "total_submitted": 2785,
+ "total_acs": 1390,
+ "total_submitted": 2798,
"frontend_question_id": 1714,
"is_new_question": false
},
@@ -33089,8 +33687,8 @@
"question__title": "Stone Game VII",
"question__title_slug": "stone-game-vii",
"question__hide": false,
- "total_acs": 35653,
- "total_submitted": 61554,
+ "total_acs": 35910,
+ "total_submitted": 61932,
"frontend_question_id": 1690,
"is_new_question": false
},
@@ -33112,8 +33710,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": 216409,
- "total_submitted": 243988,
+ "total_acs": 218610,
+ "total_submitted": 246422,
"frontend_question_id": 1689,
"is_new_question": false
},
@@ -33135,8 +33733,8 @@
"question__title": "Count of Matches in Tournament",
"question__title_slug": "count-of-matches-in-tournament",
"question__hide": false,
- "total_acs": 242258,
- "total_submitted": 282601,
+ "total_acs": 244251,
+ "total_submitted": 284913,
"frontend_question_id": 1688,
"is_new_question": false
},
@@ -33158,8 +33756,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": 10949,
- "total_submitted": 25482,
+ "total_acs": 11034,
+ "total_submitted": 25734,
"frontend_question_id": 1703,
"is_new_question": false
},
@@ -33181,8 +33779,8 @@
"question__title": "Maximum Binary String After Change",
"question__title_slug": "maximum-binary-string-after-change",
"question__hide": false,
- "total_acs": 13030,
- "total_submitted": 27776,
+ "total_acs": 13150,
+ "total_submitted": 28042,
"frontend_question_id": 1702,
"is_new_question": false
},
@@ -33204,8 +33802,8 @@
"question__title": "Average Waiting Time",
"question__title_slug": "average-waiting-time",
"question__hide": false,
- "total_acs": 29750,
- "total_submitted": 46806,
+ "total_acs": 30104,
+ "total_submitted": 47327,
"frontend_question_id": 1701,
"is_new_question": false
},
@@ -33227,8 +33825,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": 238988,
- "total_submitted": 305633,
+ "total_acs": 243302,
+ "total_submitted": 311103,
"frontend_question_id": 1700,
"is_new_question": false
},
@@ -33250,8 +33848,8 @@
"question__title": "Average Time of Process per Machine",
"question__title_slug": "average-time-of-process-per-machine",
"question__hide": false,
- "total_acs": 242619,
- "total_submitted": 362049,
+ "total_acs": 259232,
+ "total_submitted": 386173,
"frontend_question_id": 1661,
"is_new_question": false
},
@@ -33273,8 +33871,8 @@
"question__title": "Concatenation of Consecutive Binary Numbers",
"question__title_slug": "concatenation-of-consecutive-binary-numbers",
"question__hide": false,
- "total_acs": 90328,
- "total_submitted": 158181,
+ "total_acs": 90511,
+ "total_submitted": 158506,
"frontend_question_id": 1680,
"is_new_question": false
},
@@ -33296,8 +33894,8 @@
"question__title": "Minimum Incompatibility",
"question__title_slug": "minimum-incompatibility",
"question__hide": false,
- "total_acs": 8318,
- "total_submitted": 21424,
+ "total_acs": 8434,
+ "total_submitted": 21706,
"frontend_question_id": 1681,
"is_new_question": false
},
@@ -33319,8 +33917,8 @@
"question__title": "Max Number of K-Sum Pairs",
"question__title_slug": "max-number-of-k-sum-pairs",
"question__hide": false,
- "total_acs": 287923,
- "total_submitted": 523361,
+ "total_acs": 298333,
+ "total_submitted": 541878,
"frontend_question_id": 1679,
"is_new_question": false
},
@@ -33342,8 +33940,8 @@
"question__title": "Goal Parser Interpretation",
"question__title_slug": "goal-parser-interpretation",
"question__hide": false,
- "total_acs": 251246,
- "total_submitted": 288218,
+ "total_acs": 254466,
+ "total_submitted": 291716,
"frontend_question_id": 1678,
"is_new_question": false
},
@@ -33365,8 +33963,8 @@
"question__title": "Correct a Binary Tree",
"question__title_slug": "correct-a-binary-tree",
"question__hide": false,
- "total_acs": 19412,
- "total_submitted": 26103,
+ "total_acs": 19520,
+ "total_submitted": 26242,
"frontend_question_id": 1660,
"is_new_question": false
},
@@ -33388,8 +33986,8 @@
"question__title": "Hopper Company Queries III",
"question__title_slug": "hopper-company-queries-iii",
"question__hide": false,
- "total_acs": 6636,
- "total_submitted": 10197,
+ "total_acs": 6727,
+ "total_submitted": 10318,
"frontend_question_id": 1651,
"is_new_question": false
},
@@ -33411,8 +34009,8 @@
"question__title": "Minimize Deviation in Array",
"question__title_slug": "minimize-deviation-in-array",
"question__hide": false,
- "total_acs": 93954,
- "total_submitted": 173759,
+ "total_acs": 94353,
+ "total_submitted": 174571,
"frontend_question_id": 1675,
"is_new_question": false
},
@@ -33434,8 +34032,8 @@
"question__title": "Minimum Moves to Make Array Complementary",
"question__title_slug": "minimum-moves-to-make-array-complementary",
"question__hide": false,
- "total_acs": 8800,
- "total_submitted": 22248,
+ "total_acs": 8909,
+ "total_submitted": 22446,
"frontend_question_id": 1674,
"is_new_question": false
},
@@ -33457,8 +34055,8 @@
"question__title": "Find the Most Competitive Subsequence",
"question__title_slug": "find-the-most-competitive-subsequence",
"question__hide": false,
- "total_acs": 62927,
- "total_submitted": 124953,
+ "total_acs": 63530,
+ "total_submitted": 126013,
"frontend_question_id": 1673,
"is_new_question": false
},
@@ -33480,8 +34078,8 @@
"question__title": "Richest Customer Wealth",
"question__title_slug": "richest-customer-wealth",
"question__hide": false,
- "total_acs": 868591,
- "total_submitted": 987327,
+ "total_acs": 882052,
+ "total_submitted": 1001968,
"frontend_question_id": 1672,
"is_new_question": false
},
@@ -33503,8 +34101,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": 236791,
- "total_submitted": 296774,
+ "total_acs": 241434,
+ "total_submitted": 302071,
"frontend_question_id": 1650,
"is_new_question": false
},
@@ -33526,8 +34124,8 @@
"question__title": "Delivering Boxes from Storage to Ports",
"question__title_slug": "delivering-boxes-from-storage-to-ports",
"question__hide": false,
- "total_acs": 6334,
- "total_submitted": 16268,
+ "total_acs": 6384,
+ "total_submitted": 16391,
"frontend_question_id": 1687,
"is_new_question": false
},
@@ -33549,8 +34147,8 @@
"question__title": "Stone Game VI",
"question__title_slug": "stone-game-vi",
"question__hide": false,
- "total_acs": 19568,
- "total_submitted": 34340,
+ "total_acs": 19859,
+ "total_submitted": 34758,
"frontend_question_id": 1686,
"is_new_question": false
},
@@ -33572,8 +34170,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": 108048,
- "total_submitted": 157715,
+ "total_acs": 108920,
+ "total_submitted": 158998,
"frontend_question_id": 1685,
"is_new_question": false
},
@@ -33595,8 +34193,8 @@
"question__title": "Count the Number of Consistent Strings",
"question__title_slug": "count-the-number-of-consistent-strings",
"question__hide": false,
- "total_acs": 178245,
- "total_submitted": 214293,
+ "total_acs": 180766,
+ "total_submitted": 217122,
"frontend_question_id": 1684,
"is_new_question": false
},
@@ -33618,8 +34216,8 @@
"question__title": "Hopper Company Queries II",
"question__title_slug": "hopper-company-queries-ii",
"question__hide": false,
- "total_acs": 6454,
- "total_submitted": 16520,
+ "total_acs": 6520,
+ "total_submitted": 16659,
"frontend_question_id": 1645,
"is_new_question": false
},
@@ -33641,8 +34239,8 @@
"question__title": "Minimum Initial Energy to Finish Tasks",
"question__title_slug": "minimum-initial-energy-to-finish-tasks",
"question__hide": false,
- "total_acs": 17354,
- "total_submitted": 29990,
+ "total_acs": 17536,
+ "total_submitted": 30233,
"frontend_question_id": 1665,
"is_new_question": false
},
@@ -33664,8 +34262,8 @@
"question__title": "Ways to Make a Fair Array",
"question__title_slug": "ways-to-make-a-fair-array",
"question__hide": false,
- "total_acs": 38761,
- "total_submitted": 61010,
+ "total_acs": 39042,
+ "total_submitted": 61469,
"frontend_question_id": 1664,
"is_new_question": false
},
@@ -33687,8 +34285,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": 94290,
- "total_submitted": 141171,
+ "total_acs": 94573,
+ "total_submitted": 141542,
"frontend_question_id": 1663,
"is_new_question": false
},
@@ -33710,8 +34308,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": 484671,
- "total_submitted": 567525,
+ "total_acs": 490115,
+ "total_submitted": 573619,
"frontend_question_id": 1662,
"is_new_question": false
},
@@ -33733,8 +34331,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": 79580,
- "total_submitted": 123738,
+ "total_acs": 80753,
+ "total_submitted": 125266,
"frontend_question_id": 1644,
"is_new_question": false
},
@@ -33756,8 +34354,8 @@
"question__title": "Hopper Company Queries I",
"question__title_slug": "hopper-company-queries-i",
"question__hide": false,
- "total_acs": 8375,
- "total_submitted": 17620,
+ "total_acs": 8447,
+ "total_submitted": 17769,
"frontend_question_id": 1635,
"is_new_question": false
},
@@ -33779,8 +34377,8 @@
"question__title": "Maximize Grid Happiness",
"question__title_slug": "maximize-grid-happiness",
"question__hide": false,
- "total_acs": 5475,
- "total_submitted": 13834,
+ "total_acs": 5526,
+ "total_submitted": 13971,
"frontend_question_id": 1659,
"is_new_question": false
},
@@ -33802,8 +34400,8 @@
"question__title": "Determine if Two Strings Are Close",
"question__title_slug": "determine-if-two-strings-are-close",
"question__hide": false,
- "total_acs": 331816,
- "total_submitted": 605395,
+ "total_acs": 340876,
+ "total_submitted": 623012,
"frontend_question_id": 1657,
"is_new_question": false
},
@@ -33825,8 +34423,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": 191296,
- "total_submitted": 481790,
+ "total_acs": 192683,
+ "total_submitted": 485016,
"frontend_question_id": 1658,
"is_new_question": false
},
@@ -33848,8 +34446,8 @@
"question__title": "Design an Ordered Stream",
"question__title_slug": "design-an-ordered-stream",
"question__hide": false,
- "total_acs": 86795,
- "total_submitted": 102919,
+ "total_acs": 87410,
+ "total_submitted": 103639,
"frontend_question_id": 1656,
"is_new_question": false
},
@@ -33871,8 +34469,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": 10014,
- "total_submitted": 18062,
+ "total_acs": 10052,
+ "total_submitted": 18115,
"frontend_question_id": 1634,
"is_new_question": false
},
@@ -33894,8 +34492,8 @@
"question__title": "Percentage of Users Attended a Contest",
"question__title_slug": "percentage-of-users-attended-a-contest",
"question__hide": false,
- "total_acs": 167043,
- "total_submitted": 303373,
+ "total_acs": 178330,
+ "total_submitted": 321660,
"frontend_question_id": 1633,
"is_new_question": false
},
@@ -33917,8 +34515,8 @@
"question__title": "Create Sorted Array through Instructions",
"question__title_slug": "create-sorted-array-through-instructions",
"question__hide": false,
- "total_acs": 25716,
- "total_submitted": 66398,
+ "total_acs": 26007,
+ "total_submitted": 66837,
"frontend_question_id": 1649,
"is_new_question": false
},
@@ -33940,8 +34538,8 @@
"question__title": "Sell Diminishing-Valued Colored Balls",
"question__title_slug": "sell-diminishing-valued-colored-balls",
"question__hide": false,
- "total_acs": 37492,
- "total_submitted": 125016,
+ "total_acs": 37631,
+ "total_submitted": 125559,
"frontend_question_id": 1648,
"is_new_question": false
},
@@ -33963,8 +34561,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": 273553,
- "total_submitted": 446838,
+ "total_acs": 274353,
+ "total_submitted": 448126,
"frontend_question_id": 1647,
"is_new_question": false
},
@@ -33986,8 +34584,8 @@
"question__title": "Get Maximum in Generated Array",
"question__title_slug": "get-maximum-in-generated-array",
"question__hide": false,
- "total_acs": 108504,
- "total_submitted": 215182,
+ "total_acs": 109037,
+ "total_submitted": 216202,
"frontend_question_id": 1646,
"is_new_question": false
},
@@ -34009,8 +34607,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": 26448,
- "total_submitted": 32033,
+ "total_acs": 26546,
+ "total_submitted": 32154,
"frontend_question_id": 1628,
"is_new_question": false
},
@@ -34032,8 +34630,8 @@
"question__title": "Design Front Middle Back Queue",
"question__title_slug": "design-front-middle-back-queue",
"question__hide": false,
- "total_acs": 27858,
- "total_submitted": 49393,
+ "total_acs": 28110,
+ "total_submitted": 49852,
"frontend_question_id": 1670,
"is_new_question": false
},
@@ -34055,8 +34653,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": 29945,
- "total_submitted": 71757,
+ "total_acs": 30494,
+ "total_submitted": 73039,
"frontend_question_id": 1671,
"is_new_question": false
},
@@ -34078,8 +34676,8 @@
"question__title": "Merge In Between Linked Lists",
"question__title_slug": "merge-in-between-linked-lists",
"question__hide": false,
- "total_acs": 211254,
- "total_submitted": 259194,
+ "total_acs": 213466,
+ "total_submitted": 261735,
"frontend_question_id": 1669,
"is_new_question": false
},
@@ -34101,8 +34699,8 @@
"question__title": "Maximum Repeating Substring",
"question__title_slug": "maximum-repeating-substring",
"question__hide": false,
- "total_acs": 50451,
- "total_submitted": 130613,
+ "total_acs": 52109,
+ "total_submitted": 134699,
"frontend_question_id": 1668,
"is_new_question": false
},
@@ -34124,8 +34722,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": 19636,
- "total_submitted": 23959,
+ "total_acs": 19781,
+ "total_submitted": 24133,
"frontend_question_id": 1623,
"is_new_question": false
},
@@ -34147,8 +34745,8 @@
"question__title": "Furthest Building You Can Reach",
"question__title_slug": "furthest-building-you-can-reach",
"question__hide": false,
- "total_acs": 223158,
- "total_submitted": 448739,
+ "total_acs": 225227,
+ "total_submitted": 452548,
"frontend_question_id": 1642,
"is_new_question": false
},
@@ -34170,8 +34768,8 @@
"question__title": "Count Sorted Vowel Strings",
"question__title_slug": "count-sorted-vowel-strings",
"question__hide": false,
- "total_acs": 183387,
- "total_submitted": 234064,
+ "total_acs": 184712,
+ "total_submitted": 235552,
"frontend_question_id": 1641,
"is_new_question": false
},
@@ -34193,8 +34791,8 @@
"question__title": "Check Array Formation Through Concatenation",
"question__title_slug": "check-array-formation-through-concatenation",
"question__hide": false,
- "total_acs": 81899,
- "total_submitted": 144871,
+ "total_acs": 82219,
+ "total_submitted": 145424,
"frontend_question_id": 1640,
"is_new_question": false
},
@@ -34216,8 +34814,8 @@
"question__title": "Find the Missing IDs",
"question__title_slug": "find-the-missing-ids",
"question__hide": false,
- "total_acs": 18768,
- "total_submitted": 25675,
+ "total_acs": 18907,
+ "total_submitted": 25878,
"frontend_question_id": 1613,
"is_new_question": false
},
@@ -34239,8 +34837,8 @@
"question__title": "Distribute Repeating Integers",
"question__title_slug": "distribute-repeating-integers",
"question__hide": false,
- "total_acs": 14816,
- "total_submitted": 37478,
+ "total_acs": 15044,
+ "total_submitted": 38062,
"frontend_question_id": 1655,
"is_new_question": false
},
@@ -34262,8 +34860,8 @@
"question__title": "Minimum Jumps to Reach Home",
"question__title_slug": "minimum-jumps-to-reach-home",
"question__hide": false,
- "total_acs": 42827,
- "total_submitted": 145943,
+ "total_acs": 43113,
+ "total_submitted": 146828,
"frontend_question_id": 1654,
"is_new_question": false
},
@@ -34285,8 +34883,8 @@
"question__title": "Minimum Deletions to Make String Balanced",
"question__title_slug": "minimum-deletions-to-make-string-balanced",
"question__hide": false,
- "total_acs": 42288,
- "total_submitted": 71960,
+ "total_acs": 42655,
+ "total_submitted": 72628,
"frontend_question_id": 1653,
"is_new_question": false
},
@@ -34308,8 +34906,8 @@
"question__title": "Defuse the Bomb",
"question__title_slug": "defuse-the-bomb",
"question__hide": false,
- "total_acs": 45092,
- "total_submitted": 68864,
+ "total_acs": 46457,
+ "total_submitted": 70697,
"frontend_question_id": 1652,
"is_new_question": false
},
@@ -34331,8 +34929,8 @@
"question__title": "Path With Minimum Effort",
"question__title_slug": "path-with-minimum-effort",
"question__hide": false,
- "total_acs": 255020,
- "total_submitted": 427918,
+ "total_acs": 260556,
+ "total_submitted": 436308,
"frontend_question_id": 1631,
"is_new_question": false
},
@@ -34354,8 +34952,8 @@
"question__title": "Arithmetic Subarrays",
"question__title_slug": "arithmetic-subarrays",
"question__hide": false,
- "total_acs": 136676,
- "total_submitted": 163213,
+ "total_acs": 137381,
+ "total_submitted": 164044,
"frontend_question_id": 1630,
"is_new_question": false
},
@@ -34377,8 +34975,8 @@
"question__title": "Slowest Key",
"question__title_slug": "slowest-key",
"question__hide": false,
- "total_acs": 99785,
- "total_submitted": 168954,
+ "total_acs": 100317,
+ "total_submitted": 169799,
"frontend_question_id": 1629,
"is_new_question": false
},
@@ -34400,8 +34998,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": 7290,
- "total_submitted": 10294,
+ "total_acs": 7353,
+ "total_submitted": 10368,
"frontend_question_id": 1612,
"is_new_question": false
},
@@ -34423,8 +35021,8 @@
"question__title": "Sellers With No Sales",
"question__title_slug": "sellers-with-no-sales",
"question__hide": false,
- "total_acs": 33110,
- "total_submitted": 61018,
+ "total_acs": 33497,
+ "total_submitted": 61737,
"frontend_question_id": 1607,
"is_new_question": false
},
@@ -34446,8 +35044,8 @@
"question__title": "Best Team With No Conflicts",
"question__title_slug": "best-team-with-no-conflicts",
"question__hide": false,
- "total_acs": 82400,
- "total_submitted": 163650,
+ "total_acs": 83024,
+ "total_submitted": 164826,
"frontend_question_id": 1626,
"is_new_question": false
},
@@ -34469,8 +35067,8 @@
"question__title": "Lexicographically Smallest String After Applying Operations",
"question__title_slug": "lexicographically-smallest-string-after-applying-operations",
"question__hide": false,
- "total_acs": 14658,
- "total_submitted": 22423,
+ "total_acs": 14761,
+ "total_submitted": 22554,
"frontend_question_id": 1625,
"is_new_question": false
},
@@ -34492,8 +35090,8 @@
"question__title": "Largest Substring Between Two Equal Characters",
"question__title_slug": "largest-substring-between-two-equal-characters",
"question__hide": false,
- "total_acs": 152859,
- "total_submitted": 222835,
+ "total_acs": 154301,
+ "total_submitted": 224950,
"frontend_question_id": 1624,
"is_new_question": false
},
@@ -34515,8 +35113,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": 23047,
- "total_submitted": 30544,
+ "total_acs": 23145,
+ "total_submitted": 30669,
"frontend_question_id": 1602,
"is_new_question": false
},
@@ -34538,8 +35136,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": 56687,
- "total_submitted": 110313,
+ "total_acs": 57028,
+ "total_submitted": 111239,
"frontend_question_id": 1639,
"is_new_question": false
},
@@ -34561,8 +35159,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": 29777,
- "total_submitted": 41895,
+ "total_acs": 30174,
+ "total_submitted": 42402,
"frontend_question_id": 1638,
"is_new_question": false
},
@@ -34584,8 +35182,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": 168310,
- "total_submitted": 192301,
+ "total_acs": 170413,
+ "total_submitted": 194700,
"frontend_question_id": 1637,
"is_new_question": false
},
@@ -34607,8 +35205,8 @@
"question__title": "Sort Array by Increasing Frequency",
"question__title_slug": "sort-array-by-increasing-frequency",
"question__hide": false,
- "total_acs": 127072,
- "total_submitted": 177358,
+ "total_acs": 128799,
+ "total_submitted": 179503,
"frontend_question_id": 1636,
"is_new_question": false
},
@@ -34630,8 +35228,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": 10387,
- "total_submitted": 15808,
+ "total_acs": 10504,
+ "total_submitted": 15999,
"frontend_question_id": 1617,
"is_new_question": false
},
@@ -34653,8 +35251,8 @@
"question__title": "Split Two Strings to Make Palindrome",
"question__title_slug": "split-two-strings-to-make-palindrome",
"question__hide": false,
- "total_acs": 24789,
- "total_submitted": 79851,
+ "total_acs": 25023,
+ "total_submitted": 80562,
"frontend_question_id": 1616,
"is_new_question": false
},
@@ -34676,8 +35274,8 @@
"question__title": "Maximal Network Rank",
"question__title_slug": "maximal-network-rank",
"question__hide": false,
- "total_acs": 141721,
- "total_submitted": 217737,
+ "total_acs": 142704,
+ "total_submitted": 219178,
"frontend_question_id": 1615,
"is_new_question": false
},
@@ -34699,8 +35297,8 @@
"question__title": "Maximum Nesting Depth of the Parentheses",
"question__title_slug": "maximum-nesting-depth-of-the-parentheses",
"question__hide": false,
- "total_acs": 332036,
- "total_submitted": 396595,
+ "total_acs": 339424,
+ "total_submitted": 405182,
"frontend_question_id": 1614,
"is_new_question": false
},
@@ -34722,8 +35320,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": 13106,
- "total_submitted": 20940,
+ "total_acs": 13157,
+ "total_submitted": 21038,
"frontend_question_id": 1597,
"is_new_question": false
},
@@ -34745,8 +35343,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": 32929,
- "total_submitted": 42000,
+ "total_acs": 33247,
+ "total_submitted": 42407,
"frontend_question_id": 1596,
"is_new_question": false
},
@@ -34768,8 +35366,8 @@
"question__title": "Bank Account Summary II",
"question__title_slug": "bank-account-summary-ii",
"question__hide": false,
- "total_acs": 101940,
- "total_submitted": 122221,
+ "total_acs": 103632,
+ "total_submitted": 124258,
"frontend_question_id": 1587,
"is_new_question": false
},
@@ -34791,8 +35389,8 @@
"question__title": "Maximum Number of Visible Points",
"question__title_slug": "maximum-number-of-visible-points",
"question__hide": false,
- "total_acs": 40258,
- "total_submitted": 107730,
+ "total_acs": 40514,
+ "total_submitted": 108398,
"frontend_question_id": 1610,
"is_new_question": false
},
@@ -34814,8 +35412,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": 58257,
- "total_submitted": 78513,
+ "total_acs": 58503,
+ "total_submitted": 78890,
"frontend_question_id": 1611,
"is_new_question": false
},
@@ -34837,8 +35435,8 @@
"question__title": "Even Odd Tree",
"question__title_slug": "even-odd-tree",
"question__hide": false,
- "total_acs": 155659,
- "total_submitted": 236855,
+ "total_acs": 156831,
+ "total_submitted": 238405,
"frontend_question_id": 1609,
"is_new_question": false
},
@@ -34860,8 +35458,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": 191243,
- "total_submitted": 285894,
+ "total_acs": 193873,
+ "total_submitted": 289724,
"frontend_question_id": 1608,
"is_new_question": false
},
@@ -34883,8 +35481,8 @@
"question__title": "Binary Search Tree Iterator II",
"question__title_slug": "binary-search-tree-iterator-ii",
"question__hide": false,
- "total_acs": 13958,
- "total_submitted": 21300,
+ "total_acs": 13993,
+ "total_submitted": 21440,
"frontend_question_id": 1586,
"is_new_question": false
},
@@ -34906,8 +35504,8 @@
"question__title": "Fancy Sequence",
"question__title_slug": "fancy-sequence",
"question__hide": false,
- "total_acs": 12010,
- "total_submitted": 69452,
+ "total_acs": 12091,
+ "total_submitted": 69860,
"frontend_question_id": 1622,
"is_new_question": false
},
@@ -34929,8 +35527,8 @@
"question__title": "Cat and Mouse II",
"question__title_slug": "cat-and-mouse-ii",
"question__hide": false,
- "total_acs": 7111,
- "total_submitted": 17781,
+ "total_acs": 7157,
+ "total_submitted": 17921,
"frontend_question_id": 1728,
"is_new_question": false
},
@@ -34952,8 +35550,8 @@
"question__title": "Coordinate With Maximum Network Quality",
"question__title_slug": "coordinate-with-maximum-network-quality",
"question__hide": false,
- "total_acs": 8740,
- "total_submitted": 23128,
+ "total_acs": 8837,
+ "total_submitted": 23320,
"frontend_question_id": 1620,
"is_new_question": false
},
@@ -34975,8 +35573,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": 9985,
- "total_submitted": 22969,
+ "total_acs": 10061,
+ "total_submitted": 23108,
"frontend_question_id": 1621,
"is_new_question": false
},
@@ -34998,8 +35596,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": 403097,
- "total_submitted": 591257,
+ "total_acs": 426360,
+ "total_submitted": 627505,
"frontend_question_id": 1581,
"is_new_question": false
},
@@ -35021,8 +35619,8 @@
"question__title": "Maximum Number of Achievable Transfer Requests",
"question__title_slug": "maximum-number-of-achievable-transfer-requests",
"question__hide": false,
- "total_acs": 55662,
- "total_submitted": 86316,
+ "total_acs": 55990,
+ "total_submitted": 86801,
"frontend_question_id": 1601,
"is_new_question": false
},
@@ -35044,8 +35642,8 @@
"question__title": "Throne Inheritance",
"question__title_slug": "throne-inheritance",
"question__hide": false,
- "total_acs": 17238,
- "total_submitted": 26517,
+ "total_acs": 17429,
+ "total_submitted": 26769,
"frontend_question_id": 1600,
"is_new_question": false
},
@@ -35067,8 +35665,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": 12478,
- "total_submitted": 28451,
+ "total_acs": 12623,
+ "total_submitted": 28700,
"frontend_question_id": 1599,
"is_new_question": false
},
@@ -35090,8 +35688,8 @@
"question__title": "Crawler Log Folder",
"question__title_slug": "crawler-log-folder",
"question__hide": false,
- "total_acs": 80363,
- "total_submitted": 123161,
+ "total_acs": 81456,
+ "total_submitted": 124768,
"frontend_question_id": 1598,
"is_new_question": false
},
@@ -35107,14 +35705,14 @@
{
"stat": {
"question_id": 1719,
- "question__article__live": null,
- "question__article__slug": null,
- "question__article__has_video_solution": null,
+ "question__article__live": true,
+ "question__article__slug": "put-boxes-into-the-warehouse-ii",
+ "question__article__has_video_solution": false,
"question__title": "Put Boxes Into the Warehouse II",
"question__title_slug": "put-boxes-into-the-warehouse-ii",
"question__hide": false,
- "total_acs": 4546,
- "total_submitted": 7164,
+ "total_acs": 8493,
+ "total_submitted": 12789,
"frontend_question_id": 1580,
"is_new_question": false
},
@@ -35136,8 +35734,8 @@
"question__title": "Warehouse Manager",
"question__title_slug": "warehouse-manager",
"question__hide": false,
- "total_acs": 41627,
- "total_submitted": 47434,
+ "total_acs": 41951,
+ "total_submitted": 47812,
"frontend_question_id": 1571,
"is_new_question": false
},
@@ -35159,8 +35757,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": 9058,
- "total_submitted": 18905,
+ "total_acs": 9123,
+ "total_submitted": 19030,
"frontend_question_id": 1595,
"is_new_question": false
},
@@ -35182,8 +35780,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": 24142,
- "total_submitted": 71692,
+ "total_acs": 24340,
+ "total_submitted": 72205,
"frontend_question_id": 1594,
"is_new_question": false
},
@@ -35205,8 +35803,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": 31198,
- "total_submitted": 55306,
+ "total_acs": 31494,
+ "total_submitted": 55746,
"frontend_question_id": 1593,
"is_new_question": false
},
@@ -35228,8 +35826,8 @@
"question__title": "Rearrange Spaces Between Words",
"question__title_slug": "rearrange-spaces-between-words",
"question__hide": false,
- "total_acs": 56608,
- "total_submitted": 130717,
+ "total_acs": 57029,
+ "total_submitted": 131670,
"frontend_question_id": 1592,
"is_new_question": false
},
@@ -35251,8 +35849,8 @@
"question__title": "Dot Product of Two Sparse Vectors",
"question__title_slug": "dot-product-of-two-sparse-vectors",
"question__hide": false,
- "total_acs": 259586,
- "total_submitted": 288927,
+ "total_acs": 263839,
+ "total_submitted": 293758,
"frontend_question_id": 1570,
"is_new_question": false
},
@@ -35274,8 +35872,8 @@
"question__title": "Unique Orders and Customers Per Month",
"question__title_slug": "unique-orders-and-customers-per-month",
"question__hide": false,
- "total_acs": 21690,
- "total_submitted": 26404,
+ "total_acs": 21837,
+ "total_submitted": 26606,
"frontend_question_id": 1565,
"is_new_question": false
},
@@ -35297,8 +35895,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": 41260,
- "total_submitted": 53387,
+ "total_acs": 41547,
+ "total_submitted": 53758,
"frontend_question_id": 1605,
"is_new_question": false
},
@@ -35320,8 +35918,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": 16702,
- "total_submitted": 38311,
+ "total_acs": 16858,
+ "total_submitted": 38624,
"frontend_question_id": 1606,
"is_new_question": false
},
@@ -35343,8 +35941,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": 36365,
- "total_submitted": 79307,
+ "total_acs": 36600,
+ "total_submitted": 79814,
"frontend_question_id": 1604,
"is_new_question": false
},
@@ -35366,8 +35964,8 @@
"question__title": "Design Parking System",
"question__title_slug": "design-parking-system",
"question__hide": false,
- "total_acs": 280573,
- "total_submitted": 319001,
+ "total_acs": 282493,
+ "total_submitted": 321157,
"frontend_question_id": 1603,
"is_new_question": false
},
@@ -35389,8 +35987,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": 8512,
- "total_submitted": 17555,
+ "total_acs": 8594,
+ "total_submitted": 17716,
"frontend_question_id": 1585,
"is_new_question": false
},
@@ -35412,8 +36010,8 @@
"question__title": "Min Cost to Connect All Points",
"question__title_slug": "min-cost-to-connect-all-points",
"question__hide": false,
- "total_acs": 289817,
- "total_submitted": 433080,
+ "total_acs": 294320,
+ "total_submitted": 439000,
"frontend_question_id": 1584,
"is_new_question": false
},
@@ -35435,8 +36033,8 @@
"question__title": "Count Unhappy Friends",
"question__title_slug": "count-unhappy-friends",
"question__hide": false,
- "total_acs": 28346,
- "total_submitted": 46062,
+ "total_acs": 28454,
+ "total_submitted": 46226,
"frontend_question_id": 1583,
"is_new_question": false
},
@@ -35458,8 +36056,8 @@
"question__title": "Special Positions in a Binary Matrix",
"question__title_slug": "special-positions-in-a-binary-matrix",
"question__hide": false,
- "total_acs": 145805,
- "total_submitted": 212529,
+ "total_acs": 146460,
+ "total_submitted": 213504,
"frontend_question_id": 1582,
"is_new_question": false
},
@@ -35481,8 +36079,8 @@
"question__title": "Put Boxes Into the Warehouse I",
"question__title_slug": "put-boxes-into-the-warehouse-i",
"question__hide": false,
- "total_acs": 15318,
- "total_submitted": 22859,
+ "total_acs": 16419,
+ "total_submitted": 24368,
"frontend_question_id": 1564,
"is_new_question": false
},
@@ -35504,8 +36102,8 @@
"question__title": "Bank Account Summary",
"question__title_slug": "bank-account-summary",
"question__hide": false,
- "total_acs": 18060,
- "total_submitted": 35296,
+ "total_acs": 18262,
+ "total_submitted": 35649,
"frontend_question_id": 1555,
"is_new_question": false
},
@@ -35527,8 +36125,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": 58716,
- "total_submitted": 91737,
+ "total_acs": 59142,
+ "total_submitted": 92414,
"frontend_question_id": 1579,
"is_new_question": false
},
@@ -35550,8 +36148,8 @@
"question__title": "Minimum Time to Make Rope Colorful",
"question__title_slug": "minimum-time-to-make-rope-colorful",
"question__hide": false,
- "total_acs": 256420,
- "total_submitted": 401938,
+ "total_acs": 257719,
+ "total_submitted": 404137,
"frontend_question_id": 1578,
"is_new_question": false
},
@@ -35573,8 +36171,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": 20951,
- "total_submitted": 50904,
+ "total_acs": 21102,
+ "total_submitted": 51162,
"frontend_question_id": 1577,
"is_new_question": false
},
@@ -35596,8 +36194,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": 60407,
- "total_submitted": 130293,
+ "total_acs": 60805,
+ "total_submitted": 131334,
"frontend_question_id": 1576,
"is_new_question": false
},
@@ -35619,8 +36217,8 @@
"question__title": "Strings Differ by One Character",
"question__title_slug": "strings-differ-by-one-character",
"question__hide": false,
- "total_acs": 24409,
- "total_submitted": 58539,
+ "total_acs": 24487,
+ "total_submitted": 58758,
"frontend_question_id": 1554,
"is_new_question": false
},
@@ -35642,8 +36240,8 @@
"question__title": "Strange Printer II",
"question__title_slug": "strange-printer-ii",
"question__hide": false,
- "total_acs": 10950,
- "total_submitted": 18539,
+ "total_acs": 11060,
+ "total_submitted": 18720,
"frontend_question_id": 1591,
"is_new_question": false
},
@@ -35665,8 +36263,8 @@
"question__title": "Maximum Sum Obtained of Any Permutation",
"question__title_slug": "maximum-sum-obtained-of-any-permutation",
"question__hide": false,
- "total_acs": 19716,
- "total_submitted": 52049,
+ "total_acs": 19896,
+ "total_submitted": 52424,
"frontend_question_id": 1589,
"is_new_question": false
},
@@ -35688,8 +36286,8 @@
"question__title": "Make Sum Divisible by P",
"question__title_slug": "make-sum-divisible-by-p",
"question__hide": false,
- "total_acs": 28930,
- "total_submitted": 99512,
+ "total_acs": 29792,
+ "total_submitted": 102136,
"frontend_question_id": 1590,
"is_new_question": false
},
@@ -35711,8 +36309,8 @@
"question__title": "Sum of All Odd Length Subarrays",
"question__title_slug": "sum-of-all-odd-length-subarrays",
"question__hide": false,
- "total_acs": 198371,
- "total_submitted": 238787,
+ "total_acs": 200557,
+ "total_submitted": 241285,
"frontend_question_id": 1588,
"is_new_question": false
},
@@ -35734,8 +36332,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": 55358,
- "total_submitted": 103494,
+ "total_acs": 55589,
+ "total_submitted": 103911,
"frontend_question_id": 1569,
"is_new_question": false
},
@@ -35757,8 +36355,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": 14006,
- "total_submitted": 31172,
+ "total_acs": 14163,
+ "total_submitted": 31603,
"frontend_question_id": 1568,
"is_new_question": false
},
@@ -35780,8 +36378,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": 95625,
- "total_submitted": 216243,
+ "total_acs": 96109,
+ "total_submitted": 217221,
"frontend_question_id": 1567,
"is_new_question": false
},
@@ -35803,8 +36401,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": 34644,
- "total_submitted": 80285,
+ "total_acs": 34915,
+ "total_submitted": 80873,
"frontend_question_id": 1566,
"is_new_question": false
},
@@ -35826,8 +36424,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": 28632,
- "total_submitted": 44201,
+ "total_acs": 28938,
+ "total_submitted": 44699,
"frontend_question_id": 1549,
"is_new_question": false
},
@@ -35849,8 +36447,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": 17307,
- "total_submitted": 29255,
+ "total_acs": 17328,
+ "total_submitted": 29280,
"frontend_question_id": 1548,
"is_new_question": false
},
@@ -35872,8 +36470,8 @@
"question__title": "Fix Product Name Format",
"question__title_slug": "fix-product-name-format",
"question__hide": false,
- "total_acs": 20308,
- "total_submitted": 34150,
+ "total_acs": 20447,
+ "total_submitted": 34405,
"frontend_question_id": 1543,
"is_new_question": false
},
@@ -35895,8 +36493,8 @@
"question__title": "Stone Game V",
"question__title_slug": "stone-game-v",
"question__hide": false,
- "total_acs": 19741,
- "total_submitted": 48520,
+ "total_acs": 19936,
+ "total_submitted": 48948,
"frontend_question_id": 1563,
"is_new_question": false
},
@@ -35918,8 +36516,8 @@
"question__title": "Find Latest Group of Size M",
"question__title_slug": "find-latest-group-of-size-m",
"question__hide": false,
- "total_acs": 18263,
- "total_submitted": 42558,
+ "total_acs": 18364,
+ "total_submitted": 42797,
"frontend_question_id": 1562,
"is_new_question": false
},
@@ -35941,8 +36539,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": 162939,
- "total_submitted": 192718,
+ "total_acs": 164431,
+ "total_submitted": 194501,
"frontend_question_id": 1561,
"is_new_question": false
},
@@ -35964,8 +36562,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": 31785,
- "total_submitted": 54070,
+ "total_acs": 31986,
+ "total_submitted": 54386,
"frontend_question_id": 1560,
"is_new_question": false
},
@@ -35987,8 +36585,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": 4103,
- "total_submitted": 5863,
+ "total_acs": 4143,
+ "total_submitted": 5931,
"frontend_question_id": 1538,
"is_new_question": false
},
@@ -36010,8 +36608,8 @@
"question__title": "Count All Possible Routes",
"question__title_slug": "count-all-possible-routes",
"question__hide": false,
- "total_acs": 57677,
- "total_submitted": 88226,
+ "total_acs": 57923,
+ "total_submitted": 88684,
"frontend_question_id": 1575,
"is_new_question": false
},
@@ -36033,8 +36631,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": 30776,
- "total_submitted": 81152,
+ "total_acs": 31052,
+ "total_submitted": 81845,
"frontend_question_id": 1574,
"is_new_question": false
},
@@ -36056,8 +36654,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": 29988,
- "total_submitted": 89973,
+ "total_acs": 30179,
+ "total_submitted": 90424,
"frontend_question_id": 1573,
"is_new_question": false
},
@@ -36079,8 +36677,8 @@
"question__title": "Matrix Diagonal Sum",
"question__title_slug": "matrix-diagonal-sum",
"question__hide": false,
- "total_acs": 356487,
- "total_submitted": 429739,
+ "total_acs": 361468,
+ "total_submitted": 435457,
"frontend_question_id": 1572,
"is_new_question": false
},
@@ -36102,8 +36700,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": 35566,
- "total_submitted": 100767,
+ "total_acs": 35972,
+ "total_submitted": 101722,
"frontend_question_id": 1553,
"is_new_question": false
},
@@ -36119,14 +36717,14 @@
{
"stat": {
"question_id": 1675,
- "question__article__live": null,
- "question__article__slug": null,
- "question__article__has_video_solution": null,
+ "question__article__live": true,
+ "question__article__slug": "magnetic-force-between-two-balls",
+ "question__article__has_video_solution": false,
"question__title": "Magnetic Force Between Two Balls",
"question__title_slug": "magnetic-force-between-two-balls",
"question__hide": false,
- "total_acs": 57788,
- "total_submitted": 93803,
+ "total_acs": 159510,
+ "total_submitted": 224568,
"frontend_question_id": 1552,
"is_new_question": false
},
@@ -36148,8 +36746,8 @@
"question__title": "Minimum Operations to Make Array Equal",
"question__title_slug": "minimum-operations-to-make-array-equal",
"question__hide": false,
- "total_acs": 97313,
- "total_submitted": 118329,
+ "total_acs": 98043,
+ "total_submitted": 119162,
"frontend_question_id": 1551,
"is_new_question": false
},
@@ -36171,8 +36769,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": 13479,
- "total_submitted": 24013,
+ "total_acs": 13625,
+ "total_submitted": 24264,
"frontend_question_id": 1533,
"is_new_question": false
},
@@ -36194,8 +36792,8 @@
"question__title": "The Most Recent Three Orders",
"question__title_slug": "the-most-recent-three-orders",
"question__hide": false,
- "total_acs": 28613,
- "total_submitted": 41870,
+ "total_acs": 28922,
+ "total_submitted": 42332,
"frontend_question_id": 1532,
"is_new_question": false
},
@@ -36217,8 +36815,8 @@
"question__title": "Patients With a Condition",
"question__title_slug": "patients-with-a-condition",
"question__hide": false,
- "total_acs": 210092,
- "total_submitted": 521631,
+ "total_acs": 216739,
+ "total_submitted": 538450,
"frontend_question_id": 1527,
"is_new_question": false
},
@@ -36240,8 +36838,8 @@
"question__title": "Minimum Cost to Cut a Stick",
"question__title_slug": "minimum-cost-to-cut-a-stick",
"question__hide": false,
- "total_acs": 120402,
- "total_submitted": 194971,
+ "total_acs": 124283,
+ "total_submitted": 201203,
"frontend_question_id": 1547,
"is_new_question": false
},
@@ -36263,8 +36861,8 @@
"question__title": "Find Longest Awesome Substring",
"question__title_slug": "find-longest-awesome-substring",
"question__hide": false,
- "total_acs": 14482,
- "total_submitted": 33277,
+ "total_acs": 14690,
+ "total_submitted": 33672,
"frontend_question_id": 1542,
"is_new_question": false
},
@@ -36286,8 +36884,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": 42234,
- "total_submitted": 71939,
+ "total_acs": 42732,
+ "total_submitted": 72686,
"frontend_question_id": 1545,
"is_new_question": false
},
@@ -36309,8 +36907,8 @@
"question__title": "Make The String Great",
"question__title_slug": "make-the-string-great",
"question__hide": false,
- "total_acs": 310340,
- "total_submitted": 453910,
+ "total_acs": 313365,
+ "total_submitted": 458356,
"frontend_question_id": 1544,
"is_new_question": false
},
@@ -36332,8 +36930,8 @@
"question__title": "Diameter of N-Ary Tree",
"question__title_slug": "diameter-of-n-ary-tree",
"question__hide": false,
- "total_acs": 49117,
- "total_submitted": 66034,
+ "total_acs": 49422,
+ "total_submitted": 66421,
"frontend_question_id": 1522,
"is_new_question": false
},
@@ -36355,8 +36953,8 @@
"question__title": "Find Users With Valid E-Mails",
"question__title_slug": "find-users-with-valid-e-mails",
"question__hide": false,
- "total_acs": 106452,
- "total_submitted": 239385,
+ "total_acs": 111685,
+ "total_submitted": 252092,
"frontend_question_id": 1517,
"is_new_question": false
},
@@ -36378,8 +36976,8 @@
"question__title": "Detect Cycles in 2D Grid",
"question__title_slug": "detect-cycles-in-2d-grid",
"question__hide": false,
- "total_acs": 42044,
- "total_submitted": 86515,
+ "total_acs": 42547,
+ "total_submitted": 87396,
"frontend_question_id": 1559,
"is_new_question": false
},
@@ -36401,8 +36999,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": 21504,
- "total_submitted": 33813,
+ "total_acs": 21631,
+ "total_submitted": 34042,
"frontend_question_id": 1558,
"is_new_question": false
},
@@ -36424,8 +37022,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": 179615,
- "total_submitted": 221756,
+ "total_acs": 181255,
+ "total_submitted": 223775,
"frontend_question_id": 1557,
"is_new_question": false
},
@@ -36447,8 +37045,8 @@
"question__title": "Thousand Separator",
"question__title_slug": "thousand-separator",
"question__hide": false,
- "total_acs": 52323,
- "total_submitted": 97383,
+ "total_acs": 52835,
+ "total_submitted": 98322,
"frontend_question_id": 1556,
"is_new_question": false
},
@@ -36470,8 +37068,8 @@
"question__title": "Get the Maximum Score",
"question__title_slug": "get-the-maximum-score",
"question__hide": false,
- "total_acs": 26153,
- "total_submitted": 66330,
+ "total_acs": 26481,
+ "total_submitted": 67125,
"frontend_question_id": 1537,
"is_new_question": false
},
@@ -36493,8 +37091,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": 15080,
- "total_submitted": 31784,
+ "total_acs": 15207,
+ "total_submitted": 31978,
"frontend_question_id": 1536,
"is_new_question": false
},
@@ -36516,8 +37114,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": 114561,
- "total_submitted": 201072,
+ "total_acs": 115214,
+ "total_submitted": 202065,
"frontend_question_id": 1535,
"is_new_question": false
},
@@ -36539,8 +37137,8 @@
"question__title": "Count Good Triplets",
"question__title_slug": "count-good-triplets",
"question__hide": false,
- "total_acs": 120099,
- "total_submitted": 147851,
+ "total_acs": 121347,
+ "total_submitted": 149304,
"frontend_question_id": 1534,
"is_new_question": false
},
@@ -36562,8 +37160,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": 2274,
- "total_submitted": 3653,
+ "total_acs": 2279,
+ "total_submitted": 3659,
"frontend_question_id": 1516,
"is_new_question": false
},
@@ -36585,8 +37183,8 @@
"question__title": "Customer Order Frequency",
"question__title_slug": "customer-order-frequency",
"question__hide": false,
- "total_acs": 42005,
- "total_submitted": 61764,
+ "total_acs": 42403,
+ "total_submitted": 62468,
"frontend_question_id": 1511,
"is_new_question": false
},
@@ -36608,8 +37206,8 @@
"question__title": "Number of Good Leaf Nodes Pairs",
"question__title_slug": "number-of-good-leaf-nodes-pairs",
"question__hide": false,
- "total_acs": 47080,
- "total_submitted": 74234,
+ "total_acs": 47982,
+ "total_submitted": 75440,
"frontend_question_id": 1530,
"is_new_question": false
},
@@ -36631,8 +37229,8 @@
"question__title": "Minimum Suffix Flips",
"question__title_slug": "minimum-suffix-flips",
"question__hide": false,
- "total_acs": 53560,
- "total_submitted": 73084,
+ "total_acs": 54328,
+ "total_submitted": 74112,
"frontend_question_id": 1529,
"is_new_question": false
},
@@ -36654,8 +37252,8 @@
"question__title": "Shuffle String",
"question__title_slug": "shuffle-string",
"question__hide": false,
- "total_acs": 383725,
- "total_submitted": 453193,
+ "total_acs": 388425,
+ "total_submitted": 458496,
"frontend_question_id": 1528,
"is_new_question": false
},
@@ -36677,8 +37275,8 @@
"question__title": "Find Root of N-Ary Tree",
"question__title_slug": "find-root-of-n-ary-tree",
"question__hide": false,
- "total_acs": 34654,
- "total_submitted": 44217,
+ "total_acs": 34841,
+ "total_submitted": 44443,
"frontend_question_id": 1506,
"is_new_question": false
},
@@ -36700,8 +37298,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": 28232,
- "total_submitted": 59279,
+ "total_acs": 28483,
+ "total_submitted": 59719,
"frontend_question_id": 1546,
"is_new_question": false
},
@@ -36723,8 +37321,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": 61636,
- "total_submitted": 117587,
+ "total_acs": 62707,
+ "total_submitted": 119396,
"frontend_question_id": 1541,
"is_new_question": false
},
@@ -36746,8 +37344,8 @@
"question__title": "Can Convert String in K Moves",
"question__title_slug": "can-convert-string-in-k-moves",
"question__hide": false,
- "total_acs": 19073,
- "total_submitted": 54722,
+ "total_acs": 19230,
+ "total_submitted": 55125,
"frontend_question_id": 1540,
"is_new_question": false
},
@@ -36769,8 +37367,8 @@
"question__title": "Kth Missing Positive Number",
"question__title_slug": "kth-missing-positive-number",
"question__hide": false,
- "total_acs": 424580,
- "total_submitted": 707347,
+ "total_acs": 436631,
+ "total_submitted": 725591,
"frontend_question_id": 1539,
"is_new_question": false
},
@@ -36792,8 +37390,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": 10416,
- "total_submitted": 23308,
+ "total_acs": 10658,
+ "total_submitted": 23700,
"frontend_question_id": 1521,
"is_new_question": false
},
@@ -36815,8 +37413,8 @@
"question__title": "Maximum Number of Non-Overlapping Substrings",
"question__title_slug": "maximum-number-of-non-overlapping-substrings",
"question__hide": false,
- "total_acs": 16257,
- "total_submitted": 41430,
+ "total_acs": 16504,
+ "total_submitted": 42001,
"frontend_question_id": 1520,
"is_new_question": false
},
@@ -36838,8 +37436,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": 83719,
- "total_submitted": 152211,
+ "total_acs": 83967,
+ "total_submitted": 152689,
"frontend_question_id": 1519,
"is_new_question": false
},
@@ -36861,8 +37459,8 @@
"question__title": "Water Bottles",
"question__title_slug": "water-bottles",
"question__hide": false,
- "total_acs": 78907,
- "total_submitted": 129328,
+ "total_acs": 79838,
+ "total_submitted": 130729,
"frontend_question_id": 1518,
"is_new_question": false
},
@@ -36884,8 +37482,8 @@
"question__title": "Countries You Can Safely Invest In",
"question__title_slug": "countries-you-can-safely-invest-in",
"question__hide": false,
- "total_acs": 38313,
- "total_submitted": 76677,
+ "total_acs": 38646,
+ "total_submitted": 77335,
"frontend_question_id": 1501,
"is_new_question": false
},
@@ -36907,8 +37505,8 @@
"question__title": "Design a File Sharing System",
"question__title_slug": "design-a-file-sharing-system",
"question__hide": false,
- "total_acs": 4248,
- "total_submitted": 9746,
+ "total_acs": 4296,
+ "total_submitted": 9899,
"frontend_question_id": 1500,
"is_new_question": false
},
@@ -36930,8 +37528,8 @@
"question__title": "Friendly Movies Streamed Last Month",
"question__title_slug": "friendly-movies-streamed-last-month",
"question__hide": false,
- "total_acs": 30990,
- "total_submitted": 63251,
+ "total_acs": 31339,
+ "total_submitted": 63971,
"frontend_question_id": 1495,
"is_new_question": false
},
@@ -36953,8 +37551,8 @@
"question__title": "Best Position for a Service Centre",
"question__title_slug": "best-position-for-a-service-centre",
"question__hide": false,
- "total_acs": 14117,
- "total_submitted": 39613,
+ "total_acs": 14203,
+ "total_submitted": 40042,
"frontend_question_id": 1515,
"is_new_question": false
},
@@ -36976,8 +37574,8 @@
"question__title": "String Compression II",
"question__title_slug": "string-compression-ii",
"question__hide": false,
- "total_acs": 98517,
- "total_submitted": 187396,
+ "total_acs": 98944,
+ "total_submitted": 188308,
"frontend_question_id": 1531,
"is_new_question": false
},
@@ -36999,8 +37597,8 @@
"question__title": "Number of Substrings With Only 1s",
"question__title_slug": "number-of-substrings-with-only-1s",
"question__hide": false,
- "total_acs": 45638,
- "total_submitted": 97450,
+ "total_acs": 46002,
+ "total_submitted": 98118,
"frontend_question_id": 1513,
"is_new_question": false
},
@@ -37022,8 +37620,8 @@
"question__title": "Number of Good Pairs",
"question__title_slug": "number-of-good-pairs",
"question__hide": false,
- "total_acs": 767113,
- "total_submitted": 861451,
+ "total_acs": 782376,
+ "total_submitted": 877982,
"frontend_question_id": 1512,
"is_new_question": false
},
@@ -37045,8 +37643,8 @@
"question__title": "Clone N-ary Tree",
"question__title_slug": "clone-n-ary-tree",
"question__hide": false,
- "total_acs": 29089,
- "total_submitted": 34987,
+ "total_acs": 29256,
+ "total_submitted": 35195,
"frontend_question_id": 1490,
"is_new_question": false
},
@@ -37068,8 +37666,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": 38732,
- "total_submitted": 55565,
+ "total_acs": 39245,
+ "total_submitted": 56230,
"frontend_question_id": 1526,
"is_new_question": false
},
@@ -37091,8 +37689,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": 101700,
- "total_submitted": 148912,
+ "total_acs": 102707,
+ "total_submitted": 150324,
"frontend_question_id": 1525,
"is_new_question": false
},
@@ -37114,8 +37712,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": 38455,
- "total_submitted": 88220,
+ "total_acs": 38853,
+ "total_submitted": 89024,
"frontend_question_id": 1524,
"is_new_question": false
},
@@ -37137,8 +37735,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": 337098,
- "total_submitted": 675706,
+ "total_acs": 338721,
+ "total_submitted": 678744,
"frontend_question_id": 1523,
"is_new_question": false
},
@@ -37160,8 +37758,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": 10143,
- "total_submitted": 25751,
+ "total_acs": 10232,
+ "total_submitted": 25935,
"frontend_question_id": 1505,
"is_new_question": false
},
@@ -37183,8 +37781,8 @@
"question__title": "Count Submatrices With All Ones",
"question__title_slug": "count-submatrices-with-all-ones",
"question__hide": false,
- "total_acs": 51628,
- "total_submitted": 90243,
+ "total_acs": 52029,
+ "total_submitted": 90882,
"frontend_question_id": 1504,
"is_new_question": false
},
@@ -37206,8 +37804,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": 89276,
- "total_submitted": 130260,
+ "total_acs": 89524,
+ "total_submitted": 130647,
"frontend_question_id": 1503,
"is_new_question": false
},
@@ -37229,8 +37827,8 @@
"question__title": "Can Make Arithmetic Progression From Sequence",
"question__title_slug": "can-make-arithmetic-progression-from-sequence",
"question__hide": false,
- "total_acs": 246817,
- "total_submitted": 354703,
+ "total_acs": 248580,
+ "total_submitted": 357330,
"frontend_question_id": 1502,
"is_new_question": false
},
@@ -37252,8 +37850,8 @@
"question__title": "Group Sold Products By The Date",
"question__title_slug": "group-sold-products-by-the-date",
"question__hide": false,
- "total_acs": 205684,
- "total_submitted": 268012,
+ "total_acs": 211207,
+ "total_submitted": 275176,
"frontend_question_id": 1484,
"is_new_question": false
},
@@ -37275,8 +37873,8 @@
"question__title": "Clone Binary Tree With Random Pointer",
"question__title_slug": "clone-binary-tree-with-random-pointer",
"question__hide": false,
- "total_acs": 27862,
- "total_submitted": 34608,
+ "total_acs": 28531,
+ "total_submitted": 35413,
"frontend_question_id": 1485,
"is_new_question": false
},
@@ -37298,8 +37896,8 @@
"question__title": "Sales by Day of the Week",
"question__title_slug": "sales-by-day-of-the-week",
"question__hide": false,
- "total_acs": 17668,
- "total_submitted": 22802,
+ "total_acs": 17778,
+ "total_submitted": 22941,
"frontend_question_id": 1479,
"is_new_question": false
},
@@ -37321,8 +37919,8 @@
"question__title": "Max Value of Equation",
"question__title_slug": "max-value-of-equation",
"question__hide": false,
- "total_acs": 42785,
- "total_submitted": 96875,
+ "total_acs": 43113,
+ "total_submitted": 97738,
"frontend_question_id": 1499,
"is_new_question": false
},
@@ -37344,8 +37942,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": 119316,
- "total_submitted": 272502,
+ "total_acs": 120505,
+ "total_submitted": 275337,
"frontend_question_id": 1498,
"is_new_question": false
},
@@ -37367,8 +37965,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": 50342,
- "total_submitted": 130702,
+ "total_acs": 51281,
+ "total_submitted": 133181,
"frontend_question_id": 1497,
"is_new_question": false
},
@@ -37390,8 +37988,8 @@
"question__title": "Path Crossing",
"question__title_slug": "path-crossing",
"question__hide": false,
- "total_acs": 159723,
- "total_submitted": 256006,
+ "total_acs": 161564,
+ "total_submitted": 258788,
"frontend_question_id": 1496,
"is_new_question": false
},
@@ -37413,8 +38011,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": 31468,
- "total_submitted": 43013,
+ "total_acs": 31670,
+ "total_submitted": 43276,
"frontend_question_id": 1474,
"is_new_question": false
},
@@ -37436,8 +38034,8 @@
"question__title": "Stone Game IV",
"question__title_slug": "stone-game-iv",
"question__hide": false,
- "total_acs": 72456,
- "total_submitted": 121172,
+ "total_acs": 72800,
+ "total_submitted": 121765,
"frontend_question_id": 1510,
"is_new_question": false
},
@@ -37459,8 +38057,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": 87891,
- "total_submitted": 159665,
+ "total_acs": 88576,
+ "total_submitted": 160888,
"frontend_question_id": 1509,
"is_new_question": false
},
@@ -37482,8 +38080,8 @@
"question__title": "Range Sum of Sorted Subarray Sums",
"question__title_slug": "range-sum-of-sorted-subarray-sums",
"question__hide": false,
- "total_acs": 38369,
- "total_submitted": 65716,
+ "total_acs": 38674,
+ "total_submitted": 66247,
"frontend_question_id": 1508,
"is_new_question": false
},
@@ -37505,8 +38103,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": 53461,
- "total_submitted": 78897,
+ "total_acs": 53793,
+ "total_submitted": 79459,
"frontend_question_id": 1489,
"is_new_question": false
},
@@ -37528,8 +38126,8 @@
"question__title": "Avoid Flood in The City",
"question__title_slug": "avoid-flood-in-the-city",
"question__hide": false,
- "total_acs": 36133,
- "total_submitted": 134049,
+ "total_acs": 36355,
+ "total_submitted": 134938,
"frontend_question_id": 1488,
"is_new_question": false
},
@@ -37551,8 +38149,8 @@
"question__title": "Making File Names Unique",
"question__title_slug": "making-file-names-unique",
"question__hide": false,
- "total_acs": 33620,
- "total_submitted": 90792,
+ "total_acs": 33760,
+ "total_submitted": 91090,
"frontend_question_id": 1487,
"is_new_question": false
},
@@ -37574,8 +38172,8 @@
"question__title": "XOR Operation in an Array",
"question__title_slug": "xor-operation-in-an-array",
"question__hide": false,
- "total_acs": 194153,
- "total_submitted": 226098,
+ "total_acs": 196022,
+ "total_submitted": 228101,
"frontend_question_id": 1486,
"is_new_question": false
},
@@ -37597,8 +38195,8 @@
"question__title": "Find All The Lonely Nodes",
"question__title_slug": "find-all-the-lonely-nodes",
"question__hide": false,
- "total_acs": 55070,
- "total_submitted": 65829,
+ "total_acs": 55344,
+ "total_submitted": 66154,
"frontend_question_id": 1469,
"is_new_question": false
},
@@ -37620,8 +38218,8 @@
"question__title": "Calculate Salaries",
"question__title_slug": "calculate-salaries",
"question__hide": false,
- "total_acs": 24332,
- "total_submitted": 30931,
+ "total_acs": 24493,
+ "total_submitted": 31163,
"frontend_question_id": 1468,
"is_new_question": false
},
@@ -37643,8 +38241,8 @@
"question__title": "Rectangles Area",
"question__title_slug": "rectangles-area",
"question__hide": false,
- "total_acs": 17079,
- "total_submitted": 24946,
+ "total_acs": 17184,
+ "total_submitted": 25109,
"frontend_question_id": 1459,
"is_new_question": false
},
@@ -37660,14 +38258,14 @@
{
"stat": {
"question_id": 1605,
- "question__article__live": null,
- "question__article__slug": null,
- "question__article__has_video_solution": null,
+ "question__article__live": true,
+ "question__article__slug": "minimum-number-of-days-to-make-m-bouquets",
+ "question__article__has_video_solution": false,
"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": 126113,
- "total_submitted": 246534,
+ "total_acs": 246625,
+ "total_submitted": 437621,
"frontend_question_id": 1482,
"is_new_question": false
},
@@ -37689,8 +38287,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": 242278,
- "total_submitted": 384803,
+ "total_acs": 244266,
+ "total_submitted": 387626,
"frontend_question_id": 1481,
"is_new_question": false
},
@@ -37712,8 +38310,8 @@
"question__title": "Running Sum of 1d Array",
"question__title_slug": "running-sum-of-1d-array",
"question__hide": false,
- "total_acs": 1819877,
- "total_submitted": 2098077,
+ "total_acs": 1836070,
+ "total_submitted": 2116093,
"frontend_question_id": 1480,
"is_new_question": false
},
@@ -37735,8 +38333,8 @@
"question__title": "Parallel Courses II",
"question__title_slug": "parallel-courses-ii",
"question__hide": false,
- "total_acs": 18306,
- "total_submitted": 61918,
+ "total_acs": 18495,
+ "total_submitted": 62600,
"frontend_question_id": 1494,
"is_new_question": false
},
@@ -37758,8 +38356,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": 270049,
- "total_submitted": 401074,
+ "total_acs": 278299,
+ "total_submitted": 412175,
"frontend_question_id": 1493,
"is_new_question": false
},
@@ -37775,14 +38373,14 @@
{
"stat": {
"question_id": 1585,
- "question__article__live": true,
- "question__article__slug": "the-kth-factor-of-n",
- "question__article__has_video_solution": false,
+ "question__article__live": null,
+ "question__article__slug": null,
+ "question__article__has_video_solution": null,
"question__title": "The kth Factor of n",
"question__title_slug": "the-kth-factor-of-n",
"question__hide": false,
- "total_acs": 228394,
- "total_submitted": 338354,
+ "total_acs": 235169,
+ "total_submitted": 347315,
"frontend_question_id": 1492,
"is_new_question": false
},
@@ -37804,8 +38402,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": 339681,
- "total_submitted": 535434,
+ "total_acs": 341281,
+ "total_submitted": 537848,
"frontend_question_id": 1491,
"is_new_question": false
},
@@ -37827,8 +38425,8 @@
"question__title": "Paint House III",
"question__title_slug": "paint-house-iii",
"question__hide": false,
- "total_acs": 62016,
- "total_submitted": 101615,
+ "total_acs": 62298,
+ "total_submitted": 102098,
"frontend_question_id": 1473,
"is_new_question": false
},
@@ -37850,8 +38448,8 @@
"question__title": "Design Browser History",
"question__title_slug": "design-browser-history",
"question__hide": false,
- "total_acs": 234698,
- "total_submitted": 302641,
+ "total_acs": 237481,
+ "total_submitted": 306198,
"frontend_question_id": 1472,
"is_new_question": false
},
@@ -37873,8 +38471,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": 38544,
- "total_submitted": 62944,
+ "total_acs": 38805,
+ "total_submitted": 63314,
"frontend_question_id": 1471,
"is_new_question": false
},
@@ -37896,8 +38494,8 @@
"question__title": "Shuffle the Array",
"question__title_slug": "shuffle-the-array",
"question__hide": false,
- "total_acs": 689636,
- "total_submitted": 779265,
+ "total_acs": 698671,
+ "total_submitted": 789134,
"frontend_question_id": 1470,
"is_new_question": false
},
@@ -37919,8 +38517,8 @@
"question__title": "Active Users",
"question__title_slug": "active-users",
"question__hide": false,
- "total_acs": 38358,
- "total_submitted": 104639,
+ "total_acs": 38700,
+ "total_submitted": 105647,
"frontend_question_id": 1454,
"is_new_question": false
},
@@ -37942,8 +38540,8 @@
"question__title": "Apples & Oranges",
"question__title_slug": "apples-oranges",
"question__hide": false,
- "total_acs": 52240,
- "total_submitted": 60219,
+ "total_acs": 52641,
+ "total_submitted": 60997,
"frontend_question_id": 1445,
"is_new_question": false
},
@@ -37965,8 +38563,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": 8506,
- "total_submitted": 14077,
+ "total_acs": 8579,
+ "total_submitted": 14194,
"frontend_question_id": 1467,
"is_new_question": false
},
@@ -37988,8 +38586,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": 186609,
- "total_submitted": 289635,
+ "total_acs": 190314,
+ "total_submitted": 295245,
"frontend_question_id": 1466,
"is_new_question": false
},
@@ -38011,8 +38609,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": 167048,
- "total_submitted": 407109,
+ "total_acs": 167386,
+ "total_submitted": 407820,
"frontend_question_id": 1465,
"is_new_question": false
},
@@ -38034,8 +38632,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": 375025,
- "total_submitted": 453758,
+ "total_acs": 378716,
+ "total_submitted": 457955,
"frontend_question_id": 1464,
"is_new_question": false
},
@@ -38057,8 +38655,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": 47662,
- "total_submitted": 130563,
+ "total_acs": 47838,
+ "total_submitted": 131010,
"frontend_question_id": 1477,
"is_new_question": false
},
@@ -38080,8 +38678,8 @@
"question__title": "Subrectangle Queries",
"question__title_slug": "subrectangle-queries",
"question__hide": false,
- "total_acs": 107353,
- "total_submitted": 121768,
+ "total_acs": 108516,
+ "total_submitted": 123037,
"frontend_question_id": 1476,
"is_new_question": false
},
@@ -38103,8 +38701,8 @@
"question__title": "Allocate Mailboxes",
"question__title_slug": "allocate-mailboxes",
"question__hide": false,
- "total_acs": 24503,
- "total_submitted": 44302,
+ "total_acs": 24916,
+ "total_submitted": 44993,
"frontend_question_id": 1478,
"is_new_question": false
},
@@ -38126,8 +38724,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": 149618,
- "total_submitted": 192262,
+ "total_acs": 152393,
+ "total_submitted": 195500,
"frontend_question_id": 1475,
"is_new_question": false
},
@@ -38149,8 +38747,8 @@
"question__title": "Max Dot Product of Two Subsequences",
"question__title_slug": "max-dot-product-of-two-subsequences",
"question__hide": false,
- "total_acs": 77754,
- "total_submitted": 124447,
+ "total_acs": 77985,
+ "total_submitted": 124825,
"frontend_question_id": 1458,
"is_new_question": false
},
@@ -38172,8 +38770,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": 216980,
- "total_submitted": 317314,
+ "total_acs": 218664,
+ "total_submitted": 319780,
"frontend_question_id": 1457,
"is_new_question": false
},
@@ -38195,8 +38793,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": 317441,
- "total_submitted": 542095,
+ "total_acs": 328888,
+ "total_submitted": 560429,
"frontend_question_id": 1456,
"is_new_question": false
},
@@ -38218,8 +38816,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": 79603,
- "total_submitted": 123826,
+ "total_acs": 80470,
+ "total_submitted": 125126,
"frontend_question_id": 1455,
"is_new_question": false
},
@@ -38241,8 +38839,8 @@
"question__title": "Evaluate Boolean Expression",
"question__title_slug": "evaluate-boolean-expression",
"question__hide": false,
- "total_acs": 28532,
- "total_submitted": 39325,
+ "total_acs": 28871,
+ "total_submitted": 39857,
"frontend_question_id": 1440,
"is_new_question": false
},
@@ -38264,8 +38862,8 @@
"question__title": "Create a Session Bar Chart",
"question__title_slug": "create-a-session-bar-chart",
"question__hide": false,
- "total_acs": 22979,
- "total_submitted": 30529,
+ "total_acs": 23127,
+ "total_submitted": 30737,
"frontend_question_id": 1435,
"is_new_question": false
},
@@ -38287,8 +38885,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": 6152,
- "total_submitted": 16246,
+ "total_acs": 6209,
+ "total_submitted": 16375,
"frontend_question_id": 1453,
"is_new_question": false
},
@@ -38310,8 +38908,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": 24447,
- "total_submitted": 42252,
+ "total_acs": 24610,
+ "total_submitted": 42495,
"frontend_question_id": 1452,
"is_new_question": false
},
@@ -38333,8 +38931,8 @@
"question__title": "Rearrange Words in a Sentence",
"question__title_slug": "rearrange-words-in-a-sentence",
"question__hide": false,
- "total_acs": 51834,
- "total_submitted": 80292,
+ "total_acs": 52233,
+ "total_submitted": 80823,
"frontend_question_id": 1451,
"is_new_question": false
},
@@ -38356,8 +38954,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": 123224,
- "total_submitted": 162983,
+ "total_acs": 124255,
+ "total_submitted": 164263,
"frontend_question_id": 1450,
"is_new_question": false
},
@@ -38379,8 +38977,8 @@
"question__title": "Cherry Pickup II",
"question__title_slug": "cherry-pickup-ii",
"question__hide": false,
- "total_acs": 170816,
- "total_submitted": 237603,
+ "total_acs": 172551,
+ "total_submitted": 240020,
"frontend_question_id": 1463,
"is_new_question": false
},
@@ -38402,8 +39000,8 @@
"question__title": "Course Schedule IV",
"question__title_slug": "course-schedule-iv",
"question__hide": false,
- "total_acs": 59541,
- "total_submitted": 119501,
+ "total_acs": 60480,
+ "total_submitted": 121260,
"frontend_question_id": 1462,
"is_new_question": false
},
@@ -38425,8 +39023,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": 121133,
- "total_submitted": 214291,
+ "total_acs": 121668,
+ "total_submitted": 215230,
"frontend_question_id": 1461,
"is_new_question": false
},
@@ -38448,8 +39046,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": 127786,
- "total_submitted": 177484,
+ "total_acs": 128770,
+ "total_submitted": 178807,
"frontend_question_id": 1460,
"is_new_question": false
},
@@ -38471,8 +39069,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": 67677,
- "total_submitted": 108886,
+ "total_acs": 67939,
+ "total_submitted": 109341,
"frontend_question_id": 1444,
"is_new_question": false
},
@@ -38494,8 +39092,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": 117382,
- "total_submitted": 188410,
+ "total_acs": 119382,
+ "total_submitted": 191414,
"frontend_question_id": 1443,
"is_new_question": false
},
@@ -38517,8 +39115,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": 122489,
- "total_submitted": 144180,
+ "total_acs": 123975,
+ "total_submitted": 145920,
"frontend_question_id": 1442,
"is_new_question": false
},
@@ -38540,8 +39138,8 @@
"question__title": "Build an Array With Stack Operations",
"question__title_slug": "build-an-array-with-stack-operations",
"question__hide": false,
- "total_acs": 165843,
- "total_submitted": 207644,
+ "total_acs": 166851,
+ "total_submitted": 208821,
"frontend_question_id": 1441,
"is_new_question": false
},
@@ -38563,8 +39161,8 @@
"question__title": "NPV Queries",
"question__title_slug": "npv-queries",
"question__hide": false,
- "total_acs": 26652,
- "total_submitted": 32218,
+ "total_acs": 26847,
+ "total_submitted": 32446,
"frontend_question_id": 1421,
"is_new_question": false
},
@@ -38586,8 +39184,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": 34208,
- "total_submitted": 55512,
+ "total_acs": 34483,
+ "total_submitted": 55940,
"frontend_question_id": 1439,
"is_new_question": false
},
@@ -38603,14 +39201,14 @@
{
"stat": {
"question_id": 1549,
- "question__article__live": null,
- "question__article__slug": null,
- "question__article__has_video_solution": null,
+ "question__article__live": true,
+ "question__article__slug": "longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit",
+ "question__article__has_video_solution": false,
"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": 130511,
- "total_submitted": 263726,
+ "total_acs": 222257,
+ "total_submitted": 393767,
"frontend_question_id": 1438,
"is_new_question": false
},
@@ -38632,8 +39230,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": 78040,
- "total_submitted": 134586,
+ "total_acs": 78585,
+ "total_submitted": 135480,
"frontend_question_id": 1437,
"is_new_question": false
},
@@ -38655,8 +39253,8 @@
"question__title": "Destination City",
"question__title_slug": "destination-city",
"question__hide": false,
- "total_acs": 264376,
- "total_submitted": 332448,
+ "total_acs": 268058,
+ "total_submitted": 337096,
"frontend_question_id": 1436,
"is_new_question": false
},
@@ -38678,8 +39276,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": 26210,
- "total_submitted": 44319,
+ "total_acs": 26517,
+ "total_submitted": 44843,
"frontend_question_id": 1412,
"is_new_question": false
},
@@ -38701,8 +39299,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": 17797,
- "total_submitted": 37006,
+ "total_acs": 17980,
+ "total_submitted": 37386,
"frontend_question_id": 1449,
"is_new_question": false
},
@@ -38724,8 +39322,8 @@
"question__title": "Count Good Nodes in Binary Tree",
"question__title_slug": "count-good-nodes-in-binary-tree",
"question__hide": false,
- "total_acs": 502314,
- "total_submitted": 687953,
+ "total_acs": 513204,
+ "total_submitted": 702686,
"frontend_question_id": 1448,
"is_new_question": false
},
@@ -38747,8 +39345,8 @@
"question__title": "Simplified Fractions",
"question__title_slug": "simplified-fractions",
"question__hide": false,
- "total_acs": 32877,
- "total_submitted": 49329,
+ "total_acs": 33357,
+ "total_submitted": 49925,
"frontend_question_id": 1447,
"is_new_question": false
},
@@ -38770,8 +39368,8 @@
"question__title": "Consecutive Characters",
"question__title_slug": "consecutive-characters",
"question__hide": false,
- "total_acs": 165908,
- "total_submitted": 274841,
+ "total_acs": 167451,
+ "total_submitted": 277410,
"frontend_question_id": 1446,
"is_new_question": false
},
@@ -38793,8 +39391,8 @@
"question__title": "Top Travellers",
"question__title_slug": "top-travellers",
"question__hide": false,
- "total_acs": 120734,
- "total_submitted": 208924,
+ "total_acs": 123037,
+ "total_submitted": 213432,
"frontend_question_id": 1407,
"is_new_question": false
},
@@ -38816,8 +39414,8 @@
"question__title": "Diagonal Traverse II",
"question__title_slug": "diagonal-traverse-ii",
"question__hide": false,
- "total_acs": 133670,
- "total_submitted": 234900,
+ "total_acs": 135130,
+ "total_submitted": 237106,
"frontend_question_id": 1424,
"is_new_question": false
},
@@ -38839,8 +39437,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": 269456,
- "total_submitted": 510135,
+ "total_acs": 276691,
+ "total_submitted": 521432,
"frontend_question_id": 1423,
"is_new_question": false
},
@@ -38862,8 +39460,8 @@
"question__title": "Maximum Score After Splitting a String",
"question__title_slug": "maximum-score-after-splitting-a-string",
"question__hide": false,
- "total_acs": 160496,
- "total_submitted": 257873,
+ "total_acs": 161938,
+ "total_submitted": 260189,
"frontend_question_id": 1422,
"is_new_question": false
},
@@ -38885,8 +39483,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": 51264,
- "total_submitted": 70390,
+ "total_acs": 51806,
+ "total_submitted": 71110,
"frontend_question_id": 1398,
"is_new_question": false
},
@@ -38908,8 +39506,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": 64168,
- "total_submitted": 93610,
+ "total_acs": 64391,
+ "total_submitted": 94121,
"frontend_question_id": 1420,
"is_new_question": false
},
@@ -38931,8 +39529,8 @@
"question__title": "Minimum Number of Frogs Croaking",
"question__title_slug": "minimum-number-of-frogs-croaking",
"question__hide": false,
- "total_acs": 48953,
- "total_submitted": 97372,
+ "total_acs": 49324,
+ "total_submitted": 98045,
"frontend_question_id": 1419,
"is_new_question": false
},
@@ -38954,8 +39552,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": 28129,
- "total_submitted": 37746,
+ "total_acs": 28420,
+ "total_submitted": 38078,
"frontend_question_id": 1418,
"is_new_question": false
},
@@ -38977,8 +39575,8 @@
"question__title": "Reformat The String",
"question__title_slug": "reformat-the-string",
"question__hide": false,
- "total_acs": 57875,
- "total_submitted": 109567,
+ "total_acs": 58303,
+ "total_submitted": 110481,
"frontend_question_id": 1417,
"is_new_question": false
},
@@ -39000,8 +39598,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": 14853,
- "total_submitted": 34008,
+ "total_acs": 15000,
+ "total_submitted": 34305,
"frontend_question_id": 1434,
"is_new_question": false
},
@@ -39023,8 +39621,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": 42916,
- "total_submitted": 61675,
+ "total_acs": 43334,
+ "total_submitted": 62189,
"frontend_question_id": 1433,
"is_new_question": false
},
@@ -39046,8 +39644,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": 18077,
- "total_submitted": 44169,
+ "total_acs": 18228,
+ "total_submitted": 44487,
"frontend_question_id": 1432,
"is_new_question": false
},
@@ -39069,8 +39667,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": 891808,
- "total_submitted": 1019412,
+ "total_acs": 916501,
+ "total_submitted": 1047112,
"frontend_question_id": 1431,
"is_new_question": false
},
@@ -39092,8 +39690,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": 33572,
- "total_submitted": 52837,
+ "total_acs": 33828,
+ "total_submitted": 53196,
"frontend_question_id": 1411,
"is_new_question": false
},
@@ -39115,8 +39713,8 @@
"question__title": "HTML Entity Parser",
"question__title_slug": "html-entity-parser",
"question__hide": false,
- "total_acs": 24566,
- "total_submitted": 48315,
+ "total_acs": 24760,
+ "total_submitted": 48649,
"frontend_question_id": 1410,
"is_new_question": false
},
@@ -39138,8 +39736,8 @@
"question__title": "Queries on a Permutation With Key",
"question__title_slug": "queries-on-a-permutation-with-key",
"question__hide": false,
- "total_acs": 50077,
- "total_submitted": 59482,
+ "total_acs": 50405,
+ "total_submitted": 59833,
"frontend_question_id": 1409,
"is_new_question": false
},
@@ -39161,8 +39759,8 @@
"question__title": "String Matching in an Array",
"question__title_slug": "string-matching-in-an-array",
"question__hide": false,
- "total_acs": 88480,
- "total_submitted": 138496,
+ "total_acs": 89540,
+ "total_submitted": 140069,
"frontend_question_id": 1408,
"is_new_question": false
},
@@ -39184,8 +39782,8 @@
"question__title": "Capital Gain/Loss",
"question__title_slug": "capital-gainloss",
"question__hide": false,
- "total_acs": 110450,
- "total_submitted": 129275,
+ "total_acs": 111951,
+ "total_submitted": 131051,
"frontend_question_id": 1393,
"is_new_question": false
},
@@ -39207,8 +39805,8 @@
"question__title": "Stone Game III",
"question__title_slug": "stone-game-iii",
"question__hide": false,
- "total_acs": 88420,
- "total_submitted": 138362,
+ "total_acs": 89075,
+ "total_submitted": 139429,
"frontend_question_id": 1406,
"is_new_question": false
},
@@ -39230,8 +39828,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": 141765,
- "total_submitted": 230883,
+ "total_acs": 143271,
+ "total_submitted": 233259,
"frontend_question_id": 1404,
"is_new_question": false
},
@@ -39253,8 +39851,8 @@
"question__title": "Minimum Subsequence in Non-Increasing Order",
"question__title_slug": "minimum-subsequence-in-non-increasing-order",
"question__hide": false,
- "total_acs": 72946,
- "total_submitted": 100450,
+ "total_acs": 73514,
+ "total_submitted": 101256,
"frontend_question_id": 1403,
"is_new_question": false
},
@@ -39276,8 +39874,8 @@
"question__title": "Total Sales Amount by Year",
"question__title_slug": "total-sales-amount-by-year",
"question__hide": false,
- "total_acs": 16189,
- "total_submitted": 26383,
+ "total_acs": 16294,
+ "total_submitted": 26545,
"frontend_question_id": 1384,
"is_new_question": false
},
@@ -39299,8 +39897,8 @@
"question__title": "Restore The Array",
"question__title_slug": "restore-the-array",
"question__hide": false,
- "total_acs": 58485,
- "total_submitted": 122584,
+ "total_acs": 58761,
+ "total_submitted": 123307,
"frontend_question_id": 1416,
"is_new_question": false
},
@@ -39322,8 +39920,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": 39050,
- "total_submitted": 52439,
+ "total_acs": 39546,
+ "total_submitted": 52996,
"frontend_question_id": 1415,
"is_new_question": false
},
@@ -39345,8 +39943,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": 42927,
- "total_submitted": 65741,
+ "total_acs": 43218,
+ "total_submitted": 66160,
"frontend_question_id": 1414,
"is_new_question": false
},
@@ -39368,8 +39966,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": 142717,
- "total_submitted": 217465,
+ "total_acs": 144708,
+ "total_submitted": 220690,
"frontend_question_id": 1413,
"is_new_question": false
},
@@ -39391,8 +39989,8 @@
"question__title": "Find All Good Strings",
"question__title_slug": "find-all-good-strings",
"question__hide": false,
- "total_acs": 6518,
- "total_submitted": 15446,
+ "total_acs": 6580,
+ "total_submitted": 15557,
"frontend_question_id": 1397,
"is_new_question": false
},
@@ -39414,8 +40012,8 @@
"question__title": "Design Underground System",
"question__title_slug": "design-underground-system",
"question__hide": false,
- "total_acs": 231191,
- "total_submitted": 309509,
+ "total_acs": 231927,
+ "total_submitted": 310458,
"frontend_question_id": 1396,
"is_new_question": false
},
@@ -39437,8 +40035,8 @@
"question__title": "Count Number of Teams",
"question__title_slug": "count-number-of-teams",
"question__hide": false,
- "total_acs": 111935,
- "total_submitted": 169690,
+ "total_acs": 112624,
+ "total_submitted": 170786,
"frontend_question_id": 1395,
"is_new_question": false
},
@@ -39460,8 +40058,8 @@
"question__title": "Find Lucky Integer in an Array",
"question__title_slug": "find-lucky-integer-in-an-array",
"question__hide": false,
- "total_acs": 124322,
- "total_submitted": 185504,
+ "total_acs": 125962,
+ "total_submitted": 187486,
"frontend_question_id": 1394,
"is_new_question": false
},
@@ -39483,8 +40081,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": 431583,
- "total_submitted": 521278,
+ "total_acs": 460232,
+ "total_submitted": 555851,
"frontend_question_id": 1378,
"is_new_question": false
},
@@ -39506,8 +40104,8 @@
"question__title": "Longest Happy Prefix",
"question__title_slug": "longest-happy-prefix",
"question__hide": false,
- "total_acs": 43380,
- "total_submitted": 94505,
+ "total_acs": 44422,
+ "total_submitted": 96571,
"frontend_question_id": 1392,
"is_new_question": false
},
@@ -39529,8 +40127,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": 28720,
- "total_submitted": 59970,
+ "total_acs": 28952,
+ "total_submitted": 60421,
"frontend_question_id": 1391,
"is_new_question": false
},
@@ -39552,8 +40150,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": 248181,
- "total_submitted": 289076,
+ "total_acs": 250684,
+ "total_submitted": 291877,
"frontend_question_id": 1389,
"is_new_question": false
},
@@ -39575,8 +40173,8 @@
"question__title": "Get the Second Most Recent Activity",
"question__title_slug": "get-the-second-most-recent-activity",
"question__hide": false,
- "total_acs": 21584,
- "total_submitted": 31886,
+ "total_acs": 21738,
+ "total_submitted": 32081,
"frontend_question_id": 1369,
"is_new_question": false
},
@@ -39598,8 +40196,8 @@
"question__title": "Reducing Dishes",
"question__title_slug": "reducing-dishes",
"question__hide": false,
- "total_acs": 142848,
- "total_submitted": 187485,
+ "total_acs": 145051,
+ "total_submitted": 190364,
"frontend_question_id": 1402,
"is_new_question": false
},
@@ -39621,8 +40219,8 @@
"question__title": "Construct K Palindrome Strings",
"question__title_slug": "construct-k-palindrome-strings",
"question__hide": false,
- "total_acs": 52298,
- "total_submitted": 84152,
+ "total_acs": 52711,
+ "total_submitted": 84815,
"frontend_question_id": 1400,
"is_new_question": false
},
@@ -39644,8 +40242,8 @@
"question__title": "Circle and Rectangle Overlapping",
"question__title_slug": "circle-and-rectangle-overlapping",
"question__hide": false,
- "total_acs": 16892,
- "total_submitted": 36459,
+ "total_acs": 17034,
+ "total_submitted": 36720,
"frontend_question_id": 1401,
"is_new_question": false
},
@@ -39667,8 +40265,8 @@
"question__title": "Count Largest Group",
"question__title_slug": "count-largest-group",
"question__hide": false,
- "total_acs": 46013,
- "total_submitted": 69297,
+ "total_acs": 46410,
+ "total_submitted": 69993,
"frontend_question_id": 1399,
"is_new_question": false
},
@@ -39690,8 +40288,8 @@
"question__title": "Maximum Performance of a Team",
"question__title_slug": "maximum-performance-of-a-team",
"question__hide": false,
- "total_acs": 94304,
- "total_submitted": 197239,
+ "total_acs": 94793,
+ "total_submitted": 198389,
"frontend_question_id": 1383,
"is_new_question": false
},
@@ -39713,8 +40311,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": 228560,
- "total_submitted": 266323,
+ "total_acs": 230400,
+ "total_submitted": 268440,
"frontend_question_id": 1379,
"is_new_question": false
},
@@ -39736,8 +40334,8 @@
"question__title": "Design a Stack With Increment Operation",
"question__title_slug": "design-a-stack-with-increment-operation",
"question__hide": false,
- "total_acs": 112157,
- "total_submitted": 145516,
+ "total_acs": 113502,
+ "total_submitted": 147197,
"frontend_question_id": 1381,
"is_new_question": false
},
@@ -39759,8 +40357,8 @@
"question__title": "Lucky Numbers in a Matrix",
"question__title_slug": "lucky-numbers-in-a-matrix",
"question__hide": false,
- "total_acs": 107234,
- "total_submitted": 150095,
+ "total_acs": 108375,
+ "total_submitted": 151580,
"frontend_question_id": 1380,
"is_new_question": false
},
@@ -39782,8 +40380,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": 19933,
- "total_submitted": 26543,
+ "total_acs": 20079,
+ "total_submitted": 26758,
"frontend_question_id": 1364,
"is_new_question": false
},
@@ -39805,8 +40403,8 @@
"question__title": "Activity Participants",
"question__title_slug": "activity-participants",
"question__hide": false,
- "total_acs": 29269,
- "total_submitted": 40440,
+ "total_acs": 29449,
+ "total_submitted": 40710,
"frontend_question_id": 1355,
"is_new_question": false
},
@@ -39828,8 +40426,8 @@
"question__title": "Frog Position After T Seconds",
"question__title_slug": "frog-position-after-t-seconds",
"question__hide": false,
- "total_acs": 29702,
- "total_submitted": 83714,
+ "total_acs": 29988,
+ "total_submitted": 84609,
"frontend_question_id": 1377,
"is_new_question": false
},
@@ -39851,8 +40449,8 @@
"question__title": "Time Needed to Inform All Employees",
"question__title_slug": "time-needed-to-inform-all-employees",
"question__hide": false,
- "total_acs": 216052,
- "total_submitted": 360073,
+ "total_acs": 217464,
+ "total_submitted": 362417,
"frontend_question_id": 1376,
"is_new_question": false
},
@@ -39874,8 +40472,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": 52613,
- "total_submitted": 80052,
+ "total_acs": 52885,
+ "total_submitted": 80455,
"frontend_question_id": 1375,
"is_new_question": false
},
@@ -39897,8 +40495,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": 94101,
- "total_submitted": 120926,
+ "total_acs": 94839,
+ "total_submitted": 121816,
"frontend_question_id": 1374,
"is_new_question": false
},
@@ -39920,8 +40518,8 @@
"question__title": "Pizza With 3n Slices",
"question__title_slug": "pizza-with-3n-slices",
"question__hide": false,
- "total_acs": 24342,
- "total_submitted": 47075,
+ "total_acs": 24974,
+ "total_submitted": 48196,
"frontend_question_id": 1388,
"is_new_question": false
},
@@ -39943,8 +40541,8 @@
"question__title": "Sort Integers by The Power Value",
"question__title_slug": "sort-integers-by-the-power-value",
"question__hide": false,
- "total_acs": 92130,
- "total_submitted": 131597,
+ "total_acs": 92961,
+ "total_submitted": 132665,
"frontend_question_id": 1387,
"is_new_question": false
},
@@ -39966,8 +40564,8 @@
"question__title": "Cinema Seat Allocation",
"question__title_slug": "cinema-seat-allocation",
"question__hide": false,
- "total_acs": 47797,
- "total_submitted": 113981,
+ "total_acs": 48292,
+ "total_submitted": 114965,
"frontend_question_id": 1386,
"is_new_question": false
},
@@ -39989,8 +40587,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": 102720,
- "total_submitted": 150155,
+ "total_acs": 103955,
+ "total_submitted": 151705,
"frontend_question_id": 1385,
"is_new_question": false
},
@@ -40012,8 +40610,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": 47155,
- "total_submitted": 76014,
+ "total_acs": 47602,
+ "total_submitted": 76678,
"frontend_question_id": 1368,
"is_new_question": false
},
@@ -40035,8 +40633,8 @@
"question__title": "Linked List in Binary Tree",
"question__title_slug": "linked-list-in-binary-tree",
"question__hide": false,
- "total_acs": 75902,
- "total_submitted": 172987,
+ "total_acs": 76495,
+ "total_submitted": 174188,
"frontend_question_id": 1367,
"is_new_question": false
},
@@ -40058,8 +40656,8 @@
"question__title": "Rank Teams by Votes",
"question__title_slug": "rank-teams-by-votes",
"question__hide": false,
- "total_acs": 72834,
- "total_submitted": 124768,
+ "total_acs": 73946,
+ "total_submitted": 126489,
"frontend_question_id": 1366,
"is_new_question": false
},
@@ -40081,8 +40679,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": 562508,
- "total_submitted": 648526,
+ "total_acs": 568953,
+ "total_submitted": 655552,
"frontend_question_id": 1365,
"is_new_question": false
},
@@ -40104,8 +40702,8 @@
"question__title": "Students With Invalid Departments",
"question__title_slug": "students-with-invalid-departments",
"question__hide": false,
- "total_acs": 55811,
- "total_submitted": 62261,
+ "total_acs": 56220,
+ "total_submitted": 62702,
"frontend_question_id": 1350,
"is_new_question": false
},
@@ -40127,8 +40725,8 @@
"question__title": "Movie Rating",
"question__title_slug": "movie-rating",
"question__hide": false,
- "total_acs": 93472,
- "total_submitted": 235201,
+ "total_acs": 98469,
+ "total_submitted": 248070,
"frontend_question_id": 1341,
"is_new_question": false
},
@@ -40150,8 +40748,8 @@
"question__title": "Construct Target Array With Multiple Sums",
"question__title_slug": "construct-target-array-with-multiple-sums",
"question__hide": false,
- "total_acs": 66319,
- "total_submitted": 183306,
+ "total_acs": 66469,
+ "total_submitted": 183753,
"frontend_question_id": 1354,
"is_new_question": false
},
@@ -40173,8 +40771,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": 88410,
- "total_submitted": 272498,
+ "total_acs": 89510,
+ "total_submitted": 275485,
"frontend_question_id": 1353,
"is_new_question": false
},
@@ -40196,8 +40794,8 @@
"question__title": "Product of the Last K Numbers",
"question__title_slug": "product-of-the-last-k-numbers",
"question__hide": false,
- "total_acs": 87007,
- "total_submitted": 169440,
+ "total_acs": 88256,
+ "total_submitted": 171349,
"frontend_question_id": 1352,
"is_new_question": false
},
@@ -40219,8 +40817,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": 415533,
- "total_submitted": 537273,
+ "total_acs": 420570,
+ "total_submitted": 543582,
"frontend_question_id": 1351,
"is_new_question": false
},
@@ -40242,8 +40840,8 @@
"question__title": "Maximum Sum BST in Binary Tree",
"question__title_slug": "maximum-sum-bst-in-binary-tree",
"question__hide": false,
- "total_acs": 72186,
- "total_submitted": 175632,
+ "total_acs": 73828,
+ "total_submitted": 178944,
"frontend_question_id": 1373,
"is_new_question": false
},
@@ -40265,8 +40863,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": 164201,
- "total_submitted": 249748,
+ "total_acs": 168062,
+ "total_submitted": 255437,
"frontend_question_id": 1372,
"is_new_question": false
},
@@ -40288,8 +40886,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": 27107,
- "total_submitted": 42423,
+ "total_acs": 27387,
+ "total_submitted": 42799,
"frontend_question_id": 1371,
"is_new_question": false
},
@@ -40311,8 +40909,8 @@
"question__title": "Increasing Decreasing String",
"question__title_slug": "increasing-decreasing-string",
"question__hide": false,
- "total_acs": 77605,
- "total_submitted": 101577,
+ "total_acs": 78499,
+ "total_submitted": 102701,
"frontend_question_id": 1370,
"is_new_question": false
},
@@ -40334,8 +40932,8 @@
"question__title": "Maximum Students Taking Exam",
"question__title_slug": "maximum-students-taking-exam",
"question__hide": false,
- "total_acs": 16353,
- "total_submitted": 32424,
+ "total_acs": 16529,
+ "total_submitted": 32718,
"frontend_question_id": 1349,
"is_new_question": false
},
@@ -40357,8 +40955,8 @@
"question__title": "Tweet Counts Per Frequency",
"question__title_slug": "tweet-counts-per-frequency",
"question__hide": false,
- "total_acs": 32975,
- "total_submitted": 74089,
+ "total_acs": 33108,
+ "total_submitted": 74319,
"frontend_question_id": 1348,
"is_new_question": false
},
@@ -40380,8 +40978,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": 277029,
- "total_submitted": 337709,
+ "total_acs": 280360,
+ "total_submitted": 341775,
"frontend_question_id": 1347,
"is_new_question": false
},
@@ -40403,8 +41001,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": 350329,
- "total_submitted": 942289,
+ "total_acs": 354185,
+ "total_submitted": 951391,
"frontend_question_id": 1346,
"is_new_question": false
},
@@ -40426,8 +41024,8 @@
"question__title": "Number of Transactions per Visit",
"question__title_slug": "number-of-transactions-per-visit",
"question__hide": false,
- "total_acs": 12491,
- "total_submitted": 26149,
+ "total_acs": 12597,
+ "total_submitted": 26377,
"frontend_question_id": 1336,
"is_new_question": false
},
@@ -40449,8 +41047,8 @@
"question__title": "Jump Game V",
"question__title_slug": "jump-game-v",
"question__hide": false,
- "total_acs": 32148,
- "total_submitted": 50804,
+ "total_acs": 32478,
+ "total_submitted": 51287,
"frontend_question_id": 1340,
"is_new_question": false
},
@@ -40472,8 +41070,8 @@
"question__title": "Maximum Product of Splitted Binary Tree",
"question__title_slug": "maximum-product-of-splitted-binary-tree",
"question__hide": false,
- "total_acs": 123992,
- "total_submitted": 259985,
+ "total_acs": 124479,
+ "total_submitted": 261056,
"frontend_question_id": 1339,
"is_new_question": false
},
@@ -40495,8 +41093,8 @@
"question__title": "Reduce Array Size to The Half",
"question__title_slug": "reduce-array-size-to-the-half",
"question__hide": false,
- "total_acs": 193540,
- "total_submitted": 280705,
+ "total_acs": 194819,
+ "total_submitted": 282575,
"frontend_question_id": 1338,
"is_new_question": false
},
@@ -40518,8 +41116,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": 363163,
- "total_submitted": 494214,
+ "total_acs": 365071,
+ "total_submitted": 496604,
"frontend_question_id": 1337,
"is_new_question": false
},
@@ -40541,8 +41139,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": 112380,
- "total_submitted": 159511,
+ "total_acs": 117684,
+ "total_submitted": 166864,
"frontend_question_id": 1327,
"is_new_question": false
},
@@ -40564,8 +41162,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": 122564,
- "total_submitted": 188260,
+ "total_acs": 122965,
+ "total_submitted": 188975,
"frontend_question_id": 1359,
"is_new_question": false
},
@@ -40587,8 +41185,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": 103855,
- "total_submitted": 155510,
+ "total_acs": 109994,
+ "total_submitted": 164089,
"frontend_question_id": 1358,
"is_new_question": false
},
@@ -40610,8 +41208,8 @@
"question__title": "Apply Discount Every n Orders",
"question__title_slug": "apply-discount-every-n-orders",
"question__hide": false,
- "total_acs": 22219,
- "total_submitted": 31248,
+ "total_acs": 22429,
+ "total_submitted": 31516,
"frontend_question_id": 1357,
"is_new_question": false
},
@@ -40633,8 +41231,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": 224153,
- "total_submitted": 286593,
+ "total_acs": 225601,
+ "total_submitted": 288319,
"frontend_question_id": 1356,
"is_new_question": false
},
@@ -40656,8 +41254,8 @@
"question__title": "Minimum Difficulty of a Job Schedule",
"question__title_slug": "minimum-difficulty-of-a-job-schedule",
"question__hide": false,
- "total_acs": 194514,
- "total_submitted": 326379,
+ "total_acs": 195497,
+ "total_submitted": 328051,
"frontend_question_id": 1335,
"is_new_question": false
},
@@ -40679,8 +41277,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": 100700,
- "total_submitted": 166311,
+ "total_acs": 104326,
+ "total_submitted": 170746,
"frontend_question_id": 1334,
"is_new_question": false
},
@@ -40702,8 +41300,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": 30002,
- "total_submitted": 48918,
+ "total_acs": 30186,
+ "total_submitted": 49153,
"frontend_question_id": 1333,
"is_new_question": false
},
@@ -40725,8 +41323,8 @@
"question__title": "Remove Palindromic Subsequences",
"question__title_slug": "remove-palindromic-subsequences",
"question__hide": false,
- "total_acs": 133420,
- "total_submitted": 174618,
+ "total_acs": 134290,
+ "total_submitted": 175709,
"frontend_question_id": 1332,
"is_new_question": false
},
@@ -40748,8 +41346,8 @@
"question__title": "Ads Performance",
"question__title_slug": "ads-performance",
"question__hide": false,
- "total_acs": 42389,
- "total_submitted": 71150,
+ "total_acs": 42738,
+ "total_submitted": 71814,
"frontend_question_id": 1322,
"is_new_question": false
},
@@ -40771,8 +41369,8 @@
"question__title": "Restaurant Growth",
"question__title_slug": "restaurant-growth",
"question__hide": false,
- "total_acs": 87530,
- "total_submitted": 174134,
+ "total_acs": 92030,
+ "total_submitted": 181613,
"frontend_question_id": 1321,
"is_new_question": false
},
@@ -40794,8 +41392,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": 132060,
- "total_submitted": 259169,
+ "total_acs": 132795,
+ "total_submitted": 260806,
"frontend_question_id": 1326,
"is_new_question": false
},
@@ -40817,8 +41415,8 @@
"question__title": "Delete Leaves With a Given Value",
"question__title_slug": "delete-leaves-with-a-given-value",
"question__hide": false,
- "total_acs": 208746,
- "total_submitted": 269285,
+ "total_acs": 210258,
+ "total_submitted": 271274,
"frontend_question_id": 1325,
"is_new_question": false
},
@@ -40840,8 +41438,8 @@
"question__title": "Print Words Vertically",
"question__title_slug": "print-words-vertically",
"question__hide": false,
- "total_acs": 40534,
- "total_submitted": 63442,
+ "total_acs": 40990,
+ "total_submitted": 64024,
"frontend_question_id": 1324,
"is_new_question": false
},
@@ -40863,8 +41461,8 @@
"question__title": "Maximum 69 Number",
"question__title_slug": "maximum-69-number",
"question__hide": false,
- "total_acs": 262236,
- "total_submitted": 318558,
+ "total_acs": 264610,
+ "total_submitted": 321307,
"frontend_question_id": 1323,
"is_new_question": false
},
@@ -40886,8 +41484,8 @@
"question__title": "Jump Game IV",
"question__title_slug": "jump-game-iv",
"question__hide": false,
- "total_acs": 144507,
- "total_submitted": 312760,
+ "total_acs": 145096,
+ "total_submitted": 314113,
"frontend_question_id": 1345,
"is_new_question": false
},
@@ -40909,8 +41507,8 @@
"question__title": "Angle Between Hands of a Clock",
"question__title_slug": "angle-between-hands-of-a-clock",
"question__hide": false,
- "total_acs": 121840,
- "total_submitted": 191079,
+ "total_acs": 122594,
+ "total_submitted": 192147,
"frontend_question_id": 1344,
"is_new_question": false
},
@@ -40932,8 +41530,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": 97003,
- "total_submitted": 141753,
+ "total_acs": 99662,
+ "total_submitted": 145369,
"frontend_question_id": 1343,
"is_new_question": false
},
@@ -40955,8 +41553,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": 671717,
- "total_submitted": 789214,
+ "total_acs": 679124,
+ "total_submitted": 797492,
"frontend_question_id": 1342,
"is_new_question": false
},
@@ -40978,8 +41576,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": 31390,
- "total_submitted": 53029,
+ "total_acs": 31594,
+ "total_submitted": 53376,
"frontend_question_id": 1320,
"is_new_question": false
},
@@ -41001,8 +41599,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": 216244,
- "total_submitted": 344622,
+ "total_acs": 220418,
+ "total_submitted": 350607,
"frontend_question_id": 1319,
"is_new_question": false
},
@@ -41024,8 +41622,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": 124906,
- "total_submitted": 175869,
+ "total_acs": 127222,
+ "total_submitted": 179133,
"frontend_question_id": 1318,
"is_new_question": false
},
@@ -41047,8 +41645,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": 46452,
- "total_submitted": 85911,
+ "total_acs": 46872,
+ "total_submitted": 86792,
"frontend_question_id": 1317,
"is_new_question": false
},
@@ -41070,8 +41668,8 @@
"question__title": "Running Total for Different Genders",
"question__title_slug": "running-total-for-different-genders",
"question__hide": false,
- "total_acs": 40677,
- "total_submitted": 47086,
+ "total_acs": 40894,
+ "total_submitted": 47327,
"frontend_question_id": 1308,
"is_new_question": false
},
@@ -41093,8 +41691,8 @@
"question__title": "Find the Team Size",
"question__title_slug": "find-the-team-size",
"question__hide": false,
- "total_acs": 69824,
- "total_submitted": 78004,
+ "total_acs": 70258,
+ "total_submitted": 78487,
"frontend_question_id": 1303,
"is_new_question": false
},
@@ -41116,8 +41714,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": 167868,
- "total_submitted": 237745,
+ "total_acs": 172679,
+ "total_submitted": 243954,
"frontend_question_id": 1312,
"is_new_question": false
},
@@ -41139,8 +41737,8 @@
"question__title": "Get Watched Videos by Your Friends",
"question__title_slug": "get-watched-videos-by-your-friends",
"question__hide": false,
- "total_acs": 23608,
- "total_submitted": 50000,
+ "total_acs": 23944,
+ "total_submitted": 50636,
"frontend_question_id": 1311,
"is_new_question": false
},
@@ -41162,8 +41760,8 @@
"question__title": "XOR Queries of a Subarray",
"question__title_slug": "xor-queries-of-a-subarray",
"question__hide": false,
- "total_acs": 57684,
- "total_submitted": 79208,
+ "total_acs": 58416,
+ "total_submitted": 80080,
"frontend_question_id": 1310,
"is_new_question": false
},
@@ -41185,8 +41783,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": 124397,
- "total_submitted": 156172,
+ "total_acs": 125171,
+ "total_submitted": 157067,
"frontend_question_id": 1309,
"is_new_question": false
},
@@ -41208,8 +41806,8 @@
"question__title": "Encrypt and Decrypt Strings",
"question__title_slug": "encrypt-and-decrypt-strings",
"question__hide": false,
- "total_acs": 12614,
- "total_submitted": 31313,
+ "total_acs": 12768,
+ "total_submitted": 31642,
"frontend_question_id": 2227,
"is_new_question": false
},
@@ -41231,8 +41829,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": 44350,
- "total_submitted": 94591,
+ "total_acs": 44454,
+ "total_submitted": 94738,
"frontend_question_id": 1430,
"is_new_question": false
},
@@ -41254,8 +41852,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": 38117,
- "total_submitted": 73086,
+ "total_acs": 38885,
+ "total_submitted": 74315,
"frontend_question_id": 2192,
"is_new_question": false
},
@@ -41277,8 +41875,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": 57715,
- "total_submitted": 96504,
+ "total_acs": 58743,
+ "total_submitted": 98055,
"frontend_question_id": 2269,
"is_new_question": false
},
@@ -41300,8 +41898,8 @@
"question__title": "Verbal Arithmetic Puzzle",
"question__title_slug": "verbal-arithmetic-puzzle",
"question__hide": false,
- "total_acs": 13313,
- "total_submitted": 39028,
+ "total_acs": 13617,
+ "total_submitted": 39730,
"frontend_question_id": 1307,
"is_new_question": false
},
@@ -41323,8 +41921,8 @@
"question__title": "Jump Game III",
"question__title_slug": "jump-game-iii",
"question__hide": false,
- "total_acs": 230509,
- "total_submitted": 355381,
+ "total_acs": 232729,
+ "total_submitted": 358495,
"frontend_question_id": 1306,
"is_new_question": false
},
@@ -41346,8 +41944,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": 216619,
- "total_submitted": 271453,
+ "total_acs": 217986,
+ "total_submitted": 273123,
"frontend_question_id": 1305,
"is_new_question": false
},
@@ -41369,8 +41967,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": 217891,
- "total_submitted": 285975,
+ "total_acs": 219454,
+ "total_submitted": 288047,
"frontend_question_id": 1304,
"is_new_question": false
},
@@ -41392,8 +41990,8 @@
"question__title": "Weather Type in Each Country",
"question__title_slug": "weather-type-in-each-country",
"question__hide": false,
- "total_acs": 39685,
- "total_submitted": 59462,
+ "total_acs": 39890,
+ "total_submitted": 59763,
"frontend_question_id": 1294,
"is_new_question": false
},
@@ -41415,8 +42013,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": 16583,
- "total_submitted": 28518,
+ "total_acs": 16828,
+ "total_submitted": 28949,
"frontend_question_id": 1298,
"is_new_question": false
},
@@ -41438,8 +42036,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": 53200,
- "total_submitted": 102397,
+ "total_acs": 53806,
+ "total_submitted": 103510,
"frontend_question_id": 1297,
"is_new_question": false
},
@@ -41461,8 +42059,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": 83766,
- "total_submitted": 147651,
+ "total_acs": 97031,
+ "total_submitted": 166154,
"frontend_question_id": 1296,
"is_new_question": false
},
@@ -41484,8 +42082,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": 675569,
- "total_submitted": 874321,
+ "total_acs": 682300,
+ "total_submitted": 882655,
"frontend_question_id": 1295,
"is_new_question": false
},
@@ -41507,8 +42105,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": 38477,
- "total_submitted": 46764,
+ "total_acs": 38850,
+ "total_submitted": 47222,
"frontend_question_id": 1285,
"is_new_question": false
},
@@ -41530,8 +42128,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": 2821,
- "total_submitted": 4324,
+ "total_acs": 3124,
+ "total_submitted": 4744,
"frontend_question_id": 2263,
"is_new_question": false
},
@@ -41553,8 +42151,8 @@
"question__title": "Fair Distribution of Cookies",
"question__title_slug": "fair-distribution-of-cookies",
"question__hide": false,
- "total_acs": 94370,
- "total_submitted": 136282,
+ "total_acs": 95374,
+ "total_submitted": 137763,
"frontend_question_id": 2305,
"is_new_question": false
},
@@ -41576,8 +42174,8 @@
"question__title": "Check if an Array Is Consecutive",
"question__title_slug": "check-if-an-array-is-consecutive",
"question__hide": false,
- "total_acs": 5733,
- "total_submitted": 9338,
+ "total_acs": 5785,
+ "total_submitted": 9413,
"frontend_question_id": 2229,
"is_new_question": false
},
@@ -41599,8 +42197,8 @@
"question__title": "Students and Examinations",
"question__title_slug": "students-and-examinations",
"question__hide": false,
- "total_acs": 235146,
- "total_submitted": 412682,
+ "total_acs": 249913,
+ "total_submitted": 437122,
"frontend_question_id": 1280,
"is_new_question": false
},
@@ -41622,8 +42220,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": 209919,
- "total_submitted": 464099,
+ "total_acs": 211467,
+ "total_submitted": 467322,
"frontend_question_id": 1293,
"is_new_question": false
},
@@ -41645,8 +42243,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": 33450,
- "total_submitted": 62598,
+ "total_acs": 33633,
+ "total_submitted": 62885,
"frontend_question_id": 1292,
"is_new_question": false
},
@@ -41668,8 +42266,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": 472142,
- "total_submitted": 582029,
+ "total_acs": 476466,
+ "total_submitted": 587355,
"frontend_question_id": 1290,
"is_new_question": false
},
@@ -41691,8 +42289,8 @@
"question__title": "Traffic Light Controlled Intersection",
"question__title_slug": "traffic-light-controlled-intersection",
"question__hide": false,
- "total_acs": 14024,
- "total_submitted": 19188,
+ "total_acs": 14175,
+ "total_submitted": 19419,
"frontend_question_id": 1279,
"is_new_question": false
},
@@ -41714,8 +42312,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": 33000,
- "total_submitted": 45755,
+ "total_acs": 33190,
+ "total_submitted": 46030,
"frontend_question_id": 1284,
"is_new_question": false
},
@@ -41737,8 +42335,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": 179503,
- "total_submitted": 300018,
+ "total_acs": 188494,
+ "total_submitted": 312637,
"frontend_question_id": 1283,
"is_new_question": false
},
@@ -41760,8 +42358,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": 207454,
- "total_submitted": 237184,
+ "total_acs": 209037,
+ "total_submitted": 238958,
"frontend_question_id": 1282,
"is_new_question": false
},
@@ -41783,8 +42381,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": 490649,
- "total_submitted": 567219,
+ "total_acs": 496012,
+ "total_submitted": 573297,
"frontend_question_id": 1281,
"is_new_question": false
},
@@ -41806,8 +42404,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": 54713,
- "total_submitted": 64530,
+ "total_acs": 55120,
+ "total_submitted": 65004,
"frontend_question_id": 1270,
"is_new_question": false
},
@@ -41829,8 +42427,8 @@
"question__title": "Print Immutable Linked List in Reverse",
"question__title_slug": "print-immutable-linked-list-in-reverse",
"question__hide": false,
- "total_acs": 57941,
- "total_submitted": 61625,
+ "total_acs": 58260,
+ "total_submitted": 61953,
"frontend_question_id": 1265,
"is_new_question": false
},
@@ -41852,8 +42450,8 @@
"question__title": "Palindrome Partitioning III",
"question__title_slug": "palindrome-partitioning-iii",
"question__hide": false,
- "total_acs": 28417,
- "total_submitted": 46594,
+ "total_acs": 28706,
+ "total_submitted": 47080,
"frontend_question_id": 1278,
"is_new_question": false
},
@@ -41875,8 +42473,8 @@
"question__title": "Count Square Submatrices with All Ones",
"question__title_slug": "count-square-submatrices-with-all-ones",
"question__hide": false,
- "total_acs": 222382,
- "total_submitted": 295963,
+ "total_acs": 224701,
+ "total_submitted": 298734,
"frontend_question_id": 1277,
"is_new_question": false
},
@@ -41898,8 +42496,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": 25927,
- "total_submitted": 50713,
+ "total_acs": 26136,
+ "total_submitted": 51104,
"frontend_question_id": 1276,
"is_new_question": false
},
@@ -41921,8 +42519,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": 126175,
- "total_submitted": 234193,
+ "total_acs": 127279,
+ "total_submitted": 236206,
"frontend_question_id": 1275,
"is_new_question": false
},
@@ -41944,8 +42542,8 @@
"question__title": "Page Recommendations",
"question__title_slug": "page-recommendations",
"question__hide": false,
- "total_acs": 41735,
- "total_submitted": 64161,
+ "total_acs": 42102,
+ "total_submitted": 64681,
"frontend_question_id": 1264,
"is_new_question": false
},
@@ -41967,8 +42565,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": 91156,
- "total_submitted": 180808,
+ "total_acs": 91566,
+ "total_submitted": 181677,
"frontend_question_id": 1269,
"is_new_question": false
},
@@ -41990,8 +42588,8 @@
"question__title": "Search Suggestions System",
"question__title_slug": "search-suggestions-system",
"question__hide": false,
- "total_acs": 307664,
- "total_submitted": 472428,
+ "total_acs": 311750,
+ "total_submitted": 478816,
"frontend_question_id": 1268,
"is_new_question": false
},
@@ -42013,8 +42611,8 @@
"question__title": "Count Servers that Communicate",
"question__title_slug": "count-servers-that-communicate",
"question__hide": false,
- "total_acs": 59171,
- "total_submitted": 98006,
+ "total_acs": 59554,
+ "total_submitted": 98557,
"frontend_question_id": 1267,
"is_new_question": false
},
@@ -42036,8 +42634,8 @@
"question__title": "Minimum Time Visiting All Points",
"question__title_slug": "minimum-time-visiting-all-points",
"question__hide": false,
- "total_acs": 231099,
- "total_submitted": 280243,
+ "total_acs": 232104,
+ "total_submitted": 281501,
"frontend_question_id": 1266,
"is_new_question": false
},
@@ -42059,8 +42657,8 @@
"question__title": "Minimum Path Cost in a Grid",
"question__title_slug": "minimum-path-cost-in-a-grid",
"question__hide": false,
- "total_acs": 29962,
- "total_submitted": 45001,
+ "total_acs": 30332,
+ "total_submitted": 45508,
"frontend_question_id": 2304,
"is_new_question": false
},
@@ -42082,8 +42680,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": 65726,
- "total_submitted": 108520,
+ "total_acs": 66312,
+ "total_submitted": 109455,
"frontend_question_id": 2218,
"is_new_question": false
},
@@ -42105,8 +42703,8 @@
"question__title": "Find the Difference of Two Arrays",
"question__title_slug": "find-the-difference-of-two-arrays",
"question__hide": false,
- "total_acs": 329691,
- "total_submitted": 418449,
+ "total_acs": 341296,
+ "total_submitted": 432663,
"frontend_question_id": 2215,
"is_new_question": false
},
@@ -42128,8 +42726,8 @@
"question__title": "Counting Elements",
"question__title_slug": "counting-elements",
"question__hide": false,
- "total_acs": 125108,
- "total_submitted": 207919,
+ "total_acs": 126313,
+ "total_submitted": 209805,
"frontend_question_id": 1426,
"is_new_question": false
},
@@ -42151,8 +42749,8 @@
"question__title": "Average Selling Price",
"question__title_slug": "average-selling-price",
"question__hide": false,
- "total_acs": 222052,
- "total_submitted": 558012,
+ "total_acs": 234602,
+ "total_submitted": 600871,
"frontend_question_id": 1251,
"is_new_question": false
},
@@ -42174,8 +42772,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": 27990,
- "total_submitted": 57118,
+ "total_acs": 28086,
+ "total_submitted": 57327,
"frontend_question_id": 1263,
"is_new_question": false
},
@@ -42197,8 +42795,8 @@
"question__title": "Greatest Sum Divisible by Three",
"question__title_slug": "greatest-sum-divisible-by-three",
"question__hide": false,
- "total_acs": 54692,
- "total_submitted": 107932,
+ "total_acs": 55259,
+ "total_submitted": 109093,
"frontend_question_id": 1262,
"is_new_question": false
},
@@ -42220,8 +42818,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": 64578,
- "total_submitted": 83538,
+ "total_acs": 65045,
+ "total_submitted": 84074,
"frontend_question_id": 1261,
"is_new_question": false
},
@@ -42243,8 +42841,8 @@
"question__title": "Shift 2D Grid",
"question__title_slug": "shift-2d-grid",
"question__hide": false,
- "total_acs": 106428,
- "total_submitted": 157928,
+ "total_acs": 106962,
+ "total_submitted": 158678,
"frontend_question_id": 1260,
"is_new_question": false
},
@@ -42266,8 +42864,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": 2098,
- "total_submitted": 3306,
+ "total_acs": 2118,
+ "total_submitted": 3344,
"frontend_question_id": 2189,
"is_new_question": false
},
@@ -42289,8 +42887,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": 6847,
- "total_submitted": 11258,
+ "total_acs": 6886,
+ "total_submitted": 11306,
"frontend_question_id": 1618,
"is_new_question": false
},
@@ -42312,8 +42910,8 @@
"question__title": "Number of Single Divisor Triplets",
"question__title_slug": "number-of-single-divisor-triplets",
"question__hide": false,
- "total_acs": 1091,
- "total_submitted": 1981,
+ "total_acs": 1105,
+ "total_submitted": 2010,
"frontend_question_id": 2198,
"is_new_question": false
},
@@ -42335,8 +42933,8 @@
"question__title": "Calculate Amount Paid in Taxes",
"question__title_slug": "calculate-amount-paid-in-taxes",
"question__hide": false,
- "total_acs": 37700,
- "total_submitted": 57595,
+ "total_acs": 38124,
+ "total_submitted": 58107,
"frontend_question_id": 2303,
"is_new_question": false
},
@@ -42358,8 +42956,8 @@
"question__title": "Maximum Score Words Formed by Letters",
"question__title_slug": "maximum-score-words-formed-by-letters",
"question__hide": false,
- "total_acs": 111934,
- "total_submitted": 136074,
+ "total_acs": 113105,
+ "total_submitted": 137686,
"frontend_question_id": 1255,
"is_new_question": false
},
@@ -42381,8 +42979,8 @@
"question__title": "Number of Closed Islands",
"question__title_slug": "number-of-closed-islands",
"question__hide": false,
- "total_acs": 224027,
- "total_submitted": 337659,
+ "total_acs": 225695,
+ "total_submitted": 340034,
"frontend_question_id": 1254,
"is_new_question": false
},
@@ -42404,8 +43002,8 @@
"question__title": "Reconstruct a 2-Row Binary Matrix",
"question__title_slug": "reconstruct-a-2-row-binary-matrix",
"question__hide": false,
- "total_acs": 26274,
- "total_submitted": 57269,
+ "total_acs": 26457,
+ "total_submitted": 57578,
"frontend_question_id": 1253,
"is_new_question": false
},
@@ -42427,8 +43025,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": 113720,
- "total_submitted": 144523,
+ "total_acs": 114636,
+ "total_submitted": 145641,
"frontend_question_id": 1252,
"is_new_question": false
},
@@ -42450,8 +43048,8 @@
"question__title": "Number of Comments per Post",
"question__title_slug": "number-of-comments-per-post",
"question__hide": false,
- "total_acs": 35311,
- "total_submitted": 53628,
+ "total_acs": 35517,
+ "total_submitted": 53933,
"frontend_question_id": 1241,
"is_new_question": false
},
@@ -42473,8 +43071,8 @@
"question__title": "Selling Pieces of Wood",
"question__title_slug": "selling-pieces-of-wood",
"question__hide": false,
- "total_acs": 10349,
- "total_submitted": 20828,
+ "total_acs": 10499,
+ "total_submitted": 21091,
"frontend_question_id": 2312,
"is_new_question": false
},
@@ -42496,8 +43094,8 @@
"question__title": "Find Palindrome With Fixed Length",
"question__title_slug": "find-palindrome-with-fixed-length",
"question__hide": false,
- "total_acs": 21876,
- "total_submitted": 59367,
+ "total_acs": 22157,
+ "total_submitted": 59992,
"frontend_question_id": 2217,
"is_new_question": false
},
@@ -42519,8 +43117,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": 181787,
- "total_submitted": 333922,
+ "total_acs": 182442,
+ "total_submitted": 334913,
"frontend_question_id": 1428,
"is_new_question": false
},
@@ -42542,8 +43140,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": 22993,
- "total_submitted": 38709,
+ "total_acs": 23315,
+ "total_submitted": 39201,
"frontend_question_id": 1250,
"is_new_question": false
},
@@ -42565,8 +43163,8 @@
"question__title": "Minimum Remove to Make Valid Parentheses",
"question__title_slug": "minimum-remove-to-make-valid-parentheses",
"question__hide": false,
- "total_acs": 738139,
- "total_submitted": 1070825,
+ "total_acs": 744837,
+ "total_submitted": 1079418,
"frontend_question_id": 1249,
"is_new_question": false
},
@@ -42582,14 +43180,14 @@
{
"stat": {
"question_id": 1370,
- "question__article__live": null,
- "question__article__slug": null,
- "question__article__has_video_solution": null,
+ "question__article__live": true,
+ "question__article__slug": "count-number-of-nice-subarrays",
+ "question__article__has_video_solution": false,
"question__title": "Count Number of Nice Subarrays",
"question__title_slug": "count-number-of-nice-subarrays",
"question__hide": false,
- "total_acs": 135513,
- "total_submitted": 205687,
+ "total_acs": 245995,
+ "total_submitted": 347120,
"frontend_question_id": 1248,
"is_new_question": false
},
@@ -42611,8 +43209,8 @@
"question__title": "Minimum Swaps to Make Strings Equal",
"question__title_slug": "minimum-swaps-to-make-strings-equal",
"question__hide": false,
- "total_acs": 39628,
- "total_submitted": 61483,
+ "total_acs": 39881,
+ "total_submitted": 61879,
"frontend_question_id": 1247,
"is_new_question": false
},
@@ -42634,8 +43232,8 @@
"question__title": "Web Crawler Multithreaded",
"question__title_slug": "web-crawler-multithreaded",
"question__hide": false,
- "total_acs": 54318,
- "total_submitted": 110651,
+ "total_acs": 54966,
+ "total_submitted": 111724,
"frontend_question_id": 1242,
"is_new_question": false
},
@@ -42657,8 +43255,8 @@
"question__title": "Maximum Height by Stacking Cuboids ",
"question__title_slug": "maximum-height-by-stacking-cuboids",
"question__hide": false,
- "total_acs": 27571,
- "total_submitted": 48296,
+ "total_acs": 28253,
+ "total_submitted": 49301,
"frontend_question_id": 1691,
"is_new_question": false
},
@@ -42680,8 +43278,8 @@
"question__title": "First Unique Number",
"question__title_slug": "first-unique-number",
"question__hide": false,
- "total_acs": 85211,
- "total_submitted": 158623,
+ "total_acs": 85585,
+ "total_submitted": 159194,
"frontend_question_id": 1429,
"is_new_question": false
},
@@ -42703,8 +43301,8 @@
"question__title": "Tuple with Same Product",
"question__title_slug": "tuple-with-same-product",
"question__hide": false,
- "total_acs": 27809,
- "total_submitted": 45496,
+ "total_acs": 28063,
+ "total_submitted": 45863,
"frontend_question_id": 1726,
"is_new_question": false
},
@@ -42726,8 +43324,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": 52838,
- "total_submitted": 75762,
+ "total_acs": 53642,
+ "total_submitted": 76776,
"frontend_question_id": 2309,
"is_new_question": false
},
@@ -42749,8 +43347,8 @@
"question__title": "Airplane Seat Assignment Probability",
"question__title_slug": "airplane-seat-assignment-probability",
"question__hide": false,
- "total_acs": 42002,
- "total_submitted": 63267,
+ "total_acs": 42495,
+ "total_submitted": 63976,
"frontend_question_id": 1227,
"is_new_question": false
},
@@ -42772,8 +43370,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": 23528,
- "total_submitted": 43387,
+ "total_acs": 23690,
+ "total_submitted": 43656,
"frontend_question_id": 1240,
"is_new_question": false
},
@@ -42795,8 +43393,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": 286571,
- "total_submitted": 529864,
+ "total_acs": 288495,
+ "total_submitted": 533545,
"frontend_question_id": 1239,
"is_new_question": false
},
@@ -42818,8 +43416,8 @@
"question__title": "Circular Permutation in Binary Representation",
"question__title_slug": "circular-permutation-in-binary-representation",
"question__hide": false,
- "total_acs": 17903,
- "total_submitted": 25568,
+ "total_acs": 18113,
+ "total_submitted": 25833,
"frontend_question_id": 1238,
"is_new_question": false
},
@@ -42841,8 +43439,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": 67382,
- "total_submitted": 96810,
+ "total_acs": 67921,
+ "total_submitted": 97507,
"frontend_question_id": 1237,
"is_new_question": false
},
@@ -42864,8 +43462,8 @@
"question__title": "Report Contiguous Dates",
"question__title_slug": "report-contiguous-dates",
"question__hide": false,
- "total_acs": 22631,
- "total_submitted": 39212,
+ "total_acs": 22942,
+ "total_submitted": 39734,
"frontend_question_id": 1225,
"is_new_question": false
},
@@ -42887,8 +43485,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": 22882,
- "total_submitted": 44941,
+ "total_acs": 23115,
+ "total_submitted": 45387,
"frontend_question_id": 2193,
"is_new_question": false
},
@@ -42910,8 +43508,8 @@
"question__title": "Minimum Deletions to Make Array Beautiful",
"question__title_slug": "minimum-deletions-to-make-array-beautiful",
"question__hide": false,
- "total_acs": 32271,
- "total_submitted": 66981,
+ "total_acs": 32539,
+ "total_submitted": 67389,
"frontend_question_id": 2216,
"is_new_question": false
},
@@ -42933,8 +43531,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": 243115,
- "total_submitted": 330919,
+ "total_acs": 246991,
+ "total_submitted": 336851,
"frontend_question_id": 2225,
"is_new_question": false
},
@@ -42956,8 +43554,8 @@
"question__title": "Find Resultant Array After Removing Anagrams",
"question__title_slug": "find-resultant-array-after-removing-anagrams",
"question__hide": false,
- "total_acs": 59742,
- "total_submitted": 102807,
+ "total_acs": 60623,
+ "total_submitted": 104158,
"frontend_question_id": 2273,
"is_new_question": false
},
@@ -42979,8 +43577,8 @@
"question__title": "Maximum Profit in Job Scheduling",
"question__title_slug": "maximum-profit-in-job-scheduling",
"question__hide": false,
- "total_acs": 307388,
- "total_submitted": 564154,
+ "total_acs": 310372,
+ "total_submitted": 569978,
"frontend_question_id": 1235,
"is_new_question": false
},
@@ -43002,8 +43600,8 @@
"question__title": "Replace the Substring for Balanced String",
"question__title_slug": "replace-the-substring-for-balanced-string",
"question__hide": false,
- "total_acs": 34295,
- "total_submitted": 89357,
+ "total_acs": 34607,
+ "total_submitted": 90056,
"frontend_question_id": 1234,
"is_new_question": false
},
@@ -43025,8 +43623,8 @@
"question__title": "Remove Sub-Folders from the Filesystem",
"question__title_slug": "remove-sub-folders-from-the-filesystem",
"question__hide": false,
- "total_acs": 53287,
- "total_submitted": 80798,
+ "total_acs": 53588,
+ "total_submitted": 81213,
"frontend_question_id": 1233,
"is_new_question": false
},
@@ -43048,8 +43646,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": 256658,
- "total_submitted": 649726,
+ "total_acs": 258251,
+ "total_submitted": 653296,
"frontend_question_id": 1232,
"is_new_question": false
},
@@ -43071,8 +43669,8 @@
"question__title": "Maximum Score Of Spliced Array",
"question__title_slug": "maximum-score-of-spliced-array",
"question__hide": false,
- "total_acs": 18676,
- "total_submitted": 32986,
+ "total_acs": 18882,
+ "total_submitted": 33275,
"frontend_question_id": 2321,
"is_new_question": false
},
@@ -43094,8 +43692,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": 3146,
- "total_submitted": 4537,
+ "total_acs": 3232,
+ "total_submitted": 4652,
"frontend_question_id": 2204,
"is_new_question": false
},
@@ -43117,8 +43715,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": 28179,
- "total_submitted": 122779,
+ "total_acs": 28535,
+ "total_submitted": 124233,
"frontend_question_id": 2202,
"is_new_question": false
},
@@ -43140,8 +43738,8 @@
"question__title": "Perform String Shifts",
"question__title_slug": "perform-string-shifts",
"question__hide": false,
- "total_acs": 80289,
- "total_submitted": 146746,
+ "total_acs": 80492,
+ "total_submitted": 147044,
"frontend_question_id": 1427,
"is_new_question": false
},
@@ -43163,8 +43761,8 @@
"question__title": "Maximum Equal Frequency",
"question__title_slug": "maximum-equal-frequency",
"question__hide": false,
- "total_acs": 15077,
- "total_submitted": 40609,
+ "total_acs": 15184,
+ "total_submitted": 40883,
"frontend_question_id": 1224,
"is_new_question": false
},
@@ -43186,8 +43784,8 @@
"question__title": "Dice Roll Simulation",
"question__title_slug": "dice-roll-simulation",
"question__hide": false,
- "total_acs": 29481,
- "total_submitted": 60069,
+ "total_acs": 29713,
+ "total_submitted": 60432,
"frontend_question_id": 1223,
"is_new_question": false
},
@@ -43209,8 +43807,8 @@
"question__title": "Queens That Can Attack the King",
"question__title_slug": "queens-that-can-attack-the-king",
"question__hide": false,
- "total_acs": 42630,
- "total_submitted": 59307,
+ "total_acs": 42904,
+ "total_submitted": 59664,
"frontend_question_id": 1222,
"is_new_question": false
},
@@ -43232,8 +43830,8 @@
"question__title": "Split a String in Balanced Strings",
"question__title_slug": "split-a-string-in-balanced-strings",
"question__hide": false,
- "total_acs": 304101,
- "total_submitted": 353296,
+ "total_acs": 307488,
+ "total_submitted": 356914,
"frontend_question_id": 1221,
"is_new_question": false
},
@@ -43255,8 +43853,8 @@
"question__title": "The Dining Philosophers",
"question__title_slug": "the-dining-philosophers",
"question__hide": false,
- "total_acs": 33062,
- "total_submitted": 61679,
+ "total_acs": 33515,
+ "total_submitted": 62454,
"frontend_question_id": 1226,
"is_new_question": false
},
@@ -43278,8 +43876,8 @@
"question__title": "Team Scores in Football Tournament",
"question__title_slug": "team-scores-in-football-tournament",
"question__hide": false,
- "total_acs": 38794,
- "total_submitted": 69544,
+ "total_acs": 39206,
+ "total_submitted": 70258,
"frontend_question_id": 1212,
"is_new_question": false
},
@@ -43301,8 +43899,8 @@
"question__title": "Queries Quality and Percentage",
"question__title_slug": "queries-quality-and-percentage",
"question__hide": false,
- "total_acs": 169050,
- "total_submitted": 356373,
+ "total_acs": 179244,
+ "total_submitted": 383862,
"frontend_question_id": 1211,
"is_new_question": false
},
@@ -43324,8 +43922,8 @@
"question__title": "Design Skiplist",
"question__title_slug": "design-skiplist",
"question__hide": false,
- "total_acs": 23043,
- "total_submitted": 37538,
+ "total_acs": 23553,
+ "total_submitted": 38261,
"frontend_question_id": 1206,
"is_new_question": false
},
@@ -43347,8 +43945,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": 3551,
- "total_submitted": 11625,
+ "total_acs": 3589,
+ "total_submitted": 11720,
"frontend_question_id": 1960,
"is_new_question": false
},
@@ -43370,8 +43968,8 @@
"question__title": "Maximum Candies Allocated to K Children",
"question__title_slug": "maximum-candies-allocated-to-k-children",
"question__hide": false,
- "total_acs": 40695,
- "total_submitted": 107250,
+ "total_acs": 41772,
+ "total_submitted": 109699,
"frontend_question_id": 2226,
"is_new_question": false
},
@@ -43393,8 +43991,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": 26023,
- "total_submitted": 97581,
+ "total_acs": 26195,
+ "total_submitted": 98111,
"frontend_question_id": 2310,
"is_new_question": false
},
@@ -43416,8 +44014,8 @@
"question__title": "Sort the Jumbled Numbers",
"question__title_slug": "sort-the-jumbled-numbers",
"question__hide": false,
- "total_acs": 19785,
- "total_submitted": 42389,
+ "total_acs": 19974,
+ "total_submitted": 42709,
"frontend_question_id": 2191,
"is_new_question": false
},
@@ -43439,8 +44037,8 @@
"question__title": "Count Vowels Permutation",
"question__title_slug": "count-vowels-permutation",
"question__hide": false,
- "total_acs": 167108,
- "total_submitted": 269745,
+ "total_acs": 167645,
+ "total_submitted": 270743,
"frontend_question_id": 1220,
"is_new_question": false
},
@@ -43462,8 +44060,8 @@
"question__title": "Path with Maximum Gold",
"question__title_slug": "path-with-maximum-gold",
"question__hide": false,
- "total_acs": 213023,
- "total_submitted": 313242,
+ "total_acs": 214767,
+ "total_submitted": 315810,
"frontend_question_id": 1219,
"is_new_question": false
},
@@ -43485,8 +44083,8 @@
"question__title": "Longest Arithmetic Subsequence of Given Difference",
"question__title_slug": "longest-arithmetic-subsequence-of-given-difference",
"question__hide": false,
- "total_acs": 142336,
- "total_submitted": 259727,
+ "total_acs": 143365,
+ "total_submitted": 261825,
"frontend_question_id": 1218,
"is_new_question": false
},
@@ -43508,8 +44106,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": 129364,
- "total_submitted": 180339,
+ "total_acs": 130249,
+ "total_submitted": 181570,
"frontend_question_id": 1217,
"is_new_question": false
},
@@ -43531,8 +44129,8 @@
"question__title": "Monthly Transactions II",
"question__title_slug": "monthly-transactions-ii",
"question__hide": false,
- "total_acs": 22951,
- "total_submitted": 54932,
+ "total_acs": 23110,
+ "total_submitted": 55321,
"frontend_question_id": 1205,
"is_new_question": false
},
@@ -43554,8 +44152,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": 117312,
- "total_submitted": 175604,
+ "total_acs": 123348,
+ "total_submitted": 184456,
"frontend_question_id": 1204,
"is_new_question": false
},
@@ -43577,8 +44175,8 @@
"question__title": "Sum of Floored Pairs",
"question__title_slug": "sum-of-floored-pairs",
"question__hide": false,
- "total_acs": 9127,
- "total_submitted": 31778,
+ "total_acs": 9200,
+ "total_submitted": 31994,
"frontend_question_id": 1862,
"is_new_question": false
},
@@ -43600,8 +44198,8 @@
"question__title": "Path with Maximum Probability",
"question__title_slug": "path-with-maximum-probability",
"question__hide": false,
- "total_acs": 141340,
- "total_submitted": 256192,
+ "total_acs": 143326,
+ "total_submitted": 259411,
"frontend_question_id": 1514,
"is_new_question": false
},
@@ -43623,8 +44221,8 @@
"question__title": "Where Will the Ball Fall",
"question__title_slug": "where-will-the-ball-fall",
"question__hide": false,
- "total_acs": 140219,
- "total_submitted": 195323,
+ "total_acs": 140503,
+ "total_submitted": 195692,
"frontend_question_id": 1706,
"is_new_question": false
},
@@ -43646,8 +44244,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": 9538,
- "total_submitted": 19246,
+ "total_acs": 9649,
+ "total_submitted": 19418,
"frontend_question_id": 1210,
"is_new_question": false
},
@@ -43669,8 +44267,8 @@
"question__title": "Get Equal Substrings Within Budget",
"question__title_slug": "get-equal-substrings-within-budget",
"question__hide": false,
- "total_acs": 155541,
- "total_submitted": 267231,
+ "total_acs": 157593,
+ "total_submitted": 270500,
"frontend_question_id": 1208,
"is_new_question": false
},
@@ -43692,8 +44290,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": 318421,
- "total_submitted": 550474,
+ "total_acs": 321286,
+ "total_submitted": 554408,
"frontend_question_id": 1209,
"is_new_question": false
},
@@ -43715,8 +44313,8 @@
"question__title": "Unique Number of Occurrences",
"question__title_slug": "unique-number-of-occurrences",
"question__hide": false,
- "total_acs": 621139,
- "total_submitted": 805157,
+ "total_acs": 639152,
+ "total_submitted": 827593,
"frontend_question_id": 1207,
"is_new_question": false
},
@@ -43738,8 +44336,8 @@
"question__title": "Tournament Winners",
"question__title_slug": "tournament-winners",
"question__hide": false,
- "total_acs": 20633,
- "total_submitted": 42015,
+ "total_acs": 20833,
+ "total_submitted": 42367,
"frontend_question_id": 1194,
"is_new_question": false
},
@@ -43761,8 +44359,8 @@
"question__title": "Monthly Transactions I",
"question__title_slug": "monthly-transactions-i",
"question__hide": false,
- "total_acs": 169559,
- "total_submitted": 293405,
+ "total_acs": 179558,
+ "total_submitted": 311400,
"frontend_question_id": 1193,
"is_new_question": false
},
@@ -43784,8 +44382,8 @@
"question__title": "Fizz Buzz Multithreaded",
"question__title_slug": "fizz-buzz-multithreaded",
"question__hide": false,
- "total_acs": 48189,
- "total_submitted": 66588,
+ "total_acs": 48833,
+ "total_submitted": 67360,
"frontend_question_id": 1195,
"is_new_question": false
},
@@ -43807,8 +44405,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": 7150,
- "total_submitted": 14730,
+ "total_acs": 7234,
+ "total_submitted": 14871,
"frontend_question_id": 1916,
"is_new_question": false
},
@@ -43830,8 +44428,8 @@
"question__title": "Count Artifacts That Can Be Extracted",
"question__title_slug": "count-artifacts-that-can-be-extracted",
"question__hide": false,
- "total_acs": 19403,
- "total_submitted": 34502,
+ "total_acs": 19526,
+ "total_submitted": 34684,
"frontend_question_id": 2201,
"is_new_question": false
},
@@ -43853,8 +44451,8 @@
"question__title": "Largest Magic Square",
"question__title_slug": "largest-magic-square",
"question__hide": false,
- "total_acs": 11049,
- "total_submitted": 21060,
+ "total_acs": 11146,
+ "total_submitted": 21267,
"frontend_question_id": 1895,
"is_new_question": false
},
@@ -43876,8 +44474,8 @@
"question__title": "Watering Plants",
"question__title_slug": "watering-plants",
"question__hide": false,
- "total_acs": 49487,
- "total_submitted": 62183,
+ "total_acs": 50319,
+ "total_submitted": 63201,
"frontend_question_id": 2079,
"is_new_question": false
},
@@ -43899,8 +44497,8 @@
"question__title": "Sort Items by Groups Respecting Dependencies",
"question__title_slug": "sort-items-by-groups-respecting-dependencies",
"question__hide": false,
- "total_acs": 54048,
- "total_submitted": 81360,
+ "total_acs": 54332,
+ "total_submitted": 81842,
"frontend_question_id": 1203,
"is_new_question": false
},
@@ -43922,8 +44520,8 @@
"question__title": "Smallest String With Swaps",
"question__title_slug": "smallest-string-with-swaps",
"question__hide": false,
- "total_acs": 114991,
- "total_submitted": 197292,
+ "total_acs": 115724,
+ "total_submitted": 198374,
"frontend_question_id": 1202,
"is_new_question": false
},
@@ -43945,8 +44543,8 @@
"question__title": "Ugly Number III",
"question__title_slug": "ugly-number-iii",
"question__hide": false,
- "total_acs": 31859,
- "total_submitted": 107756,
+ "total_acs": 32248,
+ "total_submitted": 108827,
"frontend_question_id": 1201,
"is_new_question": false
},
@@ -43968,8 +44566,8 @@
"question__title": "Minimum Absolute Difference",
"question__title_slug": "minimum-absolute-difference",
"question__hide": false,
- "total_acs": 191880,
- "total_submitted": 275955,
+ "total_acs": 193800,
+ "total_submitted": 278562,
"frontend_question_id": 1200,
"is_new_question": false
},
@@ -43991,8 +44589,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": 54296,
- "total_submitted": 77939,
+ "total_acs": 55650,
+ "total_submitted": 79768,
"frontend_question_id": 1944,
"is_new_question": false
},
@@ -44014,8 +44612,8 @@
"question__title": "Longest Happy String",
"question__title_slug": "longest-happy-string",
"question__hide": false,
- "total_acs": 82450,
- "total_submitted": 143580,
+ "total_acs": 83356,
+ "total_submitted": 145094,
"frontend_question_id": 1405,
"is_new_question": false
},
@@ -44037,8 +44635,8 @@
"question__title": "Minimum Moves to Reach Target Score",
"question__title_slug": "minimum-moves-to-reach-target-score",
"question__hide": false,
- "total_acs": 42950,
- "total_submitted": 84794,
+ "total_acs": 43520,
+ "total_submitted": 85732,
"frontend_question_id": 2139,
"is_new_question": false
},
@@ -44060,8 +44658,8 @@
"question__title": "Delete Characters to Make Fancy String",
"question__title_slug": "delete-characters-to-make-fancy-string",
"question__hide": false,
- "total_acs": 36733,
- "total_submitted": 63312,
+ "total_acs": 37222,
+ "total_submitted": 64057,
"frontend_question_id": 1957,
"is_new_question": false
},
@@ -44083,8 +44681,8 @@
"question__title": "Reformat Department Table",
"question__title_slug": "reformat-department-table",
"question__hide": false,
- "total_acs": 117203,
- "total_submitted": 151871,
+ "total_acs": 118604,
+ "total_submitted": 153784,
"frontend_question_id": 1179,
"is_new_question": false
},
@@ -44106,8 +44704,8 @@
"question__title": "Critical Connections in a Network",
"question__title_slug": "critical-connections-in-a-network",
"question__hide": false,
- "total_acs": 229202,
- "total_submitted": 411037,
+ "total_acs": 232087,
+ "total_submitted": 415138,
"frontend_question_id": 1192,
"is_new_question": false
},
@@ -44129,8 +44727,8 @@
"question__title": "K-Concatenation Maximum Sum",
"question__title_slug": "k-concatenation-maximum-sum",
"question__hide": false,
- "total_acs": 34773,
- "total_submitted": 146774,
+ "total_acs": 35091,
+ "total_submitted": 147733,
"frontend_question_id": 1191,
"is_new_question": false
},
@@ -44152,8 +44750,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": 73467,
- "total_submitted": 110621,
+ "total_acs": 74132,
+ "total_submitted": 111510,
"frontend_question_id": 1190,
"is_new_question": false
},
@@ -44175,8 +44773,8 @@
"question__title": "Maximum Number of Balloons",
"question__title_slug": "maximum-number-of-balloons",
"question__hide": false,
- "total_acs": 203877,
- "total_submitted": 341233,
+ "total_acs": 206671,
+ "total_submitted": 346070,
"frontend_question_id": 1189,
"is_new_question": false
},
@@ -44198,8 +44796,8 @@
"question__title": "Kth Ancestor of a Tree Node",
"question__title_slug": "kth-ancestor-of-a-tree-node",
"question__hide": false,
- "total_acs": 35807,
- "total_submitted": 103201,
+ "total_acs": 36204,
+ "total_submitted": 104293,
"frontend_question_id": 1483,
"is_new_question": false
},
@@ -44221,8 +44819,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": 16650,
- "total_submitted": 30766,
+ "total_acs": 16859,
+ "total_submitted": 31085,
"frontend_question_id": 1954,
"is_new_question": false
},
@@ -44244,8 +44842,8 @@
"question__title": "Range Frequency Queries",
"question__title_slug": "range-frequency-queries",
"question__hide": false,
- "total_acs": 20769,
- "total_submitted": 52134,
+ "total_acs": 21075,
+ "total_submitted": 52693,
"frontend_question_id": 2080,
"is_new_question": false
},
@@ -44267,8 +44865,8 @@
"question__title": "Three Consecutive Odds",
"question__title_slug": "three-consecutive-odds",
"question__hide": false,
- "total_acs": 86531,
- "total_submitted": 137008,
+ "total_acs": 87782,
+ "total_submitted": 138922,
"frontend_question_id": 1550,
"is_new_question": false
},
@@ -44290,8 +44888,8 @@
"question__title": "Immediate Food Delivery II",
"question__title_slug": "immediate-food-delivery-ii",
"question__hide": false,
- "total_acs": 142890,
- "total_submitted": 280959,
+ "total_acs": 151611,
+ "total_submitted": 296675,
"frontend_question_id": 1174,
"is_new_question": false
},
@@ -44313,8 +44911,8 @@
"question__title": "Immediate Food Delivery I",
"question__title_slug": "immediate-food-delivery-i",
"question__hide": false,
- "total_acs": 74333,
- "total_submitted": 91908,
+ "total_acs": 74873,
+ "total_submitted": 92556,
"frontend_question_id": 1173,
"is_new_question": false
},
@@ -44336,8 +44934,8 @@
"question__title": "Make Array Strictly Increasing",
"question__title_slug": "make-array-strictly-increasing",
"question__hide": false,
- "total_acs": 57609,
- "total_submitted": 98841,
+ "total_acs": 57905,
+ "total_submitted": 99431,
"frontend_question_id": 1187,
"is_new_question": false
},
@@ -44359,8 +44957,8 @@
"question__title": "Day of the Week",
"question__title_slug": "day-of-the-week",
"question__hide": false,
- "total_acs": 66245,
- "total_submitted": 115177,
+ "total_acs": 67033,
+ "total_submitted": 116425,
"frontend_question_id": 1185,
"is_new_question": false
},
@@ -44382,8 +44980,8 @@
"question__title": "Maximum Subarray Sum with One Deletion",
"question__title_slug": "maximum-subarray-sum-with-one-deletion",
"question__hide": false,
- "total_acs": 52136,
- "total_submitted": 118868,
+ "total_acs": 52612,
+ "total_submitted": 119817,
"frontend_question_id": 1186,
"is_new_question": false
},
@@ -44405,8 +45003,8 @@
"question__title": "Distance Between Bus Stops",
"question__title_slug": "distance-between-bus-stops",
"question__hide": false,
- "total_acs": 60325,
- "total_submitted": 111646,
+ "total_acs": 60811,
+ "total_submitted": 112523,
"frontend_question_id": 1184,
"is_new_question": false
},
@@ -44428,8 +45026,8 @@
"question__title": "Constrained Subsequence Sum",
"question__title_slug": "constrained-subsequence-sum",
"question__hide": false,
- "total_acs": 76829,
- "total_submitted": 135535,
+ "total_acs": 77398,
+ "total_submitted": 136566,
"frontend_question_id": 1425,
"is_new_question": false
},
@@ -44451,8 +45049,8 @@
"question__title": "Balance a Binary Search Tree",
"question__title_slug": "balance-a-binary-search-tree",
"question__hide": false,
- "total_acs": 152900,
- "total_submitted": 187549,
+ "total_acs": 155226,
+ "total_submitted": 190177,
"frontend_question_id": 1382,
"is_new_question": false
},
@@ -44474,8 +45072,8 @@
"question__title": "Four Divisors",
"question__title_slug": "four-divisors",
"question__hide": false,
- "total_acs": 34177,
- "total_submitted": 80152,
+ "total_acs": 34749,
+ "total_submitted": 81222,
"frontend_question_id": 1390,
"is_new_question": false
},
@@ -44497,8 +45095,8 @@
"question__title": "Reformat Date",
"question__title_slug": "reformat-date",
"question__hide": false,
- "total_acs": 73751,
- "total_submitted": 111863,
+ "total_acs": 74950,
+ "total_submitted": 113332,
"frontend_question_id": 1507,
"is_new_question": false
},
@@ -44520,8 +45118,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": 31010,
- "total_submitted": 66326,
+ "total_acs": 31120,
+ "total_submitted": 66540,
"frontend_question_id": 1178,
"is_new_question": false
},
@@ -44543,8 +45141,8 @@
"question__title": "Can Make Palindrome from Substring",
"question__title_slug": "can-make-palindrome-from-substring",
"question__hide": false,
- "total_acs": 27607,
- "total_submitted": 70664,
+ "total_acs": 27777,
+ "total_submitted": 71054,
"frontend_question_id": 1177,
"is_new_question": false
},
@@ -44566,8 +45164,8 @@
"question__title": "Diet Plan Performance",
"question__title_slug": "diet-plan-performance",
"question__hide": false,
- "total_acs": 32396,
- "total_submitted": 60637,
+ "total_acs": 32551,
+ "total_submitted": 60892,
"frontend_question_id": 1176,
"is_new_question": false
},
@@ -44589,8 +45187,8 @@
"question__title": "Prime Arrangements",
"question__title_slug": "prime-arrangements",
"question__hide": false,
- "total_acs": 31081,
- "total_submitted": 54282,
+ "total_acs": 31413,
+ "total_submitted": 54736,
"frontend_question_id": 1175,
"is_new_question": false
},
@@ -44612,8 +45210,8 @@
"question__title": "Product Price at a Given Date",
"question__title_slug": "product-price-at-a-given-date",
"question__hide": false,
- "total_acs": 120431,
- "total_submitted": 217138,
+ "total_acs": 126293,
+ "total_submitted": 227230,
"frontend_question_id": 1164,
"is_new_question": false
},
@@ -44635,8 +45233,8 @@
"question__title": "Largest Multiple of Three",
"question__title_slug": "largest-multiple-of-three",
"question__hide": false,
- "total_acs": 20362,
- "total_submitted": 62410,
+ "total_acs": 20823,
+ "total_submitted": 63884,
"frontend_question_id": 1363,
"is_new_question": false
},
@@ -44658,8 +45256,8 @@
"question__title": "Closest Divisors",
"question__title_slug": "closest-divisors",
"question__hide": false,
- "total_acs": 22367,
- "total_submitted": 36865,
+ "total_acs": 22566,
+ "total_submitted": 37157,
"frontend_question_id": 1362,
"is_new_question": false
},
@@ -44681,8 +45279,8 @@
"question__title": "Validate Binary Tree Nodes",
"question__title_slug": "validate-binary-tree-nodes",
"question__hide": false,
- "total_acs": 113734,
- "total_submitted": 259236,
+ "total_acs": 114369,
+ "total_submitted": 260799,
"frontend_question_id": 1361,
"is_new_question": false
},
@@ -44704,8 +45302,8 @@
"question__title": "Number of Days Between Two Dates",
"question__title_slug": "number-of-days-between-two-dates",
"question__hide": false,
- "total_acs": 51192,
- "total_submitted": 102929,
+ "total_acs": 51726,
+ "total_submitted": 103797,
"frontend_question_id": 1360,
"is_new_question": false
},
@@ -44727,8 +45325,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": 80326,
- "total_submitted": 129238,
+ "total_acs": 80781,
+ "total_submitted": 129822,
"frontend_question_id": 1170,
"is_new_question": false
},
@@ -44750,8 +45348,8 @@
"question__title": "Invalid Transactions",
"question__title_slug": "invalid-transactions",
"question__hide": false,
- "total_acs": 76517,
- "total_submitted": 245450,
+ "total_acs": 77035,
+ "total_submitted": 247214,
"frontend_question_id": 1169,
"is_new_question": false
},
@@ -44773,8 +45371,8 @@
"question__title": "Web Crawler",
"question__title_slug": "web-crawler",
"question__hide": false,
- "total_acs": 37875,
- "total_submitted": 55813,
+ "total_acs": 38132,
+ "total_submitted": 56166,
"frontend_question_id": 1236,
"is_new_question": false
},
@@ -44796,8 +45394,8 @@
"question__title": "Dinner Plate Stacks",
"question__title_slug": "dinner-plate-stacks",
"question__hide": false,
- "total_acs": 18260,
- "total_submitted": 55802,
+ "total_acs": 18378,
+ "total_submitted": 56161,
"frontend_question_id": 1172,
"is_new_question": false
},
@@ -44819,8 +45417,8 @@
"question__title": "Market Analysis II",
"question__title_slug": "market-analysis-ii",
"question__hide": false,
- "total_acs": 18859,
- "total_submitted": 33044,
+ "total_acs": 19028,
+ "total_submitted": 33352,
"frontend_question_id": 1159,
"is_new_question": false
},
@@ -44842,8 +45440,8 @@
"question__title": "Market Analysis I",
"question__title_slug": "market-analysis-i",
"question__hide": false,
- "total_acs": 103130,
- "total_submitted": 180783,
+ "total_acs": 104552,
+ "total_submitted": 183217,
"frontend_question_id": 1158,
"is_new_question": false
},
@@ -44865,8 +45463,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": 163131,
- "total_submitted": 309087,
+ "total_acs": 164058,
+ "total_submitted": 310831,
"frontend_question_id": 1171,
"is_new_question": false
},
@@ -44888,8 +45486,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": 59442,
- "total_submitted": 81196,
+ "total_acs": 60292,
+ "total_submitted": 82251,
"frontend_question_id": 1935,
"is_new_question": false
},
@@ -44911,8 +45509,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": 288631,
- "total_submitted": 474220,
+ "total_acs": 290746,
+ "total_submitted": 477182,
"frontend_question_id": 1155,
"is_new_question": false
},
@@ -44934,8 +45532,8 @@
"question__title": "Online Majority Element In Subarray",
"question__title_slug": "online-majority-element-in-subarray",
"question__hide": false,
- "total_acs": 16660,
- "total_submitted": 40113,
+ "total_acs": 16885,
+ "total_submitted": 40452,
"frontend_question_id": 1157,
"is_new_question": false
},
@@ -44957,8 +45555,8 @@
"question__title": "Swap For Longest Repeated Character Substring",
"question__title_slug": "swap-for-longest-repeated-character-substring",
"question__hide": false,
- "total_acs": 31844,
- "total_submitted": 72325,
+ "total_acs": 32197,
+ "total_submitted": 73023,
"frontend_question_id": 1156,
"is_new_question": false
},
@@ -44980,8 +45578,8 @@
"question__title": "Day of the Year",
"question__title_slug": "day-of-the-year",
"question__hide": false,
- "total_acs": 59547,
- "total_submitted": 122298,
+ "total_acs": 60475,
+ "total_submitted": 123939,
"frontend_question_id": 1154,
"is_new_question": false
},
@@ -45003,8 +45601,8 @@
"question__title": "Article Views II",
"question__title_slug": "article-views-ii",
"question__hide": false,
- "total_acs": 37146,
- "total_submitted": 79030,
+ "total_acs": 37385,
+ "total_submitted": 79517,
"frontend_question_id": 1149,
"is_new_question": false
},
@@ -45026,8 +45624,8 @@
"question__title": "Article Views I",
"question__title_slug": "article-views-i",
"question__hide": false,
- "total_acs": 588327,
- "total_submitted": 780624,
+ "total_acs": 621442,
+ "total_submitted": 823568,
"frontend_question_id": 1148,
"is_new_question": false
},
@@ -45049,8 +45647,8 @@
"question__title": "Rank Transform of a Matrix",
"question__title_slug": "rank-transform-of-a-matrix",
"question__hide": false,
- "total_acs": 22006,
- "total_submitted": 53806,
+ "total_acs": 22113,
+ "total_submitted": 54087,
"frontend_question_id": 1632,
"is_new_question": false
},
@@ -45072,8 +45670,8 @@
"question__title": "Rank Transform of an Array",
"question__title_slug": "rank-transform-of-an-array",
"question__hide": false,
- "total_acs": 116059,
- "total_submitted": 186503,
+ "total_acs": 117569,
+ "total_submitted": 188622,
"frontend_question_id": 1331,
"is_new_question": false
},
@@ -45095,8 +45693,8 @@
"question__title": "Reverse Subarray To Maximize Array Value",
"question__title_slug": "reverse-subarray-to-maximize-array-value",
"question__hide": false,
- "total_acs": 5895,
- "total_submitted": 14315,
+ "total_acs": 5964,
+ "total_submitted": 14429,
"frontend_question_id": 1330,
"is_new_question": false
},
@@ -45118,8 +45716,8 @@
"question__title": "Deepest Leaves Sum",
"question__title_slug": "deepest-leaves-sum",
"question__hide": false,
- "total_acs": 329442,
- "total_submitted": 381661,
+ "total_acs": 332346,
+ "total_submitted": 385048,
"frontend_question_id": 1302,
"is_new_question": false
},
@@ -45141,8 +45739,8 @@
"question__title": "Sort the Matrix Diagonally",
"question__title_slug": "sort-the-matrix-diagonally",
"question__hide": false,
- "total_acs": 163215,
- "total_submitted": 196851,
+ "total_acs": 164263,
+ "total_submitted": 198089,
"frontend_question_id": 1329,
"is_new_question": false
},
@@ -45164,8 +45762,8 @@
"question__title": "Break a Palindrome",
"question__title_slug": "break-a-palindrome",
"question__hide": false,
- "total_acs": 168022,
- "total_submitted": 324450,
+ "total_acs": 169028,
+ "total_submitted": 326444,
"frontend_question_id": 1328,
"is_new_question": false
},
@@ -45187,8 +45785,8 @@
"question__title": "Longest Chunked Palindrome Decomposition",
"question__title_slug": "longest-chunked-palindrome-decomposition",
"question__hide": false,
- "total_acs": 24125,
- "total_submitted": 41082,
+ "total_acs": 24341,
+ "total_submitted": 41491,
"frontend_question_id": 1147,
"is_new_question": false
},
@@ -45210,8 +45808,8 @@
"question__title": "Longest Common Subsequence",
"question__title_slug": "longest-common-subsequence",
"question__hide": false,
- "total_acs": 1084730,
- "total_submitted": 1877402,
+ "total_acs": 1107192,
+ "total_submitted": 1917245,
"frontend_question_id": 1143,
"is_new_question": false
},
@@ -45233,8 +45831,8 @@
"question__title": "Snapshot Array",
"question__title_slug": "snapshot-array",
"question__hide": false,
- "total_acs": 217093,
- "total_submitted": 587150,
+ "total_acs": 218355,
+ "total_submitted": 590925,
"frontend_question_id": 1146,
"is_new_question": false
},
@@ -45256,8 +45854,8 @@
"question__title": "Binary Tree Coloring Game",
"question__title_slug": "binary-tree-coloring-game",
"question__hide": false,
- "total_acs": 45639,
- "total_submitted": 87873,
+ "total_acs": 45886,
+ "total_submitted": 88310,
"frontend_question_id": 1145,
"is_new_question": false
},
@@ -45279,8 +45877,8 @@
"question__title": "Decrease Elements To Make Array Zigzag",
"question__title_slug": "decrease-elements-to-make-array-zigzag",
"question__hide": false,
- "total_acs": 20368,
- "total_submitted": 42611,
+ "total_acs": 20538,
+ "total_submitted": 42933,
"frontend_question_id": 1144,
"is_new_question": false
},
@@ -45302,8 +45900,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": 42278,
- "total_submitted": 118318,
+ "total_acs": 42505,
+ "total_submitted": 118960,
"frontend_question_id": 1142,
"is_new_question": false
},
@@ -45325,8 +45923,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": 216823,
- "total_submitted": 448784,
+ "total_acs": 225654,
+ "total_submitted": 466310,
"frontend_question_id": 1141,
"is_new_question": false
},
@@ -45348,8 +45946,8 @@
"question__title": "Distinct Echo Substrings",
"question__title_slug": "distinct-echo-substrings",
"question__hide": false,
- "total_acs": 16523,
- "total_submitted": 32827,
+ "total_acs": 16715,
+ "total_submitted": 33132,
"frontend_question_id": 1316,
"is_new_question": false
},
@@ -45371,8 +45969,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": 152664,
- "total_submitted": 178555,
+ "total_acs": 153981,
+ "total_submitted": 180020,
"frontend_question_id": 1315,
"is_new_question": false
},
@@ -45394,8 +45992,8 @@
"question__title": "Matrix Block Sum",
"question__title_slug": "matrix-block-sum",
"question__hide": false,
- "total_acs": 88161,
- "total_submitted": 116840,
+ "total_acs": 88822,
+ "total_submitted": 117655,
"frontend_question_id": 1314,
"is_new_question": false
},
@@ -45417,8 +46015,8 @@
"question__title": "Decompress Run-Length Encoded List",
"question__title_slug": "decompress-run-length-encoded-list",
"question__hide": false,
- "total_acs": 266151,
- "total_submitted": 310448,
+ "total_acs": 267958,
+ "total_submitted": 312458,
"frontend_question_id": 1313,
"is_new_question": false
},
@@ -45440,8 +46038,8 @@
"question__title": "Stone Game II",
"question__title_slug": "stone-game-ii",
"question__hide": false,
- "total_acs": 94478,
- "total_submitted": 139997,
+ "total_acs": 95150,
+ "total_submitted": 140995,
"frontend_question_id": 1140,
"is_new_question": false
},
@@ -45463,8 +46061,8 @@
"question__title": "Largest 1-Bordered Square",
"question__title_slug": "largest-1-bordered-square",
"question__hide": false,
- "total_acs": 25052,
- "total_submitted": 49954,
+ "total_acs": 25206,
+ "total_submitted": 50236,
"frontend_question_id": 1139,
"is_new_question": false
},
@@ -45486,8 +46084,8 @@
"question__title": "Alphabet Board Path",
"question__title_slug": "alphabet-board-path",
"question__hide": false,
- "total_acs": 51364,
- "total_submitted": 99474,
+ "total_acs": 51633,
+ "total_submitted": 99955,
"frontend_question_id": 1138,
"is_new_question": false
},
@@ -45509,8 +46107,8 @@
"question__title": "Reported Posts II",
"question__title_slug": "reported-posts-ii",
"question__hide": false,
- "total_acs": 37377,
- "total_submitted": 115735,
+ "total_acs": 37591,
+ "total_submitted": 116458,
"frontend_question_id": 1132,
"is_new_question": false
},
@@ -45532,8 +46130,8 @@
"question__title": "N-th Tribonacci Number",
"question__title_slug": "n-th-tribonacci-number",
"question__hide": false,
- "total_acs": 769860,
- "total_submitted": 1206056,
+ "total_acs": 778876,
+ "total_submitted": 1220432,
"frontend_question_id": 1137,
"is_new_question": false
},
@@ -45555,8 +46153,8 @@
"question__title": "Number of Paths with Max Score",
"question__title_slug": "number-of-paths-with-max-score",
"question__hide": false,
- "total_acs": 13432,
- "total_submitted": 34023,
+ "total_acs": 13588,
+ "total_submitted": 34386,
"frontend_question_id": 1301,
"is_new_question": false
},
@@ -45578,8 +46176,8 @@
"question__title": "Number of Ships in a Rectangle",
"question__title_slug": "number-of-ships-in-a-rectangle",
"question__hide": false,
- "total_acs": 29158,
- "total_submitted": 42467,
+ "total_acs": 29216,
+ "total_submitted": 42553,
"frontend_question_id": 1274,
"is_new_question": false
},
@@ -45601,8 +46199,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": 38437,
- "total_submitted": 86555,
+ "total_acs": 38767,
+ "total_submitted": 87171,
"frontend_question_id": 1300,
"is_new_question": false
},
@@ -45624,8 +46222,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": 384763,
- "total_submitted": 539886,
+ "total_acs": 389578,
+ "total_submitted": 546717,
"frontend_question_id": 1299,
"is_new_question": false
},
@@ -45647,8 +46245,8 @@
"question__title": "Maximum of Absolute Value Expression",
"question__title_slug": "maximum-of-absolute-value-expression",
"question__hide": false,
- "total_acs": 24003,
- "total_submitted": 49636,
+ "total_acs": 24245,
+ "total_submitted": 50124,
"frontend_question_id": 1131,
"is_new_question": false
},
@@ -45670,8 +46268,8 @@
"question__title": "Shortest Path with Alternating Colors",
"question__title_slug": "shortest-path-with-alternating-colors",
"question__hide": false,
- "total_acs": 115469,
- "total_submitted": 245193,
+ "total_acs": 116573,
+ "total_submitted": 247464,
"frontend_question_id": 1129,
"is_new_question": false
},
@@ -45693,8 +46291,8 @@
"question__title": "Minimum Cost Tree From Leaf Values",
"question__title_slug": "minimum-cost-tree-from-leaf-values",
"question__hide": false,
- "total_acs": 99088,
- "total_submitted": 146211,
+ "total_acs": 99949,
+ "total_submitted": 147532,
"frontend_question_id": 1130,
"is_new_question": false
},
@@ -45716,8 +46314,8 @@
"question__title": "Number of Equivalent Domino Pairs",
"question__title_slug": "number-of-equivalent-domino-pairs",
"question__hide": false,
- "total_acs": 68356,
- "total_submitted": 141887,
+ "total_acs": 69281,
+ "total_submitted": 143467,
"frontend_question_id": 1128,
"is_new_question": false
},
@@ -45739,8 +46337,8 @@
"question__title": "User Purchase Platform",
"question__title_slug": "user-purchase-platform",
"question__hide": false,
- "total_acs": 15568,
- "total_submitted": 32791,
+ "total_acs": 15683,
+ "total_submitted": 33041,
"frontend_question_id": 1127,
"is_new_question": false
},
@@ -45762,8 +46360,8 @@
"question__title": "Active Businesses",
"question__title_slug": "active-businesses",
"question__hide": false,
- "total_acs": 44913,
- "total_submitted": 68406,
+ "total_acs": 45176,
+ "total_submitted": 68756,
"frontend_question_id": 1126,
"is_new_question": false
},
@@ -45785,8 +46383,8 @@
"question__title": "Minimum Falling Path Sum II",
"question__title_slug": "minimum-falling-path-sum-ii",
"question__hide": false,
- "total_acs": 140310,
- "total_submitted": 217818,
+ "total_acs": 141235,
+ "total_submitted": 219382,
"frontend_question_id": 1289,
"is_new_question": false
},
@@ -45808,8 +46406,8 @@
"question__title": "Graph Connectivity With Threshold",
"question__title_slug": "graph-connectivity-with-threshold",
"question__hide": false,
- "total_acs": 17407,
- "total_submitted": 37040,
+ "total_acs": 17576,
+ "total_submitted": 37363,
"frontend_question_id": 1627,
"is_new_question": false
},
@@ -45831,8 +46429,8 @@
"question__title": "Remove Covered Intervals",
"question__title_slug": "remove-covered-intervals",
"question__hide": false,
- "total_acs": 120136,
- "total_submitted": 213084,
+ "total_acs": 120706,
+ "total_submitted": 214165,
"frontend_question_id": 1288,
"is_new_question": false
},
@@ -45854,8 +46452,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": 214526,
- "total_submitted": 351824,
+ "total_acs": 216113,
+ "total_submitted": 354422,
"frontend_question_id": 1287,
"is_new_question": false
},
@@ -45877,8 +46475,8 @@
"question__title": "Smallest Sufficient Team",
"question__title_slug": "smallest-sufficient-team",
"question__hide": false,
- "total_acs": 62554,
- "total_submitted": 112551,
+ "total_acs": 63073,
+ "total_submitted": 113547,
"frontend_question_id": 1125,
"is_new_question": false
},
@@ -45900,8 +46498,8 @@
"question__title": "Longest Well-Performing Interval",
"question__title_slug": "longest-well-performing-interval",
"question__hide": false,
- "total_acs": 32221,
- "total_submitted": 92194,
+ "total_acs": 32647,
+ "total_submitted": 93208,
"frontend_question_id": 1124,
"is_new_question": false
},
@@ -45923,8 +46521,8 @@
"question__title": "Lowest Common Ancestor of Deepest Leaves",
"question__title_slug": "lowest-common-ancestor-of-deepest-leaves",
"question__hide": false,
- "total_acs": 111946,
- "total_submitted": 154825,
+ "total_acs": 112776,
+ "total_submitted": 155878,
"frontend_question_id": 1123,
"is_new_question": false
},
@@ -45940,14 +46538,14 @@
{
"stat": {
"question_id": 1217,
- "question__article__live": null,
- "question__article__slug": null,
- "question__article__has_video_solution": null,
+ "question__article__live": true,
+ "question__article__slug": "relative-sort-array",
+ "question__article__has_video_solution": false,
"question__title": "Relative Sort Array",
"question__title_slug": "relative-sort-array",
"question__hide": false,
- "total_acs": 188234,
- "total_submitted": 272425,
+ "total_acs": 330251,
+ "total_submitted": 441952,
"frontend_question_id": 1122,
"is_new_question": false
},
@@ -45969,8 +46567,8 @@
"question__title": "Print Zero Even Odd",
"question__title_slug": "print-zero-even-odd",
"question__hide": false,
- "total_acs": 50283,
- "total_submitted": 82501,
+ "total_acs": 50915,
+ "total_submitted": 83463,
"frontend_question_id": 1116,
"is_new_question": false
},
@@ -45992,8 +46590,8 @@
"question__title": "Reported Posts",
"question__title_slug": "reported-posts",
"question__hide": false,
- "total_acs": 46621,
- "total_submitted": 71881,
+ "total_acs": 46862,
+ "total_submitted": 72290,
"frontend_question_id": 1113,
"is_new_question": false
},
@@ -46015,8 +46613,8 @@
"question__title": "Highest Grade For Each Student",
"question__title_slug": "highest-grade-for-each-student",
"question__hide": false,
- "total_acs": 60696,
- "total_submitted": 85696,
+ "total_acs": 61236,
+ "total_submitted": 86414,
"frontend_question_id": 1112,
"is_new_question": false
},
@@ -46038,8 +46636,8 @@
"question__title": "Handshakes That Don't Cross",
"question__title_slug": "handshakes-that-dont-cross",
"question__hide": false,
- "total_acs": 11527,
- "total_submitted": 19324,
+ "total_acs": 11603,
+ "total_submitted": 19472,
"frontend_question_id": 1259,
"is_new_question": false
},
@@ -46061,8 +46659,8 @@
"question__title": "Sequential Digits",
"question__title_slug": "sequential-digits",
"question__hide": false,
- "total_acs": 214915,
- "total_submitted": 329056,
+ "total_acs": 216915,
+ "total_submitted": 332026,
"frontend_question_id": 1291,
"is_new_question": false
},
@@ -46084,8 +46682,8 @@
"question__title": "Iterator for Combination",
"question__title_slug": "iterator-for-combination",
"question__hide": false,
- "total_acs": 72818,
- "total_submitted": 99401,
+ "total_acs": 73269,
+ "total_submitted": 100047,
"frontend_question_id": 1286,
"is_new_question": false
},
@@ -46107,8 +46705,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": 59466,
- "total_submitted": 87126,
+ "total_acs": 60302,
+ "total_submitted": 88162,
"frontend_question_id": 1619,
"is_new_question": false
},
@@ -46130,8 +46728,8 @@
"question__title": "Design Bounded Blocking Queue",
"question__title_slug": "design-bounded-blocking-queue",
"question__hide": false,
- "total_acs": 50011,
- "total_submitted": 69045,
+ "total_acs": 50375,
+ "total_submitted": 69549,
"frontend_question_id": 1188,
"is_new_question": false
},
@@ -46153,8 +46751,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": 27086,
- "total_submitted": 37638,
+ "total_acs": 27253,
+ "total_submitted": 37855,
"frontend_question_id": 1111,
"is_new_question": false
},
@@ -46176,8 +46774,8 @@
"question__title": "Delete Nodes And Return Forest",
"question__title_slug": "delete-nodes-and-return-forest",
"question__hide": false,
- "total_acs": 223778,
- "total_submitted": 323578,
+ "total_acs": 226373,
+ "total_submitted": 327120,
"frontend_question_id": 1110,
"is_new_question": false
},
@@ -46199,8 +46797,8 @@
"question__title": "Corporate Flight Bookings",
"question__title_slug": "corporate-flight-bookings",
"question__hide": false,
- "total_acs": 63868,
- "total_submitted": 103361,
+ "total_acs": 64927,
+ "total_submitted": 104733,
"frontend_question_id": 1109,
"is_new_question": false
},
@@ -46222,8 +46820,8 @@
"question__title": "Defanging an IP Address",
"question__title_slug": "defanging-an-ip-address",
"question__hide": false,
- "total_acs": 652164,
- "total_submitted": 732017,
+ "total_acs": 658555,
+ "total_submitted": 738817,
"frontend_question_id": 1108,
"is_new_question": false
},
@@ -46245,8 +46843,8 @@
"question__title": "New Users Daily Count",
"question__title_slug": "new-users-daily-count",
"question__hide": false,
- "total_acs": 35785,
- "total_submitted": 80248,
+ "total_acs": 36039,
+ "total_submitted": 80786,
"frontend_question_id": 1107,
"is_new_question": false
},
@@ -46268,8 +46866,8 @@
"question__title": "Print in Order",
"question__title_slug": "print-in-order",
"question__hide": false,
- "total_acs": 157635,
- "total_submitted": 227115,
+ "total_acs": 159270,
+ "total_submitted": 229250,
"frontend_question_id": 1114,
"is_new_question": false
},
@@ -46291,8 +46889,8 @@
"question__title": "Palindrome Removal",
"question__title_slug": "palindrome-removal",
"question__hide": false,
- "total_acs": 10753,
- "total_submitted": 23165,
+ "total_acs": 10777,
+ "total_submitted": 23214,
"frontend_question_id": 1246,
"is_new_question": false
},
@@ -46314,8 +46912,8 @@
"question__title": "Delete Tree Nodes",
"question__title_slug": "delete-tree-nodes",
"question__hide": false,
- "total_acs": 10241,
- "total_submitted": 16712,
+ "total_acs": 10280,
+ "total_submitted": 16787,
"frontend_question_id": 1273,
"is_new_question": false
},
@@ -46337,8 +46935,8 @@
"question__title": "Remove Interval",
"question__title_slug": "remove-interval",
"question__hide": false,
- "total_acs": 36298,
- "total_submitted": 54964,
+ "total_acs": 36498,
+ "total_submitted": 55218,
"frontend_question_id": 1272,
"is_new_question": false
},
@@ -46360,8 +46958,8 @@
"question__title": "Hexspeak",
"question__title_slug": "hexspeak",
"question__hide": false,
- "total_acs": 11020,
- "total_submitted": 19010,
+ "total_acs": 11094,
+ "total_submitted": 19111,
"frontend_question_id": 1271,
"is_new_question": false
},
@@ -46383,8 +46981,8 @@
"question__title": "Unpopular Books",
"question__title_slug": "unpopular-books",
"question__hide": false,
- "total_acs": 39941,
- "total_submitted": 92714,
+ "total_acs": 40168,
+ "total_submitted": 93170,
"frontend_question_id": 1098,
"is_new_question": false
},
@@ -46406,8 +47004,8 @@
"question__title": "Parsing A Boolean Expression",
"question__title_slug": "parsing-a-boolean-expression",
"question__hide": false,
- "total_acs": 30276,
- "total_submitted": 51206,
+ "total_acs": 31091,
+ "total_submitted": 52421,
"frontend_question_id": 1106,
"is_new_question": false
},
@@ -46429,8 +47027,8 @@
"question__title": "Filling Bookcase Shelves",
"question__title_slug": "filling-bookcase-shelves",
"question__hide": false,
- "total_acs": 53748,
- "total_submitted": 90307,
+ "total_acs": 54155,
+ "total_submitted": 90970,
"frontend_question_id": 1105,
"is_new_question": false
},
@@ -46452,8 +47050,8 @@
"question__title": "Distribute Candies to People",
"question__title_slug": "distribute-candies-to-people",
"question__hide": false,
- "total_acs": 87738,
- "total_submitted": 134529,
+ "total_acs": 88384,
+ "total_submitted": 135416,
"frontend_question_id": 1103,
"is_new_question": false
},
@@ -46475,8 +47073,8 @@
"question__title": "Path In Zigzag Labelled Binary Tree",
"question__title_slug": "path-in-zigzag-labelled-binary-tree",
"question__hide": false,
- "total_acs": 45306,
- "total_submitted": 60112,
+ "total_acs": 45569,
+ "total_submitted": 60434,
"frontend_question_id": 1104,
"is_new_question": false
},
@@ -46498,8 +47096,8 @@
"question__title": "Game Play Analysis V",
"question__title_slug": "game-play-analysis-v",
"question__hide": false,
- "total_acs": 23430,
- "total_submitted": 45824,
+ "total_acs": 23625,
+ "total_submitted": 46151,
"frontend_question_id": 1097,
"is_new_question": false
},
@@ -46521,8 +47119,8 @@
"question__title": "Divide Chocolate",
"question__title_slug": "divide-chocolate",
"question__hide": false,
- "total_acs": 54469,
- "total_submitted": 92915,
+ "total_acs": 54968,
+ "total_submitted": 93621,
"frontend_question_id": 1231,
"is_new_question": false
},
@@ -46544,8 +47142,8 @@
"question__title": "Synonymous Sentences",
"question__title_slug": "synonymous-sentences",
"question__hide": false,
- "total_acs": 22469,
- "total_submitted": 39948,
+ "total_acs": 22730,
+ "total_submitted": 40379,
"frontend_question_id": 1258,
"is_new_question": false
},
@@ -46567,8 +47165,8 @@
"question__title": "Smallest Common Region",
"question__title_slug": "smallest-common-region",
"question__hide": false,
- "total_acs": 23101,
- "total_submitted": 35323,
+ "total_acs": 23374,
+ "total_submitted": 35718,
"frontend_question_id": 1257,
"is_new_question": false
},
@@ -46590,8 +47188,8 @@
"question__title": "Encode Number",
"question__title_slug": "encode-number",
"question__hide": false,
- "total_acs": 7753,
- "total_submitted": 11106,
+ "total_acs": 7775,
+ "total_submitted": 11142,
"frontend_question_id": 1256,
"is_new_question": false
},
@@ -46613,8 +47211,8 @@
"question__title": "Brace Expansion II",
"question__title_slug": "brace-expansion-ii",
"question__hide": false,
- "total_acs": 24790,
- "total_submitted": 38931,
+ "total_acs": 24902,
+ "total_submitted": 39094,
"frontend_question_id": 1096,
"is_new_question": false
},
@@ -46636,8 +47234,8 @@
"question__title": "Print FooBar Alternately",
"question__title_slug": "print-foobar-alternately",
"question__hide": false,
- "total_acs": 83747,
- "total_submitted": 127133,
+ "total_acs": 84902,
+ "total_submitted": 128433,
"frontend_question_id": 1115,
"is_new_question": false
},
@@ -46659,8 +47257,8 @@
"question__title": "Building H2O",
"question__title_slug": "building-h2o",
"question__hide": false,
- "total_acs": 51429,
- "total_submitted": 91540,
+ "total_acs": 52335,
+ "total_submitted": 92967,
"frontend_question_id": 1117,
"is_new_question": false
},
@@ -46682,8 +47280,8 @@
"question__title": "Find in Mountain Array",
"question__title_slug": "find-in-mountain-array",
"question__hide": false,
- "total_acs": 138942,
- "total_submitted": 344171,
+ "total_acs": 140333,
+ "total_submitted": 347968,
"frontend_question_id": 1095,
"is_new_question": false
},
@@ -46705,8 +47303,8 @@
"question__title": "Car Pooling",
"question__title_slug": "car-pooling",
"question__hide": false,
- "total_acs": 221828,
- "total_submitted": 395703,
+ "total_acs": 223389,
+ "total_submitted": 398707,
"frontend_question_id": 1094,
"is_new_question": false
},
@@ -46728,8 +47326,8 @@
"question__title": "Statistics from a Large Sample",
"question__title_slug": "statistics-from-a-large-sample",
"question__hide": false,
- "total_acs": 19785,
- "total_submitted": 47081,
+ "total_acs": 19960,
+ "total_submitted": 47524,
"frontend_question_id": 1093,
"is_new_question": false
},
@@ -46751,8 +47349,8 @@
"question__title": "Game Play Analysis IV",
"question__title_slug": "game-play-analysis-iv",
"question__hide": false,
- "total_acs": 161690,
- "total_submitted": 443755,
+ "total_acs": 169507,
+ "total_submitted": 463727,
"frontend_question_id": 550,
"is_new_question": false
},
@@ -46774,8 +47372,8 @@
"question__title": "Game Play Analysis III",
"question__title_slug": "game-play-analysis-iii",
"question__hide": false,
- "total_acs": 76375,
- "total_submitted": 94491,
+ "total_acs": 76960,
+ "total_submitted": 95151,
"frontend_question_id": 534,
"is_new_question": false
},
@@ -46797,8 +47395,8 @@
"question__title": "Game Play Analysis II",
"question__title_slug": "game-play-analysis-ii",
"question__hide": false,
- "total_acs": 86413,
- "total_submitted": 163495,
+ "total_acs": 87015,
+ "total_submitted": 164497,
"frontend_question_id": 512,
"is_new_question": false
},
@@ -46820,8 +47418,8 @@
"question__title": "Game Play Analysis I",
"question__title_slug": "game-play-analysis-i",
"question__hide": false,
- "total_acs": 276419,
- "total_submitted": 370021,
+ "total_acs": 281500,
+ "total_submitted": 376514,
"frontend_question_id": 511,
"is_new_question": false
},
@@ -46843,8 +47441,8 @@
"question__title": "Valid Palindrome III",
"question__title_slug": "valid-palindrome-iii",
"question__hide": false,
- "total_acs": 68105,
- "total_submitted": 137608,
+ "total_acs": 69546,
+ "total_submitted": 140784,
"frontend_question_id": 1216,
"is_new_question": false
},
@@ -46866,8 +47464,8 @@
"question__title": "Tree Diameter",
"question__title_slug": "tree-diameter",
"question__hide": false,
- "total_acs": 44348,
- "total_submitted": 72523,
+ "total_acs": 44746,
+ "total_submitted": 73171,
"frontend_question_id": 1245,
"is_new_question": false
},
@@ -46889,8 +47487,8 @@
"question__title": "Design A Leaderboard",
"question__title_slug": "design-a-leaderboard",
"question__hide": false,
- "total_acs": 73664,
- "total_submitted": 108480,
+ "total_acs": 74076,
+ "total_submitted": 109060,
"frontend_question_id": 1244,
"is_new_question": false
},
@@ -46912,8 +47510,8 @@
"question__title": "Array Transformation",
"question__title_slug": "array-transformation",
"question__hide": false,
- "total_acs": 13424,
- "total_submitted": 25718,
+ "total_acs": 13496,
+ "total_submitted": 25830,
"frontend_question_id": 1243,
"is_new_question": false
},
@@ -46935,8 +47533,8 @@
"question__title": "Sales Analysis III",
"question__title_slug": "sales-analysis-iii",
"question__hide": false,
- "total_acs": 134693,
- "total_submitted": 289321,
+ "total_acs": 136612,
+ "total_submitted": 293640,
"frontend_question_id": 1084,
"is_new_question": false
},
@@ -46958,8 +47556,8 @@
"question__title": "Sales Analysis II",
"question__title_slug": "sales-analysis-ii",
"question__hide": false,
- "total_acs": 58321,
- "total_submitted": 117413,
+ "total_acs": 58676,
+ "total_submitted": 118140,
"frontend_question_id": 1083,
"is_new_question": false
},
@@ -46981,8 +47579,8 @@
"question__title": "Sales Analysis I",
"question__title_slug": "sales-analysis-i",
"question__hide": false,
- "total_acs": 58540,
- "total_submitted": 78831,
+ "total_acs": 58952,
+ "total_submitted": 79348,
"frontend_question_id": 1082,
"is_new_question": false
},
@@ -47004,8 +47602,8 @@
"question__title": "Shortest Path in Binary Matrix",
"question__title_slug": "shortest-path-in-binary-matrix",
"question__hide": false,
- "total_acs": 473264,
- "total_submitted": 997772,
+ "total_acs": 482744,
+ "total_submitted": 1014978,
"frontend_question_id": 1091,
"is_new_question": false
},
@@ -47027,8 +47625,8 @@
"question__title": "Shortest Common Supersequence ",
"question__title_slug": "shortest-common-supersequence",
"question__hide": false,
- "total_acs": 114714,
- "total_submitted": 194209,
+ "total_acs": 118713,
+ "total_submitted": 200596,
"frontend_question_id": 1092,
"is_new_question": false
},
@@ -47050,8 +47648,8 @@
"question__title": "Largest Values From Labels",
"question__title_slug": "largest-values-from-labels",
"question__hide": false,
- "total_acs": 38373,
- "total_submitted": 61834,
+ "total_acs": 38655,
+ "total_submitted": 62208,
"frontend_question_id": 1090,
"is_new_question": false
},
@@ -47073,8 +47671,8 @@
"question__title": "Duplicate Zeros",
"question__title_slug": "duplicate-zeros",
"question__hide": false,
- "total_acs": 421467,
- "total_submitted": 811507,
+ "total_acs": 425179,
+ "total_submitted": 818198,
"frontend_question_id": 1089,
"is_new_question": false
},
@@ -47096,8 +47694,8 @@
"question__title": "Minimum Time to Build Blocks",
"question__title_slug": "minimum-time-to-build-blocks",
"question__hide": false,
- "total_acs": 6566,
- "total_submitted": 14352,
+ "total_acs": 6586,
+ "total_submitted": 14391,
"frontend_question_id": 1199,
"is_new_question": false
},
@@ -47119,8 +47717,8 @@
"question__title": "Toss Strange Coins",
"question__title_slug": "toss-strange-coins",
"question__hide": false,
- "total_acs": 17914,
- "total_submitted": 31819,
+ "total_acs": 17984,
+ "total_submitted": 31951,
"frontend_question_id": 1230,
"is_new_question": false
},
@@ -47142,8 +47740,8 @@
"question__title": "Meeting Scheduler",
"question__title_slug": "meeting-scheduler",
"question__hide": false,
- "total_acs": 78043,
- "total_submitted": 141847,
+ "total_acs": 78314,
+ "total_submitted": 142323,
"frontend_question_id": 1229,
"is_new_question": false
},
@@ -47165,8 +47763,8 @@
"question__title": "Missing Number In Arithmetic Progression",
"question__title_slug": "missing-number-in-arithmetic-progression",
"question__hide": false,
- "total_acs": 27246,
- "total_submitted": 52485,
+ "total_acs": 27398,
+ "total_submitted": 52770,
"frontend_question_id": 1228,
"is_new_question": false
},
@@ -47188,8 +47786,8 @@
"question__title": "Project Employees III",
"question__title_slug": "project-employees-iii",
"question__hide": false,
- "total_acs": 57060,
- "total_submitted": 74574,
+ "total_acs": 57518,
+ "total_submitted": 75177,
"frontend_question_id": 1077,
"is_new_question": false
},
@@ -47211,8 +47809,8 @@
"question__title": "Project Employees II",
"question__title_slug": "project-employees-ii",
"question__hide": false,
- "total_acs": 57336,
- "total_submitted": 114876,
+ "total_acs": 57653,
+ "total_submitted": 115495,
"frontend_question_id": 1076,
"is_new_question": false
},
@@ -47234,8 +47832,8 @@
"question__title": "Project Employees I",
"question__title_slug": "project-employees-i",
"question__hide": false,
- "total_acs": 226495,
- "total_submitted": 369807,
+ "total_acs": 239721,
+ "total_submitted": 389113,
"frontend_question_id": 1075,
"is_new_question": false
},
@@ -47257,8 +47855,8 @@
"question__title": "Letter Tile Possibilities",
"question__title_slug": "letter-tile-possibilities",
"question__hide": false,
- "total_acs": 100605,
- "total_submitted": 131906,
+ "total_acs": 101368,
+ "total_submitted": 132861,
"frontend_question_id": 1079,
"is_new_question": false
},
@@ -47280,8 +47878,8 @@
"question__title": "Smallest Subsequence of Distinct Characters",
"question__title_slug": "smallest-subsequence-of-distinct-characters",
"question__hide": false,
- "total_acs": 69123,
- "total_submitted": 113573,
+ "total_acs": 69799,
+ "total_submitted": 114549,
"frontend_question_id": 1081,
"is_new_question": false
},
@@ -47303,8 +47901,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": 37574,
- "total_submitted": 67672,
+ "total_acs": 37878,
+ "total_submitted": 68096,
"frontend_question_id": 1080,
"is_new_question": false
},
@@ -47326,8 +47924,8 @@
"question__title": "Occurrences After Bigram",
"question__title_slug": "occurrences-after-bigram",
"question__hide": false,
- "total_acs": 72889,
- "total_submitted": 114843,
+ "total_acs": 73514,
+ "total_submitted": 115791,
"frontend_question_id": 1078,
"is_new_question": false
},
@@ -47349,8 +47947,8 @@
"question__title": "Product Sales Analysis III",
"question__title_slug": "product-sales-analysis-iii",
"question__hide": false,
- "total_acs": 144728,
- "total_submitted": 342066,
+ "total_acs": 153174,
+ "total_submitted": 360191,
"frontend_question_id": 1070,
"is_new_question": false
},
@@ -47372,8 +47970,8 @@
"question__title": "Product Sales Analysis II",
"question__title_slug": "product-sales-analysis-ii",
"question__hide": false,
- "total_acs": 53773,
- "total_submitted": 65780,
+ "total_acs": 54068,
+ "total_submitted": 66119,
"frontend_question_id": 1069,
"is_new_question": false
},
@@ -47395,8 +47993,8 @@
"question__title": "Product Sales Analysis I",
"question__title_slug": "product-sales-analysis-i",
"question__hide": false,
- "total_acs": 444645,
- "total_submitted": 542119,
+ "total_acs": 472860,
+ "total_submitted": 573220,
"frontend_question_id": 1068,
"is_new_question": false
},
@@ -47418,8 +48016,8 @@
"question__title": "Maximum Number of Ones",
"question__title_slug": "maximum-number-of-ones",
"question__hide": false,
- "total_acs": 4947,
- "total_submitted": 7284,
+ "total_acs": 4982,
+ "total_submitted": 7324,
"frontend_question_id": 1183,
"is_new_question": false
},
@@ -47441,8 +48039,8 @@
"question__title": "Stepping Numbers",
"question__title_slug": "stepping-numbers",
"question__hide": false,
- "total_acs": 9421,
- "total_submitted": 20006,
+ "total_acs": 9458,
+ "total_submitted": 20062,
"frontend_question_id": 1215,
"is_new_question": false
},
@@ -47464,8 +48062,8 @@
"question__title": "Two Sum BSTs",
"question__title_slug": "two-sum-bsts",
"question__hide": false,
- "total_acs": 48557,
- "total_submitted": 72326,
+ "total_acs": 48874,
+ "total_submitted": 72746,
"frontend_question_id": 1214,
"is_new_question": false
},
@@ -47487,8 +48085,8 @@
"question__title": "Intersection of Three Sorted Arrays",
"question__title_slug": "intersection-of-three-sorted-arrays",
"question__hide": false,
- "total_acs": 86751,
- "total_submitted": 108702,
+ "total_acs": 87067,
+ "total_submitted": 109081,
"frontend_question_id": 1213,
"is_new_question": false
},
@@ -47510,8 +48108,8 @@
"question__title": "Adding Two Negabinary Numbers",
"question__title_slug": "adding-two-negabinary-numbers",
"question__hide": false,
- "total_acs": 17867,
- "total_submitted": 48536,
+ "total_acs": 17963,
+ "total_submitted": 48766,
"frontend_question_id": 1073,
"is_new_question": false
},
@@ -47533,8 +48131,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": 22848,
- "total_submitted": 35731,
+ "total_acs": 23013,
+ "total_submitted": 35961,
"frontend_question_id": 1072,
"is_new_question": false
},
@@ -47556,8 +48154,8 @@
"question__title": "Greatest Common Divisor of Strings",
"question__title_slug": "greatest-common-divisor-of-strings",
"question__hide": false,
- "total_acs": 454708,
- "total_submitted": 885437,
+ "total_acs": 471902,
+ "total_submitted": 918411,
"frontend_question_id": 1071,
"is_new_question": false
},
@@ -47579,8 +48177,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": 153244,
- "total_submitted": 205892,
+ "total_acs": 154172,
+ "total_submitted": 207145,
"frontend_question_id": 1074,
"is_new_question": false
},
@@ -47602,8 +48200,8 @@
"question__title": "Optimize Water Distribution in a Village",
"question__title_slug": "optimize-water-distribution-in-a-village",
"question__hide": false,
- "total_acs": 47770,
- "total_submitted": 73770,
+ "total_acs": 48130,
+ "total_submitted": 74333,
"frontend_question_id": 1168,
"is_new_question": false
},
@@ -47625,8 +48223,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": 44625,
- "total_submitted": 58329,
+ "total_acs": 44875,
+ "total_submitted": 58668,
"frontend_question_id": 1198,
"is_new_question": false
},
@@ -47648,8 +48246,8 @@
"question__title": "Minimum Knight Moves",
"question__title_slug": "minimum-knight-moves",
"question__hide": false,
- "total_acs": 156048,
- "total_submitted": 384936,
+ "total_acs": 157143,
+ "total_submitted": 387344,
"frontend_question_id": 1197,
"is_new_question": false
},
@@ -47671,8 +48269,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": 34872,
- "total_submitted": 52056,
+ "total_acs": 35295,
+ "total_submitted": 52667,
"frontend_question_id": 1196,
"is_new_question": false
},
@@ -47694,8 +48292,8 @@
"question__title": "Distant Barcodes",
"question__title_slug": "distant-barcodes",
"question__hide": false,
- "total_acs": 43008,
- "total_submitted": 92488,
+ "total_acs": 43396,
+ "total_submitted": 93163,
"frontend_question_id": 1054,
"is_new_question": false
},
@@ -47717,8 +48315,8 @@
"question__title": "Previous Permutation With One Swap",
"question__title_slug": "previous-permutation-with-one-swap",
"question__hide": false,
- "total_acs": 40324,
- "total_submitted": 81110,
+ "total_acs": 40570,
+ "total_submitted": 81654,
"frontend_question_id": 1053,
"is_new_question": false
},
@@ -47734,14 +48332,14 @@
{
"stat": {
"question_id": 1138,
- "question__article__live": null,
- "question__article__slug": null,
- "question__article__has_video_solution": null,
+ "question__article__live": true,
+ "question__article__slug": "grumpy-bookstore-owner",
+ "question__article__has_video_solution": false,
"question__title": "Grumpy Bookstore Owner",
"question__title_slug": "grumpy-bookstore-owner",
"question__hide": false,
- "total_acs": 75030,
- "total_submitted": 131412,
+ "total_acs": 190643,
+ "total_submitted": 296157,
"frontend_question_id": 1052,
"is_new_question": false
},
@@ -47757,14 +48355,14 @@
{
"stat": {
"question_id": 1137,
- "question__article__live": null,
- "question__article__slug": null,
- "question__article__has_video_solution": null,
+ "question__article__live": true,
+ "question__article__slug": "height-checker",
+ "question__article__has_video_solution": false,
"question__title": "Height Checker",
"question__title_slug": "height-checker",
"question__hide": false,
- "total_acs": 345215,
- "total_submitted": 450696,
+ "total_acs": 494083,
+ "total_submitted": 612315,
"frontend_question_id": 1051,
"is_new_question": false
},
@@ -47786,8 +48384,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": 177433,
- "total_submitted": 253591,
+ "total_acs": 180831,
+ "total_submitted": 258318,
"frontend_question_id": 1050,
"is_new_question": false
},
@@ -47809,8 +48407,8 @@
"question__title": "Customers Who Bought All Products",
"question__title_slug": "customers-who-bought-all-products",
"question__hide": false,
- "total_acs": 166986,
- "total_submitted": 270438,
+ "total_acs": 175616,
+ "total_submitted": 284154,
"frontend_question_id": 1045,
"is_new_question": false
},
@@ -47832,8 +48430,8 @@
"question__title": "Shortest Distance to Target Color",
"question__title_slug": "shortest-distance-to-target-color",
"question__hide": false,
- "total_acs": 35721,
- "total_submitted": 64469,
+ "total_acs": 35781,
+ "total_submitted": 64596,
"frontend_question_id": 1182,
"is_new_question": false
},
@@ -47855,8 +48453,8 @@
"question__title": "Last Substring in Lexicographical Order",
"question__title_slug": "last-substring-in-lexicographical-order",
"question__hide": false,
- "total_acs": 34517,
- "total_submitted": 99882,
+ "total_acs": 34648,
+ "total_submitted": 100305,
"frontend_question_id": 1163,
"is_new_question": false
},
@@ -47878,8 +48476,8 @@
"question__title": "Before and After Puzzle",
"question__title_slug": "before-and-after-puzzle",
"question__hide": false,
- "total_acs": 9634,
- "total_submitted": 21043,
+ "total_acs": 9660,
+ "total_submitted": 21074,
"frontend_question_id": 1181,
"is_new_question": false
},
@@ -47901,8 +48499,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": 27374,
- "total_submitted": 34286,
+ "total_acs": 27523,
+ "total_submitted": 34446,
"frontend_question_id": 1180,
"is_new_question": false
},
@@ -47924,8 +48522,8 @@
"question__title": "Last Stone Weight II",
"question__title_slug": "last-stone-weight-ii",
"question__hide": false,
- "total_acs": 87723,
- "total_submitted": 158227,
+ "total_acs": 88754,
+ "total_submitted": 159813,
"frontend_question_id": 1049,
"is_new_question": false
},
@@ -47947,8 +48545,8 @@
"question__title": "Longest String Chain",
"question__title_slug": "longest-string-chain",
"question__hide": false,
- "total_acs": 406426,
- "total_submitted": 665315,
+ "total_acs": 410151,
+ "total_submitted": 670924,
"frontend_question_id": 1048,
"is_new_question": false
},
@@ -47970,8 +48568,8 @@
"question__title": "Remove All Adjacent Duplicates In String",
"question__title_slug": "remove-all-adjacent-duplicates-in-string",
"question__hide": false,
- "total_acs": 571985,
- "total_submitted": 821716,
+ "total_acs": 579562,
+ "total_submitted": 831596,
"frontend_question_id": 1047,
"is_new_question": false
},
@@ -47993,8 +48591,8 @@
"question__title": "Last Stone Weight",
"question__title_slug": "last-stone-weight",
"question__hide": false,
- "total_acs": 618989,
- "total_submitted": 946385,
+ "total_acs": 627607,
+ "total_submitted": 959061,
"frontend_question_id": 1046,
"is_new_question": false
},
@@ -48016,8 +48614,8 @@
"question__title": "Minimum Cost to Connect Sticks",
"question__title_slug": "minimum-cost-to-connect-sticks",
"question__hide": false,
- "total_acs": 122637,
- "total_submitted": 175259,
+ "total_acs": 123454,
+ "total_submitted": 176276,
"frontend_question_id": 1167,
"is_new_question": false
},
@@ -48039,8 +48637,8 @@
"question__title": "Design File System",
"question__title_slug": "design-file-system",
"question__hide": false,
- "total_acs": 59150,
- "total_submitted": 94021,
+ "total_acs": 59996,
+ "total_submitted": 95233,
"frontend_question_id": 1166,
"is_new_question": false
},
@@ -48062,8 +48660,8 @@
"question__title": "String Transforms Into Another String",
"question__title_slug": "string-transforms-into-another-string",
"question__hide": false,
- "total_acs": 52065,
- "total_submitted": 148858,
+ "total_acs": 52136,
+ "total_submitted": 149105,
"frontend_question_id": 1153,
"is_new_question": false
},
@@ -48085,8 +48683,8 @@
"question__title": "Single-Row Keyboard",
"question__title_slug": "single-row-keyboard",
"question__hide": false,
- "total_acs": 85485,
- "total_submitted": 97680,
+ "total_acs": 85774,
+ "total_submitted": 98006,
"frontend_question_id": 1165,
"is_new_question": false
},
@@ -48108,8 +48706,8 @@
"question__title": "Longest Duplicate Substring",
"question__title_slug": "longest-duplicate-substring",
"question__hide": false,
- "total_acs": 68418,
- "total_submitted": 223973,
+ "total_acs": 68780,
+ "total_submitted": 225012,
"frontend_question_id": 1044,
"is_new_question": false
},
@@ -48131,8 +48729,8 @@
"question__title": "Partition Array for Maximum Sum",
"question__title_slug": "partition-array-for-maximum-sum",
"question__hide": false,
- "total_acs": 186550,
- "total_submitted": 243876,
+ "total_acs": 190327,
+ "total_submitted": 248653,
"frontend_question_id": 1043,
"is_new_question": false
},
@@ -48154,8 +48752,8 @@
"question__title": "Flower Planting With No Adjacent",
"question__title_slug": "flower-planting-with-no-adjacent",
"question__hide": false,
- "total_acs": 78833,
- "total_submitted": 153772,
+ "total_acs": 79582,
+ "total_submitted": 155036,
"frontend_question_id": 1042,
"is_new_question": false
},
@@ -48177,8 +48775,8 @@
"question__title": "Robot Bounded In Circle",
"question__title_slug": "robot-bounded-in-circle",
"question__hide": false,
- "total_acs": 235101,
- "total_submitted": 422122,
+ "total_acs": 236992,
+ "total_submitted": 424808,
"frontend_question_id": 1041,
"is_new_question": false
},
@@ -48200,8 +48798,8 @@
"question__title": "Divide Array Into Increasing Sequences",
"question__title_slug": "divide-array-into-increasing-sequences",
"question__hide": false,
- "total_acs": 4833,
- "total_submitted": 7874,
+ "total_acs": 4853,
+ "total_submitted": 7909,
"frontend_question_id": 1121,
"is_new_question": false
},
@@ -48223,8 +48821,8 @@
"question__title": "As Far from Land as Possible",
"question__title_slug": "as-far-from-land-as-possible",
"question__hide": false,
- "total_acs": 153858,
- "total_submitted": 298292,
+ "total_acs": 154702,
+ "total_submitted": 299874,
"frontend_question_id": 1162,
"is_new_question": false
},
@@ -48246,8 +48844,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": 278233,
- "total_submitted": 414611,
+ "total_acs": 283250,
+ "total_submitted": 421986,
"frontend_question_id": 1161,
"is_new_question": false
},
@@ -48269,8 +48867,8 @@
"question__title": "Valid Boomerang",
"question__title_slug": "valid-boomerang",
"question__hide": false,
- "total_acs": 52387,
- "total_submitted": 141588,
+ "total_acs": 52969,
+ "total_submitted": 143026,
"frontend_question_id": 1037,
"is_new_question": false
},
@@ -48286,14 +48884,14 @@
{
"stat": {
"question_id": 1114,
- "question__article__live": null,
- "question__article__slug": null,
- "question__article__has_video_solution": null,
+ "question__article__live": true,
+ "question__article__slug": "binary-search-tree-to-greater-sum-tree",
+ "question__article__has_video_solution": false,
"question__title": "Binary Search Tree to Greater Sum Tree",
"question__title_slug": "binary-search-tree-to-greater-sum-tree",
"question__hide": false,
- "total_acs": 178845,
- "total_submitted": 208300,
+ "total_acs": 184751,
+ "total_submitted": 214667,
"frontend_question_id": 1038,
"is_new_question": false
},
@@ -48315,8 +48913,8 @@
"question__title": "Moving Stones Until Consecutive II",
"question__title_slug": "moving-stones-until-consecutive-ii",
"question__hide": false,
- "total_acs": 10244,
- "total_submitted": 18087,
+ "total_acs": 10356,
+ "total_submitted": 18263,
"frontend_question_id": 1040,
"is_new_question": false
},
@@ -48338,8 +48936,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": 259472,
- "total_submitted": 367344,
+ "total_acs": 261723,
+ "total_submitted": 370446,
"frontend_question_id": 1160,
"is_new_question": false
},
@@ -48361,8 +48959,8 @@
"question__title": "Minimum Score Triangulation of Polygon",
"question__title_slug": "minimum-score-triangulation-of-polygon",
"question__hide": false,
- "total_acs": 49714,
- "total_submitted": 84333,
+ "total_acs": 50610,
+ "total_submitted": 85682,
"frontend_question_id": 1039,
"is_new_question": false
},
@@ -48384,8 +48982,8 @@
"question__title": "Analyze User Website Visit Pattern",
"question__title_slug": "analyze-user-website-visit-pattern",
"question__hide": false,
- "total_acs": 98307,
- "total_submitted": 230221,
+ "total_acs": 99669,
+ "total_submitted": 233312,
"frontend_question_id": 1152,
"is_new_question": false
},
@@ -48407,8 +49005,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": 64948,
- "total_submitted": 107850,
+ "total_acs": 65461,
+ "total_submitted": 108723,
"frontend_question_id": 1151,
"is_new_question": false
},
@@ -48430,8 +49028,8 @@
"question__title": "Escape a Large Maze",
"question__title_slug": "escape-a-large-maze",
"question__hide": false,
- "total_acs": 21668,
- "total_submitted": 62332,
+ "total_acs": 21829,
+ "total_submitted": 62777,
"frontend_question_id": 1036,
"is_new_question": false
},
@@ -48453,8 +49051,8 @@
"question__title": "Uncrossed Lines",
"question__title_slug": "uncrossed-lines",
"question__hide": false,
- "total_acs": 157663,
- "total_submitted": 249883,
+ "total_acs": 158780,
+ "total_submitted": 251426,
"frontend_question_id": 1035,
"is_new_question": false
},
@@ -48476,8 +49074,8 @@
"question__title": "Coloring A Border",
"question__title_slug": "coloring-a-border",
"question__hide": false,
- "total_acs": 35279,
- "total_submitted": 71992,
+ "total_acs": 35617,
+ "total_submitted": 72650,
"frontend_question_id": 1034,
"is_new_question": false
},
@@ -48499,8 +49097,8 @@
"question__title": "Moving Stones Until Consecutive",
"question__title_slug": "moving-stones-until-consecutive",
"question__hide": false,
- "total_acs": 25025,
- "total_submitted": 52144,
+ "total_acs": 25211,
+ "total_submitted": 52384,
"frontend_question_id": 1033,
"is_new_question": false
},
@@ -48522,8 +49120,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": 49273,
- "total_submitted": 83724,
+ "total_acs": 49603,
+ "total_submitted": 84284,
"frontend_question_id": 1150,
"is_new_question": false
},
@@ -48545,8 +49143,8 @@
"question__title": "Parallel Courses",
"question__title_slug": "parallel-courses",
"question__hide": false,
- "total_acs": 85430,
- "total_submitted": 139125,
+ "total_acs": 86429,
+ "total_submitted": 140709,
"frontend_question_id": 1136,
"is_new_question": false
},
@@ -48568,8 +49166,8 @@
"question__title": "Connecting Cities With Minimum Cost",
"question__title_slug": "connecting-cities-with-minimum-cost",
"question__hide": false,
- "total_acs": 73901,
- "total_submitted": 119173,
+ "total_acs": 74163,
+ "total_submitted": 119605,
"frontend_question_id": 1135,
"is_new_question": false
},
@@ -48591,8 +49189,8 @@
"question__title": "Path With Maximum Minimum Value",
"question__title_slug": "path-with-maximum-minimum-value",
"question__hide": false,
- "total_acs": 62597,
- "total_submitted": 116622,
+ "total_acs": 62831,
+ "total_submitted": 116972,
"frontend_question_id": 1102,
"is_new_question": false
},
@@ -48614,8 +49212,8 @@
"question__title": "Largest Unique Number",
"question__title_slug": "largest-unique-number",
"question__hide": false,
- "total_acs": 62090,
- "total_submitted": 89978,
+ "total_acs": 63165,
+ "total_submitted": 91437,
"frontend_question_id": 1133,
"is_new_question": false
},
@@ -48637,8 +49235,8 @@
"question__title": "Stream of Characters",
"question__title_slug": "stream-of-characters",
"question__hide": false,
- "total_acs": 89299,
- "total_submitted": 171698,
+ "total_acs": 89624,
+ "total_submitted": 172217,
"frontend_question_id": 1032,
"is_new_question": false
},
@@ -48660,8 +49258,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": 70732,
- "total_submitted": 118404,
+ "total_acs": 71220,
+ "total_submitted": 119140,
"frontend_question_id": 1031,
"is_new_question": false
},
@@ -48683,8 +49281,8 @@
"question__title": "Two City Scheduling",
"question__title_slug": "two-city-scheduling",
"question__hide": false,
- "total_acs": 243624,
- "total_submitted": 365120,
+ "total_acs": 244814,
+ "total_submitted": 366559,
"frontend_question_id": 1029,
"is_new_question": false
},
@@ -48706,8 +49304,8 @@
"question__title": "Matrix Cells in Distance Order",
"question__title_slug": "matrix-cells-in-distance-order",
"question__hide": false,
- "total_acs": 59478,
- "total_submitted": 83588,
+ "total_acs": 59988,
+ "total_submitted": 84213,
"frontend_question_id": 1030,
"is_new_question": false
},
@@ -48729,8 +49327,8 @@
"question__title": "Recover a Tree From Preorder Traversal",
"question__title_slug": "recover-a-tree-from-preorder-traversal",
"question__hide": false,
- "total_acs": 51390,
- "total_submitted": 68847,
+ "total_acs": 52076,
+ "total_submitted": 69660,
"frontend_question_id": 1028,
"is_new_question": false
},
@@ -48752,8 +49350,8 @@
"question__title": "Maximum Difference Between Node and Ancestor",
"question__title_slug": "maximum-difference-between-node-and-ancestor",
"question__hide": false,
- "total_acs": 324975,
- "total_submitted": 416132,
+ "total_acs": 327181,
+ "total_submitted": 418957,
"frontend_question_id": 1026,
"is_new_question": false
},
@@ -48775,8 +49373,8 @@
"question__title": "Maximum Average Subtree",
"question__title_slug": "maximum-average-subtree",
"question__hide": false,
- "total_acs": 68908,
- "total_submitted": 103476,
+ "total_acs": 69100,
+ "total_submitted": 103742,
"frontend_question_id": 1120,
"is_new_question": false
},
@@ -48798,8 +49396,8 @@
"question__title": "Armstrong Number",
"question__title_slug": "armstrong-number",
"question__hide": false,
- "total_acs": 36621,
- "total_submitted": 47065,
+ "total_acs": 36836,
+ "total_submitted": 47342,
"frontend_question_id": 1134,
"is_new_question": false
},
@@ -48821,8 +49419,8 @@
"question__title": "Remove Vowels from a String",
"question__title_slug": "remove-vowels-from-a-string",
"question__hide": false,
- "total_acs": 110089,
- "total_submitted": 120817,
+ "total_acs": 110448,
+ "total_submitted": 121197,
"frontend_question_id": 1119,
"is_new_question": false
},
@@ -48844,8 +49442,8 @@
"question__title": "Number of Days in a Month",
"question__title_slug": "number-of-days-in-a-month",
"question__hide": false,
- "total_acs": 8482,
- "total_submitted": 14567,
+ "total_acs": 8527,
+ "total_submitted": 14659,
"frontend_question_id": 1118,
"is_new_question": false
},
@@ -48867,8 +49465,8 @@
"question__title": "Longest Arithmetic Subsequence",
"question__title_slug": "longest-arithmetic-subsequence",
"question__hide": false,
- "total_acs": 174628,
- "total_submitted": 355611,
+ "total_acs": 175887,
+ "total_submitted": 358177,
"frontend_question_id": 1027,
"is_new_question": false
},
@@ -48890,8 +49488,8 @@
"question__title": "Divisor Game",
"question__title_slug": "divisor-game",
"question__hide": false,
- "total_acs": 257469,
- "total_submitted": 374156,
+ "total_acs": 260838,
+ "total_submitted": 378695,
"frontend_question_id": 1025,
"is_new_question": false
},
@@ -48913,8 +49511,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": 90210,
- "total_submitted": 139643,
+ "total_acs": 91805,
+ "total_submitted": 142023,
"frontend_question_id": 1101,
"is_new_question": false
},
@@ -48936,8 +49534,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": 41733,
- "total_submitted": 55890,
+ "total_acs": 42020,
+ "total_submitted": 56286,
"frontend_question_id": 1100,
"is_new_question": false
},
@@ -48959,8 +49557,8 @@
"question__title": "Two Sum Less Than K",
"question__title_slug": "two-sum-less-than-k",
"question__hide": false,
- "total_acs": 134237,
- "total_submitted": 217153,
+ "total_acs": 134757,
+ "total_submitted": 218004,
"frontend_question_id": 1099,
"is_new_question": false
},
@@ -48982,8 +49580,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": 24007,
- "total_submitted": 31421,
+ "total_acs": 24061,
+ "total_submitted": 31484,
"frontend_question_id": 1085,
"is_new_question": false
},
@@ -49005,8 +49603,8 @@
"question__title": "Video Stitching",
"question__title_slug": "video-stitching",
"question__hide": false,
- "total_acs": 69031,
- "total_submitted": 134369,
+ "total_acs": 69435,
+ "total_submitted": 135094,
"frontend_question_id": 1024,
"is_new_question": false
},
@@ -49028,8 +49626,8 @@
"question__title": "Camelcase Matching",
"question__title_slug": "camelcase-matching",
"question__hide": false,
- "total_acs": 48499,
- "total_submitted": 77875,
+ "total_acs": 48995,
+ "total_submitted": 78557,
"frontend_question_id": 1023,
"is_new_question": false
},
@@ -49051,8 +49649,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": 211416,
- "total_submitted": 289309,
+ "total_acs": 212667,
+ "total_submitted": 290907,
"frontend_question_id": 1022,
"is_new_question": false
},
@@ -49074,8 +49672,8 @@
"question__title": "Remove Outermost Parentheses",
"question__title_slug": "remove-outermost-parentheses",
"question__hide": false,
- "total_acs": 317762,
- "total_submitted": 383925,
+ "total_acs": 327049,
+ "total_submitted": 394177,
"frontend_question_id": 1021,
"is_new_question": false
},
@@ -49097,8 +49695,8 @@
"question__title": "Confusing Number II",
"question__title_slug": "confusing-number-ii",
"question__hide": false,
- "total_acs": 37176,
- "total_submitted": 78770,
+ "total_acs": 37263,
+ "total_submitted": 78941,
"frontend_question_id": 1088,
"is_new_question": false
},
@@ -49120,8 +49718,8 @@
"question__title": "Brace Expansion",
"question__title_slug": "brace-expansion",
"question__hide": false,
- "total_acs": 52294,
- "total_submitted": 78773,
+ "total_acs": 52490,
+ "total_submitted": 79064,
"frontend_question_id": 1087,
"is_new_question": false
},
@@ -49143,8 +49741,8 @@
"question__title": "Index Pairs of a String",
"question__title_slug": "index-pairs-of-a-string",
"question__hide": false,
- "total_acs": 27778,
- "total_submitted": 41223,
+ "total_acs": 27880,
+ "total_submitted": 41342,
"frontend_question_id": 1065,
"is_new_question": false
},
@@ -49166,8 +49764,8 @@
"question__title": "High Five",
"question__title_slug": "high-five",
"question__hide": false,
- "total_acs": 102816,
- "total_submitted": 137931,
+ "total_acs": 103569,
+ "total_submitted": 138902,
"frontend_question_id": 1086,
"is_new_question": false
},
@@ -49189,8 +49787,8 @@
"question__title": "Number of Enclaves",
"question__title_slug": "number-of-enclaves",
"question__hide": false,
- "total_acs": 221226,
- "total_submitted": 321493,
+ "total_acs": 227164,
+ "total_submitted": 329404,
"frontend_question_id": 1020,
"is_new_question": false
},
@@ -49212,8 +49810,8 @@
"question__title": "Next Greater Node In Linked List",
"question__title_slug": "next-greater-node-in-linked-list",
"question__hide": false,
- "total_acs": 156965,
- "total_submitted": 257967,
+ "total_acs": 158713,
+ "total_submitted": 260437,
"frontend_question_id": 1019,
"is_new_question": false
},
@@ -49235,8 +49833,8 @@
"question__title": "Binary Prefix Divisible By 5",
"question__title_slug": "binary-prefix-divisible-by-5",
"question__hide": false,
- "total_acs": 55356,
- "total_submitted": 118488,
+ "total_acs": 55862,
+ "total_submitted": 119533,
"frontend_question_id": 1018,
"is_new_question": false
},
@@ -49258,8 +49856,8 @@
"question__title": "Convert to Base -2",
"question__title_slug": "convert-to-base-2",
"question__hide": false,
- "total_acs": 26902,
- "total_submitted": 44324,
+ "total_acs": 27140,
+ "total_submitted": 44671,
"frontend_question_id": 1017,
"is_new_question": false
},
@@ -49281,8 +49879,8 @@
"question__title": "Confusing Number",
"question__title_slug": "confusing-number",
"question__hide": false,
- "total_acs": 45501,
- "total_submitted": 93414,
+ "total_acs": 45851,
+ "total_submitted": 94063,
"frontend_question_id": 1056,
"is_new_question": false
},
@@ -49304,8 +49902,8 @@
"question__title": "Digit Count in Range",
"question__title_slug": "digit-count-in-range",
"question__hide": false,
- "total_acs": 4098,
- "total_submitted": 8857,
+ "total_acs": 4113,
+ "total_submitted": 8879,
"frontend_question_id": 1067,
"is_new_question": false
},
@@ -49327,8 +49925,8 @@
"question__title": "Campus Bikes II",
"question__title_slug": "campus-bikes-ii",
"question__hide": false,
- "total_acs": 51169,
- "total_submitted": 92729,
+ "total_acs": 51244,
+ "total_submitted": 92867,
"frontend_question_id": 1066,
"is_new_question": false
},
@@ -49350,8 +49948,8 @@
"question__title": "Fixed Point",
"question__title_slug": "fixed-point",
"question__hide": false,
- "total_acs": 44087,
- "total_submitted": 68748,
+ "total_acs": 44228,
+ "total_submitted": 68963,
"frontend_question_id": 1064,
"is_new_question": false
},
@@ -49373,8 +49971,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": 37805,
- "total_submitted": 65899,
+ "total_acs": 38052,
+ "total_submitted": 66304,
"frontend_question_id": 1016,
"is_new_question": false
},
@@ -49396,8 +49994,8 @@
"question__title": "Smallest Integer Divisible by K",
"question__title_slug": "smallest-integer-divisible-by-k",
"question__hide": false,
- "total_acs": 62745,
- "total_submitted": 134674,
+ "total_acs": 62932,
+ "total_submitted": 135096,
"frontend_question_id": 1015,
"is_new_question": false
},
@@ -49419,8 +50017,8 @@
"question__title": "Best Sightseeing Pair",
"question__title_slug": "best-sightseeing-pair",
"question__hide": false,
- "total_acs": 92227,
- "total_submitted": 155960,
+ "total_acs": 92620,
+ "total_submitted": 156599,
"frontend_question_id": 1014,
"is_new_question": false
},
@@ -49442,8 +50040,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": 93068,
- "total_submitted": 221754,
+ "total_acs": 94344,
+ "total_submitted": 224743,
"frontend_question_id": 1013,
"is_new_question": false
},
@@ -49465,8 +50063,8 @@
"question__title": "Number of Valid Subarrays",
"question__title_slug": "number-of-valid-subarrays",
"question__hide": false,
- "total_acs": 13648,
- "total_submitted": 17295,
+ "total_acs": 14066,
+ "total_submitted": 17804,
"frontend_question_id": 1063,
"is_new_question": false
},
@@ -49488,8 +50086,8 @@
"question__title": "Longest Repeating Substring",
"question__title_slug": "longest-repeating-substring",
"question__hide": false,
- "total_acs": 41348,
- "total_submitted": 68068,
+ "total_acs": 41820,
+ "total_submitted": 68745,
"frontend_question_id": 1062,
"is_new_question": false
},
@@ -49511,8 +50109,8 @@
"question__title": "Missing Element in Sorted Array",
"question__title_slug": "missing-element-in-sorted-array",
"question__hide": false,
- "total_acs": 135458,
- "total_submitted": 237983,
+ "total_acs": 136984,
+ "total_submitted": 240089,
"frontend_question_id": 1060,
"is_new_question": false
},
@@ -49534,8 +50132,8 @@
"question__title": "Lexicographically Smallest Equivalent String",
"question__title_slug": "lexicographically-smallest-equivalent-string",
"question__hide": false,
- "total_acs": 79488,
- "total_submitted": 103861,
+ "total_acs": 80007,
+ "total_submitted": 104520,
"frontend_question_id": 1061,
"is_new_question": false
},
@@ -49557,8 +50155,8 @@
"question__title": "Numbers With Repeated Digits",
"question__title_slug": "numbers-with-repeated-digits",
"question__hide": false,
- "total_acs": 16879,
- "total_submitted": 40074,
+ "total_acs": 17075,
+ "total_submitted": 40460,
"frontend_question_id": 1012,
"is_new_question": false
},
@@ -49580,8 +50178,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": 384336,
- "total_submitted": 552327,
+ "total_acs": 395895,
+ "total_submitted": 567274,
"frontend_question_id": 1011,
"is_new_question": false
},
@@ -49603,8 +50201,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": 273196,
- "total_submitted": 516611,
+ "total_acs": 275196,
+ "total_submitted": 519855,
"frontend_question_id": 1010,
"is_new_question": false
},
@@ -49626,8 +50224,8 @@
"question__title": "Complement of Base 10 Integer",
"question__title_slug": "complement-of-base-10-integer",
"question__hide": false,
- "total_acs": 241246,
- "total_submitted": 396865,
+ "total_acs": 245103,
+ "total_submitted": 403130,
"frontend_question_id": 1009,
"is_new_question": false
},
@@ -49649,8 +50247,8 @@
"question__title": "Minimize Rounding Error to Meet Target",
"question__title_slug": "minimize-rounding-error-to-meet-target",
"question__hide": false,
- "total_acs": 9194,
- "total_submitted": 20394,
+ "total_acs": 9239,
+ "total_submitted": 20508,
"frontend_question_id": 1058,
"is_new_question": false
},
@@ -49672,8 +50270,8 @@
"question__title": "Campus Bikes",
"question__title_slug": "campus-bikes",
"question__hide": false,
- "total_acs": 71710,
- "total_submitted": 122344,
+ "total_acs": 71871,
+ "total_submitted": 122628,
"frontend_question_id": 1057,
"is_new_question": false
},
@@ -49695,8 +50293,8 @@
"question__title": "Shortest Way to Form String",
"question__title_slug": "shortest-way-to-form-string",
"question__hide": false,
- "total_acs": 89737,
- "total_submitted": 149010,
+ "total_acs": 90411,
+ "total_submitted": 149995,
"frontend_question_id": 1055,
"is_new_question": false
},
@@ -49718,8 +50316,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": 362762,
- "total_submitted": 442378,
+ "total_acs": 369386,
+ "total_submitted": 449938,
"frontend_question_id": 1008,
"is_new_question": false
},
@@ -49741,8 +50339,8 @@
"question__title": "Minimum Domino Rotations For Equal Row",
"question__title_slug": "minimum-domino-rotations-for-equal-row",
"question__hide": false,
- "total_acs": 203214,
- "total_submitted": 389084,
+ "total_acs": 203819,
+ "total_submitted": 390198,
"frontend_question_id": 1007,
"is_new_question": false
},
@@ -49764,8 +50362,8 @@
"question__title": "Clumsy Factorial",
"question__title_slug": "clumsy-factorial",
"question__hide": false,
- "total_acs": 31153,
- "total_submitted": 54465,
+ "total_acs": 31558,
+ "total_submitted": 55071,
"frontend_question_id": 1006,
"is_new_question": false
},
@@ -49787,8 +50385,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": 90493,
- "total_submitted": 176856,
+ "total_acs": 91644,
+ "total_submitted": 178972,
"frontend_question_id": 1005,
"is_new_question": false
},
@@ -49810,8 +50408,8 @@
"question__title": "Max Consecutive Ones III",
"question__title_slug": "max-consecutive-ones-iii",
"question__hide": false,
- "total_acs": 548427,
- "total_submitted": 868337,
+ "total_acs": 571036,
+ "total_submitted": 901211,
"frontend_question_id": 1004,
"is_new_question": false
},
@@ -49833,8 +50431,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": 62571,
- "total_submitted": 104970,
+ "total_acs": 63410,
+ "total_submitted": 106259,
"frontend_question_id": 1003,
"is_new_question": false
},
@@ -49856,8 +50454,8 @@
"question__title": "Find Common Characters",
"question__title_slug": "find-common-characters",
"question__hide": false,
- "total_acs": 216814,
- "total_submitted": 313608,
+ "total_acs": 352563,
+ "total_submitted": 473249,
"frontend_question_id": 1002,
"is_new_question": false
},
@@ -49879,8 +50477,8 @@
"question__title": "Grid Illumination",
"question__title_slug": "grid-illumination",
"question__hide": false,
- "total_acs": 20777,
- "total_submitted": 56522,
+ "total_acs": 21064,
+ "total_submitted": 57053,
"frontend_question_id": 1001,
"is_new_question": false
},
@@ -49902,8 +50500,8 @@
"question__title": "Minimum Cost to Merge Stones",
"question__title_slug": "minimum-cost-to-merge-stones",
"question__hide": false,
- "total_acs": 39415,
- "total_submitted": 91537,
+ "total_acs": 39718,
+ "total_submitted": 92127,
"frontend_question_id": 1000,
"is_new_question": false
},
@@ -49925,8 +50523,8 @@
"question__title": "Available Captures for Rook",
"question__title_slug": "available-captures-for-rook",
"question__hide": false,
- "total_acs": 66398,
- "total_submitted": 96203,
+ "total_acs": 66911,
+ "total_submitted": 96883,
"frontend_question_id": 999,
"is_new_question": false
},
@@ -49948,8 +50546,8 @@
"question__title": "Maximum Binary Tree II",
"question__title_slug": "maximum-binary-tree-ii",
"question__hide": false,
- "total_acs": 36013,
- "total_submitted": 52099,
+ "total_acs": 36279,
+ "total_submitted": 52394,
"frontend_question_id": 998,
"is_new_question": false
},
@@ -49971,8 +50569,8 @@
"question__title": "Find the Town Judge",
"question__title_slug": "find-the-town-judge",
"question__hide": false,
- "total_acs": 588385,
- "total_submitted": 1181647,
+ "total_acs": 592851,
+ "total_submitted": 1190557,
"frontend_question_id": 997,
"is_new_question": false
},
@@ -49994,8 +50592,8 @@
"question__title": "Number of Squareful Arrays",
"question__title_slug": "number-of-squareful-arrays",
"question__hide": false,
- "total_acs": 39305,
- "total_submitted": 78408,
+ "total_acs": 39665,
+ "total_submitted": 79024,
"frontend_question_id": 996,
"is_new_question": false
},
@@ -50011,14 +50609,14 @@
{
"stat": {
"question_id": 1037,
- "question__article__live": false,
+ "question__article__live": true,
"question__article__slug": "minimum-number-of-k-consecutive-bit-flips",
"question__article__has_video_solution": false,
"question__title": "Minimum Number of K Consecutive Bit Flips",
"question__title_slug": "minimum-number-of-k-consecutive-bit-flips",
"question__hide": false,
- "total_acs": 35193,
- "total_submitted": 68163,
+ "total_acs": 112965,
+ "total_submitted": 180443,
"frontend_question_id": 995,
"is_new_question": false
},
@@ -50040,8 +50638,8 @@
"question__title": "Rotting Oranges",
"question__title_slug": "rotting-oranges",
"question__hide": false,
- "total_acs": 854278,
- "total_submitted": 1577104,
+ "total_acs": 872903,
+ "total_submitted": 1606966,
"frontend_question_id": 994,
"is_new_question": false
},
@@ -50063,8 +50661,8 @@
"question__title": "Cousins in Binary Tree",
"question__title_slug": "cousins-in-binary-tree",
"question__hide": false,
- "total_acs": 276875,
- "total_submitted": 492975,
+ "total_acs": 278868,
+ "total_submitted": 495737,
"frontend_question_id": 993,
"is_new_question": false
},
@@ -50086,8 +50684,8 @@
"question__title": "Subarrays with K Different Integers",
"question__title_slug": "subarrays-with-k-different-integers",
"question__hide": false,
- "total_acs": 213664,
- "total_submitted": 337808,
+ "total_acs": 218906,
+ "total_submitted": 344925,
"frontend_question_id": 992,
"is_new_question": false
},
@@ -50109,8 +50707,8 @@
"question__title": "Broken Calculator",
"question__title_slug": "broken-calculator",
"question__hide": false,
- "total_acs": 100823,
- "total_submitted": 185237,
+ "total_acs": 101293,
+ "total_submitted": 186020,
"frontend_question_id": 991,
"is_new_question": false
},
@@ -50132,8 +50730,8 @@
"question__title": "Satisfiability of Equality Equations",
"question__title_slug": "satisfiability-of-equality-equations",
"question__hide": false,
- "total_acs": 127247,
- "total_submitted": 251946,
+ "total_acs": 128268,
+ "total_submitted": 253903,
"frontend_question_id": 990,
"is_new_question": false
},
@@ -50155,8 +50753,8 @@
"question__title": "Add to Array-Form of Integer",
"question__title_slug": "add-to-array-form-of-integer",
"question__hide": false,
- "total_acs": 260353,
- "total_submitted": 574657,
+ "total_acs": 262233,
+ "total_submitted": 579365,
"frontend_question_id": 989,
"is_new_question": false
},
@@ -50178,8 +50776,8 @@
"question__title": "Smallest String Starting From Leaf",
"question__title_slug": "smallest-string-starting-from-leaf",
"question__hide": false,
- "total_acs": 188153,
- "total_submitted": 311160,
+ "total_acs": 189340,
+ "total_submitted": 313057,
"frontend_question_id": 988,
"is_new_question": false
},
@@ -50201,8 +50799,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": 429672,
- "total_submitted": 900608,
+ "total_acs": 438018,
+ "total_submitted": 913663,
"frontend_question_id": 987,
"is_new_question": false
},
@@ -50224,8 +50822,8 @@
"question__title": "Interval List Intersections",
"question__title_slug": "interval-list-intersections",
"question__hide": false,
- "total_acs": 414123,
- "total_submitted": 577624,
+ "total_acs": 418277,
+ "total_submitted": 583011,
"frontend_question_id": 986,
"is_new_question": false
},
@@ -50247,8 +50845,8 @@
"question__title": "Sum of Even Numbers After Queries",
"question__title_slug": "sum-of-even-numbers-after-queries",
"question__hide": false,
- "total_acs": 139206,
- "total_submitted": 204367,
+ "total_acs": 139679,
+ "total_submitted": 204978,
"frontend_question_id": 985,
"is_new_question": false
},
@@ -50270,8 +50868,8 @@
"question__title": "String Without AAA or BBB",
"question__title_slug": "string-without-aaa-or-bbb",
"question__hide": false,
- "total_acs": 47540,
- "total_submitted": 108314,
+ "total_acs": 47986,
+ "total_submitted": 109171,
"frontend_question_id": 984,
"is_new_question": false
},
@@ -50293,8 +50891,8 @@
"question__title": "Minimum Cost For Tickets",
"question__title_slug": "minimum-cost-for-tickets",
"question__hide": false,
- "total_acs": 291714,
- "total_submitted": 446888,
+ "total_acs": 295114,
+ "total_submitted": 452219,
"frontend_question_id": 983,
"is_new_question": false
},
@@ -50316,8 +50914,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": 17757,
- "total_submitted": 30569,
+ "total_acs": 18060,
+ "total_submitted": 31018,
"frontend_question_id": 982,
"is_new_question": false
},
@@ -50339,8 +50937,8 @@
"question__title": "Time Based Key-Value Store",
"question__title_slug": "time-based-key-value-store",
"question__hide": false,
- "total_acs": 443289,
- "total_submitted": 898066,
+ "total_acs": 451043,
+ "total_submitted": 914253,
"frontend_question_id": 981,
"is_new_question": false
},
@@ -50362,8 +50960,8 @@
"question__title": "Unique Paths III",
"question__title_slug": "unique-paths-iii",
"question__hide": false,
- "total_acs": 201410,
- "total_submitted": 246368,
+ "total_acs": 203322,
+ "total_submitted": 248505,
"frontend_question_id": 980,
"is_new_question": false
},
@@ -50385,8 +50983,8 @@
"question__title": "Distribute Coins in Binary Tree",
"question__title_slug": "distribute-coins-in-binary-tree",
"question__hide": false,
- "total_acs": 193642,
- "total_submitted": 251498,
+ "total_acs": 195635,
+ "total_submitted": 253911,
"frontend_question_id": 979,
"is_new_question": false
},
@@ -50408,8 +51006,8 @@
"question__title": "Longest Turbulent Subarray",
"question__title_slug": "longest-turbulent-subarray",
"question__hide": false,
- "total_acs": 100548,
- "total_submitted": 212161,
+ "total_acs": 101736,
+ "total_submitted": 214299,
"frontend_question_id": 978,
"is_new_question": false
},
@@ -50431,8 +51029,8 @@
"question__title": "Squares of a Sorted Array",
"question__title_slug": "squares-of-a-sorted-array",
"question__hide": false,
- "total_acs": 1853823,
- "total_submitted": 2545435,
+ "total_acs": 1871118,
+ "total_submitted": 2568492,
"frontend_question_id": 977,
"is_new_question": false
},
@@ -50454,8 +51052,8 @@
"question__title": "Largest Perimeter Triangle",
"question__title_slug": "largest-perimeter-triangle",
"question__hide": false,
- "total_acs": 239719,
- "total_submitted": 427860,
+ "total_acs": 241532,
+ "total_submitted": 430537,
"frontend_question_id": 976,
"is_new_question": false
},
@@ -50477,8 +51075,8 @@
"question__title": "Odd Even Jump",
"question__title_slug": "odd-even-jump",
"question__hide": false,
- "total_acs": 85127,
- "total_submitted": 213193,
+ "total_acs": 85927,
+ "total_submitted": 214789,
"frontend_question_id": 975,
"is_new_question": false
},
@@ -50500,8 +51098,8 @@
"question__title": "Subarray Sums Divisible by K",
"question__title_slug": "subarray-sums-divisible-by-k",
"question__hide": false,
- "total_acs": 239279,
- "total_submitted": 443487,
+ "total_acs": 348324,
+ "total_submitted": 627125,
"frontend_question_id": 974,
"is_new_question": false
},
@@ -50523,8 +51121,8 @@
"question__title": "K Closest Points to Origin",
"question__title_slug": "k-closest-points-to-origin",
"question__hide": false,
- "total_acs": 1206773,
- "total_submitted": 1816277,
+ "total_acs": 1220962,
+ "total_submitted": 1835435,
"frontend_question_id": 973,
"is_new_question": false
},
@@ -50546,8 +51144,8 @@
"question__title": "Fibonacci Number",
"question__title_slug": "fibonacci-number",
"question__hide": false,
- "total_acs": 1806958,
- "total_submitted": 2538986,
+ "total_acs": 1839294,
+ "total_submitted": 2580402,
"frontend_question_id": 509,
"is_new_question": false
},
@@ -50569,8 +51167,8 @@
"question__title": "Equal Rational Numbers",
"question__title_slug": "equal-rational-numbers",
"question__hide": false,
- "total_acs": 7358,
- "total_submitted": 16760,
+ "total_acs": 7444,
+ "total_submitted": 16903,
"frontend_question_id": 972,
"is_new_question": false
},
@@ -50592,8 +51190,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": 42208,
- "total_submitted": 83581,
+ "total_acs": 42425,
+ "total_submitted": 83937,
"frontend_question_id": 971,
"is_new_question": false
},
@@ -50615,8 +51213,8 @@
"question__title": "Powerful Integers",
"question__title_slug": "powerful-integers",
"question__hide": false,
- "total_acs": 55103,
- "total_submitted": 125734,
+ "total_acs": 55322,
+ "total_submitted": 126212,
"frontend_question_id": 970,
"is_new_question": false
},
@@ -50638,8 +51236,8 @@
"question__title": "Pancake Sorting",
"question__title_slug": "pancake-sorting",
"question__hide": false,
- "total_acs": 94224,
- "total_submitted": 133261,
+ "total_acs": 94796,
+ "total_submitted": 134024,
"frontend_question_id": 969,
"is_new_question": false
},
@@ -50661,8 +51259,8 @@
"question__title": "Binary Tree Cameras",
"question__title_slug": "binary-tree-cameras",
"question__hide": false,
- "total_acs": 140016,
- "total_submitted": 299649,
+ "total_acs": 141270,
+ "total_submitted": 302164,
"frontend_question_id": 968,
"is_new_question": false
},
@@ -50684,8 +51282,8 @@
"question__title": "Numbers With Same Consecutive Differences",
"question__title_slug": "numbers-with-same-consecutive-differences",
"question__hide": false,
- "total_acs": 132574,
- "total_submitted": 228370,
+ "total_acs": 133217,
+ "total_submitted": 229296,
"frontend_question_id": 967,
"is_new_question": false
},
@@ -50707,8 +51305,8 @@
"question__title": "Vowel Spellchecker",
"question__title_slug": "vowel-spellchecker",
"question__hide": false,
- "total_acs": 41613,
- "total_submitted": 81007,
+ "total_acs": 41789,
+ "total_submitted": 81307,
"frontend_question_id": 966,
"is_new_question": false
},
@@ -50730,8 +51328,8 @@
"question__title": "Univalued Binary Tree",
"question__title_slug": "univalued-binary-tree",
"question__hide": false,
- "total_acs": 220973,
- "total_submitted": 311537,
+ "total_acs": 222564,
+ "total_submitted": 313434,
"frontend_question_id": 965,
"is_new_question": false
},
@@ -50753,8 +51351,8 @@
"question__title": "Least Operators to Express Number",
"question__title_slug": "least-operators-to-express-number",
"question__hide": false,
- "total_acs": 9913,
- "total_submitted": 20433,
+ "total_acs": 9982,
+ "total_submitted": 20564,
"frontend_question_id": 964,
"is_new_question": false
},
@@ -50776,8 +51374,8 @@
"question__title": "Minimum Area Rectangle II",
"question__title_slug": "minimum-area-rectangle-ii",
"question__hide": false,
- "total_acs": 27737,
- "total_submitted": 50602,
+ "total_acs": 28348,
+ "total_submitted": 51584,
"frontend_question_id": 963,
"is_new_question": false
},
@@ -50799,8 +51397,8 @@
"question__title": "Maximum Width Ramp",
"question__title_slug": "maximum-width-ramp",
"question__hide": false,
- "total_acs": 47378,
- "total_submitted": 94673,
+ "total_acs": 47975,
+ "total_submitted": 95619,
"frontend_question_id": 962,
"is_new_question": false
},
@@ -50822,8 +51420,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": 236382,
- "total_submitted": 308072,
+ "total_acs": 237972,
+ "total_submitted": 309923,
"frontend_question_id": 961,
"is_new_question": false
},
@@ -50845,8 +51443,8 @@
"question__title": "Delete Columns to Make Sorted III",
"question__title_slug": "delete-columns-to-make-sorted-iii",
"question__hide": false,
- "total_acs": 14495,
- "total_submitted": 24998,
+ "total_acs": 14649,
+ "total_submitted": 25232,
"frontend_question_id": 960,
"is_new_question": false
},
@@ -50868,8 +51466,8 @@
"question__title": "Regions Cut By Slashes",
"question__title_slug": "regions-cut-by-slashes",
"question__hide": false,
- "total_acs": 51302,
- "total_submitted": 73927,
+ "total_acs": 51542,
+ "total_submitted": 74242,
"frontend_question_id": 959,
"is_new_question": false
},
@@ -50891,8 +51489,8 @@
"question__title": "Check Completeness of a Binary Tree",
"question__title_slug": "check-completeness-of-a-binary-tree",
"question__hide": false,
- "total_acs": 234352,
- "total_submitted": 411714,
+ "total_acs": 236888,
+ "total_submitted": 415709,
"frontend_question_id": 958,
"is_new_question": false
},
@@ -50914,8 +51512,8 @@
"question__title": "Prison Cells After N Days",
"question__title_slug": "prison-cells-after-n-days",
"question__hide": false,
- "total_acs": 160179,
- "total_submitted": 411221,
+ "total_acs": 160653,
+ "total_submitted": 412238,
"frontend_question_id": 957,
"is_new_question": false
},
@@ -50937,8 +51535,8 @@
"question__title": "Tallest Billboard",
"question__title_slug": "tallest-billboard",
"question__hide": false,
- "total_acs": 58705,
- "total_submitted": 112304,
+ "total_acs": 59057,
+ "total_submitted": 113055,
"frontend_question_id": 956,
"is_new_question": false
},
@@ -50960,8 +51558,8 @@
"question__title": "Delete Columns to Make Sorted II",
"question__title_slug": "delete-columns-to-make-sorted-ii",
"question__hide": false,
- "total_acs": 20208,
- "total_submitted": 57413,
+ "total_acs": 20342,
+ "total_submitted": 57711,
"frontend_question_id": 955,
"is_new_question": false
},
@@ -50983,8 +51581,8 @@
"question__title": "Array of Doubled Pairs",
"question__title_slug": "array-of-doubled-pairs",
"question__hide": false,
- "total_acs": 87867,
- "total_submitted": 224360,
+ "total_acs": 88238,
+ "total_submitted": 225213,
"frontend_question_id": 954,
"is_new_question": false
},
@@ -51006,8 +51604,8 @@
"question__title": "Verifying an Alien Dictionary",
"question__title_slug": "verifying-an-alien-dictionary",
"question__hide": false,
- "total_acs": 506491,
- "total_submitted": 920589,
+ "total_acs": 509468,
+ "total_submitted": 925291,
"frontend_question_id": 953,
"is_new_question": false
},
@@ -51029,8 +51627,8 @@
"question__title": "Largest Component Size by Common Factor",
"question__title_slug": "largest-component-size-by-common-factor",
"question__hide": false,
- "total_acs": 53665,
- "total_submitted": 131884,
+ "total_acs": 53920,
+ "total_submitted": 132405,
"frontend_question_id": 952,
"is_new_question": false
},
@@ -51052,8 +51650,8 @@
"question__title": "Flip Equivalent Binary Trees",
"question__title_slug": "flip-equivalent-binary-trees",
"question__hide": false,
- "total_acs": 147100,
- "total_submitted": 219726,
+ "total_acs": 147874,
+ "total_submitted": 220872,
"frontend_question_id": 951,
"is_new_question": false
},
@@ -51075,8 +51673,8 @@
"question__title": "Reveal Cards In Increasing Order",
"question__title_slug": "reveal-cards-in-increasing-order",
"question__hide": false,
- "total_acs": 193319,
- "total_submitted": 233233,
+ "total_acs": 195506,
+ "total_submitted": 235712,
"frontend_question_id": 950,
"is_new_question": false
},
@@ -51098,8 +51696,8 @@
"question__title": "Largest Time for Given Digits",
"question__title_slug": "largest-time-for-given-digits",
"question__hide": false,
- "total_acs": 87051,
- "total_submitted": 247377,
+ "total_acs": 87566,
+ "total_submitted": 248634,
"frontend_question_id": 949,
"is_new_question": false
},
@@ -51121,8 +51719,8 @@
"question__title": "Bag of Tokens",
"question__title_slug": "bag-of-tokens",
"question__hide": false,
- "total_acs": 226861,
- "total_submitted": 384742,
+ "total_acs": 228569,
+ "total_submitted": 387539,
"frontend_question_id": 948,
"is_new_question": false
},
@@ -51144,8 +51742,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": 209004,
- "total_submitted": 354927,
+ "total_acs": 212390,
+ "total_submitted": 360553,
"frontend_question_id": 947,
"is_new_question": false
},
@@ -51167,8 +51765,8 @@
"question__title": "Validate Stack Sequences",
"question__title_slug": "validate-stack-sequences",
"question__hide": false,
- "total_acs": 305570,
- "total_submitted": 439845,
+ "total_acs": 307737,
+ "total_submitted": 442851,
"frontend_question_id": 946,
"is_new_question": false
},
@@ -51184,14 +51782,14 @@
{
"stat": {
"question_id": 982,
- "question__article__live": null,
- "question__article__slug": null,
- "question__article__has_video_solution": null,
+ "question__article__live": true,
+ "question__article__slug": "minimum-increment-to-make-array-unique",
+ "question__article__has_video_solution": false,
"question__title": "Minimum Increment to Make Array Unique",
"question__title_slug": "minimum-increment-to-make-array-unique",
"question__hide": false,
- "total_acs": 88280,
- "total_submitted": 168187,
+ "total_acs": 234514,
+ "total_submitted": 390903,
"frontend_question_id": 945,
"is_new_question": false
},
@@ -51213,8 +51811,8 @@
"question__title": "Delete Columns to Make Sorted",
"question__title_slug": "delete-columns-to-make-sorted",
"question__hide": false,
- "total_acs": 189269,
- "total_submitted": 253674,
+ "total_acs": 190403,
+ "total_submitted": 255124,
"frontend_question_id": 944,
"is_new_question": false
},
@@ -51236,8 +51834,8 @@
"question__title": "Find the Shortest Superstring",
"question__title_slug": "find-the-shortest-superstring",
"question__hide": false,
- "total_acs": 28910,
- "total_submitted": 65891,
+ "total_acs": 29055,
+ "total_submitted": 66188,
"frontend_question_id": 943,
"is_new_question": false
},
@@ -51259,8 +51857,8 @@
"question__title": "DI String Match",
"question__title_slug": "di-string-match",
"question__hide": false,
- "total_acs": 156032,
- "total_submitted": 198309,
+ "total_acs": 157692,
+ "total_submitted": 200146,
"frontend_question_id": 942,
"is_new_question": false
},
@@ -51282,8 +51880,8 @@
"question__title": "Valid Mountain Array",
"question__title_slug": "valid-mountain-array",
"question__hide": false,
- "total_acs": 424211,
- "total_submitted": 1268604,
+ "total_acs": 427347,
+ "total_submitted": 1277506,
"frontend_question_id": 941,
"is_new_question": false
},
@@ -51305,8 +51903,8 @@
"question__title": "Distinct Subsequences II",
"question__title_slug": "distinct-subsequences-ii",
"question__hide": false,
- "total_acs": 39414,
- "total_submitted": 91450,
+ "total_acs": 39743,
+ "total_submitted": 92241,
"frontend_question_id": 940,
"is_new_question": false
},
@@ -51328,8 +51926,8 @@
"question__title": "Minimum Area Rectangle",
"question__title_slug": "minimum-area-rectangle",
"question__hide": false,
- "total_acs": 140922,
- "total_submitted": 262239,
+ "total_acs": 142903,
+ "total_submitted": 265375,
"frontend_question_id": 939,
"is_new_question": false
},
@@ -51351,8 +51949,8 @@
"question__title": "Range Sum of BST",
"question__title_slug": "range-sum-of-bst",
"question__hide": false,
- "total_acs": 1055190,
- "total_submitted": 1214825,
+ "total_acs": 1066083,
+ "total_submitted": 1226933,
"frontend_question_id": 938,
"is_new_question": false
},
@@ -51374,8 +51972,8 @@
"question__title": "Reorder Data in Log Files",
"question__title_slug": "reorder-data-in-log-files",
"question__hide": false,
- "total_acs": 364452,
- "total_submitted": 645934,
+ "total_acs": 365782,
+ "total_submitted": 648082,
"frontend_question_id": 937,
"is_new_question": false
},
@@ -51397,8 +51995,8 @@
"question__title": "Stamping The Sequence",
"question__title_slug": "stamping-the-sequence",
"question__hide": false,
- "total_acs": 58482,
- "total_submitted": 93602,
+ "total_acs": 58586,
+ "total_submitted": 93788,
"frontend_question_id": 936,
"is_new_question": false
},
@@ -51420,8 +52018,8 @@
"question__title": "Knight Dialer",
"question__title_slug": "knight-dialer",
"question__hide": false,
- "total_acs": 174306,
- "total_submitted": 289697,
+ "total_acs": 175367,
+ "total_submitted": 291046,
"frontend_question_id": 935,
"is_new_question": false
},
@@ -51443,8 +52041,8 @@
"question__title": "Shortest Bridge",
"question__title_slug": "shortest-bridge",
"question__hide": false,
- "total_acs": 204696,
- "total_submitted": 354785,
+ "total_acs": 206349,
+ "total_submitted": 357427,
"frontend_question_id": 934,
"is_new_question": false
},
@@ -51466,8 +52064,8 @@
"question__title": "Number of Recent Calls",
"question__title_slug": "number-of-recent-calls",
"question__hide": false,
- "total_acs": 260617,
- "total_submitted": 346014,
+ "total_acs": 268287,
+ "total_submitted": 355421,
"frontend_question_id": 933,
"is_new_question": false
},
@@ -51489,8 +52087,8 @@
"question__title": "Beautiful Array",
"question__title_slug": "beautiful-array",
"question__hide": false,
- "total_acs": 44313,
- "total_submitted": 67380,
+ "total_acs": 44556,
+ "total_submitted": 67726,
"frontend_question_id": 932,
"is_new_question": false
},
@@ -51512,8 +52110,8 @@
"question__title": "Minimum Falling Path Sum",
"question__title_slug": "minimum-falling-path-sum",
"question__hide": false,
- "total_acs": 433041,
- "total_submitted": 676789,
+ "total_acs": 441394,
+ "total_submitted": 692577,
"frontend_question_id": 931,
"is_new_question": false
},
@@ -51535,8 +52133,8 @@
"question__title": "Binary Subarrays With Sum",
"question__title_slug": "binary-subarrays-with-sum",
"question__hide": false,
- "total_acs": 233698,
- "total_submitted": 374201,
+ "total_acs": 245158,
+ "total_submitted": 389542,
"frontend_question_id": 930,
"is_new_question": false
},
@@ -51558,8 +52156,8 @@
"question__title": "Unique Email Addresses",
"question__title_slug": "unique-email-addresses",
"question__hide": false,
- "total_acs": 486007,
- "total_submitted": 723420,
+ "total_acs": 489271,
+ "total_submitted": 727966,
"frontend_question_id": 929,
"is_new_question": false
},
@@ -51581,8 +52179,8 @@
"question__title": "Minimize Malware Spread II",
"question__title_slug": "minimize-malware-spread-ii",
"question__hide": false,
- "total_acs": 22444,
- "total_submitted": 51354,
+ "total_acs": 22878,
+ "total_submitted": 52185,
"frontend_question_id": 928,
"is_new_question": false
},
@@ -51604,8 +52202,8 @@
"question__title": "Three Equal Parts",
"question__title_slug": "three-equal-parts",
"question__hide": false,
- "total_acs": 29885,
- "total_submitted": 75102,
+ "total_acs": 30021,
+ "total_submitted": 75338,
"frontend_question_id": 927,
"is_new_question": false
},
@@ -51627,8 +52225,8 @@
"question__title": "Flip String to Monotone Increasing",
"question__title_slug": "flip-string-to-monotone-increasing",
"question__hide": false,
- "total_acs": 190235,
- "total_submitted": 309709,
+ "total_acs": 191170,
+ "total_submitted": 311189,
"frontend_question_id": 926,
"is_new_question": false
},
@@ -51650,8 +52248,8 @@
"question__title": "Long Pressed Name",
"question__title_slug": "long-pressed-name",
"question__hide": false,
- "total_acs": 141584,
- "total_submitted": 438118,
+ "total_acs": 143144,
+ "total_submitted": 442927,
"frontend_question_id": 925,
"is_new_question": false
},
@@ -51673,8 +52271,8 @@
"question__title": "Minimize Malware Spread",
"question__title_slug": "minimize-malware-spread",
"question__hide": false,
- "total_acs": 51959,
- "total_submitted": 123551,
+ "total_acs": 52534,
+ "total_submitted": 124853,
"frontend_question_id": 924,
"is_new_question": false
},
@@ -51696,8 +52294,8 @@
"question__title": "3Sum With Multiplicity",
"question__title_slug": "3sum-with-multiplicity",
"question__hide": false,
- "total_acs": 103008,
- "total_submitted": 226773,
+ "total_acs": 103396,
+ "total_submitted": 227552,
"frontend_question_id": 923,
"is_new_question": false
},
@@ -51719,8 +52317,8 @@
"question__title": "Sort Array By Parity II",
"question__title_slug": "sort-array-by-parity-ii",
"question__hide": false,
- "total_acs": 254667,
- "total_submitted": 360037,
+ "total_acs": 256940,
+ "total_submitted": 363081,
"frontend_question_id": 922,
"is_new_question": false
},
@@ -51742,8 +52340,8 @@
"question__title": "Minimum Add to Make Parentheses Valid",
"question__title_slug": "minimum-add-to-make-parentheses-valid",
"question__hide": false,
- "total_acs": 349795,
- "total_submitted": 465505,
+ "total_acs": 356451,
+ "total_submitted": 474718,
"frontend_question_id": 921,
"is_new_question": false
},
@@ -51765,8 +52363,8 @@
"question__title": "Number of Music Playlists",
"question__title_slug": "number-of-music-playlists",
"question__hide": false,
- "total_acs": 69519,
- "total_submitted": 114962,
+ "total_acs": 69801,
+ "total_submitted": 115482,
"frontend_question_id": 920,
"is_new_question": false
},
@@ -51788,8 +52386,8 @@
"question__title": "Complete Binary Tree Inserter",
"question__title_slug": "complete-binary-tree-inserter",
"question__hide": false,
- "total_acs": 54700,
- "total_submitted": 83381,
+ "total_acs": 55413,
+ "total_submitted": 84372,
"frontend_question_id": 919,
"is_new_question": false
},
@@ -51811,8 +52409,8 @@
"question__title": "Maximum Sum Circular Subarray",
"question__title_slug": "maximum-sum-circular-subarray",
"question__hide": false,
- "total_acs": 262659,
- "total_submitted": 584376,
+ "total_acs": 266408,
+ "total_submitted": 590934,
"frontend_question_id": 918,
"is_new_question": false
},
@@ -51834,8 +52432,8 @@
"question__title": "Reverse Only Letters",
"question__title_slug": "reverse-only-letters",
"question__hide": false,
- "total_acs": 217463,
- "total_submitted": 336359,
+ "total_acs": 220904,
+ "total_submitted": 340722,
"frontend_question_id": 917,
"is_new_question": false
},
@@ -51857,8 +52455,8 @@
"question__title": "Word Subsets",
"question__title_slug": "word-subsets",
"question__hide": false,
- "total_acs": 114408,
- "total_submitted": 219445,
+ "total_acs": 114720,
+ "total_submitted": 220269,
"frontend_question_id": 916,
"is_new_question": false
},
@@ -51880,8 +52478,8 @@
"question__title": "Partition Array into Disjoint Intervals",
"question__title_slug": "partition-array-into-disjoint-intervals",
"question__hide": false,
- "total_acs": 82686,
- "total_submitted": 169465,
+ "total_acs": 83075,
+ "total_submitted": 170295,
"frontend_question_id": 915,
"is_new_question": false
},
@@ -51903,8 +52501,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": 121836,
- "total_submitted": 406689,
+ "total_acs": 122954,
+ "total_submitted": 410687,
"frontend_question_id": 914,
"is_new_question": false
},
@@ -51926,8 +52524,8 @@
"question__title": "Cat and Mouse",
"question__title_slug": "cat-and-mouse",
"question__hide": false,
- "total_acs": 19687,
- "total_submitted": 58047,
+ "total_acs": 19828,
+ "total_submitted": 58507,
"frontend_question_id": 913,
"is_new_question": false
},
@@ -51949,8 +52547,8 @@
"question__title": "Sort an Array",
"question__title_slug": "sort-an-array",
"question__hide": false,
- "total_acs": 609924,
- "total_submitted": 1082275,
+ "total_acs": 619035,
+ "total_submitted": 1100676,
"frontend_question_id": 912,
"is_new_question": false
},
@@ -51972,8 +52570,8 @@
"question__title": "Online Election",
"question__title_slug": "online-election",
"question__hide": false,
- "total_acs": 58837,
- "total_submitted": 113235,
+ "total_acs": 59586,
+ "total_submitted": 114598,
"frontend_question_id": 911,
"is_new_question": false
},
@@ -51995,8 +52593,8 @@
"question__title": "Smallest Range II",
"question__title_slug": "smallest-range-ii",
"question__hide": false,
- "total_acs": 54480,
- "total_submitted": 150229,
+ "total_acs": 54814,
+ "total_submitted": 151017,
"frontend_question_id": 910,
"is_new_question": false
},
@@ -52018,8 +52616,8 @@
"question__title": "Snakes and Ladders",
"question__title_slug": "snakes-and-ladders",
"question__hide": false,
- "total_acs": 186370,
- "total_submitted": 425767,
+ "total_acs": 189583,
+ "total_submitted": 432909,
"frontend_question_id": 909,
"is_new_question": false
},
@@ -52041,8 +52639,8 @@
"question__title": "Smallest Range I",
"question__title_slug": "smallest-range-i",
"question__hide": false,
- "total_acs": 89665,
- "total_submitted": 127993,
+ "total_acs": 90765,
+ "total_submitted": 129364,
"frontend_question_id": 908,
"is_new_question": false
},
@@ -52064,8 +52662,8 @@
"question__title": "Sum of Subarray Minimums",
"question__title_slug": "sum-of-subarray-minimums",
"question__hide": false,
- "total_acs": 255786,
- "total_submitted": 684269,
+ "total_acs": 260137,
+ "total_submitted": 696991,
"frontend_question_id": 907,
"is_new_question": false
},
@@ -52087,8 +52685,8 @@
"question__title": "Super Palindromes",
"question__title_slug": "super-palindromes",
"question__hide": false,
- "total_acs": 24319,
- "total_submitted": 62502,
+ "total_acs": 24441,
+ "total_submitted": 62741,
"frontend_question_id": 906,
"is_new_question": false
},
@@ -52110,8 +52708,8 @@
"question__title": "Sort Array By Parity",
"question__title_slug": "sort-array-by-parity",
"question__hide": false,
- "total_acs": 800997,
- "total_submitted": 1050735,
+ "total_acs": 807286,
+ "total_submitted": 1058884,
"frontend_question_id": 905,
"is_new_question": false
},
@@ -52133,8 +52731,8 @@
"question__title": "Fruit Into Baskets",
"question__title_slug": "fruit-into-baskets",
"question__hide": false,
- "total_acs": 407570,
- "total_submitted": 918692,
+ "total_acs": 413661,
+ "total_submitted": 930078,
"frontend_question_id": 904,
"is_new_question": false
},
@@ -52156,8 +52754,8 @@
"question__title": "Valid Permutations for DI Sequence",
"question__title_slug": "valid-permutations-for-di-sequence",
"question__hide": false,
- "total_acs": 15857,
- "total_submitted": 27688,
+ "total_acs": 15990,
+ "total_submitted": 27913,
"frontend_question_id": 903,
"is_new_question": false
},
@@ -52179,8 +52777,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": 44443,
- "total_submitted": 104764,
+ "total_acs": 44687,
+ "total_submitted": 105188,
"frontend_question_id": 902,
"is_new_question": false
},
@@ -52202,8 +52800,8 @@
"question__title": "Online Stock Span",
"question__title_slug": "online-stock-span",
"question__hide": false,
- "total_acs": 314967,
- "total_submitted": 478157,
+ "total_acs": 321977,
+ "total_submitted": 487961,
"frontend_question_id": 901,
"is_new_question": false
},
@@ -52225,8 +52823,8 @@
"question__title": "RLE Iterator",
"question__title_slug": "rle-iterator",
"question__hide": false,
- "total_acs": 73584,
- "total_submitted": 123599,
+ "total_acs": 74090,
+ "total_submitted": 124398,
"frontend_question_id": 900,
"is_new_question": false
},
@@ -52248,8 +52846,8 @@
"question__title": "Orderly Queue",
"question__title_slug": "orderly-queue",
"question__hide": false,
- "total_acs": 69900,
- "total_submitted": 106021,
+ "total_acs": 70238,
+ "total_submitted": 106544,
"frontend_question_id": 899,
"is_new_question": false
},
@@ -52271,8 +52869,8 @@
"question__title": "Bitwise ORs of Subarrays",
"question__title_slug": "bitwise-ors-of-subarrays",
"question__hide": false,
- "total_acs": 35920,
- "total_submitted": 92614,
+ "total_acs": 36285,
+ "total_submitted": 93245,
"frontend_question_id": 898,
"is_new_question": false
},
@@ -52294,8 +52892,8 @@
"question__title": "Increasing Order Search Tree",
"question__title_slug": "increasing-order-search-tree",
"question__hide": false,
- "total_acs": 284557,
- "total_submitted": 363415,
+ "total_acs": 286335,
+ "total_submitted": 365587,
"frontend_question_id": 897,
"is_new_question": false
},
@@ -52317,8 +52915,8 @@
"question__title": "Monotonic Array",
"question__title_slug": "monotonic-array",
"question__hide": false,
- "total_acs": 429922,
- "total_submitted": 702890,
+ "total_acs": 435031,
+ "total_submitted": 710741,
"frontend_question_id": 896,
"is_new_question": false
},
@@ -52340,8 +52938,8 @@
"question__title": "Maximum Frequency Stack",
"question__title_slug": "maximum-frequency-stack",
"question__hide": false,
- "total_acs": 173854,
- "total_submitted": 261976,
+ "total_acs": 175024,
+ "total_submitted": 263609,
"frontend_question_id": 895,
"is_new_question": false
},
@@ -52363,8 +52961,8 @@
"question__title": "All Possible Full Binary Trees",
"question__title_slug": "all-possible-full-binary-trees",
"question__hide": false,
- "total_acs": 182710,
- "total_submitted": 220986,
+ "total_acs": 184086,
+ "total_submitted": 222635,
"frontend_question_id": 894,
"is_new_question": false
},
@@ -52386,8 +52984,8 @@
"question__title": "Groups of Special-Equivalent Strings",
"question__title_slug": "groups-of-special-equivalent-strings",
"question__hide": false,
- "total_acs": 49443,
- "total_submitted": 68936,
+ "total_acs": 49734,
+ "total_submitted": 69263,
"frontend_question_id": 893,
"is_new_question": false
},
@@ -52409,8 +53007,8 @@
"question__title": "Surface Area of 3D Shapes",
"question__title_slug": "surface-area-of-3d-shapes",
"question__hide": false,
- "total_acs": 40168,
- "total_submitted": 60878,
+ "total_acs": 40529,
+ "total_submitted": 61345,
"frontend_question_id": 892,
"is_new_question": false
},
@@ -52432,8 +53030,8 @@
"question__title": "Sum of Subsequence Widths",
"question__title_slug": "sum-of-subsequence-widths",
"question__hide": false,
- "total_acs": 21208,
- "total_submitted": 56048,
+ "total_acs": 21331,
+ "total_submitted": 56256,
"frontend_question_id": 891,
"is_new_question": false
},
@@ -52455,8 +53053,8 @@
"question__title": "Find and Replace Pattern",
"question__title_slug": "find-and-replace-pattern",
"question__hide": false,
- "total_acs": 186096,
- "total_submitted": 242210,
+ "total_acs": 187222,
+ "total_submitted": 243708,
"frontend_question_id": 890,
"is_new_question": false
},
@@ -52478,8 +53076,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": 101821,
- "total_submitted": 142587,
+ "total_acs": 102515,
+ "total_submitted": 143506,
"frontend_question_id": 889,
"is_new_question": false
},
@@ -52501,8 +53099,8 @@
"question__title": "Fair Candy Swap",
"question__title_slug": "fair-candy-swap",
"question__hide": false,
- "total_acs": 122540,
- "total_submitted": 198408,
+ "total_acs": 123871,
+ "total_submitted": 200292,
"frontend_question_id": 888,
"is_new_question": false
},
@@ -52524,8 +53122,8 @@
"question__title": "Super Egg Drop",
"question__title_slug": "super-egg-drop",
"question__hide": false,
- "total_acs": 71745,
- "total_submitted": 259141,
+ "total_acs": 72446,
+ "total_submitted": 261498,
"frontend_question_id": 887,
"is_new_question": false
},
@@ -52547,8 +53145,8 @@
"question__title": "Possible Bipartition",
"question__title_slug": "possible-bipartition",
"question__hide": false,
- "total_acs": 209211,
- "total_submitted": 413393,
+ "total_acs": 210463,
+ "total_submitted": 415672,
"frontend_question_id": 886,
"is_new_question": false
},
@@ -52570,8 +53168,8 @@
"question__title": "Spiral Matrix III",
"question__title_slug": "spiral-matrix-iii",
"question__hide": false,
- "total_acs": 49797,
- "total_submitted": 66842,
+ "total_acs": 50150,
+ "total_submitted": 67260,
"frontend_question_id": 885,
"is_new_question": false
},
@@ -52593,8 +53191,8 @@
"question__title": "Uncommon Words from Two Sentences",
"question__title_slug": "uncommon-words-from-two-sentences",
"question__hide": false,
- "total_acs": 139848,
- "total_submitted": 207649,
+ "total_acs": 140965,
+ "total_submitted": 209104,
"frontend_question_id": 884,
"is_new_question": false
},
@@ -52616,8 +53214,8 @@
"question__title": "Projection Area of 3D Shapes",
"question__title_slug": "projection-area-of-3d-shapes",
"question__hide": false,
- "total_acs": 56036,
- "total_submitted": 77111,
+ "total_acs": 56540,
+ "total_submitted": 77676,
"frontend_question_id": 883,
"is_new_question": false
},
@@ -52639,8 +53237,8 @@
"question__title": "Reachable Nodes In Subdivided Graph",
"question__title_slug": "reachable-nodes-in-subdivided-graph",
"question__hide": false,
- "total_acs": 27711,
- "total_submitted": 55027,
+ "total_acs": 27960,
+ "total_submitted": 55458,
"frontend_question_id": 882,
"is_new_question": false
},
@@ -52662,8 +53260,8 @@
"question__title": "Boats to Save People",
"question__title_slug": "boats-to-save-people",
"question__hide": false,
- "total_acs": 413890,
- "total_submitted": 697067,
+ "total_acs": 417292,
+ "total_submitted": 702398,
"frontend_question_id": 881,
"is_new_question": false
},
@@ -52685,8 +53283,8 @@
"question__title": "Decoded String at Index",
"question__title_slug": "decoded-string-at-index",
"question__hide": false,
- "total_acs": 97180,
- "total_submitted": 266756,
+ "total_acs": 97455,
+ "total_submitted": 267375,
"frontend_question_id": 880,
"is_new_question": false
},
@@ -52708,8 +53306,8 @@
"question__title": "Generate Random Point in a Circle",
"question__title_slug": "generate-random-point-in-a-circle",
"question__hide": false,
- "total_acs": 41120,
- "total_submitted": 103057,
+ "total_acs": 41355,
+ "total_submitted": 103616,
"frontend_question_id": 478,
"is_new_question": false
},
@@ -52731,8 +53329,8 @@
"question__title": "Random Point in Non-overlapping Rectangles",
"question__title_slug": "random-point-in-non-overlapping-rectangles",
"question__hide": false,
- "total_acs": 41146,
- "total_submitted": 102839,
+ "total_acs": 41352,
+ "total_submitted": 103244,
"frontend_question_id": 497,
"is_new_question": false
},
@@ -52754,8 +53352,8 @@
"question__title": "Random Flip Matrix",
"question__title_slug": "random-flip-matrix",
"question__hide": false,
- "total_acs": 21521,
- "total_submitted": 51216,
+ "total_acs": 21698,
+ "total_submitted": 51540,
"frontend_question_id": 519,
"is_new_question": false
},
@@ -52777,8 +53375,8 @@
"question__title": "Random Pick with Weight",
"question__title_slug": "random-pick-with-weight",
"question__hide": false,
- "total_acs": 459646,
- "total_submitted": 979905,
+ "total_acs": 465250,
+ "total_submitted": 990925,
"frontend_question_id": 528,
"is_new_question": false
},
@@ -52800,8 +53398,8 @@
"question__title": "Profitable Schemes",
"question__title_slug": "profitable-schemes",
"question__hide": false,
- "total_acs": 63006,
- "total_submitted": 130364,
+ "total_acs": 63412,
+ "total_submitted": 131292,
"frontend_question_id": 879,
"is_new_question": false
},
@@ -52823,8 +53421,8 @@
"question__title": "Nth Magical Number",
"question__title_slug": "nth-magical-number",
"question__hide": false,
- "total_acs": 38472,
- "total_submitted": 108747,
+ "total_acs": 38769,
+ "total_submitted": 109531,
"frontend_question_id": 878,
"is_new_question": false
},
@@ -52846,8 +53444,8 @@
"question__title": "Stone Game",
"question__title_slug": "stone-game",
"question__hide": false,
- "total_acs": 235188,
- "total_submitted": 333254,
+ "total_acs": 237777,
+ "total_submitted": 336586,
"frontend_question_id": 877,
"is_new_question": false
},
@@ -52869,8 +53467,8 @@
"question__title": "Middle of the Linked List",
"question__title_slug": "middle-of-the-linked-list",
"question__hide": false,
- "total_acs": 1924033,
- "total_submitted": 2448364,
+ "total_acs": 1955421,
+ "total_submitted": 2484003,
"frontend_question_id": 876,
"is_new_question": false
},
@@ -52892,8 +53490,8 @@
"question__title": "Koko Eating Bananas",
"question__title_slug": "koko-eating-bananas",
"question__hide": false,
- "total_acs": 658188,
- "total_submitted": 1350841,
+ "total_acs": 683010,
+ "total_submitted": 1405206,
"frontend_question_id": 875,
"is_new_question": false
},
@@ -52915,8 +53513,8 @@
"question__title": "Walking Robot Simulation",
"question__title_slug": "walking-robot-simulation",
"question__hide": false,
- "total_acs": 41104,
- "total_submitted": 102377,
+ "total_acs": 41377,
+ "total_submitted": 102901,
"frontend_question_id": 874,
"is_new_question": false
},
@@ -52938,8 +53536,8 @@
"question__title": "Length of Longest Fibonacci Subsequence",
"question__title_slug": "length-of-longest-fibonacci-subsequence",
"question__hide": false,
- "total_acs": 63895,
- "total_submitted": 132094,
+ "total_acs": 64454,
+ "total_submitted": 133176,
"frontend_question_id": 873,
"is_new_question": false
},
@@ -52961,8 +53559,8 @@
"question__title": "Leaf-Similar Trees",
"question__title_slug": "leaf-similar-trees",
"question__hide": false,
- "total_acs": 473837,
- "total_submitted": 676105,
+ "total_acs": 481552,
+ "total_submitted": 687342,
"frontend_question_id": 872,
"is_new_question": false
},
@@ -52984,8 +53582,8 @@
"question__title": "Implement Rand10() Using Rand7()",
"question__title_slug": "implement-rand10-using-rand7",
"question__hide": false,
- "total_acs": 83277,
- "total_submitted": 181471,
+ "total_acs": 83946,
+ "total_submitted": 182908,
"frontend_question_id": 470,
"is_new_question": false
},
@@ -53007,8 +53605,8 @@
"question__title": "Minimum Number of Refueling Stops",
"question__title_slug": "minimum-number-of-refueling-stops",
"question__hide": false,
- "total_acs": 136012,
- "total_submitted": 339520,
+ "total_acs": 136776,
+ "total_submitted": 341338,
"frontend_question_id": 871,
"is_new_question": false
},
@@ -53030,8 +53628,8 @@
"question__title": "Advantage Shuffle",
"question__title_slug": "advantage-shuffle",
"question__hide": false,
- "total_acs": 67064,
- "total_submitted": 127642,
+ "total_acs": 67414,
+ "total_submitted": 128181,
"frontend_question_id": 870,
"is_new_question": false
},
@@ -53053,8 +53651,8 @@
"question__title": "Reordered Power of 2",
"question__title_slug": "reordered-power-of-2",
"question__hide": false,
- "total_acs": 113176,
- "total_submitted": 180574,
+ "total_acs": 113626,
+ "total_submitted": 181374,
"frontend_question_id": 869,
"is_new_question": false
},
@@ -53076,8 +53674,8 @@
"question__title": "Binary Gap",
"question__title_slug": "binary-gap",
"question__hide": false,
- "total_acs": 82188,
- "total_submitted": 129499,
+ "total_acs": 82884,
+ "total_submitted": 130478,
"frontend_question_id": 868,
"is_new_question": false
},
@@ -53099,8 +53697,8 @@
"question__title": "Transpose Matrix",
"question__title_slug": "transpose-matrix",
"question__hide": false,
- "total_acs": 398920,
- "total_submitted": 556689,
+ "total_acs": 403300,
+ "total_submitted": 561697,
"frontend_question_id": 867,
"is_new_question": false
},
@@ -53122,8 +53720,8 @@
"question__title": "Prime Palindrome",
"question__title_slug": "prime-palindrome",
"question__hide": false,
- "total_acs": 32944,
- "total_submitted": 126797,
+ "total_acs": 33351,
+ "total_submitted": 128257,
"frontend_question_id": 866,
"is_new_question": false
},
@@ -53145,8 +53743,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": 138434,
- "total_submitted": 195906,
+ "total_acs": 139382,
+ "total_submitted": 197050,
"frontend_question_id": 865,
"is_new_question": false
},
@@ -53168,8 +53766,8 @@
"question__title": "Shortest Path to Get All Keys",
"question__title_slug": "shortest-path-to-get-all-keys",
"question__hide": false,
- "total_acs": 75975,
- "total_submitted": 141782,
+ "total_acs": 76494,
+ "total_submitted": 142827,
"frontend_question_id": 864,
"is_new_question": false
},
@@ -53191,8 +53789,8 @@
"question__title": "Random Pick with Blacklist",
"question__title_slug": "random-pick-with-blacklist",
"question__hide": false,
- "total_acs": 41960,
- "total_submitted": 125558,
+ "total_acs": 42185,
+ "total_submitted": 126159,
"frontend_question_id": 710,
"is_new_question": false
},
@@ -53214,8 +53812,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": 440988,
- "total_submitted": 683728,
+ "total_acs": 447165,
+ "total_submitted": 692353,
"frontend_question_id": 863,
"is_new_question": false
},
@@ -53237,8 +53835,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": 99374,
- "total_submitted": 382037,
+ "total_acs": 100279,
+ "total_submitted": 385073,
"frontend_question_id": 862,
"is_new_question": false
},
@@ -53260,8 +53858,8 @@
"question__title": "Score After Flipping Matrix",
"question__title_slug": "score-after-flipping-matrix",
"question__hide": false,
- "total_acs": 142962,
- "total_submitted": 177742,
+ "total_acs": 144129,
+ "total_submitted": 179248,
"frontend_question_id": 861,
"is_new_question": false
},
@@ -53283,8 +53881,8 @@
"question__title": "Lemonade Change",
"question__title_slug": "lemonade-change",
"question__hide": false,
- "total_acs": 186064,
- "total_submitted": 348270,
+ "total_acs": 193648,
+ "total_submitted": 361496,
"frontend_question_id": 860,
"is_new_question": false
},
@@ -53306,8 +53904,8 @@
"question__title": "Buddy Strings",
"question__title_slug": "buddy-strings",
"question__hide": false,
- "total_acs": 243489,
- "total_submitted": 735073,
+ "total_acs": 244929,
+ "total_submitted": 739252,
"frontend_question_id": 859,
"is_new_question": false
},
@@ -53329,8 +53927,8 @@
"question__title": "Mirror Reflection",
"question__title_slug": "mirror-reflection",
"question__hide": false,
- "total_acs": 79994,
- "total_submitted": 127829,
+ "total_acs": 80191,
+ "total_submitted": 128184,
"frontend_question_id": 858,
"is_new_question": false
},
@@ -53352,8 +53950,8 @@
"question__title": "Minimum Cost to Hire K Workers",
"question__title_slug": "minimum-cost-to-hire-k-workers",
"question__hide": false,
- "total_acs": 136994,
- "total_submitted": 216544,
+ "total_acs": 138195,
+ "total_submitted": 218217,
"frontend_question_id": 857,
"is_new_question": false
},
@@ -53375,8 +53973,8 @@
"question__title": "Score of Parentheses",
"question__title_slug": "score-of-parentheses",
"question__hide": false,
- "total_acs": 185951,
- "total_submitted": 289878,
+ "total_acs": 187408,
+ "total_submitted": 292217,
"frontend_question_id": 856,
"is_new_question": false
},
@@ -53398,8 +53996,8 @@
"question__title": "Exam Room",
"question__title_slug": "exam-room",
"question__hide": false,
- "total_acs": 60992,
- "total_submitted": 140609,
+ "total_acs": 61619,
+ "total_submitted": 141728,
"frontend_question_id": 855,
"is_new_question": false
},
@@ -53421,8 +54019,8 @@
"question__title": "K-Similar Strings",
"question__title_slug": "k-similar-strings",
"question__hide": false,
- "total_acs": 45975,
- "total_submitted": 115316,
+ "total_acs": 46309,
+ "total_submitted": 115934,
"frontend_question_id": 854,
"is_new_question": false
},
@@ -53444,8 +54042,8 @@
"question__title": "Car Fleet",
"question__title_slug": "car-fleet",
"question__hide": false,
- "total_acs": 258436,
- "total_submitted": 505404,
+ "total_acs": 265199,
+ "total_submitted": 517149,
"frontend_question_id": 853,
"is_new_question": false
},
@@ -53467,8 +54065,8 @@
"question__title": "Peak Index in a Mountain Array",
"question__title_slug": "peak-index-in-a-mountain-array",
"question__hide": false,
- "total_acs": 812800,
- "total_submitted": 1188591,
+ "total_acs": 824680,
+ "total_submitted": 1206858,
"frontend_question_id": 852,
"is_new_question": false
},
@@ -53490,8 +54088,8 @@
"question__title": "Loud and Rich",
"question__title_slug": "loud-and-rich",
"question__hide": false,
- "total_acs": 46294,
- "total_submitted": 77925,
+ "total_acs": 47114,
+ "total_submitted": 79120,
"frontend_question_id": 851,
"is_new_question": false
},
@@ -53513,8 +54111,8 @@
"question__title": "Rectangle Area II",
"question__title_slug": "rectangle-area-ii",
"question__hide": false,
- "total_acs": 35024,
- "total_submitted": 64665,
+ "total_acs": 35152,
+ "total_submitted": 64901,
"frontend_question_id": 850,
"is_new_question": false
},
@@ -53536,8 +54134,8 @@
"question__title": "Maximize Distance to Closest Person",
"question__title_slug": "maximize-distance-to-closest-person",
"question__hide": false,
- "total_acs": 226392,
- "total_submitted": 470198,
+ "total_acs": 227817,
+ "total_submitted": 472685,
"frontend_question_id": 849,
"is_new_question": false
},
@@ -53559,8 +54157,8 @@
"question__title": "Shifting Letters",
"question__title_slug": "shifting-letters",
"question__hide": false,
- "total_acs": 96984,
- "total_submitted": 216615,
+ "total_acs": 98568,
+ "total_submitted": 219979,
"frontend_question_id": 848,
"is_new_question": false
},
@@ -53582,8 +54180,8 @@
"question__title": "Shortest Path Visiting All Nodes",
"question__title_slug": "shortest-path-visiting-all-nodes",
"question__hide": false,
- "total_acs": 123068,
- "total_submitted": 188260,
+ "total_acs": 123628,
+ "total_submitted": 189183,
"frontend_question_id": 847,
"is_new_question": false
},
@@ -53599,14 +54197,14 @@
{
"stat": {
"question_id": 876,
- "question__article__live": false,
+ "question__article__live": true,
"question__article__slug": "hand-of-straights",
"question__article__has_video_solution": false,
"question__title": "Hand of Straights",
"question__title_slug": "hand-of-straights",
"question__hide": false,
- "total_acs": 170160,
- "total_submitted": 304434,
+ "total_acs": 301360,
+ "total_submitted": 531876,
"frontend_question_id": 846,
"is_new_question": false
},
@@ -53628,8 +54226,8 @@
"question__title": "Longest Mountain in Array",
"question__title_slug": "longest-mountain-in-array",
"question__hide": false,
- "total_acs": 128940,
- "total_submitted": 319064,
+ "total_acs": 130084,
+ "total_submitted": 321493,
"frontend_question_id": 845,
"is_new_question": false
},
@@ -53651,8 +54249,8 @@
"question__title": "Backspace String Compare",
"question__title_slug": "backspace-string-compare",
"question__hide": false,
- "total_acs": 823126,
- "total_submitted": 1674634,
+ "total_acs": 829148,
+ "total_submitted": 1686292,
"frontend_question_id": 844,
"is_new_question": false
},
@@ -53668,14 +54266,14 @@
{
"stat": {
"question_id": 873,
- "question__article__live": true,
- "question__article__slug": "guess-the-word",
- "question__article__has_video_solution": false,
+ "question__article__live": null,
+ "question__article__slug": null,
+ "question__article__has_video_solution": null,
"question__title": "Guess the Word",
"question__title_slug": "guess-the-word",
"question__hide": false,
- "total_acs": 143643,
- "total_submitted": 366380,
+ "total_acs": 144403,
+ "total_submitted": 369338,
"frontend_question_id": 843,
"is_new_question": false
},
@@ -53697,8 +54295,8 @@
"question__title": "Split Array into Fibonacci Sequence",
"question__title_slug": "split-array-into-fibonacci-sequence",
"question__hide": false,
- "total_acs": 39476,
- "total_submitted": 101139,
+ "total_acs": 39754,
+ "total_submitted": 101731,
"frontend_question_id": 842,
"is_new_question": false
},
@@ -53720,8 +54318,8 @@
"question__title": "Keys and Rooms",
"question__title_slug": "keys-and-rooms",
"question__hide": false,
- "total_acs": 440977,
- "total_submitted": 603588,
+ "total_acs": 448234,
+ "total_submitted": 612628,
"frontend_question_id": 841,
"is_new_question": false
},
@@ -53743,8 +54341,8 @@
"question__title": "Magic Squares In Grid",
"question__title_slug": "magic-squares-in-grid",
"question__hide": false,
- "total_acs": 38863,
- "total_submitted": 99749,
+ "total_acs": 39061,
+ "total_submitted": 100109,
"frontend_question_id": 840,
"is_new_question": false
},
@@ -53766,8 +54364,8 @@
"question__title": "Similar String Groups",
"question__title_slug": "similar-string-groups",
"question__hide": false,
- "total_acs": 119835,
- "total_submitted": 218290,
+ "total_acs": 120422,
+ "total_submitted": 219212,
"frontend_question_id": 839,
"is_new_question": false
},
@@ -53789,8 +54387,8 @@
"question__title": "Push Dominoes",
"question__title_slug": "push-dominoes",
"question__hide": false,
- "total_acs": 124107,
- "total_submitted": 217155,
+ "total_acs": 124600,
+ "total_submitted": 217963,
"frontend_question_id": 838,
"is_new_question": false
},
@@ -53812,8 +54410,8 @@
"question__title": "New 21 Game",
"question__title_slug": "new-21-game",
"question__hide": false,
- "total_acs": 76016,
- "total_submitted": 168953,
+ "total_acs": 76288,
+ "total_submitted": 169616,
"frontend_question_id": 837,
"is_new_question": false
},
@@ -53835,8 +54433,8 @@
"question__title": "Rectangle Overlap",
"question__title_slug": "rectangle-overlap",
"question__hide": false,
- "total_acs": 145303,
- "total_submitted": 324149,
+ "total_acs": 146427,
+ "total_submitted": 326296,
"frontend_question_id": 836,
"is_new_question": false
},
@@ -53858,8 +54456,8 @@
"question__title": "Robot Room Cleaner",
"question__title_slug": "robot-room-cleaner",
"question__hide": false,
- "total_acs": 165191,
- "total_submitted": 215329,
+ "total_acs": 166530,
+ "total_submitted": 216931,
"frontend_question_id": 489,
"is_new_question": false
},
@@ -53881,8 +54479,8 @@
"question__title": "Image Overlap",
"question__title_slug": "image-overlap",
"question__hide": false,
- "total_acs": 93425,
- "total_submitted": 146774,
+ "total_acs": 93747,
+ "total_submitted": 147228,
"frontend_question_id": 835,
"is_new_question": false
},
@@ -53904,8 +54502,8 @@
"question__title": "Sum of Distances in Tree",
"question__title_slug": "sum-of-distances-in-tree",
"question__hide": false,
- "total_acs": 155368,
- "total_submitted": 238005,
+ "total_acs": 156323,
+ "total_submitted": 239433,
"frontend_question_id": 834,
"is_new_question": false
},
@@ -53927,8 +54525,8 @@
"question__title": "Find And Replace in String",
"question__title_slug": "find-and-replace-in-string",
"question__hide": false,
- "total_acs": 148086,
- "total_submitted": 281869,
+ "total_acs": 148864,
+ "total_submitted": 283769,
"frontend_question_id": 833,
"is_new_question": false
},
@@ -53950,8 +54548,8 @@
"question__title": "Flipping an Image",
"question__title_slug": "flipping-an-image",
"question__hide": false,
- "total_acs": 431326,
- "total_submitted": 526228,
+ "total_acs": 435377,
+ "total_submitted": 530601,
"frontend_question_id": 832,
"is_new_question": false
},
@@ -53973,8 +54571,8 @@
"question__title": "Design Circular Queue",
"question__title_slug": "design-circular-queue",
"question__hide": false,
- "total_acs": 316792,
- "total_submitted": 615479,
+ "total_acs": 320124,
+ "total_submitted": 621214,
"frontend_question_id": 622,
"is_new_question": false
},
@@ -53996,8 +54594,8 @@
"question__title": "Design Circular Deque",
"question__title_slug": "design-circular-deque",
"question__hide": false,
- "total_acs": 70511,
- "total_submitted": 123881,
+ "total_acs": 71838,
+ "total_submitted": 126056,
"frontend_question_id": 641,
"is_new_question": false
},
@@ -54019,8 +54617,8 @@
"question__title": "Masking Personal Information",
"question__title_slug": "masking-personal-information",
"question__hide": false,
- "total_acs": 19373,
- "total_submitted": 39755,
+ "total_acs": 19522,
+ "total_submitted": 39983,
"frontend_question_id": 831,
"is_new_question": false
},
@@ -54042,8 +54640,8 @@
"question__title": "Positions of Large Groups",
"question__title_slug": "positions-of-large-groups",
"question__hide": false,
- "total_acs": 95502,
- "total_submitted": 182793,
+ "total_acs": 96187,
+ "total_submitted": 183939,
"frontend_question_id": 830,
"is_new_question": false
},
@@ -54065,8 +54663,8 @@
"question__title": "Consecutive Numbers Sum",
"question__title_slug": "consecutive-numbers-sum",
"question__hide": false,
- "total_acs": 86326,
- "total_submitted": 206485,
+ "total_acs": 86656,
+ "total_submitted": 207219,
"frontend_question_id": 829,
"is_new_question": false
},
@@ -54088,8 +54686,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": 72020,
- "total_submitted": 137518,
+ "total_acs": 72445,
+ "total_submitted": 138160,
"frontend_question_id": 828,
"is_new_question": false
},
@@ -54111,8 +54709,8 @@
"question__title": "Making A Large Island",
"question__title_slug": "making-a-large-island",
"question__hide": false,
- "total_acs": 176546,
- "total_submitted": 372636,
+ "total_acs": 180635,
+ "total_submitted": 379403,
"frontend_question_id": 827,
"is_new_question": false
},
@@ -54134,8 +54732,8 @@
"question__title": "Most Profit Assigning Work",
"question__title_slug": "most-profit-assigning-work",
"question__hide": false,
- "total_acs": 72763,
- "total_submitted": 156198,
+ "total_acs": 202977,
+ "total_submitted": 363286,
"frontend_question_id": 826,
"is_new_question": false
},
@@ -54157,8 +54755,8 @@
"question__title": "Friends Of Appropriate Ages",
"question__title_slug": "friends-of-appropriate-ages",
"question__hide": false,
- "total_acs": 88414,
- "total_submitted": 185602,
+ "total_acs": 89642,
+ "total_submitted": 187918,
"frontend_question_id": 825,
"is_new_question": false
},
@@ -54180,8 +54778,8 @@
"question__title": "Goat Latin",
"question__title_slug": "goat-latin",
"question__hide": false,
- "total_acs": 177862,
- "total_submitted": 260540,
+ "total_acs": 179508,
+ "total_submitted": 262678,
"frontend_question_id": 824,
"is_new_question": false
},
@@ -54203,8 +54801,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": 173143,
- "total_submitted": 477692,
+ "total_acs": 175862,
+ "total_submitted": 484084,
"frontend_question_id": 708,
"is_new_question": false
},
@@ -54226,8 +54824,8 @@
"question__title": "Binary Trees With Factors",
"question__title_slug": "binary-trees-with-factors",
"question__hide": false,
- "total_acs": 149623,
- "total_submitted": 282777,
+ "total_acs": 149883,
+ "total_submitted": 283250,
"frontend_question_id": 823,
"is_new_question": false
},
@@ -54249,8 +54847,8 @@
"question__title": "Card Flipping Game",
"question__title_slug": "card-flipping-game",
"question__hide": false,
- "total_acs": 19002,
- "total_submitted": 40033,
+ "total_acs": 19235,
+ "total_submitted": 40367,
"frontend_question_id": 822,
"is_new_question": false
},
@@ -54272,8 +54870,8 @@
"question__title": "Shortest Distance to a Character",
"question__title_slug": "shortest-distance-to-a-character",
"question__hide": false,
- "total_acs": 184791,
- "total_submitted": 258128,
+ "total_acs": 186381,
+ "total_submitted": 260220,
"frontend_question_id": 821,
"is_new_question": false
},
@@ -54295,8 +54893,8 @@
"question__title": "Short Encoding of Words",
"question__title_slug": "short-encoding-of-words",
"question__hide": false,
- "total_acs": 96369,
- "total_submitted": 159451,
+ "total_acs": 96618,
+ "total_submitted": 159883,
"frontend_question_id": 820,
"is_new_question": false
},
@@ -54318,8 +54916,8 @@
"question__title": "Design Linked List",
"question__title_slug": "design-linked-list",
"question__hide": false,
- "total_acs": 331405,
- "total_submitted": 1174213,
+ "total_acs": 335606,
+ "total_submitted": 1187380,
"frontend_question_id": 707,
"is_new_question": false
},
@@ -54341,8 +54939,8 @@
"question__title": "Most Common Word",
"question__title_slug": "most-common-word",
"question__hide": false,
- "total_acs": 358012,
- "total_submitted": 807695,
+ "total_acs": 360172,
+ "total_submitted": 812628,
"frontend_question_id": 819,
"is_new_question": false
},
@@ -54364,8 +54962,8 @@
"question__title": "Race Car",
"question__title_slug": "race-car",
"question__hide": false,
- "total_acs": 87887,
- "total_submitted": 201063,
+ "total_acs": 88473,
+ "total_submitted": 202296,
"frontend_question_id": 818,
"is_new_question": false
},
@@ -54387,8 +54985,8 @@
"question__title": "Linked List Components",
"question__title_slug": "linked-list-components",
"question__hide": false,
- "total_acs": 93255,
- "total_submitted": 164197,
+ "total_acs": 94016,
+ "total_submitted": 165457,
"frontend_question_id": 817,
"is_new_question": false
},
@@ -54410,8 +55008,8 @@
"question__title": "Ambiguous Coordinates",
"question__title_slug": "ambiguous-coordinates",
"question__hide": false,
- "total_acs": 29950,
- "total_submitted": 52783,
+ "total_acs": 30126,
+ "total_submitted": 53081,
"frontend_question_id": 816,
"is_new_question": false
},
@@ -54433,8 +55031,8 @@
"question__title": "Bus Routes",
"question__title_slug": "bus-routes",
"question__hide": false,
- "total_acs": 202589,
- "total_submitted": 423638,
+ "total_acs": 204110,
+ "total_submitted": 427245,
"frontend_question_id": 815,
"is_new_question": false
},
@@ -54456,8 +55054,8 @@
"question__title": "Binary Tree Pruning",
"question__title_slug": "binary-tree-pruning",
"question__hide": false,
- "total_acs": 244000,
- "total_submitted": 337817,
+ "total_acs": 245254,
+ "total_submitted": 339409,
"frontend_question_id": 814,
"is_new_question": false
},
@@ -54479,8 +55077,8 @@
"question__title": "Largest Sum of Averages",
"question__title_slug": "largest-sum-of-averages",
"question__hide": false,
- "total_acs": 53375,
- "total_submitted": 99816,
+ "total_acs": 53797,
+ "total_submitted": 100533,
"frontend_question_id": 813,
"is_new_question": false
},
@@ -54502,8 +55100,8 @@
"question__title": "Largest Triangle Area",
"question__title_slug": "largest-triangle-area",
"question__hide": false,
- "total_acs": 51782,
- "total_submitted": 85375,
+ "total_acs": 52370,
+ "total_submitted": 86231,
"frontend_question_id": 812,
"is_new_question": false
},
@@ -54525,8 +55123,8 @@
"question__title": "Subdomain Visit Count",
"question__title_slug": "subdomain-visit-count",
"question__hide": false,
- "total_acs": 229374,
- "total_submitted": 300942,
+ "total_acs": 230282,
+ "total_submitted": 302013,
"frontend_question_id": 811,
"is_new_question": false
},
@@ -54548,8 +55146,8 @@
"question__title": "Chalkboard XOR Game",
"question__title_slug": "chalkboard-xor-game",
"question__hide": false,
- "total_acs": 10884,
- "total_submitted": 18217,
+ "total_acs": 11047,
+ "total_submitted": 18459,
"frontend_question_id": 810,
"is_new_question": false
},
@@ -54571,8 +55169,8 @@
"question__title": "Expressive Words",
"question__title_slug": "expressive-words",
"question__hide": false,
- "total_acs": 116574,
- "total_submitted": 252735,
+ "total_acs": 117315,
+ "total_submitted": 254056,
"frontend_question_id": 809,
"is_new_question": false
},
@@ -54594,8 +55192,8 @@
"question__title": "Soup Servings",
"question__title_slug": "soup-servings",
"question__hide": false,
- "total_acs": 66377,
- "total_submitted": 123042,
+ "total_acs": 66748,
+ "total_submitted": 123766,
"frontend_question_id": 808,
"is_new_question": false
},
@@ -54617,8 +55215,8 @@
"question__title": "Max Increase to Keep City Skyline",
"question__title_slug": "max-increase-to-keep-city-skyline",
"question__hide": false,
- "total_acs": 164208,
- "total_submitted": 190682,
+ "total_acs": 165193,
+ "total_submitted": 191759,
"frontend_question_id": 807,
"is_new_question": false
},
@@ -54640,8 +55238,8 @@
"question__title": "Number of Lines To Write String",
"question__title_slug": "number-of-lines-to-write-string",
"question__hide": false,
- "total_acs": 79784,
- "total_submitted": 116617,
+ "total_acs": 80833,
+ "total_submitted": 117884,
"frontend_question_id": 806,
"is_new_question": false
},
@@ -54663,8 +55261,8 @@
"question__title": "Split Array With Same Average",
"question__title_slug": "split-array-with-same-average",
"question__hide": false,
- "total_acs": 35490,
- "total_submitted": 139846,
+ "total_acs": 36066,
+ "total_submitted": 141279,
"frontend_question_id": 805,
"is_new_question": false
},
@@ -54686,8 +55284,8 @@
"question__title": "Unique Morse Code Words",
"question__title_slug": "unique-morse-code-words",
"question__hide": false,
- "total_acs": 353025,
- "total_submitted": 426039,
+ "total_acs": 355014,
+ "total_submitted": 428302,
"frontend_question_id": 804,
"is_new_question": false
},
@@ -54709,8 +55307,8 @@
"question__title": "Bricks Falling When Hit",
"question__title_slug": "bricks-falling-when-hit",
"question__hide": false,
- "total_acs": 30400,
- "total_submitted": 87465,
+ "total_acs": 30513,
+ "total_submitted": 87738,
"frontend_question_id": 803,
"is_new_question": false
},
@@ -54732,8 +55330,8 @@
"question__title": "Find Eventual Safe States",
"question__title_slug": "find-eventual-safe-states",
"question__hide": false,
- "total_acs": 247277,
- "total_submitted": 394315,
+ "total_acs": 253851,
+ "total_submitted": 402796,
"frontend_question_id": 802,
"is_new_question": false
},
@@ -54755,8 +55353,8 @@
"question__title": "Minimum Swaps To Make Sequences Increasing",
"question__title_slug": "minimum-swaps-to-make-sequences-increasing",
"question__hide": false,
- "total_acs": 77101,
- "total_submitted": 192840,
+ "total_acs": 77959,
+ "total_submitted": 194684,
"frontend_question_id": 801,
"is_new_question": false
},
@@ -54778,8 +55376,8 @@
"question__title": "Similar RGB Color",
"question__title_slug": "similar-rgb-color",
"question__hide": false,
- "total_acs": 17281,
- "total_submitted": 25638,
+ "total_acs": 17336,
+ "total_submitted": 25706,
"frontend_question_id": 800,
"is_new_question": false
},
@@ -54801,8 +55399,8 @@
"question__title": "Design HashMap",
"question__title_slug": "design-hashmap",
"question__hide": false,
- "total_acs": 583919,
- "total_submitted": 890345,
+ "total_acs": 587945,
+ "total_submitted": 896800,
"frontend_question_id": 706,
"is_new_question": false
},
@@ -54824,8 +55422,8 @@
"question__title": "Design HashSet",
"question__title_slug": "design-hashset",
"question__hide": false,
- "total_acs": 415593,
- "total_submitted": 621967,
+ "total_acs": 425560,
+ "total_submitted": 634046,
"frontend_question_id": 705,
"is_new_question": false
},
@@ -54847,8 +55445,8 @@
"question__title": "Champagne Tower",
"question__title_slug": "champagne-tower",
"question__hide": false,
- "total_acs": 153940,
- "total_submitted": 264747,
+ "total_acs": 154515,
+ "total_submitted": 265699,
"frontend_question_id": 799,
"is_new_question": false
},
@@ -54870,8 +55468,8 @@
"question__title": "Smallest Rotation with Highest Score",
"question__title_slug": "smallest-rotation-with-highest-score",
"question__hide": false,
- "total_acs": 13817,
- "total_submitted": 26991,
+ "total_acs": 13928,
+ "total_submitted": 27153,
"frontend_question_id": 798,
"is_new_question": false
},
@@ -54893,8 +55491,8 @@
"question__title": "All Paths From Source to Target",
"question__title_slug": "all-paths-from-source-to-target",
"question__hide": false,
- "total_acs": 522613,
- "total_submitted": 633660,
+ "total_acs": 526894,
+ "total_submitted": 638621,
"frontend_question_id": 797,
"is_new_question": false
},
@@ -54916,8 +55514,8 @@
"question__title": "Rotate String",
"question__title_slug": "rotate-string",
"question__hide": false,
- "total_acs": 315416,
- "total_submitted": 541507,
+ "total_acs": 324653,
+ "total_submitted": 555735,
"frontend_question_id": 796,
"is_new_question": false
},
@@ -54939,8 +55537,8 @@
"question__title": "Number of Subarrays with Bounded Maximum",
"question__title_slug": "number-of-subarrays-with-bounded-maximum",
"question__hide": false,
- "total_acs": 69835,
- "total_submitted": 131285,
+ "total_acs": 70297,
+ "total_submitted": 132106,
"frontend_question_id": 795,
"is_new_question": false
},
@@ -54962,8 +55560,8 @@
"question__title": "Valid Tic-Tac-Toe State",
"question__title_slug": "valid-tic-tac-toe-state",
"question__hide": false,
- "total_acs": 58290,
- "total_submitted": 167986,
+ "total_acs": 58548,
+ "total_submitted": 168708,
"frontend_question_id": 794,
"is_new_question": false
},
@@ -54985,8 +55583,8 @@
"question__title": "Preimage Size of Factorial Zeroes Function",
"question__title_slug": "preimage-size-of-factorial-zeroes-function",
"question__hide": false,
- "total_acs": 18691,
- "total_submitted": 41989,
+ "total_acs": 18851,
+ "total_submitted": 42259,
"frontend_question_id": 793,
"is_new_question": false
},
@@ -55008,8 +55606,8 @@
"question__title": "Number of Matching Subsequences",
"question__title_slug": "number-of-matching-subsequences",
"question__hide": false,
- "total_acs": 229909,
- "total_submitted": 451064,
+ "total_acs": 230846,
+ "total_submitted": 453087,
"frontend_question_id": 792,
"is_new_question": false
},
@@ -55031,8 +55629,8 @@
"question__title": "Custom Sort String",
"question__title_slug": "custom-sort-string",
"question__hide": false,
- "total_acs": 430129,
- "total_submitted": 607700,
+ "total_acs": 435498,
+ "total_submitted": 614710,
"frontend_question_id": 791,
"is_new_question": false
},
@@ -55054,8 +55652,8 @@
"question__title": "Domino and Tromino Tiling",
"question__title_slug": "domino-and-tromino-tiling",
"question__hide": false,
- "total_acs": 133140,
- "total_submitted": 263469,
+ "total_acs": 135445,
+ "total_submitted": 268519,
"frontend_question_id": 790,
"is_new_question": false
},
@@ -55077,8 +55675,8 @@
"question__title": "Escape The Ghosts",
"question__title_slug": "escape-the-ghosts",
"question__hide": false,
- "total_acs": 29680,
- "total_submitted": 48010,
+ "total_acs": 29870,
+ "total_submitted": 48294,
"frontend_question_id": 789,
"is_new_question": false
},
@@ -55100,8 +55698,8 @@
"question__title": "Rotated Digits",
"question__title_slug": "rotated-digits",
"question__hide": false,
- "total_acs": 106799,
- "total_submitted": 189265,
+ "total_acs": 107456,
+ "total_submitted": 190385,
"frontend_question_id": 788,
"is_new_question": false
},
@@ -55123,8 +55721,8 @@
"question__title": "Cheapest Flights Within K Stops",
"question__title_slug": "cheapest-flights-within-k-stops",
"question__hide": false,
- "total_acs": 562785,
- "total_submitted": 1431247,
+ "total_acs": 571778,
+ "total_submitted": 1452082,
"frontend_question_id": 787,
"is_new_question": false
},
@@ -55146,8 +55744,8 @@
"question__title": "K-th Smallest Prime Fraction",
"question__title_slug": "k-th-smallest-prime-fraction",
"question__hide": false,
- "total_acs": 145382,
- "total_submitted": 213685,
+ "total_acs": 146880,
+ "total_submitted": 215770,
"frontend_question_id": 786,
"is_new_question": false
},
@@ -55169,8 +55767,8 @@
"question__title": "Is Graph Bipartite?",
"question__title_slug": "is-graph-bipartite",
"question__hide": false,
- "total_acs": 558910,
- "total_submitted": 1002958,
+ "total_acs": 568751,
+ "total_submitted": 1018065,
"frontend_question_id": 785,
"is_new_question": false
},
@@ -55192,8 +55790,8 @@
"question__title": "Letter Case Permutation",
"question__title_slug": "letter-case-permutation",
"question__hide": false,
- "total_acs": 302438,
- "total_submitted": 407325,
+ "total_acs": 304024,
+ "total_submitted": 409272,
"frontend_question_id": 784,
"is_new_question": false
},
@@ -55215,8 +55813,8 @@
"question__title": "Minimum Distance Between BST Nodes",
"question__title_slug": "minimum-distance-between-bst-nodes",
"question__hide": false,
- "total_acs": 251252,
- "total_submitted": 421973,
+ "total_acs": 253321,
+ "total_submitted": 425149,
"frontend_question_id": 783,
"is_new_question": false
},
@@ -55238,8 +55836,8 @@
"question__title": "Transform to Chessboard",
"question__title_slug": "transform-to-chessboard",
"question__hide": false,
- "total_acs": 17667,
- "total_submitted": 34694,
+ "total_acs": 17746,
+ "total_submitted": 34854,
"frontend_question_id": 782,
"is_new_question": false
},
@@ -55261,8 +55859,8 @@
"question__title": "Rabbits in Forest",
"question__title_slug": "rabbits-in-forest",
"question__hide": false,
- "total_acs": 57514,
- "total_submitted": 108138,
+ "total_acs": 58227,
+ "total_submitted": 109536,
"frontend_question_id": 781,
"is_new_question": false
},
@@ -55284,8 +55882,8 @@
"question__title": "Reaching Points",
"question__title_slug": "reaching-points",
"question__hide": false,
- "total_acs": 66656,
- "total_submitted": 200660,
+ "total_acs": 67199,
+ "total_submitted": 201971,
"frontend_question_id": 780,
"is_new_question": false
},
@@ -55307,8 +55905,8 @@
"question__title": "K-th Symbol in Grammar",
"question__title_slug": "k-th-symbol-in-grammar",
"question__hide": false,
- "total_acs": 202107,
- "total_submitted": 434441,
+ "total_acs": 203962,
+ "total_submitted": 437971,
"frontend_question_id": 779,
"is_new_question": false
},
@@ -55330,8 +55928,8 @@
"question__title": "Swim in Rising Water",
"question__title_slug": "swim-in-rising-water",
"question__hide": false,
- "total_acs": 161947,
- "total_submitted": 266119,
+ "total_acs": 165063,
+ "total_submitted": 270680,
"frontend_question_id": 778,
"is_new_question": false
},
@@ -55353,8 +55951,8 @@
"question__title": "Swap Adjacent in LR String",
"question__title_slug": "swap-adjacent-in-lr-string",
"question__hide": false,
- "total_acs": 76376,
- "total_submitted": 207457,
+ "total_acs": 76711,
+ "total_submitted": 208265,
"frontend_question_id": 777,
"is_new_question": false
},
@@ -55376,8 +55974,8 @@
"question__title": "Binary Search",
"question__title_slug": "binary-search",
"question__hide": false,
- "total_acs": 2426379,
- "total_submitted": 4208830,
+ "total_acs": 2471174,
+ "total_submitted": 4275384,
"frontend_question_id": 704,
"is_new_question": false
},
@@ -55399,8 +55997,8 @@
"question__title": "Split BST",
"question__title_slug": "split-bst",
"question__hide": false,
- "total_acs": 105411,
- "total_submitted": 127490,
+ "total_acs": 105563,
+ "total_submitted": 127690,
"frontend_question_id": 776,
"is_new_question": false
},
@@ -55422,8 +56020,8 @@
"question__title": "Global and Local Inversions",
"question__title_slug": "global-and-local-inversions",
"question__hide": false,
- "total_acs": 74916,
- "total_submitted": 176435,
+ "total_acs": 75549,
+ "total_submitted": 177991,
"frontend_question_id": 775,
"is_new_question": false
},
@@ -55445,8 +56043,8 @@
"question__title": "Kth Largest Element in a Stream",
"question__title_slug": "kth-largest-element-in-a-stream",
"question__hide": false,
- "total_acs": 547374,
- "total_submitted": 962836,
+ "total_acs": 556360,
+ "total_submitted": 977516,
"frontend_question_id": 703,
"is_new_question": false
},
@@ -55468,8 +56066,8 @@
"question__title": "Minimize Max Distance to Gas Station",
"question__title_slug": "minimize-max-distance-to-gas-station",
"question__hide": false,
- "total_acs": 30454,
- "total_submitted": 58207,
+ "total_acs": 30593,
+ "total_submitted": 58457,
"frontend_question_id": 774,
"is_new_question": false
},
@@ -55491,8 +56089,8 @@
"question__title": "Sliding Puzzle",
"question__title_slug": "sliding-puzzle",
"question__hide": false,
- "total_acs": 94732,
- "total_submitted": 146160,
+ "total_acs": 95170,
+ "total_submitted": 146714,
"frontend_question_id": 773,
"is_new_question": false
},
@@ -55514,8 +56112,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": 97692,
- "total_submitted": 135425,
+ "total_acs": 98325,
+ "total_submitted": 136210,
"frontend_question_id": 702,
"is_new_question": false
},
@@ -55537,8 +56135,8 @@
"question__title": "Basic Calculator III",
"question__title_slug": "basic-calculator-iii",
"question__hide": false,
- "total_acs": 126771,
- "total_submitted": 249885,
+ "total_acs": 127646,
+ "total_submitted": 251235,
"frontend_question_id": 772,
"is_new_question": false
},
@@ -55560,8 +56158,8 @@
"question__title": "Insert into a Binary Search Tree",
"question__title_slug": "insert-into-a-binary-search-tree",
"question__hide": false,
- "total_acs": 531103,
- "total_submitted": 720052,
+ "total_acs": 540522,
+ "total_submitted": 732864,
"frontend_question_id": 701,
"is_new_question": false
},
@@ -55583,8 +56181,8 @@
"question__title": "Search in a Binary Search Tree",
"question__title_slug": "search-in-a-binary-search-tree",
"question__hide": false,
- "total_acs": 876615,
- "total_submitted": 1097998,
+ "total_acs": 893479,
+ "total_submitted": 1116989,
"frontend_question_id": 700,
"is_new_question": false
},
@@ -55606,8 +56204,8 @@
"question__title": "Jewels and Stones",
"question__title_slug": "jewels-and-stones",
"question__hide": false,
- "total_acs": 1045211,
- "total_submitted": 1179386,
+ "total_acs": 1054765,
+ "total_submitted": 1189593,
"frontend_question_id": 771,
"is_new_question": false
},
@@ -55629,8 +56227,8 @@
"question__title": "Basic Calculator IV",
"question__title_slug": "basic-calculator-iv",
"question__hide": false,
- "total_acs": 10442,
- "total_submitted": 18823,
+ "total_acs": 10511,
+ "total_submitted": 18922,
"frontend_question_id": 770,
"is_new_question": false
},
@@ -55652,8 +56250,8 @@
"question__title": "Max Chunks To Make Sorted",
"question__title_slug": "max-chunks-to-make-sorted",
"question__hide": false,
- "total_acs": 105771,
- "total_submitted": 181261,
+ "total_acs": 106806,
+ "total_submitted": 182870,
"frontend_question_id": 769,
"is_new_question": false
},
@@ -55675,8 +56273,8 @@
"question__title": "Max Chunks To Make Sorted II",
"question__title_slug": "max-chunks-to-make-sorted-ii",
"question__hide": false,
- "total_acs": 63186,
- "total_submitted": 118648,
+ "total_acs": 64029,
+ "total_submitted": 120105,
"frontend_question_id": 768,
"is_new_question": false
},
@@ -55698,8 +56296,8 @@
"question__title": "Reorganize String",
"question__title_slug": "reorganize-string",
"question__hide": false,
- "total_acs": 393895,
- "total_submitted": 720678,
+ "total_acs": 398540,
+ "total_submitted": 728438,
"frontend_question_id": 767,
"is_new_question": false
},
@@ -55721,8 +56319,8 @@
"question__title": "Toeplitz Matrix",
"question__title_slug": "toeplitz-matrix",
"question__hide": false,
- "total_acs": 332440,
- "total_submitted": 481546,
+ "total_acs": 335753,
+ "total_submitted": 486132,
"frontend_question_id": 766,
"is_new_question": false
},
@@ -55744,8 +56342,8 @@
"question__title": "N-ary Tree Postorder Traversal",
"question__title_slug": "n-ary-tree-postorder-traversal",
"question__hide": false,
- "total_acs": 256543,
- "total_submitted": 329205,
+ "total_acs": 257955,
+ "total_submitted": 330890,
"frontend_question_id": 590,
"is_new_question": false
},
@@ -55767,8 +56365,8 @@
"question__title": "N-ary Tree Preorder Traversal",
"question__title_slug": "n-ary-tree-preorder-traversal",
"question__hide": false,
- "total_acs": 428158,
- "total_submitted": 566876,
+ "total_acs": 429751,
+ "total_submitted": 568773,
"frontend_question_id": 589,
"is_new_question": false
},
@@ -55790,8 +56388,8 @@
"question__title": "Maximum Depth of N-ary Tree",
"question__title_slug": "maximum-depth-of-n-ary-tree",
"question__hide": false,
- "total_acs": 283791,
- "total_submitted": 393093,
+ "total_acs": 285567,
+ "total_submitted": 395335,
"frontend_question_id": 559,
"is_new_question": false
},
@@ -55813,8 +56411,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": 14774,
- "total_submitted": 29743,
+ "total_acs": 14870,
+ "total_submitted": 29894,
"frontend_question_id": 558,
"is_new_question": false
},
@@ -55836,8 +56434,8 @@
"question__title": "Construct Quad Tree",
"question__title_slug": "construct-quad-tree",
"question__hide": false,
- "total_acs": 122762,
- "total_submitted": 162648,
+ "total_acs": 124797,
+ "total_submitted": 165151,
"frontend_question_id": 427,
"is_new_question": false
},
@@ -55859,8 +56457,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": 21715,
- "total_submitted": 27312,
+ "total_acs": 21826,
+ "total_submitted": 27440,
"frontend_question_id": 431,
"is_new_question": false
},
@@ -55882,8 +56480,8 @@
"question__title": "Couples Holding Hands",
"question__title_slug": "couples-holding-hands",
"question__hide": false,
- "total_acs": 61568,
- "total_submitted": 107434,
+ "total_acs": 62167,
+ "total_submitted": 108302,
"frontend_question_id": 765,
"is_new_question": false
},
@@ -55905,8 +56503,8 @@
"question__title": "Largest Plus Sign",
"question__title_slug": "largest-plus-sign",
"question__hide": false,
- "total_acs": 58499,
- "total_submitted": 121299,
+ "total_acs": 58833,
+ "total_submitted": 121864,
"frontend_question_id": 764,
"is_new_question": false
},
@@ -55928,8 +56526,8 @@
"question__title": "Partition Labels",
"question__title_slug": "partition-labels",
"question__hide": false,
- "total_acs": 537368,
- "total_submitted": 672772,
+ "total_acs": 541508,
+ "total_submitted": 677814,
"frontend_question_id": 763,
"is_new_question": false
},
@@ -55951,8 +56549,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": 98128,
- "total_submitted": 141164,
+ "total_acs": 99087,
+ "total_submitted": 142375,
"frontend_question_id": 762,
"is_new_question": false
},
@@ -55974,8 +56572,8 @@
"question__title": "Flatten a Multilevel Doubly Linked List",
"question__title_slug": "flatten-a-multilevel-doubly-linked-list",
"question__hide": false,
- "total_acs": 326896,
- "total_submitted": 543641,
+ "total_acs": 328988,
+ "total_submitted": 546795,
"frontend_question_id": 430,
"is_new_question": false
},
@@ -55997,8 +56595,8 @@
"question__title": "Serialize and Deserialize N-ary Tree",
"question__title_slug": "serialize-and-deserialize-n-ary-tree",
"question__hide": false,
- "total_acs": 88072,
- "total_submitted": 130966,
+ "total_acs": 88698,
+ "total_submitted": 131739,
"frontend_question_id": 428,
"is_new_question": false
},
@@ -56020,8 +56618,8 @@
"question__title": "N-ary Tree Level Order Traversal",
"question__title_slug": "n-ary-tree-level-order-traversal",
"question__hide": false,
- "total_acs": 306826,
- "total_submitted": 433102,
+ "total_acs": 308220,
+ "total_submitted": 434980,
"frontend_question_id": 429,
"is_new_question": false
},
@@ -56043,8 +56641,8 @@
"question__title": "Special Binary String",
"question__title_slug": "special-binary-string",
"question__hide": false,
- "total_acs": 17349,
- "total_submitted": 28374,
+ "total_acs": 17487,
+ "total_submitted": 28631,
"frontend_question_id": 761,
"is_new_question": false
},
@@ -56066,8 +56664,8 @@
"question__title": "Find Anagram Mappings",
"question__title_slug": "find-anagram-mappings",
"question__hide": false,
- "total_acs": 101484,
- "total_submitted": 121338,
+ "total_acs": 101826,
+ "total_submitted": 121721,
"frontend_question_id": 760,
"is_new_question": false
},
@@ -56089,8 +56687,8 @@
"question__title": "Employee Free Time",
"question__title_slug": "employee-free-time",
"question__hide": false,
- "total_acs": 149092,
- "total_submitted": 206620,
+ "total_acs": 150142,
+ "total_submitted": 207913,
"frontend_question_id": 759,
"is_new_question": false
},
@@ -56112,8 +56710,8 @@
"question__title": "Bold Words in String",
"question__title_slug": "bold-words-in-string",
"question__hide": false,
- "total_acs": 18972,
- "total_submitted": 36846,
+ "total_acs": 19021,
+ "total_submitted": 36922,
"frontend_question_id": 758,
"is_new_question": false
},
@@ -56135,8 +56733,8 @@
"question__title": "Set Intersection Size At Least Two",
"question__title_slug": "set-intersection-size-at-least-two",
"question__hide": false,
- "total_acs": 23130,
- "total_submitted": 51945,
+ "total_acs": 23292,
+ "total_submitted": 52320,
"frontend_question_id": 757,
"is_new_question": false
},
@@ -56158,8 +56756,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": 288698,
- "total_submitted": 445407,
+ "total_acs": 291896,
+ "total_submitted": 450187,
"frontend_question_id": 426,
"is_new_question": false
},
@@ -56181,8 +56779,8 @@
"question__title": "Pyramid Transition Matrix",
"question__title_slug": "pyramid-transition-matrix",
"question__hide": false,
- "total_acs": 33520,
- "total_submitted": 63438,
+ "total_acs": 33710,
+ "total_submitted": 63792,
"frontend_question_id": 756,
"is_new_question": false
},
@@ -56204,8 +56802,8 @@
"question__title": "Pour Water",
"question__title_slug": "pour-water",
"question__hide": false,
- "total_acs": 38147,
- "total_submitted": 81262,
+ "total_acs": 38330,
+ "total_submitted": 81557,
"frontend_question_id": 755,
"is_new_question": false
},
@@ -56227,8 +56825,8 @@
"question__title": "Reach a Number",
"question__title_slug": "reach-a-number",
"question__hide": false,
- "total_acs": 54566,
- "total_submitted": 126563,
+ "total_acs": 55092,
+ "total_submitted": 127655,
"frontend_question_id": 754,
"is_new_question": false
},
@@ -56250,8 +56848,8 @@
"question__title": "Cracking the Safe",
"question__title_slug": "cracking-the-safe",
"question__hide": false,
- "total_acs": 58698,
- "total_submitted": 103197,
+ "total_acs": 59046,
+ "total_submitted": 103769,
"frontend_question_id": 753,
"is_new_question": false
},
@@ -56273,8 +56871,8 @@
"question__title": "Open the Lock",
"question__title_slug": "open-the-lock",
"question__hide": false,
- "total_acs": 318645,
- "total_submitted": 528529,
+ "total_acs": 320528,
+ "total_submitted": 531526,
"frontend_question_id": 752,
"is_new_question": false
},
@@ -56296,8 +56894,8 @@
"question__title": "IP to CIDR",
"question__title_slug": "ip-to-cidr",
"question__hide": false,
- "total_acs": 24119,
- "total_submitted": 43505,
+ "total_acs": 24382,
+ "total_submitted": 43912,
"frontend_question_id": 751,
"is_new_question": false
},
@@ -56319,8 +56917,8 @@
"question__title": "Number Of Corner Rectangles",
"question__title_slug": "number-of-corner-rectangles",
"question__hide": false,
- "total_acs": 38412,
- "total_submitted": 56724,
+ "total_acs": 38456,
+ "total_submitted": 56781,
"frontend_question_id": 750,
"is_new_question": false
},
@@ -56342,8 +56940,8 @@
"question__title": "Contain Virus",
"question__title_slug": "contain-virus",
"question__hide": false,
- "total_acs": 12608,
- "total_submitted": 24757,
+ "total_acs": 12713,
+ "total_submitted": 24931,
"frontend_question_id": 749,
"is_new_question": false
},
@@ -56365,8 +56963,8 @@
"question__title": "Shortest Completing Word",
"question__title_slug": "shortest-completing-word",
"question__hide": false,
- "total_acs": 75932,
- "total_submitted": 126449,
+ "total_acs": 76779,
+ "total_submitted": 127725,
"frontend_question_id": 748,
"is_new_question": false
},
@@ -56388,8 +56986,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": 246609,
- "total_submitted": 503812,
+ "total_acs": 248947,
+ "total_submitted": 507720,
"frontend_question_id": 747,
"is_new_question": false
},
@@ -56411,8 +57009,8 @@
"question__title": "Min Cost Climbing Stairs",
"question__title_slug": "min-cost-climbing-stairs",
"question__hide": false,
- "total_acs": 1180043,
- "total_submitted": 1794594,
+ "total_acs": 1196198,
+ "total_submitted": 1816694,
"frontend_question_id": 746,
"is_new_question": false
},
@@ -56434,8 +57032,8 @@
"question__title": "Prefix and Suffix Search",
"question__title_slug": "prefix-and-suffix-search",
"question__hide": false,
- "total_acs": 96699,
- "total_submitted": 234945,
+ "total_acs": 97019,
+ "total_submitted": 235797,
"frontend_question_id": 745,
"is_new_question": false
},
@@ -56457,8 +57055,8 @@
"question__title": "Find Smallest Letter Greater Than Target",
"question__title_slug": "find-smallest-letter-greater-than-target",
"question__hide": false,
- "total_acs": 483538,
- "total_submitted": 926709,
+ "total_acs": 490128,
+ "total_submitted": 937364,
"frontend_question_id": 744,
"is_new_question": false
},
@@ -56480,8 +57078,8 @@
"question__title": "Network Delay Time",
"question__title_slug": "network-delay-time",
"question__hide": false,
- "total_acs": 495368,
- "total_submitted": 918001,
+ "total_acs": 503671,
+ "total_submitted": 930123,
"frontend_question_id": 743,
"is_new_question": false
},
@@ -56503,8 +57101,8 @@
"question__title": "Closest Leaf in a Binary Tree",
"question__title_slug": "closest-leaf-in-a-binary-tree",
"question__hide": false,
- "total_acs": 45908,
- "total_submitted": 99191,
+ "total_acs": 46034,
+ "total_submitted": 99420,
"frontend_question_id": 742,
"is_new_question": false
},
@@ -56526,8 +57124,8 @@
"question__title": "To Lower Case",
"question__title_slug": "to-lower-case",
"question__hide": false,
- "total_acs": 521983,
- "total_submitted": 625890,
+ "total_acs": 528113,
+ "total_submitted": 632858,
"frontend_question_id": 709,
"is_new_question": false
},
@@ -56549,8 +57147,8 @@
"question__title": "Cherry Pickup",
"question__title_slug": "cherry-pickup",
"question__hide": false,
- "total_acs": 80333,
- "total_submitted": 217952,
+ "total_acs": 81134,
+ "total_submitted": 219714,
"frontend_question_id": 741,
"is_new_question": false
},
@@ -56572,8 +57170,8 @@
"question__title": "Delete and Earn",
"question__title_slug": "delete-and-earn",
"question__hide": false,
- "total_acs": 340380,
- "total_submitted": 602413,
+ "total_acs": 343761,
+ "total_submitted": 608380,
"frontend_question_id": 740,
"is_new_question": false
},
@@ -56595,8 +57193,8 @@
"question__title": "Daily Temperatures",
"question__title_slug": "daily-temperatures",
"question__hide": false,
- "total_acs": 983456,
- "total_submitted": 1488606,
+ "total_acs": 1000194,
+ "total_submitted": 1512635,
"frontend_question_id": 739,
"is_new_question": false
},
@@ -56618,8 +57216,8 @@
"question__title": "Monotone Increasing Digits",
"question__title_slug": "monotone-increasing-digits",
"question__hide": false,
- "total_acs": 53552,
- "total_submitted": 111359,
+ "total_acs": 54027,
+ "total_submitted": 112234,
"frontend_question_id": 738,
"is_new_question": false
},
@@ -56641,8 +57239,8 @@
"question__title": "Sentence Similarity II",
"question__title_slug": "sentence-similarity-ii",
"question__hide": false,
- "total_acs": 71112,
- "total_submitted": 142180,
+ "total_acs": 71341,
+ "total_submitted": 142534,
"frontend_question_id": 737,
"is_new_question": false
},
@@ -56664,8 +57262,8 @@
"question__title": "Parse Lisp Expression",
"question__title_slug": "parse-lisp-expression",
"question__hide": false,
- "total_acs": 22220,
- "total_submitted": 42892,
+ "total_acs": 22324,
+ "total_submitted": 43063,
"frontend_question_id": 736,
"is_new_question": false
},
@@ -56687,8 +57285,8 @@
"question__title": "Asteroid Collision",
"question__title_slug": "asteroid-collision",
"question__hide": false,
- "total_acs": 510782,
- "total_submitted": 1148660,
+ "total_acs": 523482,
+ "total_submitted": 1176486,
"frontend_question_id": 735,
"is_new_question": false
},
@@ -56710,8 +57308,8 @@
"question__title": "Sentence Similarity",
"question__title_slug": "sentence-similarity",
"question__hide": false,
- "total_acs": 66536,
- "total_submitted": 150212,
+ "total_acs": 66803,
+ "total_submitted": 150719,
"frontend_question_id": 734,
"is_new_question": false
},
@@ -56733,8 +57331,8 @@
"question__title": "Flood Fill",
"question__title_slug": "flood-fill",
"question__hide": false,
- "total_acs": 907233,
- "total_submitted": 1416810,
+ "total_acs": 920949,
+ "total_submitted": 1435022,
"frontend_question_id": 733,
"is_new_question": false
},
@@ -56756,8 +57354,8 @@
"question__title": "My Calendar III",
"question__title_slug": "my-calendar-iii",
"question__hide": false,
- "total_acs": 90529,
- "total_submitted": 126436,
+ "total_acs": 90958,
+ "total_submitted": 127026,
"frontend_question_id": 732,
"is_new_question": false
},
@@ -56779,8 +57377,8 @@
"question__title": "My Calendar II",
"question__title_slug": "my-calendar-ii",
"question__hide": false,
- "total_acs": 100737,
- "total_submitted": 181411,
+ "total_acs": 101405,
+ "total_submitted": 182422,
"frontend_question_id": 731,
"is_new_question": false
},
@@ -56802,8 +57400,8 @@
"question__title": "Count Different Palindromic Subsequences",
"question__title_slug": "count-different-palindromic-subsequences",
"question__hide": false,
- "total_acs": 36786,
- "total_submitted": 80905,
+ "total_acs": 37025,
+ "total_submitted": 81294,
"frontend_question_id": 730,
"is_new_question": false
},
@@ -56825,8 +57423,8 @@
"question__title": "My Calendar I",
"question__title_slug": "my-calendar-i",
"question__hide": false,
- "total_acs": 283261,
- "total_submitted": 500492,
+ "total_acs": 285027,
+ "total_submitted": 503607,
"frontend_question_id": 729,
"is_new_question": false
},
@@ -56848,8 +57446,8 @@
"question__title": "Self Dividing Numbers",
"question__title_slug": "self-dividing-numbers",
"question__hide": false,
- "total_acs": 244325,
- "total_submitted": 310749,
+ "total_acs": 246477,
+ "total_submitted": 313190,
"frontend_question_id": 728,
"is_new_question": false
},
@@ -56871,8 +57469,8 @@
"question__title": "Minimum Window Subsequence",
"question__title_slug": "minimum-window-subsequence",
"question__hide": false,
- "total_acs": 91636,
- "total_submitted": 210746,
+ "total_acs": 91974,
+ "total_submitted": 211454,
"frontend_question_id": 727,
"is_new_question": false
},
@@ -56894,8 +57492,8 @@
"question__title": "Number of Atoms",
"question__title_slug": "number-of-atoms",
"question__hide": false,
- "total_acs": 59536,
- "total_submitted": 112567,
+ "total_acs": 60056,
+ "total_submitted": 113338,
"frontend_question_id": 726,
"is_new_question": false
},
@@ -56917,8 +57515,8 @@
"question__title": "Split Linked List in Parts",
"question__title_slug": "split-linked-list-in-parts",
"question__hide": false,
- "total_acs": 199137,
- "total_submitted": 310717,
+ "total_acs": 200388,
+ "total_submitted": 312481,
"frontend_question_id": 725,
"is_new_question": false
},
@@ -56940,8 +57538,8 @@
"question__title": "Find Pivot Index",
"question__title_slug": "find-pivot-index",
"question__hide": false,
- "total_acs": 1097994,
- "total_submitted": 1901472,
+ "total_acs": 1114642,
+ "total_submitted": 1924399,
"frontend_question_id": 724,
"is_new_question": false
},
@@ -56963,8 +57561,8 @@
"question__title": "Candy Crush",
"question__title_slug": "candy-crush",
"question__hide": false,
- "total_acs": 72263,
- "total_submitted": 93999,
+ "total_acs": 72519,
+ "total_submitted": 94324,
"frontend_question_id": 723,
"is_new_question": false
},
@@ -56986,8 +57584,8 @@
"question__title": "Remove Comments",
"question__title_slug": "remove-comments",
"question__hide": false,
- "total_acs": 71945,
- "total_submitted": 185928,
+ "total_acs": 72600,
+ "total_submitted": 187288,
"frontend_question_id": 722,
"is_new_question": false
},
@@ -57009,8 +57607,8 @@
"question__title": "Accounts Merge",
"question__title_slug": "accounts-merge",
"question__hide": false,
- "total_acs": 391707,
- "total_submitted": 683790,
+ "total_acs": 397808,
+ "total_submitted": 693017,
"frontend_question_id": 721,
"is_new_question": false
},
@@ -57032,8 +57630,8 @@
"question__title": "Longest Word in Dictionary",
"question__title_slug": "longest-word-in-dictionary",
"question__hide": false,
- "total_acs": 152434,
- "total_submitted": 290507,
+ "total_acs": 153548,
+ "total_submitted": 292292,
"frontend_question_id": 720,
"is_new_question": false
},
@@ -57055,8 +57653,8 @@
"question__title": "Find K-th Smallest Pair Distance",
"question__title_slug": "find-k-th-smallest-pair-distance",
"question__hide": false,
- "total_acs": 90790,
- "total_submitted": 238408,
+ "total_acs": 91655,
+ "total_submitted": 240040,
"frontend_question_id": 719,
"is_new_question": false
},
@@ -57078,8 +57676,8 @@
"question__title": "Maximum Length of Repeated Subarray",
"question__title_slug": "maximum-length-of-repeated-subarray",
"question__hide": false,
- "total_acs": 300187,
- "total_submitted": 589128,
+ "total_acs": 302051,
+ "total_submitted": 592870,
"frontend_question_id": 718,
"is_new_question": false
},
@@ -57101,8 +57699,8 @@
"question__title": "1-bit and 2-bit Characters",
"question__title_slug": "1-bit-and-2-bit-characters",
"question__hide": false,
- "total_acs": 134465,
- "total_submitted": 297122,
+ "total_acs": 135262,
+ "total_submitted": 299066,
"frontend_question_id": 717,
"is_new_question": false
},
@@ -57124,8 +57722,8 @@
"question__title": "Max Stack",
"question__title_slug": "max-stack",
"question__hide": false,
- "total_acs": 151922,
- "total_submitted": 337255,
+ "total_acs": 152891,
+ "total_submitted": 339346,
"frontend_question_id": 716,
"is_new_question": false
},
@@ -57147,8 +57745,8 @@
"question__title": "Range Module",
"question__title_slug": "range-module",
"question__hide": false,
- "total_acs": 72235,
- "total_submitted": 164187,
+ "total_acs": 73310,
+ "total_submitted": 166607,
"frontend_question_id": 715,
"is_new_question": false
},
@@ -57170,8 +57768,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": 366195,
- "total_submitted": 533668,
+ "total_acs": 373074,
+ "total_submitted": 542572,
"frontend_question_id": 714,
"is_new_question": false
},
@@ -57193,8 +57791,8 @@
"question__title": "Subarray Product Less Than K",
"question__title_slug": "subarray-product-less-than-k",
"question__hide": false,
- "total_acs": 406352,
- "total_submitted": 790627,
+ "total_acs": 411025,
+ "total_submitted": 798435,
"frontend_question_id": 713,
"is_new_question": false
},
@@ -57216,8 +57814,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": 144369,
- "total_submitted": 221747,
+ "total_acs": 145400,
+ "total_submitted": 223245,
"frontend_question_id": 712,
"is_new_question": false
},
@@ -57239,8 +57837,8 @@
"question__title": "Number of Distinct Islands II",
"question__title_slug": "number-of-distinct-islands-ii",
"question__hide": false,
- "total_acs": 11125,
- "total_submitted": 20985,
+ "total_acs": 11197,
+ "total_submitted": 21123,
"frontend_question_id": 711,
"is_new_question": false
},
@@ -57262,8 +57860,8 @@
"question__title": "Falling Squares",
"question__title_slug": "falling-squares",
"question__hide": false,
- "total_acs": 26787,
- "total_submitted": 59497,
+ "total_acs": 27071,
+ "total_submitted": 59982,
"frontend_question_id": 699,
"is_new_question": false
},
@@ -57285,8 +57883,8 @@
"question__title": "Partition to K Equal Sum Subsets",
"question__title_slug": "partition-to-k-equal-sum-subsets",
"question__hide": false,
- "total_acs": 269049,
- "total_submitted": 702040,
+ "total_acs": 270867,
+ "total_submitted": 707740,
"frontend_question_id": 698,
"is_new_question": false
},
@@ -57308,8 +57906,8 @@
"question__title": "Degree of an Array",
"question__title_slug": "degree-of-an-array",
"question__hide": false,
- "total_acs": 214639,
- "total_submitted": 379263,
+ "total_acs": 216051,
+ "total_submitted": 381655,
"frontend_question_id": 697,
"is_new_question": false
},
@@ -57331,8 +57929,8 @@
"question__title": "Count Binary Substrings",
"question__title_slug": "count-binary-substrings",
"question__hide": false,
- "total_acs": 208313,
- "total_submitted": 317719,
+ "total_acs": 209604,
+ "total_submitted": 319414,
"frontend_question_id": 696,
"is_new_question": false
},
@@ -57354,8 +57952,8 @@
"question__title": "Max Area of Island",
"question__title_slug": "max-area-of-island",
"question__hide": false,
- "total_acs": 868736,
- "total_submitted": 1206122,
+ "total_acs": 885532,
+ "total_submitted": 1225511,
"frontend_question_id": 695,
"is_new_question": false
},
@@ -57377,8 +57975,8 @@
"question__title": "Number of Distinct Islands",
"question__title_slug": "number-of-distinct-islands",
"question__hide": false,
- "total_acs": 166866,
- "total_submitted": 272119,
+ "total_acs": 168332,
+ "total_submitted": 274234,
"frontend_question_id": 694,
"is_new_question": false
},
@@ -57400,8 +57998,8 @@
"question__title": "Binary Number with Alternating Bits",
"question__title_slug": "binary-number-with-alternating-bits",
"question__hide": false,
- "total_acs": 134463,
- "total_submitted": 215072,
+ "total_acs": 135535,
+ "total_submitted": 216608,
"frontend_question_id": 693,
"is_new_question": false
},
@@ -57423,8 +58021,8 @@
"question__title": "Top K Frequent Words",
"question__title_slug": "top-k-frequent-words",
"question__hide": false,
- "total_acs": 617504,
- "total_submitted": 1063240,
+ "total_acs": 621727,
+ "total_submitted": 1069300,
"frontend_question_id": 692,
"is_new_question": false
},
@@ -57446,8 +58044,8 @@
"question__title": "Stickers to Spell Word",
"question__title_slug": "stickers-to-spell-word",
"question__hide": false,
- "total_acs": 70593,
- "total_submitted": 144832,
+ "total_acs": 72211,
+ "total_submitted": 147977,
"frontend_question_id": 691,
"is_new_question": false
},
@@ -57469,8 +58067,8 @@
"question__title": "Employee Importance",
"question__title_slug": "employee-importance",
"question__hide": false,
- "total_acs": 211877,
- "total_submitted": 316481,
+ "total_acs": 213380,
+ "total_submitted": 318167,
"frontend_question_id": 690,
"is_new_question": false
},
@@ -57492,8 +58090,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": 76879,
- "total_submitted": 153603,
+ "total_acs": 77296,
+ "total_submitted": 154275,
"frontend_question_id": 689,
"is_new_question": false
},
@@ -57515,8 +58113,8 @@
"question__title": "Knight Probability in Chessboard",
"question__title_slug": "knight-probability-in-chessboard",
"question__hide": false,
- "total_acs": 155849,
- "total_submitted": 277335,
+ "total_acs": 156790,
+ "total_submitted": 278906,
"frontend_question_id": 688,
"is_new_question": false
},
@@ -57538,8 +58136,8 @@
"question__title": "Longest Univalue Path",
"question__title_slug": "longest-univalue-path",
"question__hide": false,
- "total_acs": 184106,
- "total_submitted": 442874,
+ "total_acs": 185282,
+ "total_submitted": 445002,
"frontend_question_id": 687,
"is_new_question": false
},
@@ -57561,8 +58159,8 @@
"question__title": "Repeated String Match",
"question__title_slug": "repeated-string-match",
"question__hide": false,
- "total_acs": 167637,
- "total_submitted": 478324,
+ "total_acs": 169817,
+ "total_submitted": 483334,
"frontend_question_id": 686,
"is_new_question": false
},
@@ -57584,8 +58182,8 @@
"question__title": "Redundant Connection II",
"question__title_slug": "redundant-connection-ii",
"question__hide": false,
- "total_acs": 70499,
- "total_submitted": 204456,
+ "total_acs": 71076,
+ "total_submitted": 205927,
"frontend_question_id": 685,
"is_new_question": false
},
@@ -57607,8 +58205,8 @@
"question__title": "Redundant Connection",
"question__title_slug": "redundant-connection",
"question__hide": false,
- "total_acs": 360578,
- "total_submitted": 572754,
+ "total_acs": 365398,
+ "total_submitted": 579785,
"frontend_question_id": 684,
"is_new_question": false
},
@@ -57630,8 +58228,8 @@
"question__title": "K Empty Slots",
"question__title_slug": "k-empty-slots",
"question__hide": false,
- "total_acs": 61187,
- "total_submitted": 164997,
+ "total_acs": 61309,
+ "total_submitted": 165276,
"frontend_question_id": 683,
"is_new_question": false
},
@@ -57653,8 +58251,8 @@
"question__title": "Baseball Game",
"question__title_slug": "baseball-game",
"question__hide": false,
- "total_acs": 354760,
- "total_submitted": 464471,
+ "total_acs": 360707,
+ "total_submitted": 471300,
"frontend_question_id": 682,
"is_new_question": false
},
@@ -57676,8 +58274,8 @@
"question__title": "Next Closest Time",
"question__title_slug": "next-closest-time",
"question__hide": false,
- "total_acs": 108699,
- "total_submitted": 232917,
+ "total_acs": 109153,
+ "total_submitted": 233736,
"frontend_question_id": 681,
"is_new_question": false
},
@@ -57699,8 +58297,8 @@
"question__title": "Valid Palindrome II",
"question__title_slug": "valid-palindrome-ii",
"question__hide": false,
- "total_acs": 748564,
- "total_submitted": 1834802,
+ "total_acs": 757834,
+ "total_submitted": 1852563,
"frontend_question_id": 680,
"is_new_question": false
},
@@ -57722,8 +58320,8 @@
"question__title": "24 Game",
"question__title_slug": "24-game",
"question__hide": false,
- "total_acs": 78781,
- "total_submitted": 159583,
+ "total_acs": 79091,
+ "total_submitted": 160135,
"frontend_question_id": 679,
"is_new_question": false
},
@@ -57745,8 +58343,8 @@
"question__title": "Valid Parenthesis String",
"question__title_slug": "valid-parenthesis-string",
"question__hide": false,
- "total_acs": 372183,
- "total_submitted": 979551,
+ "total_acs": 377884,
+ "total_submitted": 993207,
"frontend_question_id": 678,
"is_new_question": false
},
@@ -57768,8 +58366,8 @@
"question__title": "Map Sum Pairs",
"question__title_slug": "map-sum-pairs",
"question__hide": false,
- "total_acs": 116074,
- "total_submitted": 204686,
+ "total_acs": 116827,
+ "total_submitted": 206005,
"frontend_question_id": 677,
"is_new_question": false
},
@@ -57791,8 +58389,8 @@
"question__title": "Implement Magic Dictionary",
"question__title_slug": "implement-magic-dictionary",
"question__hide": false,
- "total_acs": 83805,
- "total_submitted": 145846,
+ "total_acs": 84501,
+ "total_submitted": 146987,
"frontend_question_id": 676,
"is_new_question": false
},
@@ -57814,8 +58412,8 @@
"question__title": "Cut Off Trees for Golf Event",
"question__title_slug": "cut-off-trees-for-golf-event",
"question__hide": false,
- "total_acs": 68688,
- "total_submitted": 199794,
+ "total_acs": 69078,
+ "total_submitted": 200678,
"frontend_question_id": 675,
"is_new_question": false
},
@@ -57837,8 +58435,8 @@
"question__title": "Longest Continuous Increasing Subsequence",
"question__title_slug": "longest-continuous-increasing-subsequence",
"question__hide": false,
- "total_acs": 265817,
- "total_submitted": 528713,
+ "total_acs": 267831,
+ "total_submitted": 532163,
"frontend_question_id": 674,
"is_new_question": false
},
@@ -57860,8 +58458,8 @@
"question__title": "Number of Longest Increasing Subsequence",
"question__title_slug": "number-of-longest-increasing-subsequence",
"question__hide": false,
- "total_acs": 229434,
- "total_submitted": 477376,
+ "total_acs": 232682,
+ "total_submitted": 483045,
"frontend_question_id": 673,
"is_new_question": false
},
@@ -57883,8 +58481,8 @@
"question__title": "Bulb Switcher II",
"question__title_slug": "bulb-switcher-ii",
"question__hide": false,
- "total_acs": 22890,
- "total_submitted": 45668,
+ "total_acs": 23138,
+ "total_submitted": 46103,
"frontend_question_id": 672,
"is_new_question": false
},
@@ -57906,8 +58504,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": 192796,
- "total_submitted": 432709,
+ "total_acs": 194174,
+ "total_submitted": 435564,
"frontend_question_id": 671,
"is_new_question": false
},
@@ -57929,8 +58527,8 @@
"question__title": "Maximum Swap",
"question__title_slug": "maximum-swap",
"question__hide": false,
- "total_acs": 251101,
- "total_submitted": 514736,
+ "total_acs": 254249,
+ "total_submitted": 520612,
"frontend_question_id": 670,
"is_new_question": false
},
@@ -57952,8 +58550,8 @@
"question__title": "Trim a Binary Search Tree",
"question__title_slug": "trim-a-binary-search-tree",
"question__hide": false,
- "total_acs": 294184,
- "total_submitted": 443973,
+ "total_acs": 295623,
+ "total_submitted": 446099,
"frontend_question_id": 669,
"is_new_question": false
},
@@ -57975,8 +58573,8 @@
"question__title": "Kth Smallest Number in Multiplication Table",
"question__title_slug": "kth-smallest-number-in-multiplication-table",
"question__hide": false,
- "total_acs": 64137,
- "total_submitted": 124009,
+ "total_acs": 64722,
+ "total_submitted": 125002,
"frontend_question_id": 668,
"is_new_question": false
},
@@ -57998,8 +58596,8 @@
"question__title": "Beautiful Arrangement II",
"question__title_slug": "beautiful-arrangement-ii",
"question__hide": false,
- "total_acs": 53841,
- "total_submitted": 89460,
+ "total_acs": 54020,
+ "total_submitted": 89755,
"frontend_question_id": 667,
"is_new_question": false
},
@@ -58021,8 +58619,8 @@
"question__title": "Path Sum IV",
"question__title_slug": "path-sum-iv",
"question__hide": false,
- "total_acs": 34532,
- "total_submitted": 56385,
+ "total_acs": 34810,
+ "total_submitted": 56753,
"frontend_question_id": 666,
"is_new_question": false
},
@@ -58044,8 +58642,8 @@
"question__title": "Non-decreasing Array",
"question__title_slug": "non-decreasing-array",
"question__hide": false,
- "total_acs": 263200,
- "total_submitted": 1064765,
+ "total_acs": 264165,
+ "total_submitted": 1067881,
"frontend_question_id": 665,
"is_new_question": false
},
@@ -58067,8 +58665,8 @@
"question__title": "Strange Printer",
"question__title_slug": "strange-printer",
"question__hide": false,
- "total_acs": 73798,
- "total_submitted": 134286,
+ "total_acs": 74122,
+ "total_submitted": 134849,
"frontend_question_id": 664,
"is_new_question": false
},
@@ -58090,8 +58688,8 @@
"question__title": "Equal Tree Partition",
"question__title_slug": "equal-tree-partition",
"question__hide": false,
- "total_acs": 30975,
- "total_submitted": 74584,
+ "total_acs": 31060,
+ "total_submitted": 74789,
"frontend_question_id": 663,
"is_new_question": false
},
@@ -58113,8 +58711,8 @@
"question__title": "Maximum Width of Binary Tree",
"question__title_slug": "maximum-width-of-binary-tree",
"question__hide": false,
- "total_acs": 376350,
- "total_submitted": 875192,
+ "total_acs": 383030,
+ "total_submitted": 890604,
"frontend_question_id": 662,
"is_new_question": false
},
@@ -58136,8 +58734,8 @@
"question__title": "Image Smoother",
"question__title_slug": "image-smoother",
"question__hide": false,
- "total_acs": 166181,
- "total_submitted": 246805,
+ "total_acs": 167149,
+ "total_submitted": 248003,
"frontend_question_id": 661,
"is_new_question": false
},
@@ -58159,8 +58757,8 @@
"question__title": "Remove 9",
"question__title_slug": "remove-9",
"question__hide": false,
- "total_acs": 10740,
- "total_submitted": 18713,
+ "total_acs": 10766,
+ "total_submitted": 18755,
"frontend_question_id": 660,
"is_new_question": false
},
@@ -58182,8 +58780,8 @@
"question__title": "Split Array into Consecutive Subsequences",
"question__title_slug": "split-array-into-consecutive-subsequences",
"question__hide": false,
- "total_acs": 130091,
- "total_submitted": 254697,
+ "total_acs": 130715,
+ "total_submitted": 255776,
"frontend_question_id": 659,
"is_new_question": false
},
@@ -58205,8 +58803,8 @@
"question__title": "Find K Closest Elements",
"question__title_slug": "find-k-closest-elements",
"question__hide": false,
- "total_acs": 548374,
- "total_submitted": 1155344,
+ "total_acs": 555646,
+ "total_submitted": 1169003,
"frontend_question_id": 658,
"is_new_question": false
},
@@ -58228,8 +58826,8 @@
"question__title": "Robot Return to Origin",
"question__title_slug": "robot-return-to-origin",
"question__hide": false,
- "total_acs": 429702,
- "total_submitted": 567260,
+ "total_acs": 433614,
+ "total_submitted": 571960,
"frontend_question_id": 657,
"is_new_question": false
},
@@ -58251,8 +58849,8 @@
"question__title": "Coin Path",
"question__title_slug": "coin-path",
"question__hide": false,
- "total_acs": 14160,
- "total_submitted": 44091,
+ "total_acs": 14193,
+ "total_submitted": 44213,
"frontend_question_id": 656,
"is_new_question": false
},
@@ -58274,8 +58872,8 @@
"question__title": "Print Binary Tree",
"question__title_slug": "print-binary-tree",
"question__hide": false,
- "total_acs": 68885,
- "total_submitted": 107918,
+ "total_acs": 69855,
+ "total_submitted": 109040,
"frontend_question_id": 655,
"is_new_question": false
},
@@ -58297,8 +58895,8 @@
"question__title": "Maximum Binary Tree",
"question__title_slug": "maximum-binary-tree",
"question__hide": false,
- "total_acs": 293549,
- "total_submitted": 343809,
+ "total_acs": 295604,
+ "total_submitted": 346078,
"frontend_question_id": 654,
"is_new_question": false
},
@@ -58320,8 +58918,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": 539293,
- "total_submitted": 880408,
+ "total_acs": 546558,
+ "total_submitted": 891429,
"frontend_question_id": 653,
"is_new_question": false
},
@@ -58343,8 +58941,8 @@
"question__title": "Find Duplicate Subtrees",
"question__title_slug": "find-duplicate-subtrees",
"question__hide": false,
- "total_acs": 262685,
- "total_submitted": 441828,
+ "total_acs": 264361,
+ "total_submitted": 444424,
"frontend_question_id": 652,
"is_new_question": false
},
@@ -58366,8 +58964,8 @@
"question__title": "4 Keys Keyboard",
"question__title_slug": "4-keys-keyboard",
"question__hide": false,
- "total_acs": 29636,
- "total_submitted": 53118,
+ "total_acs": 29776,
+ "total_submitted": 53330,
"frontend_question_id": 651,
"is_new_question": false
},
@@ -58389,8 +58987,8 @@
"question__title": "2 Keys Keyboard",
"question__title_slug": "2-keys-keyboard",
"question__hide": false,
- "total_acs": 135534,
- "total_submitted": 250262,
+ "total_acs": 136923,
+ "total_submitted": 252628,
"frontend_question_id": 650,
"is_new_question": false
},
@@ -58412,8 +59010,8 @@
"question__title": "Dota2 Senate",
"question__title_slug": "dota2-senate",
"question__hide": false,
- "total_acs": 147461,
- "total_submitted": 309725,
+ "total_acs": 151960,
+ "total_submitted": 318982,
"frontend_question_id": 649,
"is_new_question": false
},
@@ -58429,14 +59027,14 @@
{
"stat": {
"question_id": 648,
- "question__article__live": null,
- "question__article__slug": null,
- "question__article__has_video_solution": null,
+ "question__article__live": true,
+ "question__article__slug": "replace-words",
+ "question__article__has_video_solution": false,
"question__title": "Replace Words",
"question__title_slug": "replace-words",
"question__hide": false,
- "total_acs": 139510,
- "total_submitted": 221678,
+ "total_acs": 266300,
+ "total_submitted": 391702,
"frontend_question_id": 648,
"is_new_question": false
},
@@ -58458,8 +59056,8 @@
"question__title": "Palindromic Substrings",
"question__title_slug": "palindromic-substrings",
"question__hide": false,
- "total_acs": 814541,
- "total_submitted": 1160141,
+ "total_acs": 824005,
+ "total_submitted": 1172352,
"frontend_question_id": 647,
"is_new_question": false
},
@@ -58481,8 +59079,8 @@
"question__title": "Maximum Length of Pair Chain",
"question__title_slug": "maximum-length-of-pair-chain",
"question__hide": false,
- "total_acs": 235187,
- "total_submitted": 392622,
+ "total_acs": 237827,
+ "total_submitted": 396628,
"frontend_question_id": 646,
"is_new_question": false
},
@@ -58504,8 +59102,8 @@
"question__title": "Set Mismatch",
"question__title_slug": "set-mismatch",
"question__hide": false,
- "total_acs": 448611,
- "total_submitted": 1007666,
+ "total_acs": 456468,
+ "total_submitted": 1026986,
"frontend_question_id": 645,
"is_new_question": false
},
@@ -58527,8 +59125,8 @@
"question__title": "Maximum Average Subarray II",
"question__title_slug": "maximum-average-subarray-ii",
"question__hide": false,
- "total_acs": 20451,
- "total_submitted": 55686,
+ "total_acs": 20530,
+ "total_submitted": 55847,
"frontend_question_id": 644,
"is_new_question": false
},
@@ -58550,8 +59148,8 @@
"question__title": "Maximum Average Subarray I",
"question__title_slug": "maximum-average-subarray-i",
"question__hide": false,
- "total_acs": 470090,
- "total_submitted": 1083836,
+ "total_acs": 486869,
+ "total_submitted": 1119840,
"frontend_question_id": 643,
"is_new_question": false
},
@@ -58573,8 +59171,8 @@
"question__title": "Design Search Autocomplete System",
"question__title_slug": "design-search-autocomplete-system",
"question__hide": false,
- "total_acs": 141885,
- "total_submitted": 289902,
+ "total_acs": 142743,
+ "total_submitted": 291433,
"frontend_question_id": 642,
"is_new_question": false
},
@@ -58596,8 +59194,8 @@
"question__title": "Solve the Equation",
"question__title_slug": "solve-the-equation",
"question__hide": false,
- "total_acs": 39574,
- "total_submitted": 90372,
+ "total_acs": 39789,
+ "total_submitted": 90804,
"frontend_question_id": 640,
"is_new_question": false
},
@@ -58619,8 +59217,8 @@
"question__title": "Decode Ways II",
"question__title_slug": "decode-ways-ii",
"question__hide": false,
- "total_acs": 74524,
- "total_submitted": 242653,
+ "total_acs": 74929,
+ "total_submitted": 243740,
"frontend_question_id": 639,
"is_new_question": false
},
@@ -58642,8 +59240,8 @@
"question__title": "Shopping Offers",
"question__title_slug": "shopping-offers",
"question__hide": false,
- "total_acs": 60945,
- "total_submitted": 117046,
+ "total_acs": 61371,
+ "total_submitted": 118000,
"frontend_question_id": 638,
"is_new_question": false
},
@@ -58665,8 +59263,8 @@
"question__title": "Average of Levels in Binary Tree",
"question__title_slug": "average-of-levels-in-binary-tree",
"question__hide": false,
- "total_acs": 513355,
- "total_submitted": 705555,
+ "total_acs": 521179,
+ "total_submitted": 715396,
"frontend_question_id": 637,
"is_new_question": false
},
@@ -58688,8 +59286,8 @@
"question__title": "Exclusive Time of Functions",
"question__title_slug": "exclusive-time-of-functions",
"question__hide": false,
- "total_acs": 220794,
- "total_submitted": 355190,
+ "total_acs": 222978,
+ "total_submitted": 359120,
"frontend_question_id": 636,
"is_new_question": false
},
@@ -58711,8 +59309,8 @@
"question__title": "Design Log Storage System",
"question__title_slug": "design-log-storage-system",
"question__hide": false,
- "total_acs": 35033,
- "total_submitted": 57373,
+ "total_acs": 35111,
+ "total_submitted": 57655,
"frontend_question_id": 635,
"is_new_question": false
},
@@ -58734,8 +59332,8 @@
"question__title": "Find the Derangement of An Array",
"question__title_slug": "find-the-derangement-of-an-array",
"question__hide": false,
- "total_acs": 11179,
- "total_submitted": 26662,
+ "total_acs": 11224,
+ "total_submitted": 26791,
"frontend_question_id": 634,
"is_new_question": false
},
@@ -58757,8 +59355,8 @@
"question__title": "Sum of Square Numbers",
"question__title_slug": "sum-of-square-numbers",
"question__hide": false,
- "total_acs": 201856,
- "total_submitted": 594586,
+ "total_acs": 346441,
+ "total_submitted": 945040,
"frontend_question_id": 633,
"is_new_question": false
},
@@ -58780,8 +59378,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": 106966,
- "total_submitted": 170790,
+ "total_acs": 108324,
+ "total_submitted": 172656,
"frontend_question_id": 632,
"is_new_question": false
},
@@ -58803,8 +59401,8 @@
"question__title": "Design Excel Sum Formula",
"question__title_slug": "design-excel-sum-formula",
"question__hide": false,
- "total_acs": 17142,
- "total_submitted": 39123,
+ "total_acs": 17413,
+ "total_submitted": 39737,
"frontend_question_id": 631,
"is_new_question": false
},
@@ -58826,8 +59424,8 @@
"question__title": "Course Schedule III",
"question__title_slug": "course-schedule-iii",
"question__hide": false,
- "total_acs": 111745,
- "total_submitted": 277912,
+ "total_acs": 112282,
+ "total_submitted": 279199,
"frontend_question_id": 630,
"is_new_question": false
},
@@ -58849,8 +59447,8 @@
"question__title": "K Inverse Pairs Array",
"question__title_slug": "k-inverse-pairs-array",
"question__hide": false,
- "total_acs": 127574,
- "total_submitted": 255888,
+ "total_acs": 128719,
+ "total_submitted": 258829,
"frontend_question_id": 629,
"is_new_question": false
},
@@ -58872,8 +59470,8 @@
"question__title": "Maximum Product of Three Numbers",
"question__title_slug": "maximum-product-of-three-numbers",
"question__hide": false,
- "total_acs": 325535,
- "total_submitted": 719697,
+ "total_acs": 328815,
+ "total_submitted": 727407,
"frontend_question_id": 628,
"is_new_question": false
},
@@ -58895,8 +59493,8 @@
"question__title": "Swap Salary",
"question__title_slug": "swap-salary",
"question__hide": false,
- "total_acs": 410593,
- "total_submitted": 492975,
+ "total_acs": 413787,
+ "total_submitted": 496649,
"frontend_question_id": 627,
"is_new_question": false
},
@@ -58918,8 +59516,8 @@
"question__title": "Exchange Seats",
"question__title_slug": "exchange-seats",
"question__hide": false,
- "total_acs": 216680,
- "total_submitted": 310407,
+ "total_acs": 222735,
+ "total_submitted": 318708,
"frontend_question_id": 626,
"is_new_question": false
},
@@ -58941,8 +59539,8 @@
"question__title": "Minimum Factorization",
"question__title_slug": "minimum-factorization",
"question__hide": false,
- "total_acs": 11318,
- "total_submitted": 33681,
+ "total_acs": 11355,
+ "total_submitted": 33780,
"frontend_question_id": 625,
"is_new_question": false
},
@@ -58964,8 +59562,8 @@
"question__title": "Maximum Distance in Arrays",
"question__title_slug": "maximum-distance-in-arrays",
"question__hide": false,
- "total_acs": 49449,
- "total_submitted": 116606,
+ "total_acs": 49727,
+ "total_submitted": 117300,
"frontend_question_id": 624,
"is_new_question": false
},
@@ -58987,8 +59585,8 @@
"question__title": "Add One Row to Tree",
"question__title_slug": "add-one-row-to-tree",
"question__hide": false,
- "total_acs": 273034,
- "total_submitted": 426442,
+ "total_acs": 274144,
+ "total_submitted": 428136,
"frontend_question_id": 623,
"is_new_question": false
},
@@ -59010,8 +59608,8 @@
"question__title": "Task Scheduler",
"question__title_slug": "task-scheduler",
"question__hide": false,
- "total_acs": 633169,
- "total_submitted": 1055719,
+ "total_acs": 640887,
+ "total_submitted": 1067343,
"frontend_question_id": 621,
"is_new_question": false
},
@@ -59033,8 +59631,8 @@
"question__title": "Not Boring Movies",
"question__title_slug": "not-boring-movies",
"question__hide": false,
- "total_acs": 472490,
- "total_submitted": 640931,
+ "total_acs": 490015,
+ "total_submitted": 664190,
"frontend_question_id": 620,
"is_new_question": false
},
@@ -59056,8 +59654,8 @@
"question__title": "Biggest Single Number",
"question__title_slug": "biggest-single-number",
"question__hide": false,
- "total_acs": 198833,
- "total_submitted": 315012,
+ "total_acs": 208350,
+ "total_submitted": 327500,
"frontend_question_id": 619,
"is_new_question": false
},
@@ -59079,8 +59677,8 @@
"question__title": "Students Report By Geography",
"question__title_slug": "students-report-by-geography",
"question__hide": false,
- "total_acs": 24074,
- "total_submitted": 37939,
+ "total_acs": 24252,
+ "total_submitted": 38208,
"frontend_question_id": 618,
"is_new_question": false
},
@@ -59102,8 +59700,8 @@
"question__title": "Merge Two Binary Trees",
"question__title_slug": "merge-two-binary-trees",
"question__hide": false,
- "total_acs": 770828,
- "total_submitted": 976235,
+ "total_acs": 774973,
+ "total_submitted": 981223,
"frontend_question_id": 617,
"is_new_question": false
},
@@ -59125,8 +59723,8 @@
"question__title": "Add Bold Tag in String",
"question__title_slug": "add-bold-tag-in-string",
"question__hide": false,
- "total_acs": 90727,
- "total_submitted": 182180,
+ "total_acs": 91106,
+ "total_submitted": 182802,
"frontend_question_id": 616,
"is_new_question": false
},
@@ -59148,8 +59746,8 @@
"question__title": "Average Salary: Departments VS Company",
"question__title_slug": "average-salary-departments-vs-company",
"question__hide": false,
- "total_acs": 36312,
- "total_submitted": 64732,
+ "total_acs": 36545,
+ "total_submitted": 65100,
"frontend_question_id": 615,
"is_new_question": false
},
@@ -59171,8 +59769,8 @@
"question__title": "Second Degree Follower",
"question__title_slug": "second-degree-follower",
"question__hide": false,
- "total_acs": 53085,
- "total_submitted": 137313,
+ "total_acs": 53374,
+ "total_submitted": 137845,
"frontend_question_id": 614,
"is_new_question": false
},
@@ -59194,8 +59792,8 @@
"question__title": "Shortest Distance in a Line",
"question__title_slug": "shortest-distance-in-a-line",
"question__hide": false,
- "total_acs": 71658,
- "total_submitted": 89382,
+ "total_acs": 72127,
+ "total_submitted": 89984,
"frontend_question_id": 613,
"is_new_question": false
},
@@ -59217,8 +59815,8 @@
"question__title": "Shortest Distance in a Plane",
"question__title_slug": "shortest-distance-in-a-plane",
"question__hide": false,
- "total_acs": 40966,
- "total_submitted": 66767,
+ "total_acs": 41202,
+ "total_submitted": 67123,
"frontend_question_id": 612,
"is_new_question": false
},
@@ -59240,8 +59838,8 @@
"question__title": "Valid Triangle Number",
"question__title_slug": "valid-triangle-number",
"question__hide": false,
- "total_acs": 195672,
- "total_submitted": 382272,
+ "total_acs": 197372,
+ "total_submitted": 385231,
"frontend_question_id": 611,
"is_new_question": false
},
@@ -59263,8 +59861,8 @@
"question__title": "Triangle Judgement",
"question__title_slug": "triangle-judgement",
"question__hide": false,
- "total_acs": 178042,
- "total_submitted": 248735,
+ "total_acs": 185859,
+ "total_submitted": 259169,
"frontend_question_id": 610,
"is_new_question": false
},
@@ -59286,8 +59884,8 @@
"question__title": "Find Duplicate File in System",
"question__title_slug": "find-duplicate-file-in-system",
"question__hide": false,
- "total_acs": 151710,
- "total_submitted": 224281,
+ "total_acs": 152128,
+ "total_submitted": 224871,
"frontend_question_id": 609,
"is_new_question": false
},
@@ -59309,8 +59907,8 @@
"question__title": "Tree Node",
"question__title_slug": "tree-node",
"question__hide": false,
- "total_acs": 158815,
- "total_submitted": 219625,
+ "total_acs": 160819,
+ "total_submitted": 222153,
"frontend_question_id": 608,
"is_new_question": false
},
@@ -59332,8 +59930,8 @@
"question__title": "Sales Person",
"question__title_slug": "sales-person",
"question__hide": false,
- "total_acs": 214045,
- "total_submitted": 325600,
+ "total_acs": 217304,
+ "total_submitted": 330888,
"frontend_question_id": 607,
"is_new_question": false
},
@@ -59355,8 +59953,8 @@
"question__title": "Construct String from Binary Tree",
"question__title_slug": "construct-string-from-binary-tree",
"question__hide": false,
- "total_acs": 319118,
- "total_submitted": 460719,
+ "total_acs": 320313,
+ "total_submitted": 462096,
"frontend_question_id": 606,
"is_new_question": false
},
@@ -59378,8 +59976,8 @@
"question__title": "Can Place Flowers",
"question__title_slug": "can-place-flowers",
"question__hide": false,
- "total_acs": 787428,
- "total_submitted": 2703735,
+ "total_acs": 808509,
+ "total_submitted": 2779783,
"frontend_question_id": 605,
"is_new_question": false
},
@@ -59401,8 +59999,8 @@
"question__title": "Design Compressed String Iterator",
"question__title_slug": "design-compressed-string-iterator",
"question__hide": false,
- "total_acs": 33327,
- "total_submitted": 83777,
+ "total_acs": 33516,
+ "total_submitted": 84205,
"frontend_question_id": 604,
"is_new_question": false
},
@@ -59424,8 +60022,8 @@
"question__title": "Consecutive Available Seats",
"question__title_slug": "consecutive-available-seats",
"question__hide": false,
- "total_acs": 86531,
- "total_submitted": 131060,
+ "total_acs": 87090,
+ "total_submitted": 132030,
"frontend_question_id": 603,
"is_new_question": false
},
@@ -59447,8 +60045,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": 131808,
- "total_submitted": 229748,
+ "total_acs": 136967,
+ "total_submitted": 238513,
"frontend_question_id": 602,
"is_new_question": false
},
@@ -59470,8 +60068,8 @@
"question__title": "Human Traffic of Stadium",
"question__title_slug": "human-traffic-of-stadium",
"question__hide": false,
- "total_acs": 101912,
- "total_submitted": 209578,
+ "total_acs": 103246,
+ "total_submitted": 212124,
"frontend_question_id": 601,
"is_new_question": false
},
@@ -59493,8 +60091,8 @@
"question__title": "Non-negative Integers without Consecutive Ones",
"question__title_slug": "non-negative-integers-without-consecutive-ones",
"question__hide": false,
- "total_acs": 39351,
- "total_submitted": 98774,
+ "total_acs": 39629,
+ "total_submitted": 99369,
"frontend_question_id": 600,
"is_new_question": false
},
@@ -59516,8 +60114,8 @@
"question__title": "Minimum Index Sum of Two Lists",
"question__title_slug": "minimum-index-sum-of-two-lists",
"question__hide": false,
- "total_acs": 230026,
- "total_submitted": 413865,
+ "total_acs": 232257,
+ "total_submitted": 416939,
"frontend_question_id": 599,
"is_new_question": false
},
@@ -59539,8 +60137,8 @@
"question__title": "Range Addition II",
"question__title_slug": "range-addition-ii",
"question__hide": false,
- "total_acs": 102269,
- "total_submitted": 182171,
+ "total_acs": 103029,
+ "total_submitted": 183354,
"frontend_question_id": 598,
"is_new_question": false
},
@@ -59562,8 +60160,8 @@
"question__title": "Friend Requests I: Overall Acceptance Rate",
"question__title_slug": "friend-requests-i-overall-acceptance-rate",
"question__hide": false,
- "total_acs": 75277,
- "total_submitted": 179648,
+ "total_acs": 75636,
+ "total_submitted": 180664,
"frontend_question_id": 597,
"is_new_question": false
},
@@ -59585,8 +60183,8 @@
"question__title": "Classes More Than 5 Students",
"question__title_slug": "classes-more-than-5-students",
"question__hide": false,
- "total_acs": 409840,
- "total_submitted": 742511,
+ "total_acs": 421311,
+ "total_submitted": 758389,
"frontend_question_id": 596,
"is_new_question": false
},
@@ -59608,8 +60206,8 @@
"question__title": "Big Countries",
"question__title_slug": "big-countries",
"question__hide": false,
- "total_acs": 1172372,
- "total_submitted": 1720585,
+ "total_acs": 1208618,
+ "total_submitted": 1775025,
"frontend_question_id": 595,
"is_new_question": false
},
@@ -59631,8 +60229,8 @@
"question__title": "Longest Harmonious Subsequence",
"question__title_slug": "longest-harmonious-subsequence",
"question__hide": false,
- "total_acs": 159000,
- "total_submitted": 290528,
+ "total_acs": 160790,
+ "total_submitted": 293269,
"frontend_question_id": 594,
"is_new_question": false
},
@@ -59654,8 +60252,8 @@
"question__title": "Valid Square",
"question__title_slug": "valid-square",
"question__hide": false,
- "total_acs": 108442,
- "total_submitted": 246344,
+ "total_acs": 109200,
+ "total_submitted": 247865,
"frontend_question_id": 593,
"is_new_question": false
},
@@ -59677,8 +60275,8 @@
"question__title": "Fraction Addition and Subtraction",
"question__title_slug": "fraction-addition-and-subtraction",
"question__hide": false,
- "total_acs": 36136,
- "total_submitted": 67783,
+ "total_acs": 36438,
+ "total_submitted": 68202,
"frontend_question_id": 592,
"is_new_question": false
},
@@ -59700,8 +60298,8 @@
"question__title": "Tag Validator",
"question__title_slug": "tag-validator",
"question__hide": false,
- "total_acs": 15147,
- "total_submitted": 39581,
+ "total_acs": 15363,
+ "total_submitted": 39913,
"frontend_question_id": 591,
"is_new_question": false
},
@@ -59723,8 +60321,8 @@
"question__title": "Design In-Memory File System",
"question__title_slug": "design-in-memory-file-system",
"question__hide": false,
- "total_acs": 104067,
- "total_submitted": 216376,
+ "total_acs": 105223,
+ "total_submitted": 218758,
"frontend_question_id": 588,
"is_new_question": false
},
@@ -59746,8 +60344,8 @@
"question__title": "Erect the Fence",
"question__title_slug": "erect-the-fence",
"question__hide": false,
- "total_acs": 57825,
- "total_submitted": 111308,
+ "total_acs": 58035,
+ "total_submitted": 111780,
"frontend_question_id": 587,
"is_new_question": false
},
@@ -59769,8 +60367,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": 259663,
- "total_submitted": 401004,
+ "total_acs": 264085,
+ "total_submitted": 408135,
"frontend_question_id": 586,
"is_new_question": false
},
@@ -59792,8 +60390,8 @@
"question__title": "Investments in 2016",
"question__title_slug": "investments-in-2016",
"question__hide": false,
- "total_acs": 109075,
- "total_submitted": 228240,
+ "total_acs": 114151,
+ "total_submitted": 238273,
"frontend_question_id": 585,
"is_new_question": false
},
@@ -59815,8 +60413,8 @@
"question__title": "Find Customer Referee",
"question__title_slug": "find-customer-referee",
"question__hide": false,
- "total_acs": 863003,
- "total_submitted": 1234039,
+ "total_acs": 901095,
+ "total_submitted": 1287259,
"frontend_question_id": 584,
"is_new_question": false
},
@@ -59838,8 +60436,8 @@
"question__title": "Delete Operation for Two Strings",
"question__title_slug": "delete-operation-for-two-strings",
"question__hide": false,
- "total_acs": 251280,
- "total_submitted": 407225,
+ "total_acs": 255647,
+ "total_submitted": 412946,
"frontend_question_id": 583,
"is_new_question": false
},
@@ -59861,8 +60459,8 @@
"question__title": "Kill Process",
"question__title_slug": "kill-process",
"question__hide": false,
- "total_acs": 85423,
- "total_submitted": 123036,
+ "total_acs": 85889,
+ "total_submitted": 123631,
"frontend_question_id": 582,
"is_new_question": false
},
@@ -59884,8 +60482,8 @@
"question__title": "Shortest Unsorted Continuous Subarray",
"question__title_slug": "shortest-unsorted-continuous-subarray",
"question__hide": false,
- "total_acs": 328880,
- "total_submitted": 891634,
+ "total_acs": 330587,
+ "total_submitted": 895494,
"frontend_question_id": 581,
"is_new_question": false
},
@@ -59907,8 +60505,8 @@
"question__title": "Count Student Number in Departments",
"question__title_slug": "count-student-number-in-departments",
"question__hide": false,
- "total_acs": 67310,
- "total_submitted": 114103,
+ "total_acs": 67629,
+ "total_submitted": 114575,
"frontend_question_id": 580,
"is_new_question": false
},
@@ -59930,8 +60528,8 @@
"question__title": "Find Cumulative Salary of an Employee",
"question__title_slug": "find-cumulative-salary-of-an-employee",
"question__hide": false,
- "total_acs": 35046,
- "total_submitted": 74600,
+ "total_acs": 35295,
+ "total_submitted": 74948,
"frontend_question_id": 579,
"is_new_question": false
},
@@ -59953,8 +60551,8 @@
"question__title": "Get Highest Answer Rate Question",
"question__title_slug": "get-highest-answer-rate-question",
"question__hide": false,
- "total_acs": 55973,
- "total_submitted": 138936,
+ "total_acs": 56352,
+ "total_submitted": 139955,
"frontend_question_id": 578,
"is_new_question": false
},
@@ -59976,8 +60574,8 @@
"question__title": "Employee Bonus",
"question__title_slug": "employee-bonus",
"question__hide": false,
- "total_acs": 359443,
- "total_submitted": 477842,
+ "total_acs": 379346,
+ "total_submitted": 503309,
"frontend_question_id": 577,
"is_new_question": false
},
@@ -59999,8 +60597,8 @@
"question__title": "Out of Boundary Paths",
"question__title_slug": "out-of-boundary-paths",
"question__hide": false,
- "total_acs": 207003,
- "total_submitted": 430680,
+ "total_acs": 208278,
+ "total_submitted": 433243,
"frontend_question_id": 576,
"is_new_question": false
},
@@ -60022,8 +60620,8 @@
"question__title": "Distribute Candies",
"question__title_slug": "distribute-candies",
"question__hide": false,
- "total_acs": 284869,
- "total_submitted": 420145,
+ "total_acs": 287693,
+ "total_submitted": 423830,
"frontend_question_id": 575,
"is_new_question": false
},
@@ -60045,8 +60643,8 @@
"question__title": "Winning Candidate",
"question__title_slug": "winning-candidate",
"question__hide": false,
- "total_acs": 64449,
- "total_submitted": 106032,
+ "total_acs": 64828,
+ "total_submitted": 106547,
"frontend_question_id": 574,
"is_new_question": false
},
@@ -60068,8 +60666,8 @@
"question__title": "Squirrel Simulation",
"question__title_slug": "squirrel-simulation",
"question__hide": false,
- "total_acs": 22333,
- "total_submitted": 39076,
+ "total_acs": 22391,
+ "total_submitted": 39152,
"frontend_question_id": 573,
"is_new_question": false
},
@@ -60091,8 +60689,8 @@
"question__title": "Subtree of Another Tree",
"question__title_slug": "subtree-of-another-tree",
"question__hide": false,
- "total_acs": 857725,
- "total_submitted": 1785873,
+ "total_acs": 868762,
+ "total_submitted": 1804649,
"frontend_question_id": 572,
"is_new_question": false
},
@@ -60114,8 +60712,8 @@
"question__title": "Find Median Given Frequency of Numbers",
"question__title_slug": "find-median-given-frequency-of-numbers",
"question__hide": false,
- "total_acs": 28872,
- "total_submitted": 68007,
+ "total_acs": 29111,
+ "total_submitted": 68504,
"frontend_question_id": 571,
"is_new_question": false
},
@@ -60137,8 +60735,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": 337359,
- "total_submitted": 673057,
+ "total_acs": 355380,
+ "total_submitted": 711684,
"frontend_question_id": 570,
"is_new_question": false
},
@@ -60160,8 +60758,8 @@
"question__title": "Median Employee Salary",
"question__title_slug": "median-employee-salary",
"question__hide": false,
- "total_acs": 40434,
- "total_submitted": 61333,
+ "total_acs": 40743,
+ "total_submitted": 61802,
"frontend_question_id": 569,
"is_new_question": false
},
@@ -60183,8 +60781,8 @@
"question__title": "Maximum Vacation Days",
"question__title_slug": "maximum-vacation-days",
"question__hide": false,
- "total_acs": 37854,
- "total_submitted": 82871,
+ "total_acs": 37997,
+ "total_submitted": 83142,
"frontend_question_id": 568,
"is_new_question": false
},
@@ -60206,8 +60804,8 @@
"question__title": "Permutation in String",
"question__title_slug": "permutation-in-string",
"question__hide": false,
- "total_acs": 862725,
- "total_submitted": 1941925,
+ "total_acs": 873998,
+ "total_submitted": 1964515,
"frontend_question_id": 567,
"is_new_question": false
},
@@ -60229,8 +60827,8 @@
"question__title": "Reshape the Matrix",
"question__title_slug": "reshape-the-matrix",
"question__hide": false,
- "total_acs": 378509,
- "total_submitted": 599628,
+ "total_acs": 380132,
+ "total_submitted": 602022,
"frontend_question_id": 566,
"is_new_question": false
},
@@ -60252,8 +60850,8 @@
"question__title": "Array Nesting",
"question__title_slug": "array-nesting",
"question__hide": false,
- "total_acs": 130510,
- "total_submitted": 231614,
+ "total_acs": 130994,
+ "total_submitted": 232531,
"frontend_question_id": 565,
"is_new_question": false
},
@@ -60275,8 +60873,8 @@
"question__title": "Find the Closest Palindrome",
"question__title_slug": "find-the-closest-palindrome",
"question__hide": false,
- "total_acs": 46139,
- "total_submitted": 205777,
+ "total_acs": 46724,
+ "total_submitted": 207891,
"frontend_question_id": 564,
"is_new_question": false
},
@@ -60298,8 +60896,8 @@
"question__title": "Binary Tree Tilt",
"question__title_slug": "binary-tree-tilt",
"question__hide": false,
- "total_acs": 213191,
- "total_submitted": 344094,
+ "total_acs": 214544,
+ "total_submitted": 345716,
"frontend_question_id": 563,
"is_new_question": false
},
@@ -60321,8 +60919,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": 76535,
- "total_submitted": 151852,
+ "total_acs": 76674,
+ "total_submitted": 152107,
"frontend_question_id": 562,
"is_new_question": false
},
@@ -60344,8 +60942,8 @@
"question__title": "Array Partition",
"question__title_slug": "array-partition",
"question__hide": false,
- "total_acs": 480915,
- "total_submitted": 609483,
+ "total_acs": 485543,
+ "total_submitted": 614688,
"frontend_question_id": 561,
"is_new_question": false
},
@@ -60367,8 +60965,8 @@
"question__title": "Subarray Sum Equals K",
"question__title_slug": "subarray-sum-equals-k",
"question__hide": false,
- "total_acs": 1254917,
- "total_submitted": 2873721,
+ "total_acs": 1284227,
+ "total_submitted": 2932910,
"frontend_question_id": 560,
"is_new_question": false
},
@@ -60390,8 +60988,8 @@
"question__title": "Reverse Words in a String III",
"question__title_slug": "reverse-words-in-a-string-iii",
"question__hide": false,
- "total_acs": 906626,
- "total_submitted": 1091000,
+ "total_acs": 912764,
+ "total_submitted": 1097986,
"frontend_question_id": 557,
"is_new_question": false
},
@@ -60413,8 +61011,8 @@
"question__title": "Next Greater Element III",
"question__title_slug": "next-greater-element-iii",
"question__hide": false,
- "total_acs": 154243,
- "total_submitted": 452903,
+ "total_acs": 155979,
+ "total_submitted": 457644,
"frontend_question_id": 556,
"is_new_question": false
},
@@ -60436,8 +61034,8 @@
"question__title": "Split Concatenated Strings",
"question__title_slug": "split-concatenated-strings",
"question__hide": false,
- "total_acs": 6779,
- "total_submitted": 15607,
+ "total_acs": 6794,
+ "total_submitted": 15643,
"frontend_question_id": 555,
"is_new_question": false
},
@@ -60459,8 +61057,8 @@
"question__title": "Brick Wall",
"question__title_slug": "brick-wall",
"question__hide": false,
- "total_acs": 139382,
- "total_submitted": 253823,
+ "total_acs": 140767,
+ "total_submitted": 255799,
"frontend_question_id": 554,
"is_new_question": false
},
@@ -60482,8 +61080,8 @@
"question__title": "Optimal Division",
"question__title_slug": "optimal-division",
"question__hide": false,
- "total_acs": 40412,
- "total_submitted": 66475,
+ "total_acs": 40687,
+ "total_submitted": 66862,
"frontend_question_id": 553,
"is_new_question": false
},
@@ -60505,8 +61103,8 @@
"question__title": "Student Attendance Record II",
"question__title_slug": "student-attendance-record-ii",
"question__hide": false,
- "total_acs": 135956,
- "total_submitted": 247185,
+ "total_acs": 136993,
+ "total_submitted": 248777,
"frontend_question_id": 552,
"is_new_question": false
},
@@ -60528,8 +61126,8 @@
"question__title": "Student Attendance Record I",
"question__title_slug": "student-attendance-record-i",
"question__hide": false,
- "total_acs": 218901,
- "total_submitted": 445947,
+ "total_acs": 221052,
+ "total_submitted": 449768,
"frontend_question_id": 551,
"is_new_question": false
},
@@ -60551,8 +61149,8 @@
"question__title": "Shortest Path to Get Food",
"question__title_slug": "shortest-path-to-get-food",
"question__hide": false,
- "total_acs": 64135,
- "total_submitted": 116956,
+ "total_acs": 64543,
+ "total_submitted": 117574,
"frontend_question_id": 1730,
"is_new_question": false
},
@@ -60574,8 +61172,8 @@
"question__title": "Binary Tree Longest Consecutive Sequence II",
"question__title_slug": "binary-tree-longest-consecutive-sequence-ii",
"question__hide": false,
- "total_acs": 53924,
- "total_submitted": 108977,
+ "total_acs": 54118,
+ "total_submitted": 109343,
"frontend_question_id": 549,
"is_new_question": false
},
@@ -60597,8 +61195,8 @@
"question__title": "Split Array with Equal Sum",
"question__title_slug": "split-array-with-equal-sum",
"question__hide": false,
- "total_acs": 23901,
- "total_submitted": 47721,
+ "total_acs": 23920,
+ "total_submitted": 47758,
"frontend_question_id": 548,
"is_new_question": false
},
@@ -60620,8 +61218,8 @@
"question__title": "Number of Provinces",
"question__title_slug": "number-of-provinces",
"question__hide": false,
- "total_acs": 893259,
- "total_submitted": 1346904,
+ "total_acs": 910518,
+ "total_submitted": 1369741,
"frontend_question_id": 547,
"is_new_question": false
},
@@ -60643,8 +61241,8 @@
"question__title": "Remove Boxes",
"question__title_slug": "remove-boxes",
"question__hide": false,
- "total_acs": 45705,
- "total_submitted": 95639,
+ "total_acs": 45998,
+ "total_submitted": 96172,
"frontend_question_id": 546,
"is_new_question": false
},
@@ -60666,8 +61264,8 @@
"question__title": "Boundary of Binary Tree",
"question__title_slug": "boundary-of-binary-tree",
"question__hide": false,
- "total_acs": 133810,
- "total_submitted": 294133,
+ "total_acs": 134804,
+ "total_submitted": 295794,
"frontend_question_id": 545,
"is_new_question": false
},
@@ -60689,8 +61287,8 @@
"question__title": "Output Contest Matches",
"question__title_slug": "output-contest-matches",
"question__hide": false,
- "total_acs": 27100,
- "total_submitted": 35121,
+ "total_acs": 27135,
+ "total_submitted": 35165,
"frontend_question_id": 544,
"is_new_question": false
},
@@ -60712,8 +61310,8 @@
"question__title": "Diameter of Binary Tree",
"question__title_slug": "diameter-of-binary-tree",
"question__hide": false,
- "total_acs": 1515329,
- "total_submitted": 2502351,
+ "total_acs": 1540789,
+ "total_submitted": 2537429,
"frontend_question_id": 543,
"is_new_question": false
},
@@ -60735,8 +61333,8 @@
"question__title": "01 Matrix",
"question__title_slug": "01-matrix",
"question__hide": false,
- "total_acs": 564140,
- "total_submitted": 1161145,
+ "total_acs": 573561,
+ "total_submitted": 1176501,
"frontend_question_id": 542,
"is_new_question": false
},
@@ -60758,8 +61356,8 @@
"question__title": "Reverse String II",
"question__title_slug": "reverse-string-ii",
"question__hide": false,
- "total_acs": 247512,
- "total_submitted": 487181,
+ "total_acs": 250257,
+ "total_submitted": 492086,
"frontend_question_id": 541,
"is_new_question": false
},
@@ -60781,8 +61379,8 @@
"question__title": "Single Element in a Sorted Array",
"question__title_slug": "single-element-in-a-sorted-array",
"question__hide": false,
- "total_acs": 649041,
- "total_submitted": 1098682,
+ "total_acs": 666283,
+ "total_submitted": 1126931,
"frontend_question_id": 540,
"is_new_question": false
},
@@ -60804,8 +61402,8 @@
"question__title": "Minimum Time Difference",
"question__title_slug": "minimum-time-difference",
"question__hide": false,
- "total_acs": 148269,
- "total_submitted": 260771,
+ "total_acs": 149597,
+ "total_submitted": 262854,
"frontend_question_id": 539,
"is_new_question": false
},
@@ -60827,8 +61425,8 @@
"question__title": "Convert BST to Greater Tree",
"question__title_slug": "convert-bst-to-greater-tree",
"question__hide": false,
- "total_acs": 294919,
- "total_submitted": 426930,
+ "total_acs": 296501,
+ "total_submitted": 428763,
"frontend_question_id": 538,
"is_new_question": false
},
@@ -60850,8 +61448,8 @@
"question__title": "Complex Number Multiplication",
"question__title_slug": "complex-number-multiplication",
"question__hide": false,
- "total_acs": 95601,
- "total_submitted": 133084,
+ "total_acs": 96062,
+ "total_submitted": 133647,
"frontend_question_id": 537,
"is_new_question": false
},
@@ -60873,8 +61471,8 @@
"question__title": "Construct Binary Tree from String",
"question__title_slug": "construct-binary-tree-from-string",
"question__hide": false,
- "total_acs": 93282,
- "total_submitted": 163750,
+ "total_acs": 94617,
+ "total_submitted": 165820,
"frontend_question_id": 536,
"is_new_question": false
},
@@ -60896,8 +61494,8 @@
"question__title": "Encode and Decode TinyURL",
"question__title_slug": "encode-and-decode-tinyurl",
"question__hide": false,
- "total_acs": 259811,
- "total_submitted": 300707,
+ "total_acs": 261370,
+ "total_submitted": 302467,
"frontend_question_id": 535,
"is_new_question": false
},
@@ -60919,8 +61517,8 @@
"question__title": "Lonely Pixel II",
"question__title_slug": "lonely-pixel-ii",
"question__hide": false,
- "total_acs": 13290,
- "total_submitted": 27353,
+ "total_acs": 13310,
+ "total_submitted": 27389,
"frontend_question_id": 533,
"is_new_question": false
},
@@ -60942,8 +61540,8 @@
"question__title": "K-diff Pairs in an Array",
"question__title_slug": "k-diff-pairs-in-an-array",
"question__hide": false,
- "total_acs": 339010,
- "total_submitted": 790552,
+ "total_acs": 341844,
+ "total_submitted": 795322,
"frontend_question_id": 532,
"is_new_question": false
},
@@ -60965,8 +61563,8 @@
"question__title": "Lonely Pixel I",
"question__title_slug": "lonely-pixel-i",
"question__hide": false,
- "total_acs": 43007,
- "total_submitted": 69062,
+ "total_acs": 43174,
+ "total_submitted": 69282,
"frontend_question_id": 531,
"is_new_question": false
},
@@ -60988,8 +61586,8 @@
"question__title": "Minimum Absolute Difference in BST",
"question__title_slug": "minimum-absolute-difference-in-bst",
"question__hide": false,
- "total_acs": 381943,
- "total_submitted": 654446,
+ "total_acs": 388663,
+ "total_submitted": 665688,
"frontend_question_id": 530,
"is_new_question": false
},
@@ -61011,8 +61609,8 @@
"question__title": "Minesweeper",
"question__title_slug": "minesweeper",
"question__hide": false,
- "total_acs": 158533,
- "total_submitted": 237532,
+ "total_acs": 159857,
+ "total_submitted": 239302,
"frontend_question_id": 529,
"is_new_question": false
},
@@ -61034,8 +61632,8 @@
"question__title": "Swapping Nodes in a Linked List",
"question__title_slug": "swapping-nodes-in-a-linked-list",
"question__hide": false,
- "total_acs": 335186,
- "total_submitted": 493175,
+ "total_acs": 338986,
+ "total_submitted": 498553,
"frontend_question_id": 1721,
"is_new_question": false
},
@@ -61057,8 +61655,8 @@
"question__title": "Word Abbreviation",
"question__title_slug": "word-abbreviation",
"question__hide": false,
- "total_acs": 27339,
- "total_submitted": 44793,
+ "total_acs": 27426,
+ "total_submitted": 44893,
"frontend_question_id": 527,
"is_new_question": false
},
@@ -61080,8 +61678,8 @@
"question__title": "Beautiful Arrangement",
"question__title_slug": "beautiful-arrangement",
"question__hide": false,
- "total_acs": 174487,
- "total_submitted": 271734,
+ "total_acs": 176189,
+ "total_submitted": 274005,
"frontend_question_id": 526,
"is_new_question": false
},
@@ -61103,8 +61701,8 @@
"question__title": "Contiguous Array",
"question__title_slug": "contiguous-array",
"question__hide": false,
- "total_acs": 453614,
- "total_submitted": 927171,
+ "total_acs": 459046,
+ "total_submitted": 937534,
"frontend_question_id": 525,
"is_new_question": false
},
@@ -61126,8 +61724,8 @@
"question__title": "Longest Word in Dictionary through Deleting",
"question__title_slug": "longest-word-in-dictionary-through-deleting",
"question__hide": false,
- "total_acs": 154834,
- "total_submitted": 302386,
+ "total_acs": 155570,
+ "total_submitted": 303642,
"frontend_question_id": 524,
"is_new_question": false
},
@@ -61149,8 +61747,8 @@
"question__title": "Continuous Subarray Sum",
"question__title_slug": "continuous-subarray-sum",
"question__hide": false,
- "total_acs": 462102,
- "total_submitted": 1594940,
+ "total_acs": 576817,
+ "total_submitted": 1906562,
"frontend_question_id": 523,
"is_new_question": false
},
@@ -61172,8 +61770,8 @@
"question__title": "Longest Uncommon Subsequence II",
"question__title_slug": "longest-uncommon-subsequence-ii",
"question__hide": false,
- "total_acs": 52411,
- "total_submitted": 126180,
+ "total_acs": 53095,
+ "total_submitted": 127339,
"frontend_question_id": 522,
"is_new_question": false
},
@@ -61195,8 +61793,8 @@
"question__title": "Longest Uncommon Subsequence I",
"question__title_slug": "longest-uncommon-subsequence-i",
"question__hide": false,
- "total_acs": 113066,
- "total_submitted": 186074,
+ "total_acs": 114324,
+ "total_submitted": 188019,
"frontend_question_id": 521,
"is_new_question": false
},
@@ -61218,8 +61816,8 @@
"question__title": "Detect Capital",
"question__title_slug": "detect-capital",
"question__hide": false,
- "total_acs": 433012,
- "total_submitted": 767332,
+ "total_acs": 436168,
+ "total_submitted": 772850,
"frontend_question_id": 520,
"is_new_question": false
},
@@ -61241,8 +61839,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": 2516,
- "total_submitted": 4706,
+ "total_acs": 2547,
+ "total_submitted": 4750,
"frontend_question_id": 1983,
"is_new_question": false
},
@@ -61264,8 +61862,8 @@
"question__title": "Coin Change II",
"question__title_slug": "coin-change-ii",
"question__hide": false,
- "total_acs": 622786,
- "total_submitted": 972976,
+ "total_acs": 633810,
+ "total_submitted": 988064,
"frontend_question_id": 518,
"is_new_question": false
},
@@ -61287,8 +61885,8 @@
"question__title": "Super Washing Machines",
"question__title_slug": "super-washing-machines",
"question__hide": false,
- "total_acs": 29483,
- "total_submitted": 71441,
+ "total_acs": 29746,
+ "total_submitted": 71932,
"frontend_question_id": 517,
"is_new_question": false
},
@@ -61310,8 +61908,8 @@
"question__title": "Longest Palindromic Subsequence",
"question__title_slug": "longest-palindromic-subsequence",
"question__hide": false,
- "total_acs": 488812,
- "total_submitted": 779920,
+ "total_acs": 496983,
+ "total_submitted": 791494,
"frontend_question_id": 516,
"is_new_question": false
},
@@ -61333,8 +61931,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": 343866,
- "total_submitted": 523634,
+ "total_acs": 346409,
+ "total_submitted": 527405,
"frontend_question_id": 515,
"is_new_question": false
},
@@ -61356,8 +61954,8 @@
"question__title": "Freedom Trail",
"question__title_slug": "freedom-trail",
"question__hide": false,
- "total_acs": 106990,
- "total_submitted": 181457,
+ "total_acs": 107725,
+ "total_submitted": 182677,
"frontend_question_id": 514,
"is_new_question": false
},
@@ -61379,8 +61977,8 @@
"question__title": "Find Bottom Left Tree Value",
"question__title_slug": "find-bottom-left-tree-value",
"question__hide": false,
- "total_acs": 359113,
- "total_submitted": 504528,
+ "total_acs": 361565,
+ "total_submitted": 507731,
"frontend_question_id": 513,
"is_new_question": false
},
@@ -61402,8 +62000,8 @@
"question__title": "Maximum Alternating Subarray Sum",
"question__title_slug": "maximum-alternating-subarray-sum",
"question__hide": false,
- "total_acs": 2943,
- "total_submitted": 7349,
+ "total_acs": 2976,
+ "total_submitted": 7434,
"frontend_question_id": 2036,
"is_new_question": false
},
@@ -61425,8 +62023,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": 60555,
- "total_submitted": 160799,
+ "total_acs": 61022,
+ "total_submitted": 162258,
"frontend_question_id": 1059,
"is_new_question": false
},
@@ -61448,8 +62046,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": 3970,
- "total_submitted": 7619,
+ "total_acs": 4037,
+ "total_submitted": 7748,
"frontend_question_id": 2031,
"is_new_question": false
},
@@ -61471,8 +62069,8 @@
"question__title": "Inorder Successor in BST II",
"question__title_slug": "inorder-successor-in-bst-ii",
"question__hide": false,
- "total_acs": 65795,
- "total_submitted": 108035,
+ "total_acs": 66043,
+ "total_submitted": 108432,
"frontend_question_id": 510,
"is_new_question": false
},
@@ -61494,8 +62092,8 @@
"question__title": "Most Frequent Subtree Sum",
"question__title_slug": "most-frequent-subtree-sum",
"question__hide": false,
- "total_acs": 142527,
- "total_submitted": 214360,
+ "total_acs": 143441,
+ "total_submitted": 215420,
"frontend_question_id": 508,
"is_new_question": false
},
@@ -61517,8 +62115,8 @@
"question__title": "Perfect Number",
"question__title_slug": "perfect-number",
"question__hide": false,
- "total_acs": 190524,
- "total_submitted": 468314,
+ "total_acs": 194330,
+ "total_submitted": 474985,
"frontend_question_id": 507,
"is_new_question": false
},
@@ -61540,8 +62138,8 @@
"question__title": "Relative Ranks",
"question__title_slug": "relative-ranks",
"question__hide": false,
- "total_acs": 290067,
- "total_submitted": 404827,
+ "total_acs": 293227,
+ "total_submitted": 408704,
"frontend_question_id": 506,
"is_new_question": false
},
@@ -61563,8 +62161,8 @@
"question__title": "The Maze II",
"question__title_slug": "the-maze-ii",
"question__hide": false,
- "total_acs": 107723,
- "total_submitted": 201586,
+ "total_acs": 108120,
+ "total_submitted": 202294,
"frontend_question_id": 505,
"is_new_question": false
},
@@ -61586,8 +62184,8 @@
"question__title": "Base 7",
"question__title_slug": "base-7",
"question__hide": false,
- "total_acs": 133364,
- "total_submitted": 266119,
+ "total_acs": 134996,
+ "total_submitted": 268816,
"frontend_question_id": 504,
"is_new_question": false
},
@@ -61609,8 +62207,8 @@
"question__title": "Next Greater Element II",
"question__title_slug": "next-greater-element-ii",
"question__hide": false,
- "total_acs": 401232,
- "total_submitted": 627407,
+ "total_acs": 409483,
+ "total_submitted": 639276,
"frontend_question_id": 503,
"is_new_question": false
},
@@ -61632,8 +62230,8 @@
"question__title": "IPO",
"question__title_slug": "ipo",
"question__hide": false,
- "total_acs": 126821,
- "total_submitted": 255990,
+ "total_acs": 223377,
+ "total_submitted": 419903,
"frontend_question_id": 502,
"is_new_question": false
},
@@ -61655,8 +62253,8 @@
"question__title": "Find Mode in Binary Search Tree",
"question__title_slug": "find-mode-in-binary-search-tree",
"question__hide": false,
- "total_acs": 307444,
- "total_submitted": 547325,
+ "total_acs": 309451,
+ "total_submitted": 550371,
"frontend_question_id": 501,
"is_new_question": false
},
@@ -61678,8 +62276,8 @@
"question__title": "Keyboard Row",
"question__title_slug": "keyboard-row",
"question__hide": false,
- "total_acs": 229217,
- "total_submitted": 323840,
+ "total_acs": 231717,
+ "total_submitted": 326993,
"frontend_question_id": 500,
"is_new_question": false
},
@@ -61701,8 +62299,8 @@
"question__title": "The Maze III",
"question__title_slug": "the-maze-iii",
"question__hide": false,
- "total_acs": 31463,
- "total_submitted": 64399,
+ "total_acs": 31669,
+ "total_submitted": 64719,
"frontend_question_id": 499,
"is_new_question": false
},
@@ -61724,8 +62322,8 @@
"question__title": "Diagonal Traverse",
"question__title_slug": "diagonal-traverse",
"question__hide": false,
- "total_acs": 303814,
- "total_submitted": 502972,
+ "total_acs": 307111,
+ "total_submitted": 507574,
"frontend_question_id": 498,
"is_new_question": false
},
@@ -61747,8 +62345,8 @@
"question__title": "Next Greater Element I",
"question__title_slug": "next-greater-element-i",
"question__hide": false,
- "total_acs": 724356,
- "total_submitted": 1001732,
+ "total_acs": 740285,
+ "total_submitted": 1021956,
"frontend_question_id": 496,
"is_new_question": false
},
@@ -61770,8 +62368,8 @@
"question__title": "Teemo Attacking",
"question__title_slug": "teemo-attacking",
"question__hide": false,
- "total_acs": 151911,
- "total_submitted": 268356,
+ "total_acs": 153388,
+ "total_submitted": 270906,
"frontend_question_id": 495,
"is_new_question": false
},
@@ -61793,8 +62391,8 @@
"question__title": "Target Sum",
"question__title_slug": "target-sum",
"question__hide": false,
- "total_acs": 599326,
- "total_submitted": 1277217,
+ "total_acs": 609608,
+ "total_submitted": 1296958,
"frontend_question_id": 494,
"is_new_question": false
},
@@ -61816,8 +62414,8 @@
"question__title": "Reverse Pairs",
"question__title_slug": "reverse-pairs",
"question__hide": false,
- "total_acs": 178476,
- "total_submitted": 582501,
+ "total_acs": 183775,
+ "total_submitted": 598312,
"frontend_question_id": 493,
"is_new_question": false
},
@@ -61839,8 +62437,8 @@
"question__title": "Construct the Rectangle",
"question__title_slug": "construct-the-rectangle",
"question__hide": false,
- "total_acs": 118028,
- "total_submitted": 204297,
+ "total_acs": 119319,
+ "total_submitted": 205896,
"frontend_question_id": 492,
"is_new_question": false
},
@@ -61862,8 +62460,8 @@
"question__title": "Non-decreasing Subsequences",
"question__title_slug": "non-decreasing-subsequences",
"question__hide": false,
- "total_acs": 168611,
- "total_submitted": 277451,
+ "total_acs": 169626,
+ "total_submitted": 278979,
"frontend_question_id": 491,
"is_new_question": false
},
@@ -61885,8 +62483,8 @@
"question__title": "The Maze",
"question__title_slug": "the-maze",
"question__hide": false,
- "total_acs": 171855,
- "total_submitted": 296342,
+ "total_acs": 173254,
+ "total_submitted": 298267,
"frontend_question_id": 490,
"is_new_question": false
},
@@ -61908,8 +62506,8 @@
"question__title": "Kth Smallest Instructions",
"question__title_slug": "kth-smallest-instructions",
"question__hide": false,
- "total_acs": 12669,
- "total_submitted": 26345,
+ "total_acs": 12820,
+ "total_submitted": 26626,
"frontend_question_id": 1643,
"is_new_question": false
},
@@ -61931,8 +62529,8 @@
"question__title": "Zuma Game",
"question__title_slug": "zuma-game",
"question__hide": false,
- "total_acs": 23618,
- "total_submitted": 72220,
+ "total_acs": 23732,
+ "total_submitted": 72655,
"frontend_question_id": 488,
"is_new_question": false
},
@@ -61954,8 +62552,8 @@
"question__title": "Max Consecutive Ones II",
"question__title_slug": "max-consecutive-ones-ii",
"question__hide": false,
- "total_acs": 145770,
- "total_submitted": 289362,
+ "total_acs": 146805,
+ "total_submitted": 291178,
"frontend_question_id": 487,
"is_new_question": false
},
@@ -61977,8 +62575,8 @@
"question__title": "Predict the Winner",
"question__title_slug": "predict-the-winner",
"question__hide": false,
- "total_acs": 234731,
- "total_submitted": 423643,
+ "total_acs": 235989,
+ "total_submitted": 425843,
"frontend_question_id": 486,
"is_new_question": false
},
@@ -62000,8 +62598,8 @@
"question__title": "Max Consecutive Ones",
"question__title_slug": "max-consecutive-ones",
"question__hide": false,
- "total_acs": 1178659,
- "total_submitted": 1987939,
+ "total_acs": 1205550,
+ "total_submitted": 2025430,
"frontend_question_id": 485,
"is_new_question": false
},
@@ -62023,8 +62621,8 @@
"question__title": "Find Permutation",
"question__title_slug": "find-permutation",
"question__hide": false,
- "total_acs": 39105,
- "total_submitted": 58461,
+ "total_acs": 39213,
+ "total_submitted": 58628,
"frontend_question_id": 484,
"is_new_question": false
},
@@ -62046,8 +62644,8 @@
"question__title": "Smallest Good Base",
"question__title_slug": "smallest-good-base",
"question__hide": false,
- "total_acs": 22189,
- "total_submitted": 54467,
+ "total_acs": 22418,
+ "total_submitted": 54850,
"frontend_question_id": 483,
"is_new_question": false
},
@@ -62069,8 +62667,8 @@
"question__title": "License Key Formatting",
"question__title_slug": "license-key-formatting",
"question__hide": false,
- "total_acs": 282152,
- "total_submitted": 643799,
+ "total_acs": 284121,
+ "total_submitted": 647515,
"frontend_question_id": 482,
"is_new_question": false
},
@@ -62092,8 +62690,8 @@
"question__title": "Magical String",
"question__title_slug": "magical-string",
"question__hide": false,
- "total_acs": 36832,
- "total_submitted": 71728,
+ "total_acs": 37096,
+ "total_submitted": 72183,
"frontend_question_id": 481,
"is_new_question": false
},
@@ -62115,8 +62713,8 @@
"question__title": "Sliding Window Median",
"question__title_slug": "sliding-window-median",
"question__hide": false,
- "total_acs": 149190,
- "total_submitted": 381629,
+ "total_acs": 150613,
+ "total_submitted": 385565,
"frontend_question_id": 480,
"is_new_question": false
},
@@ -62138,8 +62736,8 @@
"question__title": "Largest Palindrome Product",
"question__title_slug": "largest-palindrome-product",
"question__hide": false,
- "total_acs": 24562,
- "total_submitted": 73592,
+ "total_acs": 24699,
+ "total_submitted": 73867,
"frontend_question_id": 479,
"is_new_question": false
},
@@ -62161,8 +62759,8 @@
"question__title": "Total Hamming Distance",
"question__title_slug": "total-hamming-distance",
"question__hide": false,
- "total_acs": 109500,
- "total_submitted": 207703,
+ "total_acs": 110206,
+ "total_submitted": 208923,
"frontend_question_id": 477,
"is_new_question": false
},
@@ -62184,8 +62782,8 @@
"question__title": "Number Complement",
"question__title_slug": "number-complement",
"question__hide": false,
- "total_acs": 334043,
- "total_submitted": 493685,
+ "total_acs": 336197,
+ "total_submitted": 496744,
"frontend_question_id": 476,
"is_new_question": false
},
@@ -62207,8 +62805,8 @@
"question__title": "Heaters",
"question__title_slug": "heaters",
"question__hide": false,
- "total_acs": 118531,
- "total_submitted": 312285,
+ "total_acs": 119764,
+ "total_submitted": 314709,
"frontend_question_id": 475,
"is_new_question": false
},
@@ -62230,8 +62828,8 @@
"question__title": "Ones and Zeroes",
"question__title_slug": "ones-and-zeroes",
"question__hide": false,
- "total_acs": 204057,
- "total_submitted": 428400,
+ "total_acs": 205930,
+ "total_submitted": 431676,
"frontend_question_id": 474,
"is_new_question": false
},
@@ -62253,8 +62851,8 @@
"question__title": "Matchsticks to Square",
"question__title_slug": "matchsticks-to-square",
"question__hide": false,
- "total_acs": 164234,
- "total_submitted": 407805,
+ "total_acs": 165257,
+ "total_submitted": 410292,
"frontend_question_id": 473,
"is_new_question": false
},
@@ -62276,8 +62874,8 @@
"question__title": "Concatenated Words",
"question__title_slug": "concatenated-words",
"question__hide": false,
- "total_acs": 224888,
- "total_submitted": 455124,
+ "total_acs": 226404,
+ "total_submitted": 458243,
"frontend_question_id": 472,
"is_new_question": false
},
@@ -62299,8 +62897,8 @@
"question__title": "Encode String with Shortest Length",
"question__title_slug": "encode-string-with-shortest-length",
"question__hide": false,
- "total_acs": 30796,
- "total_submitted": 61054,
+ "total_acs": 30832,
+ "total_submitted": 61126,
"frontend_question_id": 471,
"is_new_question": false
},
@@ -62322,8 +62920,8 @@
"question__title": "Convex Polygon",
"question__title_slug": "convex-polygon",
"question__hide": false,
- "total_acs": 10745,
- "total_submitted": 27223,
+ "total_acs": 10762,
+ "total_submitted": 27250,
"frontend_question_id": 469,
"is_new_question": false
},
@@ -62345,8 +62943,8 @@
"question__title": "Validate IP Address",
"question__title_slug": "validate-ip-address",
"question__hide": false,
- "total_acs": 162670,
- "total_submitted": 600584,
+ "total_acs": 164370,
+ "total_submitted": 605085,
"frontend_question_id": 468,
"is_new_question": false
},
@@ -62368,8 +62966,8 @@
"question__title": "Unique Substrings in Wraparound String",
"question__title_slug": "unique-substrings-in-wraparound-string",
"question__hide": false,
- "total_acs": 44772,
- "total_submitted": 112629,
+ "total_acs": 45025,
+ "total_submitted": 113074,
"frontend_question_id": 467,
"is_new_question": false
},
@@ -62391,8 +62989,8 @@
"question__title": "Count The Repetitions",
"question__title_slug": "count-the-repetitions",
"question__hide": false,
- "total_acs": 18825,
- "total_submitted": 62216,
+ "total_acs": 18997,
+ "total_submitted": 62652,
"frontend_question_id": 466,
"is_new_question": false
},
@@ -62414,8 +63012,8 @@
"question__title": "Optimal Account Balancing",
"question__title_slug": "optimal-account-balancing",
"question__hide": false,
- "total_acs": 91834,
- "total_submitted": 185345,
+ "total_acs": 92933,
+ "total_submitted": 187354,
"frontend_question_id": 465,
"is_new_question": false
},
@@ -62437,8 +63035,8 @@
"question__title": "Can I Win",
"question__title_slug": "can-i-win",
"question__hide": false,
- "total_acs": 95356,
- "total_submitted": 321003,
+ "total_acs": 96004,
+ "total_submitted": 322656,
"frontend_question_id": 464,
"is_new_question": false
},
@@ -62460,8 +63058,8 @@
"question__title": "Island Perimeter",
"question__title_slug": "island-perimeter",
"question__hide": false,
- "total_acs": 632031,
- "total_submitted": 868712,
+ "total_acs": 639801,
+ "total_submitted": 877616,
"frontend_question_id": 463,
"is_new_question": false
},
@@ -62483,8 +63081,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": 180969,
- "total_submitted": 301109,
+ "total_acs": 181899,
+ "total_submitted": 302550,
"frontend_question_id": 462,
"is_new_question": false
},
@@ -62506,8 +63104,8 @@
"question__title": "Hamming Distance",
"question__title_slug": "hamming-distance",
"question__hide": false,
- "total_acs": 575175,
- "total_submitted": 762545,
+ "total_acs": 578121,
+ "total_submitted": 766106,
"frontend_question_id": 461,
"is_new_question": false
},
@@ -62529,8 +63127,8 @@
"question__title": "LFU Cache",
"question__title_slug": "lfu-cache",
"question__hide": false,
- "total_acs": 251285,
- "total_submitted": 567382,
+ "total_acs": 253995,
+ "total_submitted": 572018,
"frontend_question_id": 460,
"is_new_question": false
},
@@ -62552,8 +63150,8 @@
"question__title": "Repeated Substring Pattern",
"question__title_slug": "repeated-substring-pattern",
"question__hide": false,
- "total_acs": 450259,
- "total_submitted": 977193,
+ "total_acs": 454272,
+ "total_submitted": 985024,
"frontend_question_id": 459,
"is_new_question": false
},
@@ -62575,8 +63173,8 @@
"question__title": "Poor Pigs",
"question__title_slug": "poor-pigs",
"question__hide": false,
- "total_acs": 119440,
- "total_submitted": 200287,
+ "total_acs": 119775,
+ "total_submitted": 200886,
"frontend_question_id": 458,
"is_new_question": false
},
@@ -62598,8 +63196,8 @@
"question__title": "Circular Array Loop",
"question__title_slug": "circular-array-loop",
"question__hide": false,
- "total_acs": 81113,
- "total_submitted": 237758,
+ "total_acs": 81783,
+ "total_submitted": 239114,
"frontend_question_id": 457,
"is_new_question": false
},
@@ -62621,8 +63219,8 @@
"question__title": "132 Pattern",
"question__title_slug": "132-pattern",
"question__hide": false,
- "total_acs": 258309,
- "total_submitted": 765138,
+ "total_acs": 259975,
+ "total_submitted": 769680,
"frontend_question_id": 456,
"is_new_question": false
},
@@ -62644,8 +63242,8 @@
"question__title": "Assign Cookies",
"question__title_slug": "assign-cookies",
"question__hide": false,
- "total_acs": 449567,
- "total_submitted": 854420,
+ "total_acs": 460199,
+ "total_submitted": 873813,
"frontend_question_id": 455,
"is_new_question": false
},
@@ -62667,8 +63265,8 @@
"question__title": "4Sum II",
"question__title_slug": "4sum-ii",
"question__hide": false,
- "total_acs": 326159,
- "total_submitted": 569433,
+ "total_acs": 327817,
+ "total_submitted": 572146,
"frontend_question_id": 454,
"is_new_question": false
},
@@ -62690,8 +63288,8 @@
"question__title": "Minimum Moves to Equal Array Elements",
"question__title_slug": "minimum-moves-to-equal-array-elements",
"question__hide": false,
- "total_acs": 172250,
- "total_submitted": 303474,
+ "total_acs": 173475,
+ "total_submitted": 305226,
"frontend_question_id": 453,
"is_new_question": false
},
@@ -62713,8 +63311,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": 521394,
- "total_submitted": 883509,
+ "total_acs": 528610,
+ "total_submitted": 894809,
"frontend_question_id": 452,
"is_new_question": false
},
@@ -62736,8 +63334,8 @@
"question__title": "Sort Characters By Frequency",
"question__title_slug": "sort-characters-by-frequency",
"question__hide": false,
- "total_acs": 739120,
- "total_submitted": 1017846,
+ "total_acs": 748602,
+ "total_submitted": 1030037,
"frontend_question_id": 451,
"is_new_question": false
},
@@ -62759,8 +63357,8 @@
"question__title": "Delete Node in a BST",
"question__title_slug": "delete-node-in-a-bst",
"question__hide": false,
- "total_acs": 505693,
- "total_submitted": 985201,
+ "total_acs": 516073,
+ "total_submitted": 1003195,
"frontend_question_id": 450,
"is_new_question": false
},
@@ -62782,8 +63380,8 @@
"question__title": "Serialize and Deserialize BST",
"question__title_slug": "serialize-and-deserialize-bst",
"question__hide": false,
- "total_acs": 236008,
- "total_submitted": 409001,
+ "total_acs": 237021,
+ "total_submitted": 410366,
"frontend_question_id": 449,
"is_new_question": false
},
@@ -62805,8 +63403,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": 891179,
- "total_submitted": 1460239,
+ "total_acs": 900101,
+ "total_submitted": 1473301,
"frontend_question_id": 448,
"is_new_question": false
},
@@ -62828,8 +63426,8 @@
"question__title": "Number of Boomerangs",
"question__title_slug": "number-of-boomerangs",
"question__hide": false,
- "total_acs": 100346,
- "total_submitted": 180861,
+ "total_acs": 100719,
+ "total_submitted": 181434,
"frontend_question_id": 447,
"is_new_question": false
},
@@ -62851,8 +63449,8 @@
"question__title": "Arithmetic Slices II - Subsequence",
"question__title_slug": "arithmetic-slices-ii-subsequence",
"question__hide": false,
- "total_acs": 148889,
- "total_submitted": 272814,
+ "total_acs": 149640,
+ "total_submitted": 274220,
"frontend_question_id": 446,
"is_new_question": false
},
@@ -62874,8 +63472,8 @@
"question__title": "Add Two Numbers II",
"question__title_slug": "add-two-numbers-ii",
"question__hide": false,
- "total_acs": 475175,
- "total_submitted": 776694,
+ "total_acs": 477726,
+ "total_submitted": 780469,
"frontend_question_id": 445,
"is_new_question": false
},
@@ -62897,8 +63495,8 @@
"question__title": "Sequence Reconstruction",
"question__title_slug": "sequence-reconstruction",
"question__hide": false,
- "total_acs": 55483,
- "total_submitted": 196437,
+ "total_acs": 55707,
+ "total_submitted": 196812,
"frontend_question_id": 444,
"is_new_question": false
},
@@ -62920,8 +63518,8 @@
"question__title": "String Compression",
"question__title_slug": "string-compression",
"question__hide": false,
- "total_acs": 585823,
- "total_submitted": 1071623,
+ "total_acs": 599312,
+ "total_submitted": 1092154,
"frontend_question_id": 443,
"is_new_question": false
},
@@ -62943,8 +63541,8 @@
"question__title": "Find All Duplicates in an Array",
"question__title_slug": "find-all-duplicates-in-an-array",
"question__hide": false,
- "total_acs": 773361,
- "total_submitted": 1021417,
+ "total_acs": 780505,
+ "total_submitted": 1030446,
"frontend_question_id": 442,
"is_new_question": false
},
@@ -62966,8 +63564,8 @@
"question__title": "Arranging Coins",
"question__title_slug": "arranging-coins",
"question__hide": false,
- "total_acs": 441766,
- "total_submitted": 947216,
+ "total_acs": 446583,
+ "total_submitted": 956820,
"frontend_question_id": 441,
"is_new_question": false
},
@@ -62989,8 +63587,8 @@
"question__title": "K-th Smallest in Lexicographical Order",
"question__title_slug": "k-th-smallest-in-lexicographical-order",
"question__hide": false,
- "total_acs": 23292,
- "total_submitted": 72025,
+ "total_acs": 23443,
+ "total_submitted": 72351,
"frontend_question_id": 440,
"is_new_question": false
},
@@ -63012,8 +63610,8 @@
"question__title": "Ternary Expression Parser",
"question__title_slug": "ternary-expression-parser",
"question__hide": false,
- "total_acs": 32831,
- "total_submitted": 53925,
+ "total_acs": 32992,
+ "total_submitted": 54127,
"frontend_question_id": 439,
"is_new_question": false
},
@@ -63035,8 +63633,8 @@
"question__title": "Find All Anagrams in a String",
"question__title_slug": "find-all-anagrams-in-a-string",
"question__hide": false,
- "total_acs": 878460,
- "total_submitted": 1723220,
+ "total_acs": 885040,
+ "total_submitted": 1734319,
"frontend_question_id": 438,
"is_new_question": false
},
@@ -63058,8 +63656,8 @@
"question__title": "Path Sum III",
"question__title_slug": "path-sum-iii",
"question__hide": false,
- "total_acs": 564055,
- "total_submitted": 1219110,
+ "total_acs": 570751,
+ "total_submitted": 1234797,
"frontend_question_id": 437,
"is_new_question": false
},
@@ -63081,8 +63679,8 @@
"question__title": "Find Right Interval",
"question__title_slug": "find-right-interval",
"question__hide": false,
- "total_acs": 114638,
- "total_submitted": 219654,
+ "total_acs": 115790,
+ "total_submitted": 221478,
"frontend_question_id": 436,
"is_new_question": false
},
@@ -63104,8 +63702,8 @@
"question__title": "Non-overlapping Intervals",
"question__title_slug": "non-overlapping-intervals",
"question__hide": false,
- "total_acs": 573317,
- "total_submitted": 1073787,
+ "total_acs": 584884,
+ "total_submitted": 1092430,
"frontend_question_id": 435,
"is_new_question": false
},
@@ -63127,8 +63725,8 @@
"question__title": "Number of Segments in a String",
"question__title_slug": "number-of-segments-in-a-string",
"question__hide": false,
- "total_acs": 183537,
- "total_submitted": 505026,
+ "total_acs": 186047,
+ "total_submitted": 511720,
"frontend_question_id": 434,
"is_new_question": false
},
@@ -63150,8 +63748,8 @@
"question__title": "Minimum Genetic Mutation",
"question__title_slug": "minimum-genetic-mutation",
"question__hide": false,
- "total_acs": 167033,
- "total_submitted": 310262,
+ "total_acs": 170281,
+ "total_submitted": 315840,
"frontend_question_id": 433,
"is_new_question": false
},
@@ -63173,8 +63771,8 @@
"question__title": "All O`one Data Structure",
"question__title_slug": "all-oone-data-structure",
"question__hide": false,
- "total_acs": 81150,
- "total_submitted": 220462,
+ "total_acs": 82162,
+ "total_submitted": 222767,
"frontend_question_id": 432,
"is_new_question": false
},
@@ -63196,8 +63794,8 @@
"question__title": "Word Squares",
"question__title_slug": "word-squares",
"question__hide": false,
- "total_acs": 74419,
- "total_submitted": 139408,
+ "total_acs": 74618,
+ "total_submitted": 139689,
"frontend_question_id": 425,
"is_new_question": false
},
@@ -63219,8 +63817,8 @@
"question__title": "Longest Repeating Character Replacement",
"question__title_slug": "longest-repeating-character-replacement",
"question__hide": false,
- "total_acs": 746413,
- "total_submitted": 1379652,
+ "total_acs": 767245,
+ "total_submitted": 1412612,
"frontend_question_id": 424,
"is_new_question": false
},
@@ -63242,8 +63840,8 @@
"question__title": "Reconstruct Original Digits from English",
"question__title_slug": "reconstruct-original-digits-from-english",
"question__hide": false,
- "total_acs": 80380,
- "total_submitted": 157327,
+ "total_acs": 80802,
+ "total_submitted": 158046,
"frontend_question_id": 423,
"is_new_question": false
},
@@ -63265,8 +63863,8 @@
"question__title": "Valid Word Square",
"question__title_slug": "valid-word-square",
"question__hide": false,
- "total_acs": 58048,
- "total_submitted": 141174,
+ "total_acs": 58618,
+ "total_submitted": 142298,
"frontend_question_id": 422,
"is_new_question": false
},
@@ -63288,8 +63886,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": 161900,
- "total_submitted": 304184,
+ "total_acs": 163771,
+ "total_submitted": 307490,
"frontend_question_id": 421,
"is_new_question": false
},
@@ -63311,8 +63909,8 @@
"question__title": "Strong Password Checker",
"question__title_slug": "strong-password-checker",
"question__hide": false,
- "total_acs": 41646,
- "total_submitted": 304395,
+ "total_acs": 42020,
+ "total_submitted": 306513,
"frontend_question_id": 420,
"is_new_question": false
},
@@ -63334,8 +63932,8 @@
"question__title": "Battleships in a Board",
"question__title_slug": "battleships-in-a-board",
"question__hide": false,
- "total_acs": 208374,
- "total_submitted": 276259,
+ "total_acs": 209960,
+ "total_submitted": 278212,
"frontend_question_id": 419,
"is_new_question": false
},
@@ -63357,8 +63955,8 @@
"question__title": "Sentence Screen Fitting",
"question__title_slug": "sentence-screen-fitting",
"question__hide": false,
- "total_acs": 101314,
- "total_submitted": 280095,
+ "total_acs": 101649,
+ "total_submitted": 280876,
"frontend_question_id": 418,
"is_new_question": false
},
@@ -63380,8 +63978,8 @@
"question__title": "Pacific Atlantic Water Flow",
"question__title_slug": "pacific-atlantic-water-flow",
"question__hide": false,
- "total_acs": 471151,
- "total_submitted": 851313,
+ "total_acs": 477932,
+ "total_submitted": 861738,
"frontend_question_id": 417,
"is_new_question": false
},
@@ -63403,8 +64001,8 @@
"question__title": "Partition Equal Subset Sum",
"question__title_slug": "partition-equal-subset-sum",
"question__hide": false,
- "total_acs": 835515,
- "total_submitted": 1802686,
+ "total_acs": 851370,
+ "total_submitted": 1834008,
"frontend_question_id": 416,
"is_new_question": false
},
@@ -63426,8 +64024,8 @@
"question__title": "Add Strings",
"question__title_slug": "add-strings",
"question__hide": false,
- "total_acs": 675439,
- "total_submitted": 1307173,
+ "total_acs": 681413,
+ "total_submitted": 1318554,
"frontend_question_id": 415,
"is_new_question": false
},
@@ -63449,8 +64047,8 @@
"question__title": "Third Maximum Number",
"question__title_slug": "third-maximum-number",
"question__hide": false,
- "total_acs": 541432,
- "total_submitted": 1546432,
+ "total_acs": 548048,
+ "total_submitted": 1560334,
"frontend_question_id": 414,
"is_new_question": false
},
@@ -63472,8 +64070,8 @@
"question__title": "Arithmetic Slices",
"question__title_slug": "arithmetic-slices",
"question__hide": false,
- "total_acs": 307299,
- "total_submitted": 472404,
+ "total_acs": 308488,
+ "total_submitted": 474185,
"frontend_question_id": 413,
"is_new_question": false
},
@@ -63495,8 +64093,8 @@
"question__title": "Fizz Buzz",
"question__title_slug": "fizz-buzz",
"question__hide": false,
- "total_acs": 1247978,
- "total_submitted": 1726158,
+ "total_acs": 1262105,
+ "total_submitted": 1742604,
"frontend_question_id": 412,
"is_new_question": false
},
@@ -63518,8 +64116,8 @@
"question__title": "Minimum Unique Word Abbreviation",
"question__title_slug": "minimum-unique-word-abbreviation",
"question__hide": false,
- "total_acs": 14721,
- "total_submitted": 37026,
+ "total_acs": 14752,
+ "total_submitted": 37076,
"frontend_question_id": 411,
"is_new_question": false
},
@@ -63541,8 +64139,8 @@
"question__title": "Split Array Largest Sum",
"question__title_slug": "split-array-largest-sum",
"question__hide": false,
- "total_acs": 347141,
- "total_submitted": 625808,
+ "total_acs": 355109,
+ "total_submitted": 637956,
"frontend_question_id": 410,
"is_new_question": false
},
@@ -63564,8 +64162,8 @@
"question__title": "Longest Palindrome",
"question__title_slug": "longest-palindrome",
"question__hide": false,
- "total_acs": 769803,
- "total_submitted": 1393208,
+ "total_acs": 788186,
+ "total_submitted": 1424821,
"frontend_question_id": 409,
"is_new_question": false
},
@@ -63587,8 +64185,8 @@
"question__title": "Valid Word Abbreviation",
"question__title_slug": "valid-word-abbreviation",
"question__hide": false,
- "total_acs": 190946,
- "total_submitted": 532414,
+ "total_acs": 195343,
+ "total_submitted": 544068,
"frontend_question_id": 408,
"is_new_question": false
},
@@ -63610,8 +64208,8 @@
"question__title": "Trapping Rain Water II",
"question__title_slug": "trapping-rain-water-ii",
"question__hide": false,
- "total_acs": 88602,
- "total_submitted": 184682,
+ "total_acs": 89234,
+ "total_submitted": 185851,
"frontend_question_id": 407,
"is_new_question": false
},
@@ -63633,8 +64231,8 @@
"question__title": "Queue Reconstruction by Height",
"question__title_slug": "queue-reconstruction-by-height",
"question__hide": false,
- "total_acs": 302782,
- "total_submitted": 411906,
+ "total_acs": 304019,
+ "total_submitted": 413357,
"frontend_question_id": 406,
"is_new_question": false
},
@@ -63656,8 +64254,8 @@
"question__title": "Convert a Number to Hexadecimal",
"question__title_slug": "convert-a-number-to-hexadecimal",
"question__hide": false,
- "total_acs": 146335,
- "total_submitted": 301210,
+ "total_acs": 148482,
+ "total_submitted": 304513,
"frontend_question_id": 405,
"is_new_question": false
},
@@ -63679,8 +64277,8 @@
"question__title": "Sum of Left Leaves",
"question__title_slug": "sum-of-left-leaves",
"question__hide": false,
- "total_acs": 622133,
- "total_submitted": 1025531,
+ "total_acs": 626404,
+ "total_submitted": 1031885,
"frontend_question_id": 404,
"is_new_question": false
},
@@ -63702,8 +64300,8 @@
"question__title": "Frog Jump",
"question__title_slug": "frog-jump",
"question__hide": false,
- "total_acs": 266081,
- "total_submitted": 577188,
+ "total_acs": 267899,
+ "total_submitted": 580886,
"frontend_question_id": 403,
"is_new_question": false
},
@@ -63725,8 +64323,8 @@
"question__title": "Remove K Digits",
"question__title_slug": "remove-k-digits",
"question__hide": false,
- "total_acs": 484540,
- "total_submitted": 1442770,
+ "total_acs": 489623,
+ "total_submitted": 1455847,
"frontend_question_id": 402,
"is_new_question": false
},
@@ -63748,8 +64346,8 @@
"question__title": "Binary Watch",
"question__title_slug": "binary-watch",
"question__hide": false,
- "total_acs": 144883,
- "total_submitted": 265573,
+ "total_acs": 145887,
+ "total_submitted": 266954,
"frontend_question_id": 401,
"is_new_question": false
},
@@ -63771,8 +64369,8 @@
"question__title": "Nth Digit",
"question__title_slug": "nth-digit",
"question__hide": false,
- "total_acs": 97105,
- "total_submitted": 278766,
+ "total_acs": 97885,
+ "total_submitted": 280434,
"frontend_question_id": 400,
"is_new_question": false
},
@@ -63794,8 +64392,8 @@
"question__title": "Evaluate Division",
"question__title_slug": "evaluate-division",
"question__hide": false,
- "total_acs": 471596,
- "total_submitted": 763728,
+ "total_acs": 477802,
+ "total_submitted": 772784,
"frontend_question_id": 399,
"is_new_question": false
},
@@ -63817,8 +64415,8 @@
"question__title": "Random Pick Index",
"question__title_slug": "random-pick-index",
"question__hide": false,
- "total_acs": 226951,
- "total_submitted": 357882,
+ "total_acs": 229365,
+ "total_submitted": 361223,
"frontend_question_id": 398,
"is_new_question": false
},
@@ -63840,8 +64438,8 @@
"question__title": "Integer Replacement",
"question__title_slug": "integer-replacement",
"question__hide": false,
- "total_acs": 118622,
- "total_submitted": 331656,
+ "total_acs": 120915,
+ "total_submitted": 336432,
"frontend_question_id": 397,
"is_new_question": false
},
@@ -63863,8 +64461,8 @@
"question__title": "Rotate Function",
"question__title_slug": "rotate-function",
"question__hide": false,
- "total_acs": 85960,
- "total_submitted": 201671,
+ "total_acs": 86550,
+ "total_submitted": 202790,
"frontend_question_id": 396,
"is_new_question": false
},
@@ -63886,8 +64484,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": 224931,
- "total_submitted": 500041,
+ "total_acs": 226698,
+ "total_submitted": 503681,
"frontend_question_id": 395,
"is_new_question": false
},
@@ -63909,8 +64507,8 @@
"question__title": "Decode String",
"question__title_slug": "decode-string",
"question__hide": false,
- "total_acs": 808220,
- "total_submitted": 1363533,
+ "total_acs": 818043,
+ "total_submitted": 1377916,
"frontend_question_id": 394,
"is_new_question": false
},
@@ -63932,8 +64530,8 @@
"question__title": "UTF-8 Validation",
"question__title_slug": "utf-8-validation",
"question__hide": false,
- "total_acs": 123456,
- "total_submitted": 273311,
+ "total_acs": 123868,
+ "total_submitted": 274150,
"frontend_question_id": 393,
"is_new_question": false
},
@@ -63955,8 +64553,8 @@
"question__title": "Is Subsequence",
"question__title_slug": "is-subsequence",
"question__hide": false,
- "total_acs": 1445476,
- "total_submitted": 3010411,
+ "total_acs": 1477839,
+ "total_submitted": 3075691,
"frontend_question_id": 392,
"is_new_question": false
},
@@ -63978,8 +64576,8 @@
"question__title": "Perfect Rectangle",
"question__title_slug": "perfect-rectangle",
"question__hide": false,
- "total_acs": 44379,
- "total_submitted": 131411,
+ "total_acs": 44670,
+ "total_submitted": 132104,
"frontend_question_id": 391,
"is_new_question": false
},
@@ -64001,8 +64599,8 @@
"question__title": "Elimination Game",
"question__title_slug": "elimination-game",
"question__hide": false,
- "total_acs": 72410,
- "total_submitted": 158356,
+ "total_acs": 73538,
+ "total_submitted": 160453,
"frontend_question_id": 390,
"is_new_question": false
},
@@ -64024,8 +64622,8 @@
"question__title": "Find the Difference",
"question__title_slug": "find-the-difference",
"question__hide": false,
- "total_acs": 737422,
- "total_submitted": 1236229,
+ "total_acs": 746096,
+ "total_submitted": 1250897,
"frontend_question_id": 389,
"is_new_question": false
},
@@ -64047,8 +64645,8 @@
"question__title": "Longest Absolute File Path",
"question__title_slug": "longest-absolute-file-path",
"question__hide": false,
- "total_acs": 155457,
- "total_submitted": 327650,
+ "total_acs": 156498,
+ "total_submitted": 329147,
"frontend_question_id": 388,
"is_new_question": false
},
@@ -64070,8 +64668,8 @@
"question__title": "First Unique Character in a String",
"question__title_slug": "first-unique-character-in-a-string",
"question__hide": false,
- "total_acs": 1724957,
- "total_submitted": 2773377,
+ "total_acs": 1738606,
+ "total_submitted": 2792520,
"frontend_question_id": 387,
"is_new_question": false
},
@@ -64093,8 +64691,8 @@
"question__title": "Lexicographical Numbers",
"question__title_slug": "lexicographical-numbers",
"question__hide": false,
- "total_acs": 122809,
- "total_submitted": 191640,
+ "total_acs": 123822,
+ "total_submitted": 192883,
"frontend_question_id": 386,
"is_new_question": false
},
@@ -64116,8 +64714,8 @@
"question__title": "Mini Parser",
"question__title_slug": "mini-parser",
"question__hide": false,
- "total_acs": 57352,
- "total_submitted": 149927,
+ "total_acs": 57721,
+ "total_submitted": 150495,
"frontend_question_id": 385,
"is_new_question": false
},
@@ -64139,8 +64737,8 @@
"question__title": "Shuffle an Array",
"question__title_slug": "shuffle-an-array",
"question__hide": false,
- "total_acs": 336555,
- "total_submitted": 576717,
+ "total_acs": 337976,
+ "total_submitted": 578833,
"frontend_question_id": 384,
"is_new_question": false
},
@@ -64162,8 +64760,8 @@
"question__title": "Ransom Note",
"question__title_slug": "ransom-note",
"question__hide": false,
- "total_acs": 1159382,
- "total_submitted": 1881962,
+ "total_acs": 1182857,
+ "total_submitted": 1914418,
"frontend_question_id": 383,
"is_new_question": false
},
@@ -64185,8 +64783,8 @@
"question__title": "Linked List Random Node",
"question__title_slug": "linked-list-random-node",
"question__hide": false,
- "total_acs": 243078,
- "total_submitted": 384551,
+ "total_acs": 244054,
+ "total_submitted": 385900,
"frontend_question_id": 382,
"is_new_question": false
},
@@ -64208,8 +64806,8 @@
"question__title": "Insert Delete GetRandom O(1) - Duplicates allowed",
"question__title_slug": "insert-delete-getrandom-o1-duplicates-allowed",
"question__hide": false,
- "total_acs": 143092,
- "total_submitted": 403434,
+ "total_acs": 144110,
+ "total_submitted": 405935,
"frontend_question_id": 381,
"is_new_question": false
},
@@ -64231,8 +64829,8 @@
"question__title": "Insert Delete GetRandom O(1)",
"question__title_slug": "insert-delete-getrandom-o1",
"question__hide": false,
- "total_acs": 918239,
- "total_submitted": 1686121,
+ "total_acs": 931241,
+ "total_submitted": 1708706,
"frontend_question_id": 380,
"is_new_question": false
},
@@ -64254,8 +64852,8 @@
"question__title": "Design Phone Directory",
"question__title_slug": "design-phone-directory",
"question__hide": false,
- "total_acs": 66122,
- "total_submitted": 127835,
+ "total_acs": 66293,
+ "total_submitted": 128114,
"frontend_question_id": 379,
"is_new_question": false
},
@@ -64277,8 +64875,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": 617228,
- "total_submitted": 987446,
+ "total_acs": 621757,
+ "total_submitted": 993895,
"frontend_question_id": 378,
"is_new_question": false
},
@@ -64300,8 +64898,8 @@
"question__title": "Combination Sum IV",
"question__title_slug": "combination-sum-iv",
"question__hide": false,
- "total_acs": 485454,
- "total_submitted": 895811,
+ "total_acs": 489008,
+ "total_submitted": 902124,
"frontend_question_id": 377,
"is_new_question": false
},
@@ -64323,8 +64921,8 @@
"question__title": "Wiggle Subsequence",
"question__title_slug": "wiggle-subsequence",
"question__hide": false,
- "total_acs": 246010,
- "total_submitted": 506786,
+ "total_acs": 247227,
+ "total_submitted": 509192,
"frontend_question_id": 376,
"is_new_question": false
},
@@ -64346,8 +64944,8 @@
"question__title": "Guess Number Higher or Lower II",
"question__title_slug": "guess-number-higher-or-lower-ii",
"question__hide": false,
- "total_acs": 124162,
- "total_submitted": 252859,
+ "total_acs": 125435,
+ "total_submitted": 254621,
"frontend_question_id": 375,
"is_new_question": false
},
@@ -64369,8 +64967,8 @@
"question__title": "Guess Number Higher or Lower",
"question__title_slug": "guess-number-higher-or-lower",
"question__hide": false,
- "total_acs": 654321,
- "total_submitted": 1219884,
+ "total_acs": 664363,
+ "total_submitted": 1236073,
"frontend_question_id": 374,
"is_new_question": false
},
@@ -64392,8 +64990,8 @@
"question__title": "Find K Pairs with Smallest Sums",
"question__title_slug": "find-k-pairs-with-smallest-sums",
"question__hide": false,
- "total_acs": 297804,
- "total_submitted": 744988,
+ "total_acs": 301744,
+ "total_submitted": 754465,
"frontend_question_id": 373,
"is_new_question": false
},
@@ -64415,8 +65013,8 @@
"question__title": "Super Pow",
"question__title_slug": "super-pow",
"question__hide": false,
- "total_acs": 71788,
- "total_submitted": 204314,
+ "total_acs": 72493,
+ "total_submitted": 206595,
"frontend_question_id": 372,
"is_new_question": false
},
@@ -64438,8 +65036,8 @@
"question__title": "Sum of Two Integers",
"question__title_slug": "sum-of-two-integers",
"question__hide": false,
- "total_acs": 483486,
- "total_submitted": 930066,
+ "total_acs": 489340,
+ "total_submitted": 939618,
"frontend_question_id": 371,
"is_new_question": false
},
@@ -64461,8 +65059,8 @@
"question__title": "Range Addition",
"question__title_slug": "range-addition",
"question__hide": false,
- "total_acs": 93733,
- "total_submitted": 130857,
+ "total_acs": 94121,
+ "total_submitted": 131317,
"frontend_question_id": 370,
"is_new_question": false
},
@@ -64484,8 +65082,8 @@
"question__title": "Plus One Linked List",
"question__title_slug": "plus-one-linked-list",
"question__hide": false,
- "total_acs": 80131,
- "total_submitted": 131247,
+ "total_acs": 80314,
+ "total_submitted": 131562,
"frontend_question_id": 369,
"is_new_question": false
},
@@ -64507,8 +65105,8 @@
"question__title": "Largest Divisible Subset",
"question__title_slug": "largest-divisible-subset",
"question__hide": false,
- "total_acs": 294165,
- "total_submitted": 649029,
+ "total_acs": 298047,
+ "total_submitted": 656405,
"frontend_question_id": 368,
"is_new_question": false
},
@@ -64530,8 +65128,8 @@
"question__title": "Valid Perfect Square",
"question__title_slug": "valid-perfect-square",
"question__hide": false,
- "total_acs": 612333,
- "total_submitted": 1401982,
+ "total_acs": 623200,
+ "total_submitted": 1424019,
"frontend_question_id": 367,
"is_new_question": false
},
@@ -64553,8 +65151,8 @@
"question__title": "Find Leaves of Binary Tree",
"question__title_slug": "find-leaves-of-binary-tree",
"question__hide": false,
- "total_acs": 256698,
- "total_submitted": 318457,
+ "total_acs": 257659,
+ "total_submitted": 319554,
"frontend_question_id": 366,
"is_new_question": false
},
@@ -64576,8 +65174,8 @@
"question__title": "Water and Jug Problem",
"question__title_slug": "water-and-jug-problem",
"question__hide": false,
- "total_acs": 102939,
- "total_submitted": 252639,
+ "total_acs": 104069,
+ "total_submitted": 254516,
"frontend_question_id": 365,
"is_new_question": false
},
@@ -64599,8 +65197,8 @@
"question__title": "Nested List Weight Sum II",
"question__title_slug": "nested-list-weight-sum-ii",
"question__hide": false,
- "total_acs": 136936,
- "total_submitted": 210426,
+ "total_acs": 137590,
+ "total_submitted": 211659,
"frontend_question_id": 364,
"is_new_question": false
},
@@ -64622,8 +65220,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": 125635,
- "total_submitted": 284468,
+ "total_acs": 126054,
+ "total_submitted": 285284,
"frontend_question_id": 363,
"is_new_question": false
},
@@ -64645,8 +65243,8 @@
"question__title": "Design Hit Counter",
"question__title_slug": "design-hit-counter",
"question__hide": false,
- "total_acs": 242562,
- "total_submitted": 352970,
+ "total_acs": 244329,
+ "total_submitted": 355463,
"frontend_question_id": 362,
"is_new_question": false
},
@@ -64668,8 +65266,8 @@
"question__title": "Bomb Enemy",
"question__title_slug": "bomb-enemy",
"question__hide": false,
- "total_acs": 78150,
- "total_submitted": 150906,
+ "total_acs": 78318,
+ "total_submitted": 151205,
"frontend_question_id": 361,
"is_new_question": false
},
@@ -64691,8 +65289,8 @@
"question__title": "Sort Transformed Array",
"question__title_slug": "sort-transformed-array",
"question__hide": false,
- "total_acs": 65643,
- "total_submitted": 117570,
+ "total_acs": 65869,
+ "total_submitted": 117862,
"frontend_question_id": 360,
"is_new_question": false
},
@@ -64714,8 +65312,8 @@
"question__title": "Logger Rate Limiter",
"question__title_slug": "logger-rate-limiter",
"question__hide": false,
- "total_acs": 319675,
- "total_submitted": 421093,
+ "total_acs": 322687,
+ "total_submitted": 424870,
"frontend_question_id": 359,
"is_new_question": false
},
@@ -64737,8 +65335,8 @@
"question__title": "Rearrange String k Distance Apart",
"question__title_slug": "rearrange-string-k-distance-apart",
"question__hide": false,
- "total_acs": 64589,
- "total_submitted": 166559,
+ "total_acs": 65033,
+ "total_submitted": 167423,
"frontend_question_id": 358,
"is_new_question": false
},
@@ -64760,8 +65358,8 @@
"question__title": "Count Numbers with Unique Digits",
"question__title_slug": "count-numbers-with-unique-digits",
"question__hide": false,
- "total_acs": 139083,
- "total_submitted": 262119,
+ "total_acs": 140283,
+ "total_submitted": 264044,
"frontend_question_id": 357,
"is_new_question": false
},
@@ -64783,8 +65381,8 @@
"question__title": "Line Reflection",
"question__title_slug": "line-reflection",
"question__hide": false,
- "total_acs": 40948,
- "total_submitted": 115106,
+ "total_acs": 41228,
+ "total_submitted": 115731,
"frontend_question_id": 356,
"is_new_question": false
},
@@ -64806,8 +65404,8 @@
"question__title": "Design Twitter",
"question__title_slug": "design-twitter",
"question__hide": false,
- "total_acs": 179842,
- "total_submitted": 453820,
+ "total_acs": 183694,
+ "total_submitted": 461089,
"frontend_question_id": 355,
"is_new_question": false
},
@@ -64829,8 +65427,8 @@
"question__title": "Russian Doll Envelopes",
"question__title_slug": "russian-doll-envelopes",
"question__hide": false,
- "total_acs": 218226,
- "total_submitted": 588429,
+ "total_acs": 219794,
+ "total_submitted": 592825,
"frontend_question_id": 354,
"is_new_question": false
},
@@ -64852,8 +65450,8 @@
"question__title": "Design Snake Game",
"question__title_slug": "design-snake-game",
"question__hide": false,
- "total_acs": 84343,
- "total_submitted": 217521,
+ "total_acs": 84907,
+ "total_submitted": 218788,
"frontend_question_id": 353,
"is_new_question": false
},
@@ -64875,8 +65473,8 @@
"question__title": "Data Stream as Disjoint Intervals",
"question__title_slug": "data-stream-as-disjoint-intervals",
"question__hide": false,
- "total_acs": 108872,
- "total_submitted": 181292,
+ "total_acs": 109362,
+ "total_submitted": 182032,
"frontend_question_id": 352,
"is_new_question": false
},
@@ -64898,8 +65496,8 @@
"question__title": "Android Unlock Patterns",
"question__title_slug": "android-unlock-patterns",
"question__hide": false,
- "total_acs": 72334,
- "total_submitted": 139498,
+ "total_acs": 72511,
+ "total_submitted": 139752,
"frontend_question_id": 351,
"is_new_question": false
},
@@ -64921,8 +65519,8 @@
"question__title": "Intersection of Two Arrays II",
"question__title_slug": "intersection-of-two-arrays-ii",
"question__hide": false,
- "total_acs": 1212332,
- "total_submitted": 2144732,
+ "total_acs": 1221988,
+ "total_submitted": 2159569,
"frontend_question_id": 350,
"is_new_question": false
},
@@ -64944,8 +65542,8 @@
"question__title": "Intersection of Two Arrays",
"question__title_slug": "intersection-of-two-arrays",
"question__hide": false,
- "total_acs": 1219205,
- "total_submitted": 1634413,
+ "total_acs": 1234228,
+ "total_submitted": 1652229,
"frontend_question_id": 349,
"is_new_question": false
},
@@ -64967,8 +65565,8 @@
"question__title": "Design Tic-Tac-Toe",
"question__title_slug": "design-tic-tac-toe",
"question__hide": false,
- "total_acs": 245144,
- "total_submitted": 422350,
+ "total_acs": 247277,
+ "total_submitted": 425652,
"frontend_question_id": 348,
"is_new_question": false
},
@@ -64990,8 +65588,8 @@
"question__title": "Top K Frequent Elements",
"question__title_slug": "top-k-frequent-elements",
"question__hide": false,
- "total_acs": 2138693,
- "total_submitted": 3403820,
+ "total_acs": 2173546,
+ "total_submitted": 3454724,
"frontend_question_id": 347,
"is_new_question": false
},
@@ -65013,8 +65611,8 @@
"question__title": "Moving Average from Data Stream",
"question__title_slug": "moving-average-from-data-stream",
"question__hide": false,
- "total_acs": 387015,
- "total_submitted": 493166,
+ "total_acs": 391714,
+ "total_submitted": 498619,
"frontend_question_id": 346,
"is_new_question": false
},
@@ -65036,8 +65634,8 @@
"question__title": "Reverse Vowels of a String",
"question__title_slug": "reverse-vowels-of-a-string",
"question__hide": false,
- "total_acs": 862703,
- "total_submitted": 1618685,
+ "total_acs": 884423,
+ "total_submitted": 1654308,
"frontend_question_id": 345,
"is_new_question": false
},
@@ -65059,8 +65657,8 @@
"question__title": "Reverse String",
"question__title_slug": "reverse-string",
"question__hide": false,
- "total_acs": 2672448,
- "total_submitted": 3400074,
+ "total_acs": 2708466,
+ "total_submitted": 3441404,
"frontend_question_id": 344,
"is_new_question": false
},
@@ -65082,8 +65680,8 @@
"question__title": "Integer Break",
"question__title_slug": "integer-break",
"question__hide": false,
- "total_acs": 359029,
- "total_submitted": 594477,
+ "total_acs": 360936,
+ "total_submitted": 597255,
"frontend_question_id": 343,
"is_new_question": false
},
@@ -65105,8 +65703,8 @@
"question__title": "Power of Four",
"question__title_slug": "power-of-four",
"question__hide": false,
- "total_acs": 669341,
- "total_submitted": 1392382,
+ "total_acs": 675869,
+ "total_submitted": 1404127,
"frontend_question_id": 342,
"is_new_question": false
},
@@ -65128,8 +65726,8 @@
"question__title": "Flatten Nested List Iterator",
"question__title_slug": "flatten-nested-list-iterator",
"question__hide": false,
- "total_acs": 451770,
- "total_submitted": 700053,
+ "total_acs": 454203,
+ "total_submitted": 703248,
"frontend_question_id": 341,
"is_new_question": false
},
@@ -65151,8 +65749,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": 346331,
- "total_submitted": 708703,
+ "total_acs": 347817,
+ "total_submitted": 711264,
"frontend_question_id": 340,
"is_new_question": false
},
@@ -65174,8 +65772,8 @@
"question__title": "Nested List Weight Sum",
"question__title_slug": "nested-list-weight-sum",
"question__hide": false,
- "total_acs": 283860,
- "total_submitted": 338791,
+ "total_acs": 287448,
+ "total_submitted": 342662,
"frontend_question_id": 339,
"is_new_question": false
},
@@ -65197,8 +65795,8 @@
"question__title": "Counting Bits",
"question__title_slug": "counting-bits",
"question__hide": false,
- "total_acs": 1113855,
- "total_submitted": 1421135,
+ "total_acs": 1128457,
+ "total_submitted": 1438101,
"frontend_question_id": 338,
"is_new_question": false
},
@@ -65220,8 +65818,8 @@
"question__title": "House Robber III",
"question__title_slug": "house-robber-iii",
"question__hide": false,
- "total_acs": 382839,
- "total_submitted": 705361,
+ "total_acs": 385796,
+ "total_submitted": 710490,
"frontend_question_id": 337,
"is_new_question": false
},
@@ -65243,8 +65841,8 @@
"question__title": "Palindrome Pairs",
"question__title_slug": "palindrome-pairs",
"question__hide": false,
- "total_acs": 206534,
- "total_submitted": 583804,
+ "total_acs": 207397,
+ "total_submitted": 585873,
"frontend_question_id": 336,
"is_new_question": false
},
@@ -65266,8 +65864,8 @@
"question__title": "Self Crossing",
"question__title_slug": "self-crossing",
"question__hide": false,
- "total_acs": 34711,
- "total_submitted": 113531,
+ "total_acs": 34954,
+ "total_submitted": 114168,
"frontend_question_id": 335,
"is_new_question": false
},
@@ -65289,8 +65887,8 @@
"question__title": "Increasing Triplet Subsequence",
"question__title_slug": "increasing-triplet-subsequence",
"question__hide": false,
- "total_acs": 574482,
- "total_submitted": 1444492,
+ "total_acs": 586072,
+ "total_submitted": 1476373,
"frontend_question_id": 334,
"is_new_question": false
},
@@ -65312,8 +65910,8 @@
"question__title": "Largest BST Subtree",
"question__title_slug": "largest-bst-subtree",
"question__hide": false,
- "total_acs": 107803,
- "total_submitted": 245521,
+ "total_acs": 108451,
+ "total_submitted": 246573,
"frontend_question_id": 333,
"is_new_question": false
},
@@ -65335,8 +65933,8 @@
"question__title": "Reconstruct Itinerary",
"question__title_slug": "reconstruct-itinerary",
"question__hide": false,
- "total_acs": 430196,
- "total_submitted": 994883,
+ "total_acs": 433102,
+ "total_submitted": 1001329,
"frontend_question_id": 332,
"is_new_question": false
},
@@ -65358,8 +65956,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": 141475,
- "total_submitted": 312545,
+ "total_acs": 142440,
+ "total_submitted": 314164,
"frontend_question_id": 331,
"is_new_question": false
},
@@ -65381,8 +65979,8 @@
"question__title": "Patching Array",
"question__title_slug": "patching-array",
"question__hide": false,
- "total_acs": 71484,
- "total_submitted": 170469,
+ "total_acs": 155767,
+ "total_submitted": 293619,
"frontend_question_id": 330,
"is_new_question": false
},
@@ -65404,8 +66002,8 @@
"question__title": "Longest Increasing Path in a Matrix",
"question__title_slug": "longest-increasing-path-in-a-matrix",
"question__hide": false,
- "total_acs": 527619,
- "total_submitted": 982481,
+ "total_acs": 531850,
+ "total_submitted": 989109,
"frontend_question_id": 329,
"is_new_question": false
},
@@ -65427,8 +66025,8 @@
"question__title": "Odd Even Linked List",
"question__title_slug": "odd-even-linked-list",
"question__hide": false,
- "total_acs": 932381,
- "total_submitted": 1518112,
+ "total_acs": 949331,
+ "total_submitted": 1545042,
"frontend_question_id": 328,
"is_new_question": false
},
@@ -65450,8 +66048,8 @@
"question__title": "Count of Range Sum",
"question__title_slug": "count-of-range-sum",
"question__hide": false,
- "total_acs": 77269,
- "total_submitted": 214950,
+ "total_acs": 77819,
+ "total_submitted": 216230,
"frontend_question_id": 327,
"is_new_question": false
},
@@ -65473,8 +66071,8 @@
"question__title": "Power of Three",
"question__title_slug": "power-of-three",
"question__hide": false,
- "total_acs": 841391,
- "total_submitted": 1803414,
+ "total_acs": 850590,
+ "total_submitted": 1820450,
"frontend_question_id": 326,
"is_new_question": false
},
@@ -65496,8 +66094,8 @@
"question__title": "Maximum Size Subarray Sum Equals k",
"question__title_slug": "maximum-size-subarray-sum-equals-k",
"question__hide": false,
- "total_acs": 185147,
- "total_submitted": 373985,
+ "total_acs": 186022,
+ "total_submitted": 375501,
"frontend_question_id": 325,
"is_new_question": false
},
@@ -65519,8 +66117,8 @@
"question__title": "Wiggle Sort II",
"question__title_slug": "wiggle-sort-ii",
"question__hide": false,
- "total_acs": 159448,
- "total_submitted": 463540,
+ "total_acs": 160736,
+ "total_submitted": 466252,
"frontend_question_id": 324,
"is_new_question": false
},
@@ -65542,8 +66140,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": 403043,
- "total_submitted": 640894,
+ "total_acs": 406555,
+ "total_submitted": 645843,
"frontend_question_id": 323,
"is_new_question": false
},
@@ -65565,8 +66163,8 @@
"question__title": "Coin Change",
"question__title_slug": "coin-change",
"question__hide": false,
- "total_acs": 1802705,
- "total_submitted": 4088950,
+ "total_acs": 1830434,
+ "total_submitted": 4139606,
"frontend_question_id": 322,
"is_new_question": false
},
@@ -65588,8 +66186,8 @@
"question__title": "Create Maximum Number",
"question__title_slug": "create-maximum-number",
"question__hide": false,
- "total_acs": 61108,
- "total_submitted": 201864,
+ "total_acs": 61508,
+ "total_submitted": 202636,
"frontend_question_id": 321,
"is_new_question": false
},
@@ -65611,8 +66209,8 @@
"question__title": "Generalized Abbreviation",
"question__title_slug": "generalized-abbreviation",
"question__hide": false,
- "total_acs": 68269,
- "total_submitted": 116782,
+ "total_acs": 68408,
+ "total_submitted": 116942,
"frontend_question_id": 320,
"is_new_question": false
},
@@ -65634,8 +66232,8 @@
"question__title": "Bulb Switcher",
"question__title_slug": "bulb-switcher",
"question__hide": false,
- "total_acs": 219615,
- "total_submitted": 415928,
+ "total_acs": 221538,
+ "total_submitted": 419042,
"frontend_question_id": 319,
"is_new_question": false
},
@@ -65657,8 +66255,8 @@
"question__title": "Maximum Product of Word Lengths",
"question__title_slug": "maximum-product-of-word-lengths",
"question__hide": false,
- "total_acs": 217582,
- "total_submitted": 362441,
+ "total_acs": 218294,
+ "total_submitted": 363499,
"frontend_question_id": 318,
"is_new_question": false
},
@@ -65680,8 +66278,8 @@
"question__title": "Shortest Distance from All Buildings",
"question__title_slug": "shortest-distance-from-all-buildings",
"question__hide": false,
- "total_acs": 176902,
- "total_submitted": 408922,
+ "total_acs": 178527,
+ "total_submitted": 412197,
"frontend_question_id": 317,
"is_new_question": false
},
@@ -65703,8 +66301,8 @@
"question__title": "Remove Duplicate Letters",
"question__title_slug": "remove-duplicate-letters",
"question__hide": false,
- "total_acs": 334350,
- "total_submitted": 672353,
+ "total_acs": 336558,
+ "total_submitted": 675791,
"frontend_question_id": 316,
"is_new_question": false
},
@@ -65726,8 +66324,8 @@
"question__title": "Count of Smaller Numbers After Self",
"question__title_slug": "count-of-smaller-numbers-after-self",
"question__hide": false,
- "total_acs": 321021,
- "total_submitted": 756260,
+ "total_acs": 322828,
+ "total_submitted": 759926,
"frontend_question_id": 315,
"is_new_question": false
},
@@ -65749,8 +66347,8 @@
"question__title": "Binary Tree Vertical Order Traversal",
"question__title_slug": "binary-tree-vertical-order-traversal",
"question__hide": false,
- "total_acs": 414560,
- "total_submitted": 759884,
+ "total_acs": 419964,
+ "total_submitted": 768119,
"frontend_question_id": 314,
"is_new_question": false
},
@@ -65772,8 +66370,8 @@
"question__title": "Super Ugly Number",
"question__title_slug": "super-ugly-number",
"question__hide": false,
- "total_acs": 128802,
- "total_submitted": 284584,
+ "total_acs": 129515,
+ "total_submitted": 286023,
"frontend_question_id": 313,
"is_new_question": false
},
@@ -65795,8 +66393,8 @@
"question__title": "Burst Balloons",
"question__title_slug": "burst-balloons",
"question__hide": false,
- "total_acs": 284706,
- "total_submitted": 482993,
+ "total_acs": 289209,
+ "total_submitted": 489298,
"frontend_question_id": 312,
"is_new_question": false
},
@@ -65818,8 +66416,8 @@
"question__title": "Sparse Matrix Multiplication",
"question__title_slug": "sparse-matrix-multiplication",
"question__hide": false,
- "total_acs": 191290,
- "total_submitted": 280859,
+ "total_acs": 191947,
+ "total_submitted": 281703,
"frontend_question_id": 311,
"is_new_question": false
},
@@ -65841,8 +66439,8 @@
"question__title": "Minimum Height Trees",
"question__title_slug": "minimum-height-trees",
"question__hide": false,
- "total_acs": 373104,
- "total_submitted": 893474,
+ "total_acs": 376017,
+ "total_submitted": 899942,
"frontend_question_id": 310,
"is_new_question": false
},
@@ -65864,8 +66462,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": 511785,
- "total_submitted": 878154,
+ "total_acs": 519813,
+ "total_submitted": 889155,
"frontend_question_id": 309,
"is_new_question": false
},
@@ -65887,8 +66485,8 @@
"question__title": "Range Sum Query 2D - Mutable",
"question__title_slug": "range-sum-query-2d-mutable",
"question__hide": false,
- "total_acs": 77544,
- "total_submitted": 175767,
+ "total_acs": 77707,
+ "total_submitted": 175987,
"frontend_question_id": 308,
"is_new_question": false
},
@@ -65910,8 +66508,8 @@
"question__title": "Range Sum Query - Mutable",
"question__title_slug": "range-sum-query-mutable",
"question__hide": false,
- "total_acs": 271138,
- "total_submitted": 661108,
+ "total_acs": 273139,
+ "total_submitted": 664924,
"frontend_question_id": 307,
"is_new_question": false
},
@@ -65933,8 +66531,8 @@
"question__title": "Additive Number",
"question__title_slug": "additive-number",
"question__hide": false,
- "total_acs": 90761,
- "total_submitted": 286939,
+ "total_acs": 91821,
+ "total_submitted": 289099,
"frontend_question_id": 306,
"is_new_question": false
},
@@ -65956,8 +66554,8 @@
"question__title": "Number of Islands II",
"question__title_slug": "number-of-islands-ii",
"question__hide": false,
- "total_acs": 145269,
- "total_submitted": 364283,
+ "total_acs": 146056,
+ "total_submitted": 366102,
"frontend_question_id": 305,
"is_new_question": false
},
@@ -65979,8 +66577,8 @@
"question__title": "Range Sum Query 2D - Immutable",
"question__title_slug": "range-sum-query-2d-immutable",
"question__hide": false,
- "total_acs": 368478,
- "total_submitted": 673345,
+ "total_acs": 371166,
+ "total_submitted": 676911,
"frontend_question_id": 304,
"is_new_question": false
},
@@ -66002,8 +66600,8 @@
"question__title": "Range Sum Query - Immutable",
"question__title_slug": "range-sum-query-immutable",
"question__hide": false,
- "total_acs": 537677,
- "total_submitted": 844546,
+ "total_acs": 543778,
+ "total_submitted": 851407,
"frontend_question_id": 303,
"is_new_question": false
},
@@ -66025,8 +66623,8 @@
"question__title": "Smallest Rectangle Enclosing Black Pixels",
"question__title_slug": "smallest-rectangle-enclosing-black-pixels",
"question__hide": false,
- "total_acs": 50047,
- "total_submitted": 84883,
+ "total_acs": 50200,
+ "total_submitted": 85080,
"frontend_question_id": 302,
"is_new_question": false
},
@@ -66048,8 +66646,8 @@
"question__title": "Remove Invalid Parentheses",
"question__title_slug": "remove-invalid-parentheses",
"question__hide": false,
- "total_acs": 432598,
- "total_submitted": 895739,
+ "total_acs": 434993,
+ "total_submitted": 899660,
"frontend_question_id": 301,
"is_new_question": false
},
@@ -66071,8 +66669,8 @@
"question__title": "Longest Increasing Subsequence",
"question__title_slug": "longest-increasing-subsequence",
"question__hide": false,
- "total_acs": 1693539,
- "total_submitted": 3051378,
+ "total_acs": 1720105,
+ "total_submitted": 3090675,
"frontend_question_id": 300,
"is_new_question": false
},
@@ -66094,8 +66692,8 @@
"question__title": "Bulls and Cows",
"question__title_slug": "bulls-and-cows",
"question__hide": false,
- "total_acs": 375275,
- "total_submitted": 745617,
+ "total_acs": 377098,
+ "total_submitted": 748401,
"frontend_question_id": 299,
"is_new_question": false
},
@@ -66117,8 +66715,8 @@
"question__title": "Binary Tree Longest Consecutive Sequence",
"question__title_slug": "binary-tree-longest-consecutive-sequence",
"question__hide": false,
- "total_acs": 148298,
- "total_submitted": 276909,
+ "total_acs": 148863,
+ "total_submitted": 277779,
"frontend_question_id": 298,
"is_new_question": false
},
@@ -66140,8 +66738,8 @@
"question__title": "Serialize and Deserialize Binary Tree",
"question__title_slug": "serialize-and-deserialize-binary-tree",
"question__hide": false,
- "total_acs": 874401,
- "total_submitted": 1536427,
+ "total_acs": 883420,
+ "total_submitted": 1549412,
"frontend_question_id": 297,
"is_new_question": false
},
@@ -66163,8 +66761,8 @@
"question__title": "Best Meeting Point",
"question__title_slug": "best-meeting-point",
"question__hide": false,
- "total_acs": 84191,
- "total_submitted": 138114,
+ "total_acs": 84647,
+ "total_submitted": 138847,
"frontend_question_id": 296,
"is_new_question": false
},
@@ -66186,8 +66784,8 @@
"question__title": "Find Median from Data Stream",
"question__title_slug": "find-median-from-data-stream",
"question__hide": false,
- "total_acs": 791339,
- "total_submitted": 1522400,
+ "total_acs": 802699,
+ "total_submitted": 1542104,
"frontend_question_id": 295,
"is_new_question": false
},
@@ -66209,8 +66807,8 @@
"question__title": "Flip Game II",
"question__title_slug": "flip-game-ii",
"question__hide": false,
- "total_acs": 70975,
- "total_submitted": 136225,
+ "total_acs": 71072,
+ "total_submitted": 136379,
"frontend_question_id": 294,
"is_new_question": false
},
@@ -66232,8 +66830,8 @@
"question__title": "Flip Game",
"question__title_slug": "flip-game",
"question__hide": false,
- "total_acs": 73545,
- "total_submitted": 113878,
+ "total_acs": 73736,
+ "total_submitted": 114133,
"frontend_question_id": 293,
"is_new_question": false
},
@@ -66255,8 +66853,8 @@
"question__title": "Nim Game",
"question__title_slug": "nim-game",
"question__hide": false,
- "total_acs": 379403,
- "total_submitted": 666492,
+ "total_acs": 382535,
+ "total_submitted": 671428,
"frontend_question_id": 292,
"is_new_question": false
},
@@ -66278,8 +66876,8 @@
"question__title": "Word Pattern II",
"question__title_slug": "word-pattern-ii",
"question__hide": false,
- "total_acs": 76492,
- "total_submitted": 158709,
+ "total_acs": 76821,
+ "total_submitted": 159277,
"frontend_question_id": 291,
"is_new_question": false
},
@@ -66301,8 +66899,8 @@
"question__title": "Word Pattern",
"question__title_slug": "word-pattern",
"question__hide": false,
- "total_acs": 721262,
- "total_submitted": 1713314,
+ "total_acs": 733548,
+ "total_submitted": 1740545,
"frontend_question_id": 290,
"is_new_question": false
},
@@ -66324,8 +66922,8 @@
"question__title": "Game of Life",
"question__title_slug": "game-of-life",
"question__hide": false,
- "total_acs": 472588,
- "total_submitted": 682127,
+ "total_acs": 477543,
+ "total_submitted": 687965,
"frontend_question_id": 289,
"is_new_question": false
},
@@ -66347,8 +66945,8 @@
"question__title": "Unique Word Abbreviation",
"question__title_slug": "unique-word-abbreviation",
"question__hide": false,
- "total_acs": 73417,
- "total_submitted": 279080,
+ "total_acs": 73608,
+ "total_submitted": 279411,
"frontend_question_id": 288,
"is_new_question": false
},
@@ -66370,8 +66968,8 @@
"question__title": "Find the Duplicate Number",
"question__title_slug": "find-the-duplicate-number",
"question__hide": false,
- "total_acs": 1747576,
- "total_submitted": 2868326,
+ "total_acs": 1769873,
+ "total_submitted": 2899874,
"frontend_question_id": 287,
"is_new_question": false
},
@@ -66393,8 +66991,8 @@
"question__title": "Walls and Gates",
"question__title_slug": "walls-and-gates",
"question__hide": false,
- "total_acs": 318134,
- "total_submitted": 517422,
+ "total_acs": 320760,
+ "total_submitted": 521244,
"frontend_question_id": 286,
"is_new_question": false
},
@@ -66416,8 +67014,8 @@
"question__title": "Inorder Successor in BST",
"question__title_slug": "inorder-successor-in-bst",
"question__hide": false,
- "total_acs": 332149,
- "total_submitted": 666469,
+ "total_acs": 333821,
+ "total_submitted": 668925,
"frontend_question_id": 285,
"is_new_question": false
},
@@ -66439,8 +67037,8 @@
"question__title": "Peeking Iterator",
"question__title_slug": "peeking-iterator",
"question__hide": false,
- "total_acs": 220803,
- "total_submitted": 370677,
+ "total_acs": 221588,
+ "total_submitted": 371639,
"frontend_question_id": 284,
"is_new_question": false
},
@@ -66462,8 +67060,8 @@
"question__title": "Move Zeroes",
"question__title_slug": "move-zeroes",
"question__hide": false,
- "total_acs": 3007517,
- "total_submitted": 4866607,
+ "total_acs": 3061408,
+ "total_submitted": 4950451,
"frontend_question_id": 283,
"is_new_question": false
},
@@ -66485,8 +67083,8 @@
"question__title": "Expression Add Operators",
"question__title_slug": "expression-add-operators",
"question__hide": false,
- "total_acs": 226213,
- "total_submitted": 566465,
+ "total_acs": 228188,
+ "total_submitted": 570541,
"frontend_question_id": 282,
"is_new_question": false
},
@@ -66508,8 +67106,8 @@
"question__title": "Zigzag Iterator",
"question__title_slug": "zigzag-iterator",
"question__hide": false,
- "total_acs": 93804,
- "total_submitted": 146676,
+ "total_acs": 94192,
+ "total_submitted": 147141,
"frontend_question_id": 281,
"is_new_question": false
},
@@ -66531,8 +67129,8 @@
"question__title": "Wiggle Sort",
"question__title_slug": "wiggle-sort",
"question__hide": false,
- "total_acs": 142142,
- "total_submitted": 209958,
+ "total_acs": 142653,
+ "total_submitted": 210639,
"frontend_question_id": 280,
"is_new_question": false
},
@@ -66554,8 +67152,8 @@
"question__title": "Perfect Squares",
"question__title_slug": "perfect-squares",
"question__hide": false,
- "total_acs": 854895,
- "total_submitted": 1558523,
+ "total_acs": 860714,
+ "total_submitted": 1567863,
"frontend_question_id": 279,
"is_new_question": false
},
@@ -66577,8 +67175,8 @@
"question__title": "First Bad Version",
"question__title_slug": "first-bad-version",
"question__hide": false,
- "total_acs": 1690196,
- "total_submitted": 3800428,
+ "total_acs": 1704092,
+ "total_submitted": 3824647,
"frontend_question_id": 278,
"is_new_question": false
},
@@ -66600,8 +67198,8 @@
"question__title": "Find the Celebrity",
"question__title_slug": "find-the-celebrity",
"question__hide": false,
- "total_acs": 268531,
- "total_submitted": 567736,
+ "total_acs": 270332,
+ "total_submitted": 570754,
"frontend_question_id": 277,
"is_new_question": false
},
@@ -66623,8 +67221,8 @@
"question__title": "Paint Fence",
"question__title_slug": "paint-fence",
"question__hide": false,
- "total_acs": 113298,
- "total_submitted": 242644,
+ "total_acs": 113779,
+ "total_submitted": 243360,
"frontend_question_id": 276,
"is_new_question": false
},
@@ -66646,8 +67244,8 @@
"question__title": "H-Index II",
"question__title_slug": "h-index-ii",
"question__hide": false,
- "total_acs": 205701,
- "total_submitted": 538872,
+ "total_acs": 207646,
+ "total_submitted": 543088,
"frontend_question_id": 275,
"is_new_question": false
},
@@ -66669,8 +67267,8 @@
"question__title": "H-Index",
"question__title_slug": "h-index",
"question__hide": false,
- "total_acs": 472560,
- "total_submitted": 1210979,
+ "total_acs": 486512,
+ "total_submitted": 1245113,
"frontend_question_id": 274,
"is_new_question": false
},
@@ -66692,8 +67290,8 @@
"question__title": "Integer to English Words",
"question__title_slug": "integer-to-english-words",
"question__hide": false,
- "total_acs": 382195,
- "total_submitted": 1246679,
+ "total_acs": 385132,
+ "total_submitted": 1253104,
"frontend_question_id": 273,
"is_new_question": false
},
@@ -66715,8 +67313,8 @@
"question__title": "Closest Binary Search Tree Value II",
"question__title_slug": "closest-binary-search-tree-value-ii",
"question__hide": false,
- "total_acs": 118849,
- "total_submitted": 200820,
+ "total_acs": 119471,
+ "total_submitted": 201635,
"frontend_question_id": 272,
"is_new_question": false
},
@@ -66738,8 +67336,8 @@
"question__title": "Encode and Decode Strings",
"question__title_slug": "encode-and-decode-strings",
"question__hide": false,
- "total_acs": 201859,
- "total_submitted": 431458,
+ "total_acs": 204713,
+ "total_submitted": 436095,
"frontend_question_id": 271,
"is_new_question": false
},
@@ -66761,8 +67359,8 @@
"question__title": "Closest Binary Search Tree Value",
"question__title_slug": "closest-binary-search-tree-value",
"question__hide": false,
- "total_acs": 345421,
- "total_submitted": 670464,
+ "total_acs": 349278,
+ "total_submitted": 678931,
"frontend_question_id": 270,
"is_new_question": false
},
@@ -66784,8 +67382,8 @@
"question__title": "Alien Dictionary",
"question__title_slug": "alien-dictionary",
"question__hide": false,
- "total_acs": 382624,
- "total_submitted": 1068714,
+ "total_acs": 385116,
+ "total_submitted": 1074540,
"frontend_question_id": 269,
"is_new_question": false
},
@@ -66807,8 +67405,8 @@
"question__title": "Missing Number",
"question__title_slug": "missing-number",
"question__hide": false,
- "total_acs": 2241312,
- "total_submitted": 3342493,
+ "total_acs": 2284364,
+ "total_submitted": 3397104,
"frontend_question_id": 268,
"is_new_question": false
},
@@ -66830,8 +67428,8 @@
"question__title": "Palindrome Permutation II",
"question__title_slug": "palindrome-permutation-ii",
"question__hide": false,
- "total_acs": 68514,
- "total_submitted": 164790,
+ "total_acs": 69109,
+ "total_submitted": 165905,
"frontend_question_id": 267,
"is_new_question": false
},
@@ -66853,8 +67451,8 @@
"question__title": "Palindrome Permutation",
"question__title_slug": "palindrome-permutation",
"question__hide": false,
- "total_acs": 204131,
- "total_submitted": 302951,
+ "total_acs": 205425,
+ "total_submitted": 304471,
"frontend_question_id": 266,
"is_new_question": false
},
@@ -66876,8 +67474,8 @@
"question__title": "Paint House II",
"question__title_slug": "paint-house-ii",
"question__hide": false,
- "total_acs": 123304,
- "total_submitted": 225135,
+ "total_acs": 123789,
+ "total_submitted": 225840,
"frontend_question_id": 265,
"is_new_question": false
},
@@ -66899,8 +67497,8 @@
"question__title": "Ugly Number II",
"question__title_slug": "ugly-number-ii",
"question__hide": false,
- "total_acs": 343191,
- "total_submitted": 742675,
+ "total_acs": 345372,
+ "total_submitted": 747049,
"frontend_question_id": 264,
"is_new_question": false
},
@@ -66922,8 +67520,8 @@
"question__title": "Ugly Number",
"question__title_slug": "ugly-number",
"question__hide": false,
- "total_acs": 518405,
- "total_submitted": 1235990,
+ "total_acs": 524017,
+ "total_submitted": 1248874,
"frontend_question_id": 263,
"is_new_question": false
},
@@ -66945,8 +67543,8 @@
"question__title": "Trips and Users",
"question__title_slug": "trips-and-users",
"question__hide": false,
- "total_acs": 184112,
- "total_submitted": 505755,
+ "total_acs": 186369,
+ "total_submitted": 511676,
"frontend_question_id": 262,
"is_new_question": false
},
@@ -66968,8 +67566,8 @@
"question__title": "Graph Valid Tree",
"question__title_slug": "graph-valid-tree",
"question__hide": false,
- "total_acs": 403384,
- "total_submitted": 836928,
+ "total_acs": 407065,
+ "total_submitted": 843474,
"frontend_question_id": 261,
"is_new_question": false
},
@@ -66991,8 +67589,8 @@
"question__title": "Single Number III",
"question__title_slug": "single-number-iii",
"question__hide": false,
- "total_acs": 456730,
- "total_submitted": 645533,
+ "total_acs": 462096,
+ "total_submitted": 653009,
"frontend_question_id": 260,
"is_new_question": false
},
@@ -67014,8 +67612,8 @@
"question__title": "3Sum Smaller",
"question__title_slug": "3sum-smaller",
"question__hide": false,
- "total_acs": 151201,
- "total_submitted": 297730,
+ "total_acs": 152059,
+ "total_submitted": 299315,
"frontend_question_id": 259,
"is_new_question": false
},
@@ -67037,8 +67635,8 @@
"question__title": "Add Digits",
"question__title_slug": "add-digits",
"question__hide": false,
- "total_acs": 793245,
- "total_submitted": 1189720,
+ "total_acs": 802045,
+ "total_submitted": 1201440,
"frontend_question_id": 258,
"is_new_question": false
},
@@ -67060,8 +67658,8 @@
"question__title": "Binary Tree Paths",
"question__title_slug": "binary-tree-paths",
"question__hide": false,
- "total_acs": 731096,
- "total_submitted": 1144873,
+ "total_acs": 737707,
+ "total_submitted": 1152760,
"frontend_question_id": 257,
"is_new_question": false
},
@@ -67083,8 +67681,8 @@
"question__title": "Paint House",
"question__title_slug": "paint-house",
"question__hide": false,
- "total_acs": 208557,
- "total_submitted": 333307,
+ "total_acs": 209626,
+ "total_submitted": 334706,
"frontend_question_id": 256,
"is_new_question": false
},
@@ -67106,8 +67704,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": 81068,
- "total_submitted": 162279,
+ "total_acs": 81313,
+ "total_submitted": 162652,
"frontend_question_id": 255,
"is_new_question": false
},
@@ -67129,8 +67727,8 @@
"question__title": "Factor Combinations",
"question__title_slug": "factor-combinations",
"question__hide": false,
- "total_acs": 127500,
- "total_submitted": 257282,
+ "total_acs": 127824,
+ "total_submitted": 257832,
"frontend_question_id": 254,
"is_new_question": false
},
@@ -67152,8 +67750,8 @@
"question__title": "Meeting Rooms II",
"question__title_slug": "meeting-rooms-ii",
"question__hide": false,
- "total_acs": 899428,
- "total_submitted": 1752220,
+ "total_acs": 905111,
+ "total_submitted": 1762277,
"frontend_question_id": 253,
"is_new_question": false
},
@@ -67175,8 +67773,8 @@
"question__title": "Meeting Rooms",
"question__title_slug": "meeting-rooms",
"question__hide": false,
- "total_acs": 401408,
- "total_submitted": 690630,
+ "total_acs": 404399,
+ "total_submitted": 695249,
"frontend_question_id": 252,
"is_new_question": false
},
@@ -67198,8 +67796,8 @@
"question__title": "Flatten 2D Vector",
"question__title_slug": "flatten-2d-vector",
"question__hide": false,
- "total_acs": 127144,
- "total_submitted": 256650,
+ "total_acs": 127689,
+ "total_submitted": 257595,
"frontend_question_id": 251,
"is_new_question": false
},
@@ -67221,8 +67819,8 @@
"question__title": "Count Univalue Subtrees",
"question__title_slug": "count-univalue-subtrees",
"question__hide": false,
- "total_acs": 153111,
- "total_submitted": 271132,
+ "total_acs": 153644,
+ "total_submitted": 271934,
"frontend_question_id": 250,
"is_new_question": false
},
@@ -67244,8 +67842,8 @@
"question__title": "Group Shifted Strings",
"question__title_slug": "group-shifted-strings",
"question__hide": false,
- "total_acs": 240061,
- "total_submitted": 365213,
+ "total_acs": 242719,
+ "total_submitted": 368746,
"frontend_question_id": 249,
"is_new_question": false
},
@@ -67267,8 +67865,8 @@
"question__title": "Strobogrammatic Number III",
"question__title_slug": "strobogrammatic-number-iii",
"question__hide": false,
- "total_acs": 36526,
- "total_submitted": 86679,
+ "total_acs": 36567,
+ "total_submitted": 86751,
"frontend_question_id": 248,
"is_new_question": false
},
@@ -67290,8 +67888,8 @@
"question__title": "Strobogrammatic Number II",
"question__title_slug": "strobogrammatic-number-ii",
"question__hide": false,
- "total_acs": 141075,
- "total_submitted": 269199,
+ "total_acs": 141935,
+ "total_submitted": 270632,
"frontend_question_id": 247,
"is_new_question": false
},
@@ -67313,8 +67911,8 @@
"question__title": "Strobogrammatic Number",
"question__title_slug": "strobogrammatic-number",
"question__hide": false,
- "total_acs": 174426,
- "total_submitted": 365690,
+ "total_acs": 175108,
+ "total_submitted": 367241,
"frontend_question_id": 246,
"is_new_question": false
},
@@ -67336,8 +67934,8 @@
"question__title": "Shortest Word Distance III",
"question__title_slug": "shortest-word-distance-iii",
"question__hide": false,
- "total_acs": 82354,
- "total_submitted": 140784,
+ "total_acs": 82505,
+ "total_submitted": 141002,
"frontend_question_id": 245,
"is_new_question": false
},
@@ -67359,8 +67957,8 @@
"question__title": "Shortest Word Distance II",
"question__title_slug": "shortest-word-distance-ii",
"question__hide": false,
- "total_acs": 153819,
- "total_submitted": 251095,
+ "total_acs": 154362,
+ "total_submitted": 251829,
"frontend_question_id": 244,
"is_new_question": false
},
@@ -67382,8 +67980,8 @@
"question__title": "Shortest Word Distance",
"question__title_slug": "shortest-word-distance",
"question__hide": false,
- "total_acs": 214341,
- "total_submitted": 327923,
+ "total_acs": 215193,
+ "total_submitted": 329108,
"frontend_question_id": 243,
"is_new_question": false
},
@@ -67405,8 +68003,8 @@
"question__title": "Valid Anagram",
"question__title_slug": "valid-anagram",
"question__hide": false,
- "total_acs": 3550004,
- "total_submitted": 5489363,
+ "total_acs": 3614796,
+ "total_submitted": 5579398,
"frontend_question_id": 242,
"is_new_question": false
},
@@ -67428,8 +68026,8 @@
"question__title": "Different Ways to Add Parentheses",
"question__title_slug": "different-ways-to-add-parentheses",
"question__hide": false,
- "total_acs": 220621,
- "total_submitted": 336686,
+ "total_acs": 222040,
+ "total_submitted": 338374,
"frontend_question_id": 241,
"is_new_question": false
},
@@ -67451,8 +68049,8 @@
"question__title": "Search a 2D Matrix II",
"question__title_slug": "search-a-2d-matrix-ii",
"question__hide": false,
- "total_acs": 935393,
- "total_submitted": 1771813,
+ "total_acs": 947090,
+ "total_submitted": 1788967,
"frontend_question_id": 240,
"is_new_question": false
},
@@ -67474,8 +68072,8 @@
"question__title": "Sliding Window Maximum",
"question__title_slug": "sliding-window-maximum",
"question__hide": false,
- "total_acs": 1035818,
- "total_submitted": 2222897,
+ "total_acs": 1051700,
+ "total_submitted": 2253958,
"frontend_question_id": 239,
"is_new_question": false
},
@@ -67497,8 +68095,8 @@
"question__title": "Product of Array Except Self",
"question__title_slug": "product-of-array-except-self",
"question__hide": false,
- "total_acs": 2664334,
- "total_submitted": 4016194,
+ "total_acs": 2714063,
+ "total_submitted": 4087437,
"frontend_question_id": 238,
"is_new_question": false
},
@@ -67520,8 +68118,8 @@
"question__title": "Delete Node in a Linked List",
"question__title_slug": "delete-node-in-a-linked-list",
"question__hide": false,
- "total_acs": 1403390,
- "total_submitted": 1756670,
+ "total_acs": 1422909,
+ "total_submitted": 1777330,
"frontend_question_id": 237,
"is_new_question": false
},
@@ -67543,8 +68141,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": 1644496,
- "total_submitted": 2630327,
+ "total_acs": 1668124,
+ "total_submitted": 2658376,
"frontend_question_id": 236,
"is_new_question": false
},
@@ -67566,8 +68164,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": 1508765,
- "total_submitted": 2321499,
+ "total_acs": 1529533,
+ "total_submitted": 2346658,
"frontend_question_id": 235,
"is_new_question": false
},
@@ -67589,8 +68187,8 @@
"question__title": "Palindrome Linked List",
"question__title_slug": "palindrome-linked-list",
"question__hide": false,
- "total_acs": 1942434,
- "total_submitted": 3642039,
+ "total_acs": 1968864,
+ "total_submitted": 3681776,
"frontend_question_id": 234,
"is_new_question": false
},
@@ -67612,8 +68210,8 @@
"question__title": "Number of Digit One",
"question__title_slug": "number-of-digit-one",
"question__hide": false,
- "total_acs": 93794,
- "total_submitted": 270874,
+ "total_acs": 94780,
+ "total_submitted": 273393,
"frontend_question_id": 233,
"is_new_question": false
},
@@ -67635,8 +68233,8 @@
"question__title": "Implement Queue using Stacks",
"question__title_slug": "implement-queue-using-stacks",
"question__hide": false,
- "total_acs": 938539,
- "total_submitted": 1414671,
+ "total_acs": 954394,
+ "total_submitted": 1435891,
"frontend_question_id": 232,
"is_new_question": false
},
@@ -67658,8 +68256,8 @@
"question__title": "Power of Two",
"question__title_slug": "power-of-two",
"question__hide": false,
- "total_acs": 1324472,
- "total_submitted": 2772399,
+ "total_acs": 1345707,
+ "total_submitted": 2814797,
"frontend_question_id": 231,
"is_new_question": false
},
@@ -67681,8 +68279,8 @@
"question__title": "Kth Smallest Element in a BST",
"question__title_slug": "kth-smallest-element-in-a-bst",
"question__hide": false,
- "total_acs": 1442682,
- "total_submitted": 1983385,
+ "total_acs": 1466224,
+ "total_submitted": 2011064,
"frontend_question_id": 230,
"is_new_question": false
},
@@ -67704,8 +68302,8 @@
"question__title": "Majority Element II",
"question__title_slug": "majority-element-ii",
"question__hide": false,
- "total_acs": 690826,
- "total_submitted": 1337346,
+ "total_acs": 707289,
+ "total_submitted": 1364329,
"frontend_question_id": 229,
"is_new_question": false
},
@@ -67727,8 +68325,8 @@
"question__title": "Summary Ranges",
"question__title_slug": "summary-ranges",
"question__hide": false,
- "total_acs": 567615,
- "total_submitted": 1116953,
+ "total_acs": 577607,
+ "total_submitted": 1133766,
"frontend_question_id": 228,
"is_new_question": false
},
@@ -67750,8 +68348,8 @@
"question__title": "Basic Calculator II",
"question__title_slug": "basic-calculator-ii",
"question__hide": false,
- "total_acs": 638622,
- "total_submitted": 1459641,
+ "total_acs": 645716,
+ "total_submitted": 1472451,
"frontend_question_id": 227,
"is_new_question": false
},
@@ -67773,8 +68371,8 @@
"question__title": "Invert Binary Tree",
"question__title_slug": "invert-binary-tree",
"question__hide": false,
- "total_acs": 2082342,
- "total_submitted": 2699764,
+ "total_acs": 2111279,
+ "total_submitted": 2732826,
"frontend_question_id": 226,
"is_new_question": false
},
@@ -67796,8 +68394,8 @@
"question__title": "Implement Stack using Queues",
"question__title_slug": "implement-stack-using-queues",
"question__hide": false,
- "total_acs": 677406,
- "total_submitted": 1059492,
+ "total_acs": 690852,
+ "total_submitted": 1076504,
"frontend_question_id": 225,
"is_new_question": false
},
@@ -67819,8 +68417,8 @@
"question__title": "Basic Calculator",
"question__title_slug": "basic-calculator",
"question__hide": false,
- "total_acs": 468972,
- "total_submitted": 1077277,
+ "total_acs": 474401,
+ "total_submitted": 1088214,
"frontend_question_id": 224,
"is_new_question": false
},
@@ -67842,8 +68440,8 @@
"question__title": "Rectangle Area",
"question__title_slug": "rectangle-area",
"question__hide": false,
- "total_acs": 223669,
- "total_submitted": 483207,
+ "total_acs": 225107,
+ "total_submitted": 485563,
"frontend_question_id": 223,
"is_new_question": false
},
@@ -67865,8 +68463,8 @@
"question__title": "Count Complete Tree Nodes",
"question__title_slug": "count-complete-tree-nodes",
"question__hide": false,
- "total_acs": 730595,
- "total_submitted": 1113618,
+ "total_acs": 744242,
+ "total_submitted": 1129148,
"frontend_question_id": 222,
"is_new_question": false
},
@@ -67888,8 +68486,8 @@
"question__title": "Maximal Square",
"question__title_slug": "maximal-square",
"question__hide": false,
- "total_acs": 686070,
- "total_submitted": 1469167,
+ "total_acs": 691931,
+ "total_submitted": 1478419,
"frontend_question_id": 221,
"is_new_question": false
},
@@ -67911,8 +68509,8 @@
"question__title": "Contains Duplicate III",
"question__title_slug": "contains-duplicate-iii",
"question__hide": false,
- "total_acs": 253610,
- "total_submitted": 1112404,
+ "total_acs": 254883,
+ "total_submitted": 1116357,
"frontend_question_id": 220,
"is_new_question": false
},
@@ -67934,8 +68532,8 @@
"question__title": "Contains Duplicate II",
"question__title_slug": "contains-duplicate-ii",
"question__hide": false,
- "total_acs": 950012,
- "total_submitted": 2093192,
+ "total_acs": 968289,
+ "total_submitted": 2124489,
"frontend_question_id": 219,
"is_new_question": false
},
@@ -67957,8 +68555,8 @@
"question__title": "The Skyline Problem",
"question__title_slug": "the-skyline-problem",
"question__hide": false,
- "total_acs": 289767,
- "total_submitted": 677808,
+ "total_acs": 291295,
+ "total_submitted": 680496,
"frontend_question_id": 218,
"is_new_question": false
},
@@ -67980,8 +68578,8 @@
"question__title": "Contains Duplicate",
"question__title_slug": "contains-duplicate",
"question__hide": false,
- "total_acs": 4026368,
- "total_submitted": 6513848,
+ "total_acs": 4084345,
+ "total_submitted": 6599115,
"frontend_question_id": 217,
"is_new_question": false
},
@@ -68003,8 +68601,8 @@
"question__title": "Combination Sum III",
"question__title_slug": "combination-sum-iii",
"question__hide": false,
- "total_acs": 517150,
- "total_submitted": 740626,
+ "total_acs": 525055,
+ "total_submitted": 750499,
"frontend_question_id": 216,
"is_new_question": false
},
@@ -68026,8 +68624,8 @@
"question__title": "Kth Largest Element in an Array",
"question__title_slug": "kth-largest-element-in-an-array",
"question__hide": false,
- "total_acs": 2321098,
- "total_submitted": 3475458,
+ "total_acs": 2352526,
+ "total_submitted": 3520314,
"frontend_question_id": 215,
"is_new_question": false
},
@@ -68049,8 +68647,8 @@
"question__title": "Shortest Palindrome",
"question__title_slug": "shortest-palindrome",
"question__hide": false,
- "total_acs": 181418,
- "total_submitted": 540672,
+ "total_acs": 182915,
+ "total_submitted": 543838,
"frontend_question_id": 214,
"is_new_question": false
},
@@ -68072,8 +68670,8 @@
"question__title": "House Robber II",
"question__title_slug": "house-robber-ii",
"question__hide": false,
- "total_acs": 762885,
- "total_submitted": 1813386,
+ "total_acs": 776306,
+ "total_submitted": 1841671,
"frontend_question_id": 213,
"is_new_question": false
},
@@ -68095,8 +68693,8 @@
"question__title": "Word Search II",
"question__title_slug": "word-search-ii",
"question__hide": false,
- "total_acs": 660870,
- "total_submitted": 1818591,
+ "total_acs": 667679,
+ "total_submitted": 1834540,
"frontend_question_id": 212,
"is_new_question": false
},
@@ -68118,8 +68716,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": 641253,
- "total_submitted": 1413332,
+ "total_acs": 648207,
+ "total_submitted": 1425363,
"frontend_question_id": 211,
"is_new_question": false
},
@@ -68141,8 +68739,8 @@
"question__title": "Course Schedule II",
"question__title_slug": "course-schedule-ii",
"question__hide": false,
- "total_acs": 1042888,
- "total_submitted": 2059832,
+ "total_acs": 1058778,
+ "total_submitted": 2085071,
"frontend_question_id": 210,
"is_new_question": false
},
@@ -68164,8 +68762,8 @@
"question__title": "Minimum Size Subarray Sum",
"question__title_slug": "minimum-size-subarray-sum",
"question__hide": false,
- "total_acs": 1055567,
- "total_submitted": 2235396,
+ "total_acs": 1075736,
+ "total_submitted": 2272152,
"frontend_question_id": 209,
"is_new_question": false
},
@@ -68187,8 +68785,8 @@
"question__title": "Implement Trie (Prefix Tree)",
"question__title_slug": "implement-trie-prefix-tree",
"question__hide": false,
- "total_acs": 1046110,
- "total_submitted": 1600565,
+ "total_acs": 1062839,
+ "total_submitted": 1621350,
"frontend_question_id": 208,
"is_new_question": false
},
@@ -68210,8 +68808,8 @@
"question__title": "Course Schedule",
"question__title_slug": "course-schedule",
"question__hide": false,
- "total_acs": 1578876,
- "total_submitted": 3369577,
+ "total_acs": 1603039,
+ "total_submitted": 3412909,
"frontend_question_id": 207,
"is_new_question": false
},
@@ -68233,8 +68831,8 @@
"question__title": "Reverse Linked List",
"question__title_slug": "reverse-linked-list",
"question__hide": false,
- "total_acs": 4180557,
- "total_submitted": 5447447,
+ "total_acs": 4240893,
+ "total_submitted": 5514686,
"frontend_question_id": 206,
"is_new_question": false
},
@@ -68256,8 +68854,8 @@
"question__title": "Isomorphic Strings",
"question__title_slug": "isomorphic-strings",
"question__hide": false,
- "total_acs": 1355976,
- "total_submitted": 2998282,
+ "total_acs": 1378362,
+ "total_submitted": 3042949,
"frontend_question_id": 205,
"is_new_question": false
},
@@ -68279,8 +68877,8 @@
"question__title": "Count Primes",
"question__title_slug": "count-primes",
"question__hide": false,
- "total_acs": 870856,
- "total_submitted": 2586767,
+ "total_acs": 881287,
+ "total_submitted": 2612630,
"frontend_question_id": 204,
"is_new_question": false
},
@@ -68302,8 +68900,8 @@
"question__title": "Remove Linked List Elements",
"question__title_slug": "remove-linked-list-elements",
"question__hide": false,
- "total_acs": 1140195,
- "total_submitted": 2326723,
+ "total_acs": 1151395,
+ "total_submitted": 2342595,
"frontend_question_id": 203,
"is_new_question": false
},
@@ -68325,8 +68923,8 @@
"question__title": "Happy Number",
"question__title_slug": "happy-number",
"question__hide": false,
- "total_acs": 1474773,
- "total_submitted": 2622810,
+ "total_acs": 1494739,
+ "total_submitted": 2653249,
"frontend_question_id": 202,
"is_new_question": false
},
@@ -68348,8 +68946,8 @@
"question__title": "Bitwise AND of Numbers Range",
"question__title_slug": "bitwise-and-of-numbers-range",
"question__hide": false,
- "total_acs": 395061,
- "total_submitted": 841151,
+ "total_acs": 398617,
+ "total_submitted": 847676,
"frontend_question_id": 201,
"is_new_question": false
},
@@ -68371,8 +68969,8 @@
"question__title": "Number of Islands",
"question__title_slug": "number-of-islands",
"question__hide": false,
- "total_acs": 2752776,
- "total_submitted": 4615535,
+ "total_acs": 2783556,
+ "total_submitted": 4657225,
"frontend_question_id": 200,
"is_new_question": false
},
@@ -68394,8 +68992,8 @@
"question__title": "Binary Tree Right Side View",
"question__title_slug": "binary-tree-right-side-view",
"question__hide": false,
- "total_acs": 1326698,
- "total_submitted": 2098424,
+ "total_acs": 1351766,
+ "total_submitted": 2134358,
"frontend_question_id": 199,
"is_new_question": false
},
@@ -68417,8 +69015,8 @@
"question__title": "House Robber",
"question__title_slug": "house-robber",
"question__hide": false,
- "total_acs": 2229787,
- "total_submitted": 4363910,
+ "total_acs": 2266462,
+ "total_submitted": 4429520,
"frontend_question_id": 198,
"is_new_question": false
},
@@ -68440,8 +69038,8 @@
"question__title": "Rising Temperature",
"question__title_slug": "rising-temperature",
"question__hide": false,
- "total_acs": 653345,
- "total_submitted": 1371843,
+ "total_acs": 676930,
+ "total_submitted": 1416066,
"frontend_question_id": 197,
"is_new_question": false
},
@@ -68463,8 +69061,8 @@
"question__title": "Delete Duplicate Emails",
"question__title_slug": "delete-duplicate-emails",
"question__hide": false,
- "total_acs": 534334,
- "total_submitted": 860989,
+ "total_acs": 543296,
+ "total_submitted": 873573,
"frontend_question_id": 196,
"is_new_question": false
},
@@ -68486,8 +69084,8 @@
"question__title": "Tenth Line",
"question__title_slug": "tenth-line",
"question__hide": false,
- "total_acs": 107452,
- "total_submitted": 321636,
+ "total_acs": 108449,
+ "total_submitted": 324304,
"frontend_question_id": 195,
"is_new_question": false
},
@@ -68509,8 +69107,8 @@
"question__title": "Transpose File",
"question__title_slug": "transpose-file",
"question__hide": false,
- "total_acs": 25918,
- "total_submitted": 98157,
+ "total_acs": 26220,
+ "total_submitted": 98934,
"frontend_question_id": 194,
"is_new_question": false
},
@@ -68532,8 +69130,8 @@
"question__title": "Valid Phone Numbers",
"question__title_slug": "valid-phone-numbers",
"question__hide": false,
- "total_acs": 83952,
- "total_submitted": 321959,
+ "total_acs": 84831,
+ "total_submitted": 324823,
"frontend_question_id": 193,
"is_new_question": false
},
@@ -68555,8 +69153,8 @@
"question__title": "Word Frequency",
"question__title_slug": "word-frequency",
"question__hide": false,
- "total_acs": 51368,
- "total_submitted": 199091,
+ "total_acs": 51815,
+ "total_submitted": 200471,
"frontend_question_id": 192,
"is_new_question": false
},
@@ -68578,8 +69176,8 @@
"question__title": "Number of 1 Bits",
"question__title_slug": "number-of-1-bits",
"question__hide": false,
- "total_acs": 1482504,
- "total_submitted": 2079534,
+ "total_acs": 1500708,
+ "total_submitted": 2098772,
"frontend_question_id": 191,
"is_new_question": false
},
@@ -68601,8 +69199,8 @@
"question__title": "Reverse Bits",
"question__title_slug": "reverse-bits",
"question__hide": false,
- "total_acs": 803442,
- "total_submitted": 1364432,
+ "total_acs": 813736,
+ "total_submitted": 1376104,
"frontend_question_id": 190,
"is_new_question": false
},
@@ -68624,8 +69222,8 @@
"question__title": "Rotate Array",
"question__title_slug": "rotate-array",
"question__hide": false,
- "total_acs": 2194274,
- "total_submitted": 5387769,
+ "total_acs": 2247493,
+ "total_submitted": 5499837,
"frontend_question_id": 189,
"is_new_question": false
},
@@ -68647,8 +69245,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": 459212,
- "total_submitted": 1066695,
+ "total_acs": 467165,
+ "total_submitted": 1078008,
"frontend_question_id": 188,
"is_new_question": false
},
@@ -68670,8 +69268,8 @@
"question__title": "Repeated DNA Sequences",
"question__title_slug": "repeated-dna-sequences",
"question__hide": false,
- "total_acs": 380825,
- "total_submitted": 776409,
+ "total_acs": 384067,
+ "total_submitted": 781277,
"frontend_question_id": 187,
"is_new_question": false
},
@@ -68693,8 +69291,8 @@
"question__title": "Reverse Words in a String II",
"question__title_slug": "reverse-words-in-a-string-ii",
"question__hide": false,
- "total_acs": 162215,
- "total_submitted": 296518,
+ "total_acs": 162808,
+ "total_submitted": 297233,
"frontend_question_id": 186,
"is_new_question": false
},
@@ -68716,8 +69314,8 @@
"question__title": "Department Top Three Salaries",
"question__title_slug": "department-top-three-salaries",
"question__hide": false,
- "total_acs": 330166,
- "total_submitted": 616065,
+ "total_acs": 337535,
+ "total_submitted": 627403,
"frontend_question_id": 185,
"is_new_question": false
},
@@ -68739,8 +69337,8 @@
"question__title": "Department Highest Salary",
"question__title_slug": "department-highest-salary",
"question__hide": false,
- "total_acs": 388768,
- "total_submitted": 749127,
+ "total_acs": 393221,
+ "total_submitted": 755900,
"frontend_question_id": 184,
"is_new_question": false
},
@@ -68762,8 +69360,8 @@
"question__title": "Customers Who Never Order",
"question__title_slug": "customers-who-never-order",
"question__hide": false,
- "total_acs": 815993,
- "total_submitted": 1178718,
+ "total_acs": 824839,
+ "total_submitted": 1190671,
"frontend_question_id": 183,
"is_new_question": false
},
@@ -68785,8 +69383,8 @@
"question__title": "Duplicate Emails",
"question__title_slug": "duplicate-emails",
"question__hide": false,
- "total_acs": 670971,
- "total_submitted": 942967,
+ "total_acs": 679320,
+ "total_submitted": 953976,
"frontend_question_id": 182,
"is_new_question": false
},
@@ -68808,8 +69406,8 @@
"question__title": "Employees Earning More Than Their Managers",
"question__title_slug": "employees-earning-more-than-their-managers",
"question__hide": false,
- "total_acs": 646798,
- "total_submitted": 928701,
+ "total_acs": 654653,
+ "total_submitted": 938834,
"frontend_question_id": 181,
"is_new_question": false
},
@@ -68831,8 +69429,8 @@
"question__title": "Consecutive Numbers",
"question__title_slug": "consecutive-numbers",
"question__hide": false,
- "total_acs": 378222,
- "total_submitted": 824645,
+ "total_acs": 385862,
+ "total_submitted": 851171,
"frontend_question_id": 180,
"is_new_question": false
},
@@ -68854,8 +69452,8 @@
"question__title": "Largest Number",
"question__title_slug": "largest-number",
"question__hide": false,
- "total_acs": 478959,
- "total_submitted": 1318754,
+ "total_acs": 483731,
+ "total_submitted": 1328342,
"frontend_question_id": 179,
"is_new_question": false
},
@@ -68877,8 +69475,8 @@
"question__title": "Rank Scores",
"question__title_slug": "rank-scores",
"question__hide": false,
- "total_acs": 393232,
- "total_submitted": 628891,
+ "total_acs": 397886,
+ "total_submitted": 635032,
"frontend_question_id": 178,
"is_new_question": false
},
@@ -68900,8 +69498,8 @@
"question__title": "Nth Highest Salary",
"question__title_slug": "nth-highest-salary",
"question__hide": false,
- "total_acs": 396662,
- "total_submitted": 1045411,
+ "total_acs": 401094,
+ "total_submitted": 1057380,
"frontend_question_id": 177,
"is_new_question": false
},
@@ -68923,8 +69521,8 @@
"question__title": "Second Highest Salary",
"question__title_slug": "second-highest-salary",
"question__hide": false,
- "total_acs": 873201,
- "total_submitted": 2150367,
+ "total_acs": 885981,
+ "total_submitted": 2174147,
"frontend_question_id": 176,
"is_new_question": false
},
@@ -68946,8 +69544,8 @@
"question__title": "Combine Two Tables",
"question__title_slug": "combine-two-tables",
"question__hide": false,
- "total_acs": 1023888,
- "total_submitted": 1345315,
+ "total_acs": 1035723,
+ "total_submitted": 1359265,
"frontend_question_id": 175,
"is_new_question": false
},
@@ -68969,8 +69567,8 @@
"question__title": "Dungeon Game",
"question__title_slug": "dungeon-game",
"question__hide": false,
- "total_acs": 226210,
- "total_submitted": 592359,
+ "total_acs": 227660,
+ "total_submitted": 595575,
"frontend_question_id": 174,
"is_new_question": false
},
@@ -68992,8 +69590,8 @@
"question__title": "Binary Search Tree Iterator",
"question__title_slug": "binary-search-tree-iterator",
"question__hide": false,
- "total_acs": 791960,
- "total_submitted": 1096572,
+ "total_acs": 800378,
+ "total_submitted": 1105798,
"frontend_question_id": 173,
"is_new_question": false
},
@@ -69015,8 +69613,8 @@
"question__title": "Factorial Trailing Zeroes",
"question__title_slug": "factorial-trailing-zeroes",
"question__hide": false,
- "total_acs": 453892,
- "total_submitted": 1045192,
+ "total_acs": 459489,
+ "total_submitted": 1056291,
"frontend_question_id": 172,
"is_new_question": false
},
@@ -69038,8 +69636,8 @@
"question__title": "Excel Sheet Column Number",
"question__title_slug": "excel-sheet-column-number",
"question__hide": false,
- "total_acs": 690428,
- "total_submitted": 1080598,
+ "total_acs": 695949,
+ "total_submitted": 1087414,
"frontend_question_id": 171,
"is_new_question": false
},
@@ -69061,8 +69659,8 @@
"question__title": "Two Sum III - Data structure design",
"question__title_slug": "two-sum-iii-data-structure-design",
"question__hide": false,
- "total_acs": 155107,
- "total_submitted": 407274,
+ "total_acs": 155742,
+ "total_submitted": 408710,
"frontend_question_id": 170,
"is_new_question": false
},
@@ -69084,8 +69682,8 @@
"question__title": "Majority Element",
"question__title_slug": "majority-element",
"question__hide": false,
- "total_acs": 2909249,
- "total_submitted": 4483036,
+ "total_acs": 2984813,
+ "total_submitted": 4594453,
"frontend_question_id": 169,
"is_new_question": false
},
@@ -69107,8 +69705,8 @@
"question__title": "Excel Sheet Column Title",
"question__title_slug": "excel-sheet-column-title",
"question__hide": false,
- "total_acs": 528752,
- "total_submitted": 1295795,
+ "total_acs": 533588,
+ "total_submitted": 1303144,
"frontend_question_id": 168,
"is_new_question": false
},
@@ -69130,8 +69728,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": 2048482,
- "total_submitted": 3333731,
+ "total_acs": 2082547,
+ "total_submitted": 3382548,
"frontend_question_id": 167,
"is_new_question": false
},
@@ -69153,8 +69751,8 @@
"question__title": "Fraction to Recurring Decimal",
"question__title_slug": "fraction-to-recurring-decimal",
"question__hide": false,
- "total_acs": 228404,
- "total_submitted": 909635,
+ "total_acs": 229692,
+ "total_submitted": 912718,
"frontend_question_id": 166,
"is_new_question": false
},
@@ -69176,8 +69774,8 @@
"question__title": "Compare Version Numbers",
"question__title_slug": "compare-version-numbers",
"question__hide": false,
- "total_acs": 493034,
- "total_submitted": 1208844,
+ "total_acs": 496437,
+ "total_submitted": 1214095,
"frontend_question_id": 165,
"is_new_question": false
},
@@ -69199,8 +69797,8 @@
"question__title": "Maximum Gap",
"question__title_slug": "maximum-gap",
"question__hide": false,
- "total_acs": 213531,
- "total_submitted": 462265,
+ "total_acs": 216715,
+ "total_submitted": 467290,
"frontend_question_id": 164,
"is_new_question": false
},
@@ -69222,8 +69820,8 @@
"question__title": "Missing Ranges",
"question__title_slug": "missing-ranges",
"question__hide": false,
- "total_acs": 243408,
- "total_submitted": 719203,
+ "total_acs": 245783,
+ "total_submitted": 724407,
"frontend_question_id": 163,
"is_new_question": false
},
@@ -69245,8 +69843,8 @@
"question__title": "Find Peak Element",
"question__title_slug": "find-peak-element",
"question__hide": false,
- "total_acs": 1387920,
- "total_submitted": 3017359,
+ "total_acs": 1417087,
+ "total_submitted": 3080533,
"frontend_question_id": 162,
"is_new_question": false
},
@@ -69268,8 +69866,8 @@
"question__title": "One Edit Distance",
"question__title_slug": "one-edit-distance",
"question__hide": false,
- "total_acs": 206717,
- "total_submitted": 602631,
+ "total_acs": 207543,
+ "total_submitted": 604744,
"frontend_question_id": 161,
"is_new_question": false
},
@@ -69291,8 +69889,8 @@
"question__title": "Intersection of Two Linked Lists",
"question__title_slug": "intersection-of-two-linked-lists",
"question__hide": false,
- "total_acs": 1582650,
- "total_submitted": 2741844,
+ "total_acs": 1605255,
+ "total_submitted": 2770839,
"frontend_question_id": 160,
"is_new_question": false
},
@@ -69314,8 +69912,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": 260321,
- "total_submitted": 469412,
+ "total_acs": 261539,
+ "total_submitted": 471193,
"frontend_question_id": 159,
"is_new_question": false
},
@@ -69337,8 +69935,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": 183977,
- "total_submitted": 434652,
+ "total_acs": 184404,
+ "total_submitted": 435277,
"frontend_question_id": 158,
"is_new_question": false
},
@@ -69360,8 +69958,8 @@
"question__title": "Read N Characters Given Read4",
"question__title_slug": "read-n-characters-given-read4",
"question__hide": false,
- "total_acs": 191443,
- "total_submitted": 460490,
+ "total_acs": 191965,
+ "total_submitted": 461396,
"frontend_question_id": 157,
"is_new_question": false
},
@@ -69383,8 +69981,8 @@
"question__title": "Binary Tree Upside Down",
"question__title_slug": "binary-tree-upside-down",
"question__hide": false,
- "total_acs": 102192,
- "total_submitted": 162568,
+ "total_acs": 102664,
+ "total_submitted": 163110,
"frontend_question_id": 156,
"is_new_question": false
},
@@ -69406,8 +70004,8 @@
"question__title": "Min Stack",
"question__title_slug": "min-stack",
"question__hide": false,
- "total_acs": 1687612,
- "total_submitted": 3105806,
+ "total_acs": 1714555,
+ "total_submitted": 3148364,
"frontend_question_id": 155,
"is_new_question": false
},
@@ -69429,8 +70027,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": 451673,
- "total_submitted": 1034054,
+ "total_acs": 456044,
+ "total_submitted": 1044088,
"frontend_question_id": 154,
"is_new_question": false
},
@@ -69452,8 +70050,8 @@
"question__title": "Find Minimum in Rotated Sorted Array",
"question__title_slug": "find-minimum-in-rotated-sorted-array",
"question__hide": false,
- "total_acs": 1816754,
- "total_submitted": 3595375,
+ "total_acs": 1853686,
+ "total_submitted": 3657604,
"frontend_question_id": 153,
"is_new_question": false
},
@@ -69475,8 +70073,8 @@
"question__title": "Maximum Product Subarray",
"question__title_slug": "maximum-product-subarray",
"question__hide": false,
- "total_acs": 1283184,
- "total_submitted": 3659120,
+ "total_acs": 1297770,
+ "total_submitted": 3740004,
"frontend_question_id": 152,
"is_new_question": false
},
@@ -69498,8 +70096,8 @@
"question__title": "Reverse Words in a String",
"question__title_slug": "reverse-words-in-a-string",
"question__hide": false,
- "total_acs": 1544433,
- "total_submitted": 3583934,
+ "total_acs": 1588985,
+ "total_submitted": 3638605,
"frontend_question_id": 151,
"is_new_question": false
},
@@ -69521,8 +70119,8 @@
"question__title": "Evaluate Reverse Polish Notation",
"question__title_slug": "evaluate-reverse-polish-notation",
"question__hide": false,
- "total_acs": 1058121,
- "total_submitted": 2047493,
+ "total_acs": 1075271,
+ "total_submitted": 2073203,
"frontend_question_id": 150,
"is_new_question": false
},
@@ -69544,8 +70142,8 @@
"question__title": "Max Points on a Line",
"question__title_slug": "max-points-on-a-line",
"question__hide": false,
- "total_acs": 394556,
- "total_submitted": 1467164,
+ "total_acs": 398461,
+ "total_submitted": 1475061,
"frontend_question_id": 149,
"is_new_question": false
},
@@ -69567,8 +70165,8 @@
"question__title": "Sort List",
"question__title_slug": "sort-list",
"question__hide": false,
- "total_acs": 797866,
- "total_submitted": 1370980,
+ "total_acs": 811456,
+ "total_submitted": 1388644,
"frontend_question_id": 148,
"is_new_question": false
},
@@ -69590,8 +70188,8 @@
"question__title": "Insertion Sort List",
"question__title_slug": "insertion-sort-list",
"question__hide": false,
- "total_acs": 373237,
- "total_submitted": 693774,
+ "total_acs": 375854,
+ "total_submitted": 696948,
"frontend_question_id": 147,
"is_new_question": false
},
@@ -69613,8 +70211,8 @@
"question__title": "LRU Cache",
"question__title_slug": "lru-cache",
"question__hide": false,
- "total_acs": 1650035,
- "total_submitted": 3872391,
+ "total_acs": 1669360,
+ "total_submitted": 3907562,
"frontend_question_id": 146,
"is_new_question": false
},
@@ -69636,8 +70234,8 @@
"question__title": "Binary Tree Postorder Traversal",
"question__title_slug": "binary-tree-postorder-traversal",
"question__hide": false,
- "total_acs": 1203860,
- "total_submitted": 1690751,
+ "total_acs": 1222846,
+ "total_submitted": 1712130,
"frontend_question_id": 145,
"is_new_question": false
},
@@ -69659,8 +70257,8 @@
"question__title": "Binary Tree Preorder Traversal",
"question__title_slug": "binary-tree-preorder-traversal",
"question__hide": false,
- "total_acs": 1627153,
- "total_submitted": 2333104,
+ "total_acs": 1650331,
+ "total_submitted": 2359699,
"frontend_question_id": 144,
"is_new_question": false
},
@@ -69682,8 +70280,8 @@
"question__title": "Reorder List",
"question__title_slug": "reorder-list",
"question__hide": false,
- "total_acs": 996479,
- "total_submitted": 1689828,
+ "total_acs": 1009548,
+ "total_submitted": 1706315,
"frontend_question_id": 143,
"is_new_question": false
},
@@ -69705,8 +70303,8 @@
"question__title": "Linked List Cycle II",
"question__title_slug": "linked-list-cycle-ii",
"question__hide": false,
- "total_acs": 1303038,
- "total_submitted": 2528996,
+ "total_acs": 1322350,
+ "total_submitted": 2556122,
"frontend_question_id": 142,
"is_new_question": false
},
@@ -69728,8 +70326,8 @@
"question__title": "Linked List Cycle",
"question__title_slug": "linked-list-cycle",
"question__hide": false,
- "total_acs": 2995614,
- "total_submitted": 5927594,
+ "total_acs": 3046413,
+ "total_submitted": 6014935,
"frontend_question_id": 141,
"is_new_question": false
},
@@ -69751,8 +70349,8 @@
"question__title": "Word Break II",
"question__title_slug": "word-break-ii",
"question__hide": false,
- "total_acs": 659525,
- "total_submitted": 1294951,
+ "total_acs": 664275,
+ "total_submitted": 1300254,
"frontend_question_id": 140,
"is_new_question": false
},
@@ -69774,8 +70372,8 @@
"question__title": "Word Break",
"question__title_slug": "word-break",
"question__hide": false,
- "total_acs": 1692993,
- "total_submitted": 3612165,
+ "total_acs": 1710898,
+ "total_submitted": 3645738,
"frontend_question_id": 139,
"is_new_question": false
},
@@ -69797,8 +70395,8 @@
"question__title": "Copy List with Random Pointer",
"question__title_slug": "copy-list-with-random-pointer",
"question__hide": false,
- "total_acs": 1262082,
- "total_submitted": 2236708,
+ "total_acs": 1278196,
+ "total_submitted": 2256568,
"frontend_question_id": 138,
"is_new_question": false
},
@@ -69820,8 +70418,8 @@
"question__title": "Single Number II",
"question__title_slug": "single-number-ii",
"question__hide": false,
- "total_acs": 595236,
- "total_submitted": 945718,
+ "total_acs": 603709,
+ "total_submitted": 956823,
"frontend_question_id": 137,
"is_new_question": false
},
@@ -69843,8 +70441,8 @@
"question__title": "Single Number",
"question__title_slug": "single-number",
"question__hide": false,
- "total_acs": 2818230,
- "total_submitted": 3853030,
+ "total_acs": 2864933,
+ "total_submitted": 3907415,
"frontend_question_id": 136,
"is_new_question": false
},
@@ -69866,8 +70464,8 @@
"question__title": "Candy",
"question__title_slug": "candy",
"question__hide": false,
- "total_acs": 527809,
- "total_submitted": 1217239,
+ "total_acs": 540181,
+ "total_submitted": 1243504,
"frontend_question_id": 135,
"is_new_question": false
},
@@ -69889,8 +70487,8 @@
"question__title": "Gas Station",
"question__title_slug": "gas-station",
"question__hide": false,
- "total_acs": 814895,
- "total_submitted": 1790621,
+ "total_acs": 829822,
+ "total_submitted": 1822753,
"frontend_question_id": 134,
"is_new_question": false
},
@@ -69912,8 +70510,8 @@
"question__title": "Clone Graph",
"question__title_slug": "clone-graph",
"question__hide": false,
- "total_acs": 1250575,
- "total_submitted": 2168032,
+ "total_acs": 1266114,
+ "total_submitted": 2185881,
"frontend_question_id": 133,
"is_new_question": false
},
@@ -69935,8 +70533,8 @@
"question__title": "Palindrome Partitioning II",
"question__title_slug": "palindrome-partitioning-ii",
"question__hide": false,
- "total_acs": 282179,
- "total_submitted": 829099,
+ "total_acs": 285683,
+ "total_submitted": 838242,
"frontend_question_id": 132,
"is_new_question": false
},
@@ -69958,8 +70556,8 @@
"question__title": "Palindrome Partitioning",
"question__title_slug": "palindrome-partitioning",
"question__hide": false,
- "total_acs": 895610,
- "total_submitted": 1291332,
+ "total_acs": 908762,
+ "total_submitted": 1306658,
"frontend_question_id": 131,
"is_new_question": false
},
@@ -69981,8 +70579,8 @@
"question__title": "Surrounded Regions",
"question__title_slug": "surrounded-regions",
"question__hide": false,
- "total_acs": 712298,
- "total_submitted": 1794988,
+ "total_acs": 725482,
+ "total_submitted": 1818862,
"frontend_question_id": 130,
"is_new_question": false
},
@@ -70004,8 +70602,8 @@
"question__title": "Sum Root to Leaf Numbers",
"question__title_slug": "sum-root-to-leaf-numbers",
"question__hide": false,
- "total_acs": 888662,
- "total_submitted": 1346190,
+ "total_acs": 899295,
+ "total_submitted": 1359579,
"frontend_question_id": 129,
"is_new_question": false
},
@@ -70027,8 +70625,8 @@
"question__title": "Longest Consecutive Sequence",
"question__title_slug": "longest-consecutive-sequence",
"question__hide": false,
- "total_acs": 1789764,
- "total_submitted": 3785585,
+ "total_acs": 1832063,
+ "total_submitted": 3874365,
"frontend_question_id": 128,
"is_new_question": false
},
@@ -70050,8 +70648,8 @@
"question__title": "Word Ladder",
"question__title_slug": "word-ladder",
"question__hide": false,
- "total_acs": 1077176,
- "total_submitted": 2733395,
+ "total_acs": 1090122,
+ "total_submitted": 2754114,
"frontend_question_id": 127,
"is_new_question": false
},
@@ -70073,8 +70671,8 @@
"question__title": "Word Ladder II",
"question__title_slug": "word-ladder-ii",
"question__hide": false,
- "total_acs": 367597,
- "total_submitted": 1348379,
+ "total_acs": 369549,
+ "total_submitted": 1356531,
"frontend_question_id": 126,
"is_new_question": false
},
@@ -70096,8 +70694,8 @@
"question__title": "Valid Palindrome",
"question__title_slug": "valid-palindrome",
"question__hide": false,
- "total_acs": 3024579,
- "total_submitted": 6339877,
+ "total_acs": 3086509,
+ "total_submitted": 6444033,
"frontend_question_id": 125,
"is_new_question": false
},
@@ -70119,8 +70717,8 @@
"question__title": "Binary Tree Maximum Path Sum",
"question__title_slug": "binary-tree-maximum-path-sum",
"question__hide": false,
- "total_acs": 1239935,
- "total_submitted": 3092348,
+ "total_acs": 1258632,
+ "total_submitted": 3135285,
"frontend_question_id": 124,
"is_new_question": false
},
@@ -70142,8 +70740,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": 609020,
- "total_submitted": 1264477,
+ "total_acs": 619402,
+ "total_submitted": 1280756,
"frontend_question_id": 123,
"is_new_question": false
},
@@ -70165,8 +70763,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": 1920707,
- "total_submitted": 2880474,
+ "total_acs": 1953884,
+ "total_submitted": 2922554,
"frontend_question_id": 122,
"is_new_question": false
},
@@ -70188,8 +70786,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": 4702249,
- "total_submitted": 8750582,
+ "total_acs": 4790006,
+ "total_submitted": 8901917,
"frontend_question_id": 121,
"is_new_question": false
},
@@ -70211,8 +70809,8 @@
"question__title": "Triangle",
"question__title_slug": "triangle",
"question__hide": false,
- "total_acs": 763062,
- "total_submitted": 1343768,
+ "total_acs": 776441,
+ "total_submitted": 1363144,
"frontend_question_id": 120,
"is_new_question": false
},
@@ -70234,8 +70832,8 @@
"question__title": "Pascal's Triangle II",
"question__title_slug": "pascals-triangle-ii",
"question__hide": false,
- "total_acs": 889553,
- "total_submitted": 1386977,
+ "total_acs": 897925,
+ "total_submitted": 1397826,
"frontend_question_id": 119,
"is_new_question": false
},
@@ -70257,8 +70855,8 @@
"question__title": "Pascal's Triangle",
"question__title_slug": "pascals-triangle",
"question__hide": false,
- "total_acs": 1680933,
- "total_submitted": 2256741,
+ "total_acs": 1705592,
+ "total_submitted": 2285044,
"frontend_question_id": 118,
"is_new_question": false
},
@@ -70280,8 +70878,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": 635595,
- "total_submitted": 1205647,
+ "total_acs": 640957,
+ "total_submitted": 1212478,
"frontend_question_id": 117,
"is_new_question": false
},
@@ -70303,8 +70901,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": 1049344,
- "total_submitted": 1668404,
+ "total_acs": 1057645,
+ "total_submitted": 1677638,
"frontend_question_id": 116,
"is_new_question": false
},
@@ -70326,8 +70924,8 @@
"question__title": "Distinct Subsequences",
"question__title_slug": "distinct-subsequences",
"question__hide": false,
- "total_acs": 402163,
- "total_submitted": 852328,
+ "total_acs": 411281,
+ "total_submitted": 867694,
"frontend_question_id": 115,
"is_new_question": false
},
@@ -70349,8 +70947,8 @@
"question__title": "Flatten Binary Tree to Linked List",
"question__title_slug": "flatten-binary-tree-to-linked-list",
"question__hide": false,
- "total_acs": 956630,
- "total_submitted": 1467934,
+ "total_acs": 969766,
+ "total_submitted": 1483177,
"frontend_question_id": 114,
"is_new_question": false
},
@@ -70372,8 +70970,8 @@
"question__title": "Path Sum II",
"question__title_slug": "path-sum-ii",
"question__hide": false,
- "total_acs": 862344,
- "total_submitted": 1471426,
+ "total_acs": 869504,
+ "total_submitted": 1481245,
"frontend_question_id": 113,
"is_new_question": false
},
@@ -70395,8 +70993,8 @@
"question__title": "Path Sum",
"question__title_slug": "path-sum",
"question__hide": false,
- "total_acs": 1466550,
- "total_submitted": 2899708,
+ "total_acs": 1484327,
+ "total_submitted": 2926986,
"frontend_question_id": 112,
"is_new_question": false
},
@@ -70418,8 +71016,8 @@
"question__title": "Minimum Depth of Binary Tree",
"question__title_slug": "minimum-depth-of-binary-tree",
"question__hide": false,
- "total_acs": 1209382,
- "total_submitted": 2509009,
+ "total_acs": 1221241,
+ "total_submitted": 2526126,
"frontend_question_id": 111,
"is_new_question": false
},
@@ -70441,8 +71039,8 @@
"question__title": "Balanced Binary Tree",
"question__title_slug": "balanced-binary-tree",
"question__hide": false,
- "total_acs": 1497669,
- "total_submitted": 2864038,
+ "total_acs": 1523112,
+ "total_submitted": 2901675,
"frontend_question_id": 110,
"is_new_question": false
},
@@ -70464,8 +71062,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": 529284,
- "total_submitted": 852579,
+ "total_acs": 532571,
+ "total_submitted": 856300,
"frontend_question_id": 109,
"is_new_question": false
},
@@ -70487,8 +71085,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": 1211685,
- "total_submitted": 1686461,
+ "total_acs": 1225081,
+ "total_submitted": 1702030,
"frontend_question_id": 108,
"is_new_question": false
},
@@ -70510,8 +71108,8 @@
"question__title": "Binary Tree Level Order Traversal II",
"question__title_slug": "binary-tree-level-order-traversal-ii",
"question__hide": false,
- "total_acs": 650158,
- "total_submitted": 1022544,
+ "total_acs": 654114,
+ "total_submitted": 1026791,
"frontend_question_id": 107,
"is_new_question": false
},
@@ -70533,8 +71131,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": 645095,
- "total_submitted": 1022309,
+ "total_acs": 654146,
+ "total_submitted": 1033060,
"frontend_question_id": 106,
"is_new_question": false
},
@@ -70556,8 +71154,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": 1239703,
- "total_submitted": 1933600,
+ "total_acs": 1258132,
+ "total_submitted": 1957655,
"frontend_question_id": 105,
"is_new_question": false
},
@@ -70579,8 +71177,8 @@
"question__title": "Maximum Depth of Binary Tree",
"question__title_slug": "maximum-depth-of-binary-tree",
"question__hide": false,
- "total_acs": 3118465,
- "total_submitted": 4131080,
+ "total_acs": 3167377,
+ "total_submitted": 4189401,
"frontend_question_id": 104,
"is_new_question": false
},
@@ -70602,8 +71200,8 @@
"question__title": "Binary Tree Zigzag Level Order Traversal",
"question__title_slug": "binary-tree-zigzag-level-order-traversal",
"question__hide": false,
- "total_acs": 1179439,
- "total_submitted": 1995223,
+ "total_acs": 1195972,
+ "total_submitted": 2017746,
"frontend_question_id": 103,
"is_new_question": false
},
@@ -70625,8 +71223,8 @@
"question__title": "Binary Tree Level Order Traversal",
"question__title_slug": "binary-tree-level-order-traversal",
"question__hide": false,
- "total_acs": 2254860,
- "total_submitted": 3343229,
+ "total_acs": 2285387,
+ "total_submitted": 3378949,
"frontend_question_id": 102,
"is_new_question": false
},
@@ -70648,8 +71246,8 @@
"question__title": "Symmetric Tree",
"question__title_slug": "symmetric-tree",
"question__hide": false,
- "total_acs": 2006492,
- "total_submitted": 3539703,
+ "total_acs": 2030514,
+ "total_submitted": 3572437,
"frontend_question_id": 101,
"is_new_question": false
},
@@ -70671,8 +71269,8 @@
"question__title": "Same Tree",
"question__title_slug": "same-tree",
"question__hide": false,
- "total_acs": 2180384,
- "total_submitted": 3498209,
+ "total_acs": 2215274,
+ "total_submitted": 3543758,
"frontend_question_id": 100,
"is_new_question": false
},
@@ -70694,8 +71292,8 @@
"question__title": "Recover Binary Search Tree",
"question__title_slug": "recover-binary-search-tree",
"question__hide": false,
- "total_acs": 456558,
- "total_submitted": 856381,
+ "total_acs": 461348,
+ "total_submitted": 862571,
"frontend_question_id": 99,
"is_new_question": false
},
@@ -70717,8 +71315,8 @@
"question__title": "Validate Binary Search Tree",
"question__title_slug": "validate-binary-search-tree",
"question__hide": false,
- "total_acs": 2356610,
- "total_submitted": 7136949,
+ "total_acs": 2384458,
+ "total_submitted": 7205903,
"frontend_question_id": 98,
"is_new_question": false
},
@@ -70740,8 +71338,8 @@
"question__title": "Interleaving String",
"question__title_slug": "interleaving-string",
"question__hide": false,
- "total_acs": 526323,
- "total_submitted": 1312825,
+ "total_acs": 532483,
+ "total_submitted": 1324949,
"frontend_question_id": 97,
"is_new_question": false
},
@@ -70763,8 +71361,8 @@
"question__title": "Unique Binary Search Trees",
"question__title_slug": "unique-binary-search-trees",
"question__hide": false,
- "total_acs": 662952,
- "total_submitted": 1084674,
+ "total_acs": 667824,
+ "total_submitted": 1091477,
"frontend_question_id": 96,
"is_new_question": false
},
@@ -70786,8 +71384,8 @@
"question__title": "Unique Binary Search Trees II",
"question__title_slug": "unique-binary-search-trees-ii",
"question__hide": false,
- "total_acs": 453642,
- "total_submitted": 783132,
+ "total_acs": 456573,
+ "total_submitted": 786350,
"frontend_question_id": 95,
"is_new_question": false
},
@@ -70809,8 +71407,8 @@
"question__title": "Binary Tree Inorder Traversal",
"question__title_slug": "binary-tree-inorder-traversal",
"question__hide": false,
- "total_acs": 2547128,
- "total_submitted": 3338939,
+ "total_acs": 2579638,
+ "total_submitted": 3375344,
"frontend_question_id": 94,
"is_new_question": false
},
@@ -70832,8 +71430,8 @@
"question__title": "Restore IP Addresses",
"question__title_slug": "restore-ip-addresses",
"question__hide": false,
- "total_acs": 461697,
- "total_submitted": 920326,
+ "total_acs": 465458,
+ "total_submitted": 924935,
"frontend_question_id": 93,
"is_new_question": false
},
@@ -70855,8 +71453,8 @@
"question__title": "Reverse Linked List II",
"question__title_slug": "reverse-linked-list-ii",
"question__hide": false,
- "total_acs": 873263,
- "total_submitted": 1827529,
+ "total_acs": 884181,
+ "total_submitted": 1847391,
"frontend_question_id": 92,
"is_new_question": false
},
@@ -70878,8 +71476,8 @@
"question__title": "Decode Ways",
"question__title_slug": "decode-ways",
"question__hide": false,
- "total_acs": 1259943,
- "total_submitted": 3600179,
+ "total_acs": 1269750,
+ "total_submitted": 3620202,
"frontend_question_id": 91,
"is_new_question": false
},
@@ -70901,8 +71499,8 @@
"question__title": "Subsets II",
"question__title_slug": "subsets-ii",
"question__hide": false,
- "total_acs": 930294,
- "total_submitted": 1619847,
+ "total_acs": 946983,
+ "total_submitted": 1645090,
"frontend_question_id": 90,
"is_new_question": false
},
@@ -70924,8 +71522,8 @@
"question__title": "Gray Code",
"question__title_slug": "gray-code",
"question__hide": false,
- "total_acs": 300195,
- "total_submitted": 505445,
+ "total_acs": 302536,
+ "total_submitted": 508319,
"frontend_question_id": 89,
"is_new_question": false
},
@@ -70947,8 +71545,8 @@
"question__title": "Merge Sorted Array",
"question__title_slug": "merge-sorted-array",
"question__hide": false,
- "total_acs": 3197873,
- "total_submitted": 6412484,
+ "total_acs": 3274817,
+ "total_submitted": 6541211,
"frontend_question_id": 88,
"is_new_question": false
},
@@ -70970,8 +71568,8 @@
"question__title": "Scramble String",
"question__title_slug": "scramble-string",
"question__hide": false,
- "total_acs": 230078,
- "total_submitted": 571772,
+ "total_acs": 231795,
+ "total_submitted": 574782,
"frontend_question_id": 87,
"is_new_question": false
},
@@ -70993,8 +71591,8 @@
"question__title": "Partition List",
"question__title_slug": "partition-list",
"question__hide": false,
- "total_acs": 627625,
- "total_submitted": 1111971,
+ "total_acs": 634564,
+ "total_submitted": 1121681,
"frontend_question_id": 86,
"is_new_question": false
},
@@ -71016,8 +71614,8 @@
"question__title": "Maximal Rectangle",
"question__title_slug": "maximal-rectangle",
"question__hide": false,
- "total_acs": 488977,
- "total_submitted": 965905,
+ "total_acs": 494849,
+ "total_submitted": 973938,
"frontend_question_id": 85,
"is_new_question": false
},
@@ -71039,8 +71637,8 @@
"question__title": "Largest Rectangle in Histogram",
"question__title_slug": "largest-rectangle-in-histogram",
"question__hide": false,
- "total_acs": 901194,
- "total_submitted": 2019524,
+ "total_acs": 916756,
+ "total_submitted": 2047697,
"frontend_question_id": 84,
"is_new_question": false
},
@@ -71062,8 +71660,8 @@
"question__title": "Remove Duplicates from Sorted List",
"question__title_slug": "remove-duplicates-from-sorted-list",
"question__hide": false,
- "total_acs": 1533466,
- "total_submitted": 2910881,
+ "total_acs": 1554560,
+ "total_submitted": 2944011,
"frontend_question_id": 83,
"is_new_question": false
},
@@ -71085,8 +71683,8 @@
"question__title": "Remove Duplicates from Sorted List II",
"question__title_slug": "remove-duplicates-from-sorted-list-ii",
"question__hide": false,
- "total_acs": 741719,
- "total_submitted": 1557362,
+ "total_acs": 750830,
+ "total_submitted": 1573046,
"frontend_question_id": 82,
"is_new_question": false
},
@@ -71108,8 +71706,8 @@
"question__title": "Search in Rotated Sorted Array II",
"question__title_slug": "search-in-rotated-sorted-array-ii",
"question__hide": false,
- "total_acs": 730842,
- "total_submitted": 1935158,
+ "total_acs": 745337,
+ "total_submitted": 1969610,
"frontend_question_id": 81,
"is_new_question": false
},
@@ -71131,8 +71729,8 @@
"question__title": "Remove Duplicates from Sorted Array II",
"question__title_slug": "remove-duplicates-from-sorted-array-ii",
"question__hide": false,
- "total_acs": 980444,
- "total_submitted": 1671866,
+ "total_acs": 1011232,
+ "total_submitted": 1715940,
"frontend_question_id": 80,
"is_new_question": false
},
@@ -71154,8 +71752,8 @@
"question__title": "Word Search",
"question__title_slug": "word-search",
"question__hide": false,
- "total_acs": 1691082,
- "total_submitted": 3938739,
+ "total_acs": 1709027,
+ "total_submitted": 3970665,
"frontend_question_id": 79,
"is_new_question": false
},
@@ -71177,8 +71775,8 @@
"question__title": "Subsets",
"question__title_slug": "subsets",
"question__hide": false,
- "total_acs": 1967693,
- "total_submitted": 2510103,
+ "total_acs": 1996271,
+ "total_submitted": 2541574,
"frontend_question_id": 78,
"is_new_question": false
},
@@ -71200,8 +71798,8 @@
"question__title": "Combinations",
"question__title_slug": "combinations",
"question__hide": false,
- "total_acs": 908958,
- "total_submitted": 1288039,
+ "total_acs": 920062,
+ "total_submitted": 1301274,
"frontend_question_id": 77,
"is_new_question": false
},
@@ -71223,8 +71821,8 @@
"question__title": "Minimum Window Substring",
"question__title_slug": "minimum-window-substring",
"question__hide": false,
- "total_acs": 1368812,
- "total_submitted": 3173951,
+ "total_acs": 1387383,
+ "total_submitted": 3209139,
"frontend_question_id": 76,
"is_new_question": false
},
@@ -71246,8 +71844,8 @@
"question__title": "Sort Colors",
"question__title_slug": "sort-colors",
"question__hide": false,
- "total_acs": 1960245,
- "total_submitted": 3132348,
+ "total_acs": 2151712,
+ "total_submitted": 3364392,
"frontend_question_id": 75,
"is_new_question": false
},
@@ -71269,8 +71867,8 @@
"question__title": "Search a 2D Matrix",
"question__title_slug": "search-a-2d-matrix",
"question__hide": false,
- "total_acs": 1797001,
- "total_submitted": 3575385,
+ "total_acs": 1831715,
+ "total_submitted": 3633324,
"frontend_question_id": 74,
"is_new_question": false
},
@@ -71292,8 +71890,8 @@
"question__title": "Set Matrix Zeroes",
"question__title_slug": "set-matrix-zeroes",
"question__hide": false,
- "total_acs": 1427358,
- "total_submitted": 2549978,
+ "total_acs": 1459157,
+ "total_submitted": 2594689,
"frontend_question_id": 73,
"is_new_question": false
},
@@ -71315,8 +71913,8 @@
"question__title": "Edit Distance",
"question__title_slug": "edit-distance",
"question__hide": false,
- "total_acs": 868552,
- "total_submitted": 1534505,
+ "total_acs": 884933,
+ "total_submitted": 1559237,
"frontend_question_id": 72,
"is_new_question": false
},
@@ -71338,8 +71936,8 @@
"question__title": "Simplify Path",
"question__title_slug": "simplify-path",
"question__hide": false,
- "total_acs": 768176,
- "total_submitted": 1794778,
+ "total_acs": 782013,
+ "total_submitted": 1816374,
"frontend_question_id": 71,
"is_new_question": false
},
@@ -71361,8 +71959,8 @@
"question__title": "Climbing Stairs",
"question__title_slug": "climbing-stairs",
"question__hide": false,
- "total_acs": 3285068,
- "total_submitted": 6206929,
+ "total_acs": 3336333,
+ "total_submitted": 6300420,
"frontend_question_id": 70,
"is_new_question": false
},
@@ -71384,8 +71982,8 @@
"question__title": "Sqrt(x)",
"question__title_slug": "sqrtx",
"question__hide": false,
- "total_acs": 1979317,
- "total_submitted": 5090952,
+ "total_acs": 2013954,
+ "total_submitted": 5167730,
"frontend_question_id": 69,
"is_new_question": false
},
@@ -71407,8 +72005,8 @@
"question__title": "Text Justification",
"question__title_slug": "text-justification",
"question__hide": false,
- "total_acs": 420268,
- "total_submitted": 960477,
+ "total_acs": 425992,
+ "total_submitted": 968416,
"frontend_question_id": 68,
"is_new_question": false
},
@@ -71430,8 +72028,8 @@
"question__title": "Add Binary",
"question__title_slug": "add-binary",
"question__hide": false,
- "total_acs": 1475942,
- "total_submitted": 2748163,
+ "total_acs": 1495491,
+ "total_submitted": 2778659,
"frontend_question_id": 67,
"is_new_question": false
},
@@ -71453,8 +72051,8 @@
"question__title": "Plus One",
"question__title_slug": "plus-one",
"question__hide": false,
- "total_acs": 2267949,
- "total_submitted": 4990791,
+ "total_acs": 2302862,
+ "total_submitted": 5053227,
"frontend_question_id": 66,
"is_new_question": false
},
@@ -71476,8 +72074,8 @@
"question__title": "Valid Number",
"question__title_slug": "valid-number",
"question__hide": false,
- "total_acs": 367970,
- "total_submitted": 1843871,
+ "total_acs": 371886,
+ "total_submitted": 1856246,
"frontend_question_id": 65,
"is_new_question": false
},
@@ -71499,8 +72097,8 @@
"question__title": "Minimum Path Sum",
"question__title_slug": "minimum-path-sum",
"question__hide": false,
- "total_acs": 1179286,
- "total_submitted": 1840615,
+ "total_acs": 1198299,
+ "total_submitted": 1865598,
"frontend_question_id": 64,
"is_new_question": false
},
@@ -71522,8 +72120,8 @@
"question__title": "Unique Paths II",
"question__title_slug": "unique-paths-ii",
"question__hide": false,
- "total_acs": 939954,
- "total_submitted": 2254737,
+ "total_acs": 955497,
+ "total_submitted": 2286222,
"frontend_question_id": 63,
"is_new_question": false
},
@@ -71545,8 +72143,8 @@
"question__title": "Unique Paths",
"question__title_slug": "unique-paths",
"question__hide": false,
- "total_acs": 1841182,
- "total_submitted": 2859649,
+ "total_acs": 1869329,
+ "total_submitted": 2900450,
"frontend_question_id": 62,
"is_new_question": false
},
@@ -71568,8 +72166,8 @@
"question__title": "Rotate List",
"question__title_slug": "rotate-list",
"question__hide": false,
- "total_acs": 969444,
- "total_submitted": 2556777,
+ "total_acs": 988938,
+ "total_submitted": 2597969,
"frontend_question_id": 61,
"is_new_question": false
},
@@ -71591,8 +72189,8 @@
"question__title": "Permutation Sequence",
"question__title_slug": "permutation-sequence",
"question__hide": false,
- "total_acs": 398470,
- "total_submitted": 843980,
+ "total_acs": 403864,
+ "total_submitted": 851717,
"frontend_question_id": 60,
"is_new_question": false
},
@@ -71614,8 +72212,8 @@
"question__title": "Spiral Matrix II",
"question__title_slug": "spiral-matrix-ii",
"question__hide": false,
- "total_acs": 577652,
- "total_submitted": 810539,
+ "total_acs": 582812,
+ "total_submitted": 816434,
"frontend_question_id": 59,
"is_new_question": false
},
@@ -71637,8 +72235,8 @@
"question__title": "Length of Last Word",
"question__title_slug": "length-of-last-word",
"question__hide": false,
- "total_acs": 2008389,
- "total_submitted": 3857296,
+ "total_acs": 2050915,
+ "total_submitted": 3917280,
"frontend_question_id": 58,
"is_new_question": false
},
@@ -71660,8 +72258,8 @@
"question__title": "Insert Interval",
"question__title_slug": "insert-interval",
"question__hide": false,
- "total_acs": 1122401,
- "total_submitted": 2696524,
+ "total_acs": 1139534,
+ "total_submitted": 2731015,
"frontend_question_id": 57,
"is_new_question": false
},
@@ -71683,8 +72281,8 @@
"question__title": "Merge Intervals",
"question__title_slug": "merge-intervals",
"question__hide": false,
- "total_acs": 2414060,
- "total_submitted": 5086163,
+ "total_acs": 2450824,
+ "total_submitted": 5152612,
"frontend_question_id": 56,
"is_new_question": false
},
@@ -71706,8 +72304,8 @@
"question__title": "Jump Game",
"question__title_slug": "jump-game",
"question__hide": false,
- "total_acs": 1922707,
- "total_submitted": 4990078,
+ "total_acs": 1959722,
+ "total_submitted": 5080373,
"frontend_question_id": 55,
"is_new_question": false
},
@@ -71729,8 +72327,8 @@
"question__title": "Spiral Matrix",
"question__title_slug": "spiral-matrix",
"question__hide": false,
- "total_acs": 1434238,
- "total_submitted": 2880909,
+ "total_acs": 1457824,
+ "total_submitted": 2914930,
"frontend_question_id": 54,
"is_new_question": false
},
@@ -71752,8 +72350,8 @@
"question__title": "Maximum Subarray",
"question__title_slug": "maximum-subarray",
"question__hide": false,
- "total_acs": 3923124,
- "total_submitted": 7715788,
+ "total_acs": 3977128,
+ "total_submitted": 7813424,
"frontend_question_id": 53,
"is_new_question": false
},
@@ -71775,8 +72373,8 @@
"question__title": "N-Queens II",
"question__title_slug": "n-queens-ii",
"question__hide": false,
- "total_acs": 391357,
- "total_submitted": 527750,
+ "total_acs": 396629,
+ "total_submitted": 533822,
"frontend_question_id": 52,
"is_new_question": false
},
@@ -71798,8 +72396,8 @@
"question__title": "N-Queens",
"question__title_slug": "n-queens",
"question__hide": false,
- "total_acs": 731286,
- "total_submitted": 1066917,
+ "total_acs": 745366,
+ "total_submitted": 1082852,
"frontend_question_id": 51,
"is_new_question": false
},
@@ -71821,8 +72419,8 @@
"question__title": "Pow(x, n)",
"question__title_slug": "powx-n",
"question__hide": false,
- "total_acs": 1674887,
- "total_submitted": 4794805,
+ "total_acs": 1703992,
+ "total_submitted": 4863970,
"frontend_question_id": 50,
"is_new_question": false
},
@@ -71844,8 +72442,8 @@
"question__title": "Group Anagrams",
"question__title_slug": "group-anagrams",
"question__hide": false,
- "total_acs": 2907929,
- "total_submitted": 4232505,
+ "total_acs": 2951322,
+ "total_submitted": 4287612,
"frontend_question_id": 49,
"is_new_question": false
},
@@ -71867,8 +72465,8 @@
"question__title": "Rotate Image",
"question__title_slug": "rotate-image",
"question__hide": false,
- "total_acs": 1727382,
- "total_submitted": 2315072,
+ "total_acs": 1759600,
+ "total_submitted": 2350952,
"frontend_question_id": 48,
"is_new_question": false
},
@@ -71890,8 +72488,8 @@
"question__title": "Permutations II",
"question__title_slug": "permutations-ii",
"question__hide": false,
- "total_acs": 934829,
- "total_submitted": 1573739,
+ "total_acs": 943893,
+ "total_submitted": 1585832,
"frontend_question_id": 47,
"is_new_question": false
},
@@ -71913,8 +72511,8 @@
"question__title": "Permutations",
"question__title_slug": "permutations",
"question__hide": false,
- "total_acs": 2090982,
- "total_submitted": 2663368,
+ "total_acs": 2118885,
+ "total_submitted": 2694214,
"frontend_question_id": 46,
"is_new_question": false
},
@@ -71936,8 +72534,8 @@
"question__title": "Jump Game II",
"question__title_slug": "jump-game-ii",
"question__hide": false,
- "total_acs": 1257129,
- "total_submitted": 3103813,
+ "total_acs": 1282063,
+ "total_submitted": 3162843,
"frontend_question_id": 45,
"is_new_question": false
},
@@ -71959,8 +72557,8 @@
"question__title": "Wildcard Matching",
"question__title_slug": "wildcard-matching",
"question__hide": false,
- "total_acs": 576328,
- "total_submitted": 2052037,
+ "total_acs": 584407,
+ "total_submitted": 2073465,
"frontend_question_id": 44,
"is_new_question": false
},
@@ -71982,8 +72580,8 @@
"question__title": "Multiply Strings",
"question__title_slug": "multiply-strings",
"question__hide": false,
- "total_acs": 803480,
- "total_submitted": 1981982,
+ "total_acs": 811601,
+ "total_submitted": 1997930,
"frontend_question_id": 43,
"is_new_question": false
},
@@ -72005,8 +72603,8 @@
"question__title": "Trapping Rain Water",
"question__title_slug": "trapping-rain-water",
"question__hide": false,
- "total_acs": 2132019,
- "total_submitted": 3429755,
+ "total_acs": 2165100,
+ "total_submitted": 3474258,
"frontend_question_id": 42,
"is_new_question": false
},
@@ -72028,8 +72626,8 @@
"question__title": "First Missing Positive",
"question__title_slug": "first-missing-positive",
"question__hide": false,
- "total_acs": 1220209,
- "total_submitted": 3082149,
+ "total_acs": 1232268,
+ "total_submitted": 3108727,
"frontend_question_id": 41,
"is_new_question": false
},
@@ -72051,8 +72649,8 @@
"question__title": "Combination Sum II",
"question__title_slug": "combination-sum-ii",
"question__hide": false,
- "total_acs": 984891,
- "total_submitted": 1801908,
+ "total_acs": 1002055,
+ "total_submitted": 1829378,
"frontend_question_id": 40,
"is_new_question": false
},
@@ -72074,8 +72672,8 @@
"question__title": "Combination Sum",
"question__title_slug": "combination-sum",
"question__hide": false,
- "total_acs": 1956328,
- "total_submitted": 2729108,
+ "total_acs": 1987196,
+ "total_submitted": 2764931,
"frontend_question_id": 39,
"is_new_question": false
},
@@ -72097,8 +72695,8 @@
"question__title": "Count and Say",
"question__title_slug": "count-and-say",
"question__hide": false,
- "total_acs": 933978,
- "total_submitted": 1688114,
+ "total_acs": 943776,
+ "total_submitted": 1700069,
"frontend_question_id": 38,
"is_new_question": false
},
@@ -72120,8 +72718,8 @@
"question__title": "Sudoku Solver",
"question__title_slug": "sudoku-solver",
"question__hide": false,
- "total_acs": 594807,
- "total_submitted": 968049,
+ "total_acs": 604632,
+ "total_submitted": 979926,
"frontend_question_id": 37,
"is_new_question": false
},
@@ -72143,8 +72741,8 @@
"question__title": "Valid Sudoku",
"question__title_slug": "valid-sudoku",
"question__hide": false,
- "total_acs": 1535743,
- "total_submitted": 2566934,
+ "total_acs": 1558615,
+ "total_submitted": 2599251,
"frontend_question_id": 36,
"is_new_question": false
},
@@ -72166,8 +72764,8 @@
"question__title": "Search Insert Position",
"question__title_slug": "search-insert-position",
"question__hide": false,
- "total_acs": 2910429,
- "total_submitted": 6306727,
+ "total_acs": 2960196,
+ "total_submitted": 6389254,
"frontend_question_id": 35,
"is_new_question": false
},
@@ -72189,8 +72787,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": 2058735,
- "total_submitted": 4632148,
+ "total_acs": 2091641,
+ "total_submitted": 4691164,
"frontend_question_id": 34,
"is_new_question": false
},
@@ -72212,8 +72810,8 @@
"question__title": "Search in Rotated Sorted Array",
"question__title_slug": "search-in-rotated-sorted-array",
"question__hide": false,
- "total_acs": 2766342,
- "total_submitted": 6768430,
+ "total_acs": 2811945,
+ "total_submitted": 6861110,
"frontend_question_id": 33,
"is_new_question": false
},
@@ -72235,8 +72833,8 @@
"question__title": "Longest Valid Parentheses",
"question__title_slug": "longest-valid-parentheses",
"question__hide": false,
- "total_acs": 745626,
- "total_submitted": 2174332,
+ "total_acs": 752911,
+ "total_submitted": 2191036,
"frontend_question_id": 32,
"is_new_question": false
},
@@ -72258,8 +72856,8 @@
"question__title": "Next Permutation",
"question__title_slug": "next-permutation",
"question__hide": false,
- "total_acs": 1363213,
- "total_submitted": 3397337,
+ "total_acs": 1386551,
+ "total_submitted": 3440603,
"frontend_question_id": 31,
"is_new_question": false
},
@@ -72281,8 +72879,8 @@
"question__title": "Substring with Concatenation of All Words",
"question__title_slug": "substring-with-concatenation-of-all-words",
"question__hide": false,
- "total_acs": 454905,
- "total_submitted": 1390501,
+ "total_acs": 460557,
+ "total_submitted": 1411139,
"frontend_question_id": 30,
"is_new_question": false
},
@@ -72304,8 +72902,8 @@
"question__title": "Divide Two Integers",
"question__title_slug": "divide-two-integers",
"question__hide": false,
- "total_acs": 750786,
- "total_submitted": 4283974,
+ "total_acs": 761133,
+ "total_submitted": 4329333,
"frontend_question_id": 29,
"is_new_question": false
},
@@ -72327,8 +72925,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": 2490467,
- "total_submitted": 5855188,
+ "total_acs": 2535482,
+ "total_submitted": 5939195,
"frontend_question_id": 28,
"is_new_question": false
},
@@ -72350,8 +72948,8 @@
"question__title": "Remove Element",
"question__title_slug": "remove-element",
"question__hide": false,
- "total_acs": 2951416,
- "total_submitted": 5173316,
+ "total_acs": 3021073,
+ "total_submitted": 5276905,
"frontend_question_id": 27,
"is_new_question": false
},
@@ -72373,8 +72971,8 @@
"question__title": "Remove Duplicates from Sorted Array",
"question__title_slug": "remove-duplicates-from-sorted-array",
"question__hide": false,
- "total_acs": 4407877,
- "total_submitted": 7864879,
+ "total_acs": 4505955,
+ "total_submitted": 7999419,
"frontend_question_id": 26,
"is_new_question": false
},
@@ -72396,8 +72994,8 @@
"question__title": "Reverse Nodes in k-Group",
"question__title_slug": "reverse-nodes-in-k-group",
"question__hide": false,
- "total_acs": 936811,
- "total_submitted": 1588025,
+ "total_acs": 953050,
+ "total_submitted": 1608628,
"frontend_question_id": 25,
"is_new_question": false
},
@@ -72419,8 +73017,8 @@
"question__title": "Swap Nodes in Pairs",
"question__title_slug": "swap-nodes-in-pairs",
"question__hide": false,
- "total_acs": 1375547,
- "total_submitted": 2131414,
+ "total_acs": 1388773,
+ "total_submitted": 2147551,
"frontend_question_id": 24,
"is_new_question": false
},
@@ -72442,8 +73040,8 @@
"question__title": "Merge k Sorted Lists",
"question__title_slug": "merge-k-sorted-lists",
"question__hide": false,
- "total_acs": 2011122,
- "total_submitted": 3791360,
+ "total_acs": 2034474,
+ "total_submitted": 3821703,
"frontend_question_id": 23,
"is_new_question": false
},
@@ -72465,8 +73063,8 @@
"question__title": "Generate Parentheses",
"question__title_slug": "generate-parentheses",
"question__hide": false,
- "total_acs": 1844173,
- "total_submitted": 2468080,
+ "total_acs": 1870466,
+ "total_submitted": 2498624,
"frontend_question_id": 22,
"is_new_question": false
},
@@ -72488,8 +73086,8 @@
"question__title": "Merge Two Sorted Lists",
"question__title_slug": "merge-two-sorted-lists",
"question__hide": false,
- "total_acs": 4206191,
- "total_submitted": 6526474,
+ "total_acs": 4264970,
+ "total_submitted": 6602179,
"frontend_question_id": 21,
"is_new_question": false
},
@@ -72511,8 +73109,8 @@
"question__title": "Valid Parentheses",
"question__title_slug": "valid-parentheses",
"question__hide": false,
- "total_acs": 4652520,
- "total_submitted": 11450881,
+ "total_acs": 4726392,
+ "total_submitted": 11615934,
"frontend_question_id": 20,
"is_new_question": false
},
@@ -72534,8 +73132,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": 2748298,
- "total_submitted": 6031404,
+ "total_acs": 2788408,
+ "total_submitted": 6092368,
"frontend_question_id": 19,
"is_new_question": false
},
@@ -72557,8 +73155,8 @@
"question__title": "4Sum",
"question__title_slug": "4sum",
"question__hide": false,
- "total_acs": 967675,
- "total_submitted": 2663767,
+ "total_acs": 983754,
+ "total_submitted": 2703175,
"frontend_question_id": 18,
"is_new_question": false
},
@@ -72580,8 +73178,8 @@
"question__title": "Letter Combinations of a Phone Number",
"question__title_slug": "letter-combinations-of-a-phone-number",
"question__hide": false,
- "total_acs": 2045837,
- "total_submitted": 3372465,
+ "total_acs": 2071945,
+ "total_submitted": 3405164,
"frontend_question_id": 17,
"is_new_question": false
},
@@ -72603,8 +73201,8 @@
"question__title": "3Sum Closest",
"question__title_slug": "3sum-closest",
"question__hide": false,
- "total_acs": 1231633,
- "total_submitted": 2686248,
+ "total_acs": 1242897,
+ "total_submitted": 2709279,
"frontend_question_id": 16,
"is_new_question": false
},
@@ -72626,8 +73224,8 @@
"question__title": "3Sum",
"question__title_slug": "3sum",
"question__hide": false,
- "total_acs": 3579981,
- "total_submitted": 10331746,
+ "total_acs": 3635947,
+ "total_submitted": 10457777,
"frontend_question_id": 15,
"is_new_question": false
},
@@ -72649,8 +73247,8 @@
"question__title": "Longest Common Prefix",
"question__title_slug": "longest-common-prefix",
"question__hide": false,
- "total_acs": 3370858,
- "total_submitted": 7846861,
+ "total_acs": 3430636,
+ "total_submitted": 7960081,
"frontend_question_id": 14,
"is_new_question": false
},
@@ -72672,8 +73270,8 @@
"question__title": "Roman to Integer",
"question__title_slug": "roman-to-integer",
"question__hide": false,
- "total_acs": 3677669,
- "total_submitted": 5983306,
+ "total_acs": 3737891,
+ "total_submitted": 6060904,
"frontend_question_id": 13,
"is_new_question": false
},
@@ -72695,8 +73293,8 @@
"question__title": "Integer to Roman",
"question__title_slug": "integer-to-roman",
"question__hide": false,
- "total_acs": 1325177,
- "total_submitted": 2038309,
+ "total_acs": 1345557,
+ "total_submitted": 2062681,
"frontend_question_id": 12,
"is_new_question": false
},
@@ -72718,8 +73316,8 @@
"question__title": "Container With Most Water",
"question__title_slug": "container-with-most-water",
"question__hide": false,
- "total_acs": 2996886,
- "total_submitted": 5408145,
+ "total_acs": 3050301,
+ "total_submitted": 5492504,
"frontend_question_id": 11,
"is_new_question": false
},
@@ -72741,8 +73339,8 @@
"question__title": "Regular Expression Matching",
"question__title_slug": "regular-expression-matching",
"question__hide": false,
- "total_acs": 966078,
- "total_submitted": 3426584,
+ "total_acs": 974729,
+ "total_submitted": 3454464,
"frontend_question_id": 10,
"is_new_question": false
},
@@ -72764,8 +73362,8 @@
"question__title": "Palindrome Number",
"question__title_slug": "palindrome-number",
"question__hide": false,
- "total_acs": 4689227,
- "total_submitted": 8288094,
+ "total_acs": 4781090,
+ "total_submitted": 8424803,
"frontend_question_id": 9,
"is_new_question": false
},
@@ -72787,8 +73385,8 @@
"question__title": "String to Integer (atoi)",
"question__title_slug": "string-to-integer-atoi",
"question__hide": false,
- "total_acs": 1551555,
- "total_submitted": 8937572,
+ "total_acs": 1574232,
+ "total_submitted": 9015410,
"frontend_question_id": 8,
"is_new_question": false
},
@@ -72810,8 +73408,8 @@
"question__title": "Reverse Integer",
"question__title_slug": "reverse-integer",
"question__hide": false,
- "total_acs": 3247969,
- "total_submitted": 11316982,
+ "total_acs": 3290781,
+ "total_submitted": 11436549,
"frontend_question_id": 7,
"is_new_question": false
},
@@ -72833,8 +73431,8 @@
"question__title": "Zigzag Conversion",
"question__title_slug": "zigzag-conversion",
"question__hide": false,
- "total_acs": 1351781,
- "total_submitted": 2803875,
+ "total_acs": 1372670,
+ "total_submitted": 2835631,
"frontend_question_id": 6,
"is_new_question": false
},
@@ -72856,8 +73454,8 @@
"question__title": "Longest Palindromic Substring",
"question__title_slug": "longest-palindromic-substring",
"question__hide": false,
- "total_acs": 3088688,
- "total_submitted": 9097643,
+ "total_acs": 3125014,
+ "total_submitted": 9184702,
"frontend_question_id": 5,
"is_new_question": false
},
@@ -72879,8 +73477,8 @@
"question__title": "Median of Two Sorted Arrays",
"question__title_slug": "median-of-two-sorted-arrays",
"question__hide": false,
- "total_acs": 2614351,
- "total_submitted": 6493333,
+ "total_acs": 2657570,
+ "total_submitted": 6565934,
"frontend_question_id": 4,
"is_new_question": false
},
@@ -72902,8 +73500,8 @@
"question__title": "Longest Substring Without Repeating Characters",
"question__title_slug": "longest-substring-without-repeating-characters",
"question__hide": false,
- "total_acs": 5838784,
- "total_submitted": 16738510,
+ "total_acs": 5919799,
+ "total_submitted": 16926181,
"frontend_question_id": 3,
"is_new_question": false
},
@@ -72925,8 +73523,8 @@
"question__title": "Add Two Numbers",
"question__title_slug": "add-two-numbers",
"question__hide": false,
- "total_acs": 4616093,
- "total_submitted": 10721764,
+ "total_acs": 4678748,
+ "total_submitted": 10820704,
"frontend_question_id": 2,
"is_new_question": false
},
@@ -72948,8 +73546,8 @@
"question__title": "Two Sum",
"question__title_slug": "two-sum",
"question__hide": false,
- "total_acs": 13353882,
- "total_submitted": 25315480,
+ "total_acs": 13560402,
+ "total_submitted": 25622406,
"frontend_question_id": 1,
"is_new_question": false
},
diff --git a/leetcode/originData/[no content]bitwise-or-of-adjacent-elements.json b/leetcode/originData/[no content]bitwise-or-of-adjacent-elements.json
new file mode 100644
index 00000000..8f6e84b9
--- /dev/null
+++ b/leetcode/originData/[no content]bitwise-or-of-adjacent-elements.json
@@ -0,0 +1,58 @@
+{
+ "data": {
+ "question": {
+ "questionId": "3472",
+ "questionFrontendId": "3173",
+ "boundTopicId": null,
+ "title": "Bitwise OR of Adjacent Elements",
+ "titleSlug": "bitwise-or-of-adjacent-elements",
+ "content": null,
+ "translatedTitle": null,
+ "translatedContent": null,
+ "isPaidOnly": true,
+ "difficulty": "Easy",
+ "likes": 7,
+ "dislikes": 1,
+ "isLiked": null,
+ "similarQuestions": "[{\"title\": \"Neighboring Bitwise XOR\", \"titleSlug\": \"neighboring-bitwise-xor\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
+ "exampleTestcases": "[1,3,7,15]\n[8,4,2]\n[5,4,9,11]",
+ "categoryTitle": "Algorithms",
+ "contributors": [],
+ "topicTags": [
+ {
+ "name": "Array",
+ "slug": "array",
+ "translatedName": null,
+ "__typename": "TopicTagNode"
+ },
+ {
+ "name": "Bit Manipulation",
+ "slug": "bit-manipulation",
+ "translatedName": null,
+ "__typename": "TopicTagNode"
+ }
+ ],
+ "companyTagStats": null,
+ "codeSnippets": null,
+ "stats": "{\"totalAccepted\": \"867\", \"totalSubmission\": \"908\", \"totalAcceptedRaw\": 867, \"totalSubmissionRaw\": 908, \"acRate\": \"95.5%\"}",
+ "hints": [
+ "Iterate over array and calculate each element of the resulting array using Compiled with Your code is compiled with level two optimization ( Most standard library headers are already included automatically for your convenience. Most standard library headers are already included automatically for your convenience. Includes Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself. For Map/TreeMap data structure, you may use sortedcontainers library. Note that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead. Compiled with Your code is compiled with level one optimization ( Most standard library headers are already included automatically for your convenience. For hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples: 1. Adding an item to a hash.\\r\\nMySQL 8.0<\\/code><\\/p>\"],\"mssql\":[\"MS SQL Server\",\"| operation."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "[1,3,7,15]",
+ "metaData": "{\n \"name\": \"orArray\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[]\"\n }\n ],\n \"return\": {\n \"type\": \"integer[]\"\n },\n \"manual\": false\n}",
+ "judgerAvailable": true,
+ "judgeType": "large",
+ "mysqlSchemas": [],
+ "enableRunCode": true,
+ "enableTestMode": false,
+ "enableDebugger": true,
+ "envInfo": "{\"cpp\": [\"C++\", \" clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.OpenJDK 21. Using compile arguments: --enable-preview --release 21Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.Python 2.7.12.gcc 11 using the gnu11 standard.-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.\\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
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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour code will be run directly without compiling
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/[no content]calculate-parking-fees-and-duration.json b/leetcode/originData/[no content]calculate-parking-fees-and-duration.json new file mode 100644 index 00000000..8a15842f --- /dev/null +++ b/leetcode/originData/[no content]calculate-parking-fees-and-duration.json @@ -0,0 +1,59 @@ +{ + "data": { + "question": { + "questionId": "3473", + "questionFrontendId": "3166", + "boundTopicId": null, + "title": "Calculate Parking Fees and Duration", + "titleSlug": "calculate-parking-fees-and-duration", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Medium", + "likes": 4, + "dislikes": 1, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "{\"headers\":{\"ParkingTransactions\":[\"lot_id\",\"car_id\",\"entry_time\",\"exit_time\",\"fee_paid\"]},\"rows\":{\"ParkingTransactions\":[[1,1001,\"2023-06-01 08:00:00\",\"2023-06-01 10:30:00\",5.00],[1,1001,\"2023-06-02 11:00:00\",\"2023-06-02 12:45:00\",3.00],[2,1001,\"2023-06-01 10:45:00\",\"2023-06-01 12:00:00\",6.00],[2,1002,\"2023-06-01 09:00:00\",\"2023-06-01 11:30:00\",4.00],[3,1001,\"2023-06-03 07:00:00\",\"2023-06-03 09:00:00\",4.00],[3,1002,\"2023-06-02 12:00:00\",\"2023-06-02 14:00:00\",2.00]]}}", + "categoryTitle": "Database", + "contributors": [], + "topicTags": [ + { + "name": "Database", + "slug": "database", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"377\", \"totalSubmission\": \"631\", \"totalAcceptedRaw\": 377, \"totalSubmissionRaw\": 631, \"acRate\": \"59.7%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "{\"headers\":{\"ParkingTransactions\":[\"lot_id\",\"car_id\",\"entry_time\",\"exit_time\",\"fee_paid\"]},\"rows\":{\"ParkingTransactions\":[[1,1001,\"2023-06-01 08:00:00\",\"2023-06-01 10:30:00\",5.00],[1,1001,\"2023-06-02 11:00:00\",\"2023-06-02 12:45:00\",3.00],[2,1001,\"2023-06-01 10:45:00\",\"2023-06-01 12:00:00\",6.00],[2,1002,\"2023-06-01 09:00:00\",\"2023-06-01 11:30:00\",4.00],[3,1001,\"2023-06-03 07:00:00\",\"2023-06-03 09:00:00\",4.00],[3,1002,\"2023-06-02 12:00:00\",\"2023-06-02 14:00:00\",2.00]]}}", + "metaData": "{\"mysql\": [\"CREATE TABLE If not exists ParkingTransactions (\\n lot_id INT,\\n car_id INT,\\n entry_time DATETIME,\\n exit_time DATETIME,\\n fee_paid DECIMAL(10, 2)\\n)\\n\"], \"mssql\": [\"CREATE TABLE ParkingTransactions (\\n lot_id INT,\\n car_id INT,\\n entry_time DATETIME,\\n exit_time DATETIME,\\n fee_paid DECIMAL(10, 2)\\n);\\n\"], \"oraclesql\": [\"CREATE TABLE ParkingTransactions (\\n lot_id NUMBER,\\n car_id NUMBER,\\n entry_time DATE,\\n exit_time DATE,\\n fee_paid NUMBER(10, 2)\\n)\\n\", \"ALTER SESSION SET nls_date_format='YYYY-MM-DD HH24:MI:SS'\"], \"database\": true, \"name\": \"calculate_fees_and_duration\", \"postgresql\": [\"CREATE TABLE IF NOT EXISTS ParkingTransactions (\\n lot_id INTEGER,\\n car_id INTEGER,\\n entry_time TIMESTAMP,\\n exit_time TIMESTAMP,\\n fee_paid NUMERIC(10, 2)\\n);\"], \"pythondata\": [\"ParkingTransactions = pd.DataFrame([], columns=['lot_id', 'car_id', 'entry_time', 'exit_time', 'fee_paid']).astype({\\n 'lot_id': 'Int64',\\n 'car_id': 'Int64',\\n 'entry_time': 'datetime64[ns]',\\n 'exit_time': 'datetime64[ns]',\\n 'fee_paid': 'float64'\\n})\"], \"database_schema\": {\"ParkingTransactions\": {\"lot_id\": \"INT\", \"car_id\": \"INT\", \"entry_time\": \"DATETIME\", \"exit_time\": \"DATETIME\", \"fee_paid\": \"DECIMAL(10, 2)\"}}}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [ + "CREATE TABLE If not exists ParkingTransactions (\n lot_id INT,\n car_id INT,\n entry_time DATETIME,\n exit_time DATETIME,\n fee_paid DECIMAL(10, 2)\n)\n", + "Truncate table ParkingTransactions", + "insert into ParkingTransactions (lot_id, car_id, entry_time, exit_time, fee_paid) values ('1', '1001', '2023-06-01 08:00:00', '2023-06-01 10:30:00', '5.0')", + "insert into ParkingTransactions (lot_id, car_id, entry_time, exit_time, fee_paid) values ('1', '1001', '2023-06-02 11:00:00', '2023-06-02 12:45:00', '3.0')", + "insert into ParkingTransactions (lot_id, car_id, entry_time, exit_time, fee_paid) values ('2', '1001', '2023-06-01 10:45:00', '2023-06-01 12:00:00', '6.0')", + "insert into ParkingTransactions (lot_id, car_id, entry_time, exit_time, fee_paid) values ('2', '1002', '2023-06-01 09:00:00', '2023-06-01 11:30:00', '4.0')", + "insert into ParkingTransactions (lot_id, car_id, entry_time, exit_time, fee_paid) values ('3', '1001', '2023-06-03 07:00:00', '2023-06-03 09:00:00', '4.0')", + "insert into ParkingTransactions (lot_id, car_id, entry_time, exit_time, fee_paid) values ('3', '1002', '2023-06-02 12:00:00', '2023-06-02 14:00:00', '2.0')" + ], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": false, + "envInfo": "{\"mysql\": [\"MySQL\", \"MySQL 8.0.
mssql server 2019.
Oracle Sql 11.2.
Python 3.10 with Pandas 2.0.2 and NumPy 1.25.0
\"], \"postgresql\": [\"PostgreSQL\", \"PostgreSQL 16
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/[no content]consecutive-available-seats-ii.json b/leetcode/originData/[no content]consecutive-available-seats-ii.json new file mode 100644 index 00000000..57197ba8 --- /dev/null +++ b/leetcode/originData/[no content]consecutive-available-seats-ii.json @@ -0,0 +1,58 @@ +{ + "data": { + "question": { + "questionId": "3448", + "questionFrontendId": "3140", + "boundTopicId": null, + "title": "Consecutive Available Seats II", + "titleSlug": "consecutive-available-seats-ii", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Medium", + "likes": 2, + "dislikes": 2, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "{\"headers\":{\"Cinema\":[\"seat_id\",\"free\"]},\"rows\":{\"Cinema\":[[1,1],[2,0],[3,1],[4,1],[5,1]]}}", + "categoryTitle": "Database", + "contributors": [], + "topicTags": [ + { + "name": "Database", + "slug": "database", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"513\", \"totalSubmission\": \"807\", \"totalAcceptedRaw\": 513, \"totalSubmissionRaw\": 807, \"acRate\": \"63.6%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "{\"headers\":{\"Cinema\":[\"seat_id\",\"free\"]},\"rows\":{\"Cinema\":[[1,1],[2,0],[3,1],[4,1],[5,1]]}}", + "metaData": "{\"mysql\": [\"CREATE TABLE if Not exists Cinema (\\n seat_id INT PRIMARY KEY AUTO_INCREMENT,\\n free BOOLEAN\\n)\\n\"], \"mssql\": [\"Create table Cinema (seat_id int primary key, free BIT)\\n\"], \"oraclesql\": [\"CREATE TABLE Cinema (\\n seat_id INT PRIMARY KEY,\\n free NUMBER(1,0)\\n)\\n\"], \"database\": true, \"name\": \"consecutive_available_seats\", \"postgresql\": [\"CREATE TABLE Cinema (\\n seat_id INT PRIMARY KEY,\\n free INT CHECK (free IN (0, 1))\\n);\"], \"pythondata\": [\"Cinema = pd.DataFrame({'seat_id': pd.Series(dtype='int'), 'free': pd.Series(dtype='bool')})\"], \"database_schema\": {\"Cinema\": {\"seat_id\": \"INT\", \"free\": \"BOOLEAN\"}}}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [ + "CREATE TABLE if Not exists Cinema (\n seat_id INT PRIMARY KEY AUTO_INCREMENT,\n free BOOLEAN\n)\n", + "Truncate table Cinema", + "insert into Cinema (seat_id, free) values ('1', '1')", + "insert into Cinema (seat_id, free) values ('2', '0')", + "insert into Cinema (seat_id, free) values ('3', '1')", + "insert into Cinema (seat_id, free) values ('4', '1')", + "insert into Cinema (seat_id, free) values ('5', '1')" + ], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": false, + "envInfo": "{\"mysql\": [\"MySQL\", \"MySQL 8.0.
mssql server 2019.
Oracle Sql 11.2.
Python 3.10 with Pandas 2.0.2 and NumPy 1.25.0
\"], \"postgresql\": [\"PostgreSQL\", \"PostgreSQL 16
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/[no content]find-cities-in-each-state.json b/leetcode/originData/[no content]find-cities-in-each-state.json new file mode 100644 index 00000000..ec2f8788 --- /dev/null +++ b/leetcode/originData/[no content]find-cities-in-each-state.json @@ -0,0 +1,55 @@ +{ + "data": { + "question": { + "questionId": "3505", + "questionFrontendId": "3198", + "boundTopicId": null, + "title": "Find Cities in Each State", + "titleSlug": "find-cities-in-each-state", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Easy", + "likes": 0, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "{\"headers\":{\"cities\":[\"state\",\"city\"]},\"rows\":{\"cities\":[[\"California\",\"Los Angeles\"],[\"California\",\"San Francisco\"],[\"California\",\"San Diego\"],[\"Texas\",\"Houston\"],[\"Texas\",\"Austin\"],[\"Texas\",\"Dallas\"],[\"New York\",\"New York City\"],[\"New York\",\"Buffalo\"],[\"New York\",\"Rochester\"]]}}", + "categoryTitle": "Database", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"58\", \"totalSubmission\": \"58\", \"totalAcceptedRaw\": 58, \"totalSubmissionRaw\": 58, \"acRate\": \"100.0%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "{\"headers\":{\"cities\":[\"state\",\"city\"]},\"rows\":{\"cities\":[[\"California\",\"Los Angeles\"],[\"California\",\"San Francisco\"],[\"California\",\"San Diego\"],[\"Texas\",\"Houston\"],[\"Texas\",\"Austin\"],[\"Texas\",\"Dallas\"],[\"New York\",\"New York City\"],[\"New York\",\"Buffalo\"],[\"New York\",\"Rochester\"]]}}", + "metaData": "{\"mysql\": [\"Create table if not exists cities( state varchar(100),city varchar(100))\"], \"mssql\": [\"Create table cities( state varchar(100),city varchar(100))\"], \"oraclesql\": [\"Create table cities( state varchar2(100),city varchar2(100))\"], \"database\": true, \"name\": \"find_cities\", \"postgresql\": [\"CREATE TABLE IF NOT EXISTS cities (\\n state VARCHAR(100),\\n city VARCHAR(100)\\n);\"], \"pythondata\": [\"cities = pd.DataFrame(columns=['state', 'city'])\"], \"database_schema\": {\"cities\": {\"state\": \"VARCHAR(100)\", \"city\": \"VARCHAR(100)\"}}}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [ + "Create table if not exists cities( state varchar(100),city varchar(100))", + "Truncate table cities", + "insert into cities (state, city) values ('California', 'Los Angeles')", + "insert into cities (state, city) values ('California', 'San Francisco')", + "insert into cities (state, city) values ('California', 'San Diego')", + "insert into cities (state, city) values ('Texas', 'Houston')", + "insert into cities (state, city) values ('Texas', 'Austin')", + "insert into cities (state, city) values ('Texas', 'Dallas')", + "insert into cities (state, city) values ('New York', 'New York City')", + "insert into cities (state, city) values ('New York', 'Buffalo')", + "insert into cities (state, city) values ('New York', 'Rochester')" + ], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": false, + "envInfo": "{\"mysql\": [\"MySQL\", \"MySQL 8.0.
mssql server 2019.
Oracle Sql 11.2.
Python 3.10 with Pandas 2.0.2 and NumPy 1.25.0
\"], \"postgresql\": [\"PostgreSQL\", \"PostgreSQL 16
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/[no content]find-the-level-of-tree-with-minimum-sum.json b/leetcode/originData/[no content]find-the-level-of-tree-with-minimum-sum.json new file mode 100644 index 00000000..aa673f30 --- /dev/null +++ b/leetcode/originData/[no content]find-the-level-of-tree-with-minimum-sum.json @@ -0,0 +1,71 @@ +{ + "data": { + "question": { + "questionId": "3467", + "questionFrontendId": "3157", + "boundTopicId": null, + "title": "Find the Level of Tree with Minimum Sum", + "titleSlug": "find-the-level-of-tree-with-minimum-sum", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Medium", + "likes": 8, + "dislikes": 2, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Kth Largest Sum in a Binary Tree\", \"titleSlug\": \"kth-largest-sum-in-a-binary-tree\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]", + "exampleTestcases": "[50,6,2,30,80,7]\n[36,17,10,null,null,24]\n[5,null,5,null,5]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "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": null, + "stats": "{\"totalAccepted\": \"676\", \"totalSubmission\": \"954\", \"totalAcceptedRaw\": 676, \"totalSubmissionRaw\": 954, \"acRate\": \"70.9%\"}", + "hints": [ + "Run a DFS on the tree and update an array sum where sum[i] is the sum for level i.", + "The answer is the first minimum element of sum." + ], + "solution": null, + "status": null, + "sampleTestCase": "[50,6,2,30,80,7]", + "metaData": "{\n \"name\": \"minimumLevel\",\n \"params\": [\n {\n \"name\": \"root\",\n \"type\": \"TreeNode\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": true, + "envInfo": "{\"cpp\": [\"C++\", \"Compiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour code will be run directly without compiling
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/[no content]find-top-scoring-students-ii.json b/leetcode/originData/[no content]find-top-scoring-students-ii.json new file mode 100644 index 00000000..ca8f8a0c --- /dev/null +++ b/leetcode/originData/[no content]find-top-scoring-students-ii.json @@ -0,0 +1,81 @@ +{ + "data": { + "question": { + "questionId": "3503", + "questionFrontendId": "3188", + "boundTopicId": null, + "title": "Find Top Scoring Students II", + "titleSlug": "find-top-scoring-students-ii", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Hard", + "likes": 4, + "dislikes": 2, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "{\"headers\":{\"students\":[\"student_id\",\"name\",\"major\"],\"courses\":[\"course_id\",\"name\",\"credits\",\"major\",\"mandatory\"],\"enrollments\":[\"student_id\",\"course_id\",\"semester\",\"grade\",\"GPA\"]},\"rows\":{\"students\":[[1,\"Alice\",\"Computer Science\"],[2,\"Bob\",\"Computer Science\"],[3,\"Charlie\",\"Mathematics\"],[4,\"David\",\"Mathematics\"]],\"courses\":[[101,\"Algorithms\",3,\"Computer Science\",\"Yes\"],[102,\"Data Structures\",3,\"Computer Science\",\"Yes\"],[103,\"Calculus\",4,\"Mathematics\",\"Yes\"],[104,\"Linear Algebra\",4,\"Mathematics\",\"Yes\"],[105,\"Machine Learning\",3,\"Computer Science\",\"No\"],[106,\"Probability\",3,\"Mathematics\",\"No\"],[107,\"Operating Systems\",3,\"Computer Science\",\"No\"],[108,\"Statistics\",3,\"Mathematics\",\"No\"]],\"enrollments\":[[1,101,\"Fall 2023\",\"A\",4.0],[1,102,\"Spring 2023\",\"A\",4.0],[1,105,\"Spring 2023\",\"A\",4.0],[1,107,\"Fall 2023\",\"B\",3.5],[2,101,\"Fall 2023\",\"A\",4.0],[2,102,\"Spring 2023\",\"B\",3.0],[3,103,\"Fall 2023\",\"A\",4.0],[3,104,\"Spring 2023\",\"A\",4.0],[3,106,\"Spring 2023\",\"A\",4.0],[3,108,\"Fall 2023\",\"B\",3.5],[4,103,\"Fall 2023\",\"B\",3.0],[4,104,\"Spring 2023\",\"B\",3.0]]}}", + "categoryTitle": "Database", + "contributors": [], + "topicTags": [ + { + "name": "Database", + "slug": "database", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"180\", \"totalSubmission\": \"327\", \"totalAcceptedRaw\": 180, \"totalSubmissionRaw\": 327, \"acRate\": \"55.0%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "{\"headers\":{\"students\":[\"student_id\",\"name\",\"major\"],\"courses\":[\"course_id\",\"name\",\"credits\",\"major\",\"mandatory\"],\"enrollments\":[\"student_id\",\"course_id\",\"semester\",\"grade\",\"GPA\"]},\"rows\":{\"students\":[[1,\"Alice\",\"Computer Science\"],[2,\"Bob\",\"Computer Science\"],[3,\"Charlie\",\"Mathematics\"],[4,\"David\",\"Mathematics\"]],\"courses\":[[101,\"Algorithms\",3,\"Computer Science\",\"Yes\"],[102,\"Data Structures\",3,\"Computer Science\",\"Yes\"],[103,\"Calculus\",4,\"Mathematics\",\"Yes\"],[104,\"Linear Algebra\",4,\"Mathematics\",\"Yes\"],[105,\"Machine Learning\",3,\"Computer Science\",\"No\"],[106,\"Probability\",3,\"Mathematics\",\"No\"],[107,\"Operating Systems\",3,\"Computer Science\",\"No\"],[108,\"Statistics\",3,\"Mathematics\",\"No\"]],\"enrollments\":[[1,101,\"Fall 2023\",\"A\",4.0],[1,102,\"Spring 2023\",\"A\",4.0],[1,105,\"Spring 2023\",\"A\",4.0],[1,107,\"Fall 2023\",\"B\",3.5],[2,101,\"Fall 2023\",\"A\",4.0],[2,102,\"Spring 2023\",\"B\",3.0],[3,103,\"Fall 2023\",\"A\",4.0],[3,104,\"Spring 2023\",\"A\",4.0],[3,106,\"Spring 2023\",\"A\",4.0],[3,108,\"Fall 2023\",\"B\",3.5],[4,103,\"Fall 2023\",\"B\",3.0],[4,104,\"Spring 2023\",\"B\",3.0]]}}", + "metaData": "{\"mysql\": [\"CREATE TABLE if not exists students (\\n student_id INT ,\\n name VARCHAR(255),\\n major VARCHAR(255)\\n)\", \"CREATE TABLE if not exists courses (\\n course_id INT ,\\n name VARCHAR(255),\\n credits INT,\\n major VARCHAR(255),\\n mandatory ENUM('yes', 'no') DEFAULT 'no'\\n)\", \"CREATE TABLE if not exists enrollments (\\n student_id INT,\\n course_id INT,\\n semester VARCHAR(255),\\n grade VARCHAR(10),\\nGPA decimal(3,2)\\n\\n);\"], \"mssql\": [\"CREATE TABLE students (\\n student_id INT ,\\n name VARCHAR(255),\\n major VARCHAR(255)\\n)\", \"CREATE TABLE courses (\\n course_id INT PRIMARY KEY,\\n name VARCHAR(255),\\n credits INT,\\n major VARCHAR(255),\\n mandatory VARCHAR(3) CHECK (mandatory IN ('yes', 'no')) DEFAULT 'no'\\n)\", \"CREATE TABLE enrollments (\\n student_id INT,\\n course_id INT,\\n semester VARCHAR(255),\\n grade VARCHAR(1),\\n GPA DECIMAL(3,2)\\n)\"], \"oraclesql\": [\"CREATE TABLE students (\\n student_id NUMBER ,\\n name VARCHAR2(255),\\n major VARCHAR2(255)\\n)\", \"CREATE TABLE courses (\\n course_id NUMBER ,\\n name VARCHAR2(255),\\n credits NUMBER,\\n major VARCHAR2(255),\\n mandatory VARCHAR2(3) CHECK (mandatory IN ('Yes', 'No')) \\n)\", \"CREATE TABLE enrollments (\\n student_id NUMBER,\\n course_id NUMBER,\\n semester VARCHAR2(255),\\n grade VARCHAR2(1),\\n GPA Number (3,2)\\n)\"], \"database\": true, \"name\": \"find_top_scoring_students\", \"pythondata\": [\"students = pd.DataFrame([], columns=['student_id', 'name', 'major']).astype({\\n 'student_id': 'Int64', # Nullable integer type for student_id\\n 'name': 'string', # String type for names\\n 'major': 'string' # String type for majors\\n})\", \"courses = pd.DataFrame([], columns=['course_id', 'name', 'credits', 'major', 'mandatory']).astype({'course_id': 'Int64', 'name': 'string', 'credits': 'Int64', 'major': 'string', 'mandatory': 'string'})\\n\\n # pd.CategoricalDtype(categories=['yes', 'no'])\\n\", \"enrollments = pd.DataFrame([], columns=['student_id', 'course_id', 'semester', 'grade', 'GPA']).astype({'student_id': 'Int64', 'course_id': 'Int64', 'semester': 'string', 'grade': 'string', 'GPA': 'float'})\\n\"], \"postgresql\": [\"CREATE TABLE IF NOT EXISTS students (\\n student_id SERIAL,\\n name VARCHAR(255),\\n major VARCHAR(255)\\n);\", \"CREATE TABLE courses (\\n course_id INTEGER, -- or SERIAL if you want auto-increment\\n name VARCHAR(255),\\n credits INTEGER, -- or NUMERIC if you need decimal places\\n major VARCHAR(255),\\n mandatory VARCHAR(3) CHECK (mandatory IN ('Yes', 'No'))\\n);\\n\", \"CREATE TABLE IF NOT EXISTS enrollments (\\n student_id INT,\\n course_id INT,\\n semester VARCHAR(255),\\n grade VARCHAR(10),\\n GPA NUMERIC(3,2)\\n);\\n\"], \"database_schema\": {\"students\": {\"student_id\": \"INT\", \"name\": \"VARCHAR(255)\", \"major\": \"VARCHAR(255)\"}, \"courses\": {\"course_id\": \"INT\", \"name\": \"VARCHAR(255)\", \"credits\": \"INT\", \"major\": \"VARCHAR(255)\", \"mandatory\": \"ENUM('yes', 'no')\"}, \"enrollments\": {\"student_id\": \"INT\", \"course_id\": \"INT\", \"semester\": \"VARCHAR(255)\", \"grade\": \"VARCHAR(10)\", \"GPA\": \"DECIMAL(3, 2)\"}}}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [ + "CREATE TABLE if not exists students (\n student_id INT ,\n name VARCHAR(255),\n major VARCHAR(255)\n)", + "CREATE TABLE if not exists courses (\n course_id INT ,\n name VARCHAR(255),\n credits INT,\n major VARCHAR(255),\n mandatory ENUM('yes', 'no') DEFAULT 'no'\n)", + "CREATE TABLE if not exists enrollments (\n student_id INT,\n course_id INT,\n semester VARCHAR(255),\n grade VARCHAR(10),\nGPA decimal(3,2)\n\n);", + "Truncate table students", + "insert into students (student_id, name, major) values ('1', 'Alice', 'Computer Science')", + "insert into students (student_id, name, major) values ('2', 'Bob', 'Computer Science')", + "insert into students (student_id, name, major) values ('3', 'Charlie', 'Mathematics')", + "insert into students (student_id, name, major) values ('4', 'David', 'Mathematics')", + "Truncate table courses", + "insert into courses (course_id, name, credits, major, mandatory) values ('101', 'Algorithms', '3', 'Computer Science', 'Yes')", + "insert into courses (course_id, name, credits, major, mandatory) values ('102', 'Data Structures', '3', 'Computer Science', 'Yes')", + "insert into courses (course_id, name, credits, major, mandatory) values ('103', 'Calculus', '4', 'Mathematics', 'Yes')", + "insert into courses (course_id, name, credits, major, mandatory) values ('104', 'Linear Algebra', '4', 'Mathematics', 'Yes')", + "insert into courses (course_id, name, credits, major, mandatory) values ('105', 'Machine Learning', '3', 'Computer Science', 'No')", + "insert into courses (course_id, name, credits, major, mandatory) values ('106', 'Probability', '3', 'Mathematics', 'No')", + "insert into courses (course_id, name, credits, major, mandatory) values ('107', 'Operating Systems', '3', 'Computer Science', 'No')", + "insert into courses (course_id, name, credits, major, mandatory) values ('108', 'Statistics', '3', 'Mathematics', 'No')", + "Truncate table enrollments", + "insert into enrollments (student_id, course_id, semester, grade, GPA) values ('1', '101', 'Fall 2023', 'A', '4.0')", + "insert into enrollments (student_id, course_id, semester, grade, GPA) values ('1', '102', 'Spring 2023', 'A', '4.0')", + "insert into enrollments (student_id, course_id, semester, grade, GPA) values ('1', '105', 'Spring 2023', 'A', '4.0')", + "insert into enrollments (student_id, course_id, semester, grade, GPA) values ('1', '107', 'Fall 2023', 'B', '3.5')", + "insert into enrollments (student_id, course_id, semester, grade, GPA) values ('2', '101', 'Fall 2023', 'A', '4.0')", + "insert into enrollments (student_id, course_id, semester, grade, GPA) values ('2', '102', 'Spring 2023', 'B', '3.0')", + "insert into enrollments (student_id, course_id, semester, grade, GPA) values ('3', '103', 'Fall 2023', 'A', '4.0')", + "insert into enrollments (student_id, course_id, semester, grade, GPA) values ('3', '104', 'Spring 2023', 'A', '4.0')", + "insert into enrollments (student_id, course_id, semester, grade, GPA) values ('3', '106', 'Spring 2023', 'A', '4.0')", + "insert into enrollments (student_id, course_id, semester, grade, GPA) values ('3', '108', 'Fall 2023', 'B', '3.5')", + "insert into enrollments (student_id, course_id, semester, grade, GPA) values ('4', '103', 'Fall 2023', 'B', '3.0')", + "insert into enrollments (student_id, course_id, semester, grade, GPA) values ('4', '104', 'Spring 2023', 'B', '3.0')" + ], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": false, + "envInfo": "{\"mysql\": [\"MySQL\", \"MySQL 8.0.
mssql server 2019.
Oracle Sql 11.2.
Python 3.10 with Pandas 2.0.2 and NumPy 1.25.0
\"], \"postgresql\": [\"PostgreSQL\", \"PostgreSQL 16
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/[no content]find-top-scoring-students.json b/leetcode/originData/[no content]find-top-scoring-students.json new file mode 100644 index 00000000..43e947b9 --- /dev/null +++ b/leetcode/originData/[no content]find-top-scoring-students.json @@ -0,0 +1,73 @@ +{ + "data": { + "question": { + "questionId": "3488", + "questionFrontendId": "3182", + "boundTopicId": null, + "title": "Find Top Scoring Students", + "titleSlug": "find-top-scoring-students", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Medium", + "likes": 4, + "dislikes": 2, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "{\"headers\":{\"students\":[\"student_id\",\"name\",\"major\"],\"courses\":[\"course_id\",\"name\",\"credits\",\"major\"],\"enrollments\":[\"student_id\",\"course_id\",\"semester\",\"grade\"]},\"rows\":{\"students\":[[1,\"Alice\",\"Computer Science\"],[2,\"Bob\",\"Computer Science\"],[3,\"Charlie\",\"Mathematics\"],[4,\"David\",\"Mathematics\"]],\"courses\":[[101,\"Algorithms\",3,\"Computer Science\"],[102,\"Data Structures\",3,\"Computer Science\"],[103,\"Calculus\",4,\"Mathematics\"],[104,\"Linear Algebra\",4,\"Mathematics\"]],\"enrollments\":[[1,101,\"Fall 2023\",\"A\"],[1,102,\"Fall 2023\",\"A\"],[2,101,\"Fall 2023\",\"B\"],[2,102,\"Fall 2023\",\"A\"],[3,103,\"Fall 2023\",\"A\"],[3,104,\"Fall 2023\",\"A\"],[4,103,\"Fall 2023\",\"A\"],[4,104,\"Fall 2023\",\"B\"]]}}", + "categoryTitle": "Database", + "contributors": [], + "topicTags": [ + { + "name": "Database", + "slug": "database", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"298\", \"totalSubmission\": \"531\", \"totalAcceptedRaw\": 298, \"totalSubmissionRaw\": 531, \"acRate\": \"56.1%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "{\"headers\":{\"students\":[\"student_id\",\"name\",\"major\"],\"courses\":[\"course_id\",\"name\",\"credits\",\"major\"],\"enrollments\":[\"student_id\",\"course_id\",\"semester\",\"grade\"]},\"rows\":{\"students\":[[1,\"Alice\",\"Computer Science\"],[2,\"Bob\",\"Computer Science\"],[3,\"Charlie\",\"Mathematics\"],[4,\"David\",\"Mathematics\"]],\"courses\":[[101,\"Algorithms\",3,\"Computer Science\"],[102,\"Data Structures\",3,\"Computer Science\"],[103,\"Calculus\",4,\"Mathematics\"],[104,\"Linear Algebra\",4,\"Mathematics\"]],\"enrollments\":[[1,101,\"Fall 2023\",\"A\"],[1,102,\"Fall 2023\",\"A\"],[2,101,\"Fall 2023\",\"B\"],[2,102,\"Fall 2023\",\"A\"],[3,103,\"Fall 2023\",\"A\"],[3,104,\"Fall 2023\",\"A\"],[4,103,\"Fall 2023\",\"A\"],[4,104,\"Fall 2023\",\"B\"]]}}", + "metaData": "{\"mysql\": [\"CREATE TABLE if not exists students (\\n student_id INT ,\\n name VARCHAR(255),\\n major VARCHAR(255)\\n)\", \"CREATE TABLE if not exists courses (\\n course_id INT ,\\n name VARCHAR(255),\\n credits INT,\\n major VARCHAR(255)\\n)\\n\", \"CREATE TABLE if not exists enrollments (\\n student_id INT,\\n course_id INT,\\n semester VARCHAR(255),\\n grade VARCHAR(10)\\n\\n);\"], \"mssql\": [\"CREATE TABLE students (\\n student_id INT ,\\n name VARCHAR(255),\\n major VARCHAR(255)\\n)\", \"CREATE TABLE courses (\\n course_id INT ,\\n name VARCHAR(255),\\n credits INT,\\n major VARCHAR(255)\\n)\\n\", \"CREATE TABLE enrollments (\\n student_id INT,\\n course_id INT,\\n semester VARCHAR(255),\\n grade VARCHAR(10)\\n\\n);\"], \"oraclesql\": [\"CREATE TABLE students (\\n student_id NUMBER ,\\n name VARCHAR2(255),\\n major VARCHAR2(255)\\n)\", \"CREATE TABLE courses (\\n course_id NUMBER,\\n name VARCHAR2(255),\\n credits NUMBER,\\n major VARCHAR2(255)\\n)\", \"CREATE TABLE enrollments (\\n student_id NUMBER,\\n course_id NUMBER,\\n semester VARCHAR2(255),\\n grade VARCHAR2(10) \\n \\n)\"], \"database\": true, \"name\": \"find_top_scoring_students\", \"pythondata\": [\"enrollments = pd.DataFrame([], columns=['student_id', 'course_id', 'semester', 'grade']).astype({\\n 'student_id': 'Int64', # Nullable integer type\\n 'course_id': 'Int64', # Nullable integer type\\n 'semester': 'object', # Object type for arbitrary strings\\n 'grade': 'object' # Object type for arbitrary strings\\n})\", \"students = pd.DataFrame([], columns=['student_id', 'name', 'major']).astype({\\n 'student_id': 'Int64', # Nullable integer type\\n 'name': 'object', # Object type for arbitrary strings, equivalent to VARCHAR\\n 'major': 'object' # Object type for arbitrary strings, equivalent to VARCHAR\\n})\", \"courses = pd.DataFrame([], columns=['course_id', 'name', 'credits', 'major']).astype({\\n 'course_id': 'Int64', # Nullable integer type\\n 'name': 'object', # Object type for arbitrary strings, equivalent to VARCHAR\\n 'credits': 'Int64', # Nullable integer type\\n 'major': 'object' # Object type for arbitrary strings, equivalent to VARCHAR\\n})\"], \"postgresql\": [\"CREATE TABLE IF NOT EXISTS students (\\n student_id INT,\\n name VARCHAR(255),\\n major VARCHAR(255)\\n);\\n\", \"CREATE TABLE IF NOT EXISTS courses (\\n course_id INT,\\n name VARCHAR(255),\\n credits INT,\\n major VARCHAR(255)\\n);\\n\", \"CREATE TABLE IF NOT EXISTS enrollments (\\n student_id INT,\\n course_id INT,\\n semester VARCHAR(255),\\n grade VARCHAR(10)\\n);\\n\"], \"database_schema\": {\"students\": {\"student_id\": \"INT\", \"name\": \"VARCHAR(255)\", \"major\": \"VARCHAR(255)\"}, \"courses\": {\"course_id\": \"INT\", \"name\": \"VARCHAR(255)\", \"credits\": \"INT\", \"major\": \"VARCHAR(255)\"}, \"enrollments\": {\"student_id\": \"INT\", \"course_id\": \"INT\", \"semester\": \"VARCHAR(255)\", \"grade\": \"VARCHAR(10)\"}}}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [ + "CREATE TABLE if not exists students (\n student_id INT ,\n name VARCHAR(255),\n major VARCHAR(255)\n)", + "CREATE TABLE if not exists courses (\n course_id INT ,\n name VARCHAR(255),\n credits INT,\n major VARCHAR(255)\n)\n", + "CREATE TABLE if not exists enrollments (\n student_id INT,\n course_id INT,\n semester VARCHAR(255),\n grade VARCHAR(10)\n\n);", + "Truncate table students", + "insert into students (student_id, name, major) values ('1', 'Alice', 'Computer Science')", + "insert into students (student_id, name, major) values ('2', 'Bob', 'Computer Science')", + "insert into students (student_id, name, major) values ('3', 'Charlie', 'Mathematics')", + "insert into students (student_id, name, major) values ('4', 'David', 'Mathematics')", + "Truncate table courses", + "insert into courses (course_id, name, credits, major) values ('101', 'Algorithms', '3', 'Computer Science')", + "insert into courses (course_id, name, credits, major) values ('102', 'Data Structures', '3', 'Computer Science')", + "insert into courses (course_id, name, credits, major) values ('103', 'Calculus', '4', 'Mathematics')", + "insert into courses (course_id, name, credits, major) values ('104', 'Linear Algebra', '4', 'Mathematics')", + "Truncate table enrollments", + "insert into enrollments (student_id, course_id, semester, grade) values ('1', '101', 'Fall 2023', 'A')", + "insert into enrollments (student_id, course_id, semester, grade) values ('1', '102', 'Fall 2023', 'A')", + "insert into enrollments (student_id, course_id, semester, grade) values ('2', '101', 'Fall 2023', 'B')", + "insert into enrollments (student_id, course_id, semester, grade) values ('2', '102', 'Fall 2023', 'A')", + "insert into enrollments (student_id, course_id, semester, grade) values ('3', '103', 'Fall 2023', 'A')", + "insert into enrollments (student_id, course_id, semester, grade) values ('3', '104', 'Fall 2023', 'A')", + "insert into enrollments (student_id, course_id, semester, grade) values ('4', '103', 'Fall 2023', 'A')", + "insert into enrollments (student_id, course_id, semester, grade) values ('4', '104', 'Fall 2023', 'B')" + ], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": false, + "envInfo": "{\"mysql\": [\"MySQL\", \"MySQL 8.0.
mssql server 2019.
Oracle Sql 11.2.
Python 3.10 with Pandas 2.0.2 and NumPy 1.25.0
\"], \"postgresql\": [\"PostgreSQL\", \"PostgreSQL 16
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/[no content]invalid-tweets-ii.json b/leetcode/originData/[no content]invalid-tweets-ii.json new file mode 100644 index 00000000..ceac67d9 --- /dev/null +++ b/leetcode/originData/[no content]invalid-tweets-ii.json @@ -0,0 +1,69 @@ +{ + "data": { + "question": { + "questionId": "3457", + "questionFrontendId": "3150", + "boundTopicId": null, + "title": "Invalid Tweets II", + "titleSlug": "invalid-tweets-ii", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Easy", + "likes": 4, + "dislikes": 1, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "{\"headers\": {\"Tweets\": [\"tweet_id\", \"content\"]}, \"rows\": {\"Tweets\": [[1, \"What an amazing meal @MaxPower @AlexJones @JohnDoe #Learning #Fitness #Love\"], [2, \"Learning something new every day @AnnaWilson #Learning #Foodie\"], [3, \"Never been happier about today's achievements @SaraJohnson @JohnDoe @AnnaWilson #Fashion\"], [4, \"Traveling, exploring, and living my best life @JaneSmith @JohnDoe @ChrisAnderson @AlexJones #WorkLife #Travel\"], [5, \"Work hard, play hard, and cherish every moment @AlexJones #Fashion #Foodie\"], [6, \"Never been happier about today's achievements @ChrisAnderson #Fashion #WorkLife\"], [7, \"So grateful for today's experiences @AnnaWilson @LisaTaylor @ChrisAnderson @MikeBrown #Fashion #HappyDay #WorkLife #Nature\"], [8, \"What an amazing meal @EmilyClark @AlexJones @MikeBrown #Fitness\"], [9, \"Learning something new every day @EmilyClark @AnnaWilson @MaxPower #Travel\"], [10, \"So grateful for today's experiences @ChrisAnderson #Nature\"], [11, \"So grateful for today's experiences @AlexJones #Art #WorkLife\"], [12, \"Learning something new every day @JaneSmith @MikeBrown #Travel\"], [13, \"What an amazing meal @EmilyClark @JohnDoe @LisaTaylor @MaxPower #Foodie #Fitness\"], [14, \"Work hard, play hard, and cherish every moment @LisaTaylor @SaraJohnson @MaxPower @ChrisAnderson #TechLife #Nature #Music\"], [15, \"What a beautiful day it is @EmilyClark @MaxPower @SaraJohnson #Fashion\"], [16, \"What a beautiful day it is @AnnaWilson @JaneSmith #Fashion #Love #TechLife\"]]}}", + "categoryTitle": "Database", + "contributors": [], + "topicTags": [ + { + "name": "Database", + "slug": "database", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"734\", \"totalSubmission\": \"800\", \"totalAcceptedRaw\": 734, \"totalSubmissionRaw\": 800, \"acRate\": \"91.8%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "{\"headers\": {\"Tweets\": [\"tweet_id\", \"content\"]}, \"rows\": {\"Tweets\": [[1, \"What an amazing meal @MaxPower @AlexJones @JohnDoe #Learning #Fitness #Love\"], [2, \"Learning something new every day @AnnaWilson #Learning #Foodie\"], [3, \"Never been happier about today's achievements @SaraJohnson @JohnDoe @AnnaWilson #Fashion\"], [4, \"Traveling, exploring, and living my best life @JaneSmith @JohnDoe @ChrisAnderson @AlexJones #WorkLife #Travel\"], [5, \"Work hard, play hard, and cherish every moment @AlexJones #Fashion #Foodie\"], [6, \"Never been happier about today's achievements @ChrisAnderson #Fashion #WorkLife\"], [7, \"So grateful for today's experiences @AnnaWilson @LisaTaylor @ChrisAnderson @MikeBrown #Fashion #HappyDay #WorkLife #Nature\"], [8, \"What an amazing meal @EmilyClark @AlexJones @MikeBrown #Fitness\"], [9, \"Learning something new every day @EmilyClark @AnnaWilson @MaxPower #Travel\"], [10, \"So grateful for today's experiences @ChrisAnderson #Nature\"], [11, \"So grateful for today's experiences @AlexJones #Art #WorkLife\"], [12, \"Learning something new every day @JaneSmith @MikeBrown #Travel\"], [13, \"What an amazing meal @EmilyClark @JohnDoe @LisaTaylor @MaxPower #Foodie #Fitness\"], [14, \"Work hard, play hard, and cherish every moment @LisaTaylor @SaraJohnson @MaxPower @ChrisAnderson #TechLife #Nature #Music\"], [15, \"What a beautiful day it is @EmilyClark @MaxPower @SaraJohnson #Fashion\"], [16, \"What a beautiful day it is @AnnaWilson @JaneSmith #Fashion #Love #TechLife\"]]}}", + "metaData": "{\"mysql\": [\"Create table If Not Exists Tweets(tweet_id int, content varchar(500))\"], \"mssql\": [\"Create table Tweets(tweet_id int, content varchar(500))\"], \"oraclesql\": [\"Create table Tweets(tweet_id int, content varchar(500))\"], \"database\": true, \"name\": \"find_invalid_tweets\", \"pythondata\": [\"Tweets = pd.DataFrame([], columns=['tweet_id', 'content']).astype({'tweet_id':'Int64', 'content':'object'})\"], \"postgresql\": [\"Create table If Not Exists Tweets(tweet_id int, content varchar(500))\"], \"database_schema\": {\"Tweets\": {\"tweet_id\": \"INT\", \"content\": \"VARCHAR(500)\"}}}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [ + "Create table If Not Exists Tweets(tweet_id int, content varchar(500))", + "Truncate table Tweets", + "insert into Tweets (tweet_id, content) values ('1', 'What an amazing meal @MaxPower @AlexJones @JohnDoe #Learning #Fitness #Love')", + "insert into Tweets (tweet_id, content) values ('2', 'Learning something new every day @AnnaWilson #Learning #Foodie')", + "insert into Tweets (tweet_id, content) values ('3', 'Never been happier about today's achievements @SaraJohnson @JohnDoe @AnnaWilson #Fashion')", + "insert into Tweets (tweet_id, content) values ('4', 'Traveling, exploring, and living my best life @JaneSmith @JohnDoe @ChrisAnderson @AlexJones #WorkLife #Travel')", + "insert into Tweets (tweet_id, content) values ('5', 'Work hard, play hard, and cherish every moment @AlexJones #Fashion #Foodie')", + "insert into Tweets (tweet_id, content) values ('6', 'Never been happier about today's achievements @ChrisAnderson #Fashion #WorkLife')", + "insert into Tweets (tweet_id, content) values ('7', 'So grateful for today's experiences @AnnaWilson @LisaTaylor @ChrisAnderson @MikeBrown #Fashion #HappyDay #WorkLife #Nature')", + "insert into Tweets (tweet_id, content) values ('8', 'What an amazing meal @EmilyClark @AlexJones @MikeBrown #Fitness')", + "insert into Tweets (tweet_id, content) values ('9', 'Learning something new every day @EmilyClark @AnnaWilson @MaxPower #Travel')", + "insert into Tweets (tweet_id, content) values ('10', 'So grateful for today's experiences @ChrisAnderson #Nature')", + "insert into Tweets (tweet_id, content) values ('11', 'So grateful for today's experiences @AlexJones #Art #WorkLife')", + "insert into Tweets (tweet_id, content) values ('12', 'Learning something new every day @JaneSmith @MikeBrown #Travel')", + "insert into Tweets (tweet_id, content) values ('13', 'What an amazing meal @EmilyClark @JohnDoe @LisaTaylor @MaxPower #Foodie #Fitness')", + "insert into Tweets (tweet_id, content) values ('14', 'Work hard, play hard, and cherish every moment @LisaTaylor @SaraJohnson @MaxPower @ChrisAnderson #TechLife #Nature #Music')", + "insert into Tweets (tweet_id, content) values ('15', 'What a beautiful day it is @EmilyClark @MaxPower @SaraJohnson #Fashion')", + "insert into Tweets (tweet_id, content) values ('16', 'What a beautiful day it is @AnnaWilson @JaneSmith #Fashion #Love #TechLife')" + ], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": false, + "envInfo": "{\"mysql\": [\"MySQL\", \"MySQL 8.0.
mssql server 2019.
Oracle Sql 11.2.
Python 3.10 with Pandas 2.0.2 and NumPy 1.25.0
\"], \"postgresql\": [\"PostgreSQL\", \"PostgreSQL 16
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/[no content]maximum-number-of-upgradable-servers.json b/leetcode/originData/[no content]maximum-number-of-upgradable-servers.json new file mode 100644 index 00000000..1c33d788 --- /dev/null +++ b/leetcode/originData/[no content]maximum-number-of-upgradable-servers.json @@ -0,0 +1,64 @@ +{ + "data": { + "question": { + "questionId": "3458", + "questionFrontendId": "3155", + "boundTopicId": null, + "title": "Maximum Number of Upgradable Servers", + "titleSlug": "maximum-number-of-upgradable-servers", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Medium", + "likes": 6, + "dislikes": 2, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "[4,3]\n[3,5]\n[4,2]\n[8,9]\n[1]\n[2]\n[1]\n[1]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Math", + "slug": "math", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Binary Search", + "slug": "binary-search", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"496\", \"totalSubmission\": \"920\", \"totalAcceptedRaw\": 496, \"totalSubmissionRaw\": 920, \"acRate\": \"53.9%\"}", + "hints": [ + "Use binary search to find the maximum number of servers that can be upgraded for each data center separately." + ], + "solution": null, + "status": null, + "sampleTestCase": "[4,3]\n[3,5]\n[4,2]\n[8,9]", + "metaData": "{\n \"name\": \"maxUpgrades\",\n \"params\": [\n {\n \"name\": \"count\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer[]\",\n \"name\": \"upgrade\"\n },\n {\n \"type\": \"integer[]\",\n \"name\": \"sell\"\n },\n {\n \"type\": \"integer[]\",\n \"name\": \"money\"\n }\n ],\n \"return\": {\n \"type\": \"integer[]\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": true, + "envInfo": "{\"cpp\": [\"C++\", \"Compiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour code will be run directly without compiling
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/[no content]minimum-moves-to-get-a-peaceful-board.json b/leetcode/originData/[no content]minimum-moves-to-get-a-peaceful-board.json new file mode 100644 index 00000000..4b78baee --- /dev/null +++ b/leetcode/originData/[no content]minimum-moves-to-get-a-peaceful-board.json @@ -0,0 +1,74 @@ +{ + "data": { + "question": { + "questionId": "3504", + "questionFrontendId": "3189", + "boundTopicId": null, + "title": "Minimum Moves to Get a Peaceful Board", + "titleSlug": "minimum-moves-to-get-a-peaceful-board", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Medium", + "likes": 11, + "dislikes": 3, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Transform to Chessboard\", \"titleSlug\": \"transform-to-chessboard\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Most Stones Removed with Same Row or Column\", \"titleSlug\": \"most-stones-removed-with-same-row-or-column\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]", + "exampleTestcases": "[[0,0],[1,0],[1,1]]\n[[0,0],[0,1],[0,2],[0,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" + }, + { + "name": "Counting Sort", + "slug": "counting-sort", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"297\", \"totalSubmission\": \"390\", \"totalAcceptedRaw\": 297, \"totalSubmissionRaw\": 390, \"acRate\": \"76.2%\"}", + "hints": [ + "Think of a greedy method.", + "First, distribute the rooks in individual rows.", + "You can do this by sorting all rooks by their rows. Then assign the first one to the first row, the second one to the second row, and so on.", + "After you've distributed rooks across all rows, now do the same for columns.", + "Sort rooks by their columns and then assign the first one to the first column and so on." + ], + "solution": null, + "status": null, + "sampleTestCase": "[[0,0],[1,0],[1,1]]", + "metaData": "{\n \"name\": \"minMoves\",\n \"params\": [\n {\n \"name\": \"rooks\",\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 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour code will be run directly without compiling
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/[no content]the-number-of-ways-to-make-the-sum.json b/leetcode/originData/[no content]the-number-of-ways-to-make-the-sum.json new file mode 100644 index 00000000..630e06dc --- /dev/null +++ b/leetcode/originData/[no content]the-number-of-ways-to-make-the-sum.json @@ -0,0 +1,61 @@ +{ + "data": { + "question": { + "questionId": "3489", + "questionFrontendId": "3183", + "boundTopicId": null, + "title": "The Number of Ways to Make the Sum", + "titleSlug": "the-number-of-ways-to-make-the-sum", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Medium", + "likes": 8, + "dislikes": 1, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Combination Sum\", \"titleSlug\": \"combination-sum\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Climbing Stairs\", \"titleSlug\": \"climbing-stairs\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Coin Change II\", \"titleSlug\": \"coin-change-ii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]", + "exampleTestcases": "4\n12\n5", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Dynamic Programming", + "slug": "dynamic-programming", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"550\", \"totalSubmission\": \"876\", \"totalAcceptedRaw\": 550, \"totalSubmissionRaw\": 876, \"acRate\": \"62.8%\"}", + "hints": [ + "Consider using dynamic programming.", + "Definedp[i][x] as the number of ways to make the sum x using only the first i coins; and define coin[i] as the value of coin i.",
+ "We can calculate dp[i][x] as the sum of dp[i - 1][x] and dp[i][x - coin[i]].",
+ "Remember that 4 can at most be multiplied twice, so we calculate the dp for our infinite coins and then manually handle the existence of 4."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "4",
+ "metaData": "{\n \"name\": \"numberOfWays\",\n \"params\": [\n {\n \"name\": \"n\",\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 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour code will be run directly without compiling
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/check-if-grid-satisfies-conditions.json b/leetcode/originData/check-if-grid-satisfies-conditions.json new file mode 100644 index 00000000..de6a013e --- /dev/null +++ b/leetcode/originData/check-if-grid-satisfies-conditions.json @@ -0,0 +1,174 @@ +{ + "data": { + "question": { + "questionId": "3415", + "questionFrontendId": "3142", + "boundTopicId": null, + "title": "Check if Grid Satisfies Conditions", + "titleSlug": "check-if-grid-satisfies-conditions", + "content": "You are given a 2D matrix grid of size m x n. You need to check if each cell grid[i][j] is:
grid[i][j] == grid[i + 1][j] (if it exists).grid[i][j] != grid[i][j + 1] (if it exists).Return true if all the cells satisfy these conditions, otherwise, return false.
\n
Example 1:
\n\nInput: grid = [[1,0,2],[1,0,2]]
\n\nOutput: true
\n\nExplanation:
\n\n
All the cells in the grid satisfy the conditions.
\nExample 2:
\n\nInput: grid = [[1,1,1],[0,0,0]]
\n\nOutput: false
\n\nExplanation:
\n\n![\"\"](\"https://assets.leetcode.com/uploads/2024/03/27/example21.png\")
All cells in the first row are equal.
\nExample 3:
\n\nInput: grid = [[1],[2],[3]]
\n\nOutput: false
\n\nExplanation:
\n\n![\"\"](\"https://assets.leetcode.com/uploads/2024/03/31/changed.png\")
Cells in the first column have different values.
\n\n
Constraints:
\n\n1 <= n, m <= 100 <= grid[i][j] <= 9Compiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour 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/clear-digits.json b/leetcode/originData/clear-digits.json new file mode 100644 index 00000000..7f077ec4 --- /dev/null +++ b/leetcode/originData/clear-digits.json @@ -0,0 +1,180 @@ +{ + "data": { + "question": { + "questionId": "3447", + "questionFrontendId": "3174", + "boundTopicId": null, + "title": "Clear Digits", + "titleSlug": "clear-digits", + "content": "You are given a string s.
Your task is to remove all digits by doing this operation repeatedly:
\n\nReturn the resulting string after removing all digits.
\n\n\n
Example 1:
\n\nInput: s = "abc"
\n\nOutput: "abc"
\n\nExplanation:
\n\nThere is no digit in the string.
\nExample 2:
\n\nInput: s = "cb34"
\n\nOutput: ""
\n\nExplanation:
\n\nFirst, we apply the operation on s[2], and s becomes "c4".
Then we apply the operation on s[1], and s becomes "".
\n
Constraints:
\n\n1 <= s.length <= 100s consists only of lowercase English letters and digits.s from left to right, if s[i] is a digit, mark the nearest unmarked non-digit index to its left.",
+ "Delete all digits and all marked characters."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "\"abc\"",
+ "metaData": "{\n \"name\": \"clearDigits\",\n \"params\": [\n {\n \"name\": \"s\",\n \"type\": \"string\"\n }\n ],\n \"return\": {\n \"type\": \"string\"\n }\n}",
+ "judgerAvailable": true,
+ "judgeType": "large",
+ "mysqlSchemas": [],
+ "enableRunCode": true,
+ "enableTestMode": false,
+ "enableDebugger": true,
+ "envInfo": "{\"cpp\": [\"C++\", \"Compiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour code will be run directly without compiling
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/count-pairs-that-form-a-complete-day-i.json b/leetcode/originData/count-pairs-that-form-a-complete-day-i.json new file mode 100644 index 00000000..1cf392b8 --- /dev/null +++ b/leetcode/originData/count-pairs-that-form-a-complete-day-i.json @@ -0,0 +1,179 @@ +{ + "data": { + "question": { + "questionId": "3421", + "questionFrontendId": "3184", + "boundTopicId": null, + "title": "Count Pairs That Form a Complete Day I", + "titleSlug": "count-pairs-that-form-a-complete-day-i", + "content": "Given an integer array hours representing times in hours, return an integer denoting the number of pairs i, j where i < j and hours[i] + hours[j] forms a complete day.
A complete day is defined as a time duration that is an exact multiple of 24 hours.
\n\nFor example, 1 day is 24 hours, 2 days is 48 hours, 3 days is 72 hours, and so on.
\n\n\n
Example 1:
\n\nInput: hours = [12,12,30,24,24]
\n\nOutput: 2
\n\nExplanation:
\n\nThe pairs of indices that form a complete day are (0, 1) and (3, 4).
Example 2:
\n\nInput: hours = [72,48,24,3]
\n\nOutput: 3
\n\nExplanation:
\n\nThe pairs of indices that form a complete day are (0, 1), (0, 2), and (1, 2).
\n
Constraints:
\n\n1 <= hours.length <= 1001 <= hours[i] <= 109(i, j) and check if they form a valid complete day. It is considered a complete day if (hours[i] + hours[j]) % 24 == 0."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "[12,12,30,24,24]",
+ "metaData": "{\n \"name\": \"countCompleteDayPairs\",\n \"params\": [\n {\n \"name\": \"hours\",\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 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour code will be run directly without compiling
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/count-pairs-that-form-a-complete-day-ii.json b/leetcode/originData/count-pairs-that-form-a-complete-day-ii.json new file mode 100644 index 00000000..10548bcd --- /dev/null +++ b/leetcode/originData/count-pairs-that-form-a-complete-day-ii.json @@ -0,0 +1,180 @@ +{ + "data": { + "question": { + "questionId": "3418", + "questionFrontendId": "3185", + "boundTopicId": null, + "title": "Count Pairs That Form a Complete Day II", + "titleSlug": "count-pairs-that-form-a-complete-day-ii", + "content": "Given an integer array hours representing times in hours, return an integer denoting the number of pairs i, j where i < j and hours[i] + hours[j] forms a complete day.
A complete day is defined as a time duration that is an exact multiple of 24 hours.
\n\nFor example, 1 day is 24 hours, 2 days is 48 hours, 3 days is 72 hours, and so on.
\n\n\n
Example 1:
\n\nInput: hours = [12,12,30,24,24]
\n\nOutput: 2
\n\nExplanation: The pairs of indices that form a complete day are (0, 1) and (3, 4).
Example 2:
\n\nInput: hours = [72,48,24,3]
\n\nOutput: 3
\n\nExplanation: The pairs of indices that form a complete day are (0, 1), (0, 2), and (1, 2).
\n
Constraints:
\n\n1 <= hours.length <= 5 * 1051 <= hours[i] <= 109(i, j) forms a valid complete day if (hours[i] + hours[j]) % 24 == 0.",
+ "Using an array or a map, for each index j moving from left to right, increase the answer by the count of (24 - hours[j]) % 24, and then increase the count of hours[j]."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "[12,12,30,24,24]",
+ "metaData": "{\n \"name\": \"countCompleteDayPairs\",\n \"params\": [\n {\n \"name\": \"hours\",\n \"type\": \"integer[]\"\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 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour code will be run directly without compiling
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/count-the-number-of-inversions.json b/leetcode/originData/count-the-number-of-inversions.json new file mode 100644 index 00000000..11ebad04 --- /dev/null +++ b/leetcode/originData/count-the-number-of-inversions.json @@ -0,0 +1,175 @@ +{ + "data": { + "question": { + "questionId": "3460", + "questionFrontendId": "3193", + "boundTopicId": null, + "title": "Count the Number of Inversions", + "titleSlug": "count-the-number-of-inversions", + "content": "You are given an integer n and a 2D array requirements, where requirements[i] = [endi, cnti] represents the end index and the inversion count of each requirement.
A pair of indices (i, j) from an integer array nums is called an inversion if:
i < j and nums[i] > nums[j]Return the number of permutations perm of [0, 1, 2, ..., n - 1] such that for all requirements[i], perm[0..endi] has exactly cnti inversions.
Since the answer may be very large, return it modulo 109 + 7.
\n
Example 1:
\n\nInput: n = 3, requirements = [[2,2],[0,0]]
\n\nOutput: 2
\n\nExplanation:
\n\nThe two permutations are:
\n\n[2, 0, 1]\n\n\t[2, 0, 1] has inversions (0, 1) and (0, 2).[2] has 0 inversions.[1, 2, 0]\n\t[1, 2, 0] has inversions (0, 2) and (1, 2).[1] has 0 inversions.Example 2:
\n\nInput: n = 3, requirements = [[2,2],[1,1],[0,0]]
\n\nOutput: 1
\n\nExplanation:
\n\nThe only satisfying permutation is [2, 0, 1]:
[2, 0, 1] has inversions (0, 1) and (0, 2).[2, 0] has an inversion (0, 1).[2] has 0 inversions.Example 3:
\n\nInput: n = 2, requirements = [[0,0],[1,0]]
\n\nOutput: 1
\n\nExplanation:
\n\nThe only satisfying permutation is [0, 1]:
[0] has 0 inversions.[0, 1] has an inversion (0, 1).\n
Constraints:
\n\n2 <= n <= 3001 <= requirements.length <= nrequirements[i] = [endi, cnti]0 <= endi <= n - 10 <= cnti <= 400i such that endi == n - 1.endi are unique.dp[i][j] denote the number of arrays of length i with j inversions.",
+ "dp[i][j] = dp[i - 1][j] + dp[i - 1][j - 1] + … + dp[i - 1][0].",
+ "dp[i][j] = 0 if for some x, requirements[x][0] == i and requirements[x][1] != j."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "3\n[[2,2],[0,0]]",
+ "metaData": "{\n \"name\": \"numberOfPermutations\",\n \"params\": [\n {\n \"name\": \"n\",\n \"type\": \"integer\"\n },\n {\n \"type\": \"integer[][]\",\n \"name\": \"requirements\"\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 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour code will be run directly without compiling
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/find-minimum-operations-to-make-all-elements-divisible-by-three.json b/leetcode/originData/find-minimum-operations-to-make-all-elements-divisible-by-three.json new file mode 100644 index 00000000..7f6682d8 --- /dev/null +++ b/leetcode/originData/find-minimum-operations-to-make-all-elements-divisible-by-three.json @@ -0,0 +1,174 @@ +{ + "data": { + "question": { + "questionId": "3476", + "questionFrontendId": "3190", + "boundTopicId": null, + "title": "Find Minimum Operations to Make All Elements Divisible by Three", + "titleSlug": "find-minimum-operations-to-make-all-elements-divisible-by-three", + "content": "You are given an integer array nums. In one operation, you can add or subtract 1 from any element of nums.
Return the minimum number of operations to make all elements of nums divisible by 3.
\n
Example 1:
\n\nInput: nums = [1,2,3,4]
\n\nOutput: 3
\n\nExplanation:
\n\nAll array elements can be made divisible by 3 using 3 operations:
\n\nExample 2:
\n\nInput: nums = [3,6,9]
\n\nOutput: 0
\n\n
Constraints:
\n\n1 <= nums.length <= 501 <= nums[i] <= 50x % 3 != 0 we can always increment or decrement x such that we only need 1 operation.",
+ "Add min(nums[i] % 3, 3 - (num[i] % 3)) to the count of operations."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "[1,2,3,4]",
+ "metaData": "{\n \"name\": \"minimumOperations\",\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 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour code will be run directly without compiling
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/find-number-of-ways-to-reach-the-k-th-stair.json b/leetcode/originData/find-number-of-ways-to-reach-the-k-th-stair.json new file mode 100644 index 00000000..99985f0c --- /dev/null +++ b/leetcode/originData/find-number-of-ways-to-reach-the-k-th-stair.json @@ -0,0 +1,193 @@ +{ + "data": { + "question": { + "questionId": "3414", + "questionFrontendId": "3154", + "boundTopicId": null, + "title": "Find Number of Ways to Reach the K-th Stair", + "titleSlug": "find-number-of-ways-to-reach-the-k-th-stair", + "content": "You are given a non-negative integer k. There exists a staircase with an infinite number of stairs, with the lowest stair numbered 0.
Alice has an integer jump, with an initial value of 0. She starts on stair 1 and wants to reach stair k using any number of operations. If she is on stair i, in one operation she can:
i - 1. This operation cannot be used consecutively or on stair 0.i + 2jump. And then, jump becomes jump + 1.Return the total number of ways Alice can reach stair k.
Note that it is possible that Alice reaches the stair k, and performs some operations to reach the stair k again.
\n
Example 1:
\n\nInput: k = 0
\n\nOutput: 2
\n\nExplanation:
\n\nThe 2 possible ways of reaching stair 0 are:
\n\nExample 2:
\n\nInput: k = 1
\n\nOutput: 4
\n\nExplanation:
\n\nThe 4 possible ways of reaching stair 1 are:
\n\n\n
Constraints:
\n\n0 <= k <= 109x operations of the second type and y operations of the first type, the stair 2x + 1 - y is reached.",
+ "Since first operations cannot be consecutive, there are exactly x + 1 positions (before and after each power of 2) to perform the second operation.",
+ "Using combinatorics, we have x + 1Cy number of ways to select the positions of second operations."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "0",
+ "metaData": "{\n \"name\": \"waysToReachStair\",\n \"params\": [\n {\n \"name\": \"k\",\n \"type\": \"integer\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}",
+ "judgerAvailable": true,
+ "judgeType": "large",
+ "mysqlSchemas": [],
+ "enableRunCode": true,
+ "enableTestMode": false,
+ "enableDebugger": true,
+ "envInfo": "{\"cpp\": [\"C++\", \"Compiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour code will be run directly without compiling
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/find-occurrences-of-an-element-in-an-array.json b/leetcode/originData/find-occurrences-of-an-element-in-an-array.json new file mode 100644 index 00000000..f22161d2 --- /dev/null +++ b/leetcode/originData/find-occurrences-of-an-element-in-an-array.json @@ -0,0 +1,173 @@ +{ + "data": { + "question": { + "questionId": "3420", + "questionFrontendId": "3159", + "boundTopicId": null, + "title": "Find Occurrences of an Element in an Array", + "titleSlug": "find-occurrences-of-an-element-in-an-array", + "content": "You are given an integer array nums, an integer array queries, and an integer x.
For each queries[i], you need to find the index of the queries[i]th occurrence of x in the nums array. If there are fewer than queries[i] occurrences of x, the answer should be -1 for that query.
Return an integer array answer containing the answers to all queries.
\n
Example 1:
\n\nInput: nums = [1,3,1,7], queries = [1,3,2,4], x = 1
\n\nOutput: [0,-1,2,-1]
\n\nExplanation:
\n\nnums, so the answer is -1.nums, so the answer is -1.Example 2:
\n\nInput: nums = [1,2,3], queries = [10], x = 5
\n\nOutput: [-1]
\n\nExplanation:
\n\nnums, so the answer is -1.\n
Constraints:
\n\n1 <= nums.length, queries.length <= 1051 <= queries[i] <= 1051 <= nums[i], x <= 104nums and save all the occurrences of each element in the separate arrays."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "[1,3,1,7]\n[1,3,2,4]\n1",
+ "metaData": "{\n \"name\": \"occurrencesOfElement\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer[]\",\n \"name\": \"queries\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"x\"\n }\n ],\n \"return\": {\n \"type\": \"integer[]\"\n }\n}",
+ "judgerAvailable": true,
+ "judgeType": "large",
+ "mysqlSchemas": [],
+ "enableRunCode": true,
+ "enableTestMode": false,
+ "enableDebugger": true,
+ "envInfo": "{\"cpp\": [\"C++\", \"Compiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour code will be run directly without compiling
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/find-products-of-elements-of-big-array.json b/leetcode/originData/find-products-of-elements-of-big-array.json new file mode 100644 index 00000000..6a5bbea2 --- /dev/null +++ b/leetcode/originData/find-products-of-elements-of-big-array.json @@ -0,0 +1,181 @@ +{ + "data": { + "question": { + "questionId": "3411", + "questionFrontendId": "3145", + "boundTopicId": null, + "title": "Find Products of Elements of Big Array", + "titleSlug": "find-products-of-elements-of-big-array", + "content": "A powerful array for an integer x is the shortest sorted array of powers of two that sum up to x. For example, the powerful array for 11 is [1, 2, 8].
The array big_nums is created by concatenating the powerful arrays for every positive integer i in ascending order: 1, 2, 3, and so forth. Thus, big_nums starts as [1, 2, 1, 2, 4, 1, 4, 2, 4, 1, 2, 4, 8, ...].
You are given a 2D integer matrix queries, where for queries[i] = [fromi, toi, modi] you should calculate (big_nums[fromi] * big_nums[fromi + 1] * ... * big_nums[toi]) % modi.
Return an integer array answer such that answer[i] is the answer to the ith query.
\n
Example 1:
\n\nInput: queries = [[1,3,7]]
\n\nOutput: [4]
\n\nExplanation:
\n\nThere is one query.
\n\nbig_nums[1..3] = [2,1,2]. The product of them is 4. The remainder of 4 under 7 is 4.
Example 2:
\n\nInput: queries = [[2,5,3],[7,7,4]]
\n\nOutput: [2,2]
\n\nExplanation:
\n\nThere are two queries.
\n\nFirst query: big_nums[2..5] = [1,2,4,1]. The product of them is 8. The remainder of 8 under 3 is 2.
Second query: big_nums[7] = 2. The remainder of 2 under 4 is 2.
\n
Constraints:
\n\n1 <= queries.length <= 500queries[i].length == 30 <= queries[i][0] <= queries[i][1] <= 10151 <= queries[i][2] <= 105f(n, i) which is the total number of numbers in [1, n] when the ith bit is set in O(log(n)) time.",
+ "Use binary search to find the last number for each query (and there might be one “incomplete” number for the query).",
+ "Use a similar way to find the product (we only need to save the sum of exponents of power of 2)."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "[[1,3,7]]",
+ "metaData": "{\n \"name\": \"findProductsOfElements\",\n \"params\": [\n {\n \"name\": \"queries\",\n \"type\": \"long[][]\"\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 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour code will be run directly without compiling
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/find-subarray-with-bitwise-or-closest-to-k.json b/leetcode/originData/find-subarray-with-bitwise-or-closest-to-k.json new file mode 100644 index 00000000..7825bda2 --- /dev/null +++ b/leetcode/originData/find-subarray-with-bitwise-or-closest-to-k.json @@ -0,0 +1,187 @@ +{ + "data": { + "question": { + "questionId": "3436", + "questionFrontendId": "3171", + "boundTopicId": null, + "title": "Find Subarray With Bitwise OR Closest to K", + "titleSlug": "find-subarray-with-bitwise-or-closest-to-k", + "content": "You are given an array nums and an integer k. You need to find a subarray of nums such that the absolute difference between k and the bitwise OR of the subarray elements is as small as possible. In other words, select a subarray nums[l..r] such that |k - (nums[l] OR nums[l + 1] ... OR nums[r])| is minimum.
Return the minimum possible value of the absolute difference.
\n\nA subarray is a contiguous non-empty sequence of elements within an array.
\n\n\n
Example 1:
\n\nInput: nums = [1,2,4,5], k = 3
\n\nOutput: 0
\n\nExplanation:
\n\nThe subarray nums[0..1] has OR value 3, which gives the minimum absolute difference |3 - 3| = 0.
Example 2:
\n\nInput: nums = [1,3,1,3], k = 2
\n\nOutput: 1
\n\nExplanation:
\n\nThe subarray nums[1..1] has OR value 3, which gives the minimum absolute difference |3 - 2| = 1.
Example 3:
\n\nInput: nums = [1], k = 10
\n\nOutput: 9
\n\nExplanation:
\n\nThere is a single subarray with OR value 1, which gives the minimum absolute difference |10 - 1| = 9.
\n
Constraints:
\n\n1 <= nums.length <= 1051 <= nums[i] <= 1091 <= k <= 109dp[i] be the set of all the bitwise OR of all the subarrays ending at index i.",
+ "We start from nums[i], taking the bitwise OR result by including elements one by one from i towards left. Notice that only unset bits can become set on adding an element, and set bits never become unset again.",
+ "Hence dp[i] can contain at most 30 elements."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "[1,2,4,5]\n3",
+ "metaData": "{\n \"name\": \"minimumDifference\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"k\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}",
+ "judgerAvailable": true,
+ "judgeType": "large",
+ "mysqlSchemas": [],
+ "enableRunCode": true,
+ "enableTestMode": false,
+ "enableDebugger": true,
+ "envInfo": "{\"cpp\": [\"C++\", \"Compiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour code will be run directly without compiling
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/find-the-child-who-has-the-ball-after-k-seconds.json b/leetcode/originData/find-the-child-who-has-the-ball-after-k-seconds.json new file mode 100644 index 00000000..628188c4 --- /dev/null +++ b/leetcode/originData/find-the-child-who-has-the-ball-after-k-seconds.json @@ -0,0 +1,174 @@ +{ + "data": { + "question": { + "questionId": "3450", + "questionFrontendId": "3178", + "boundTopicId": null, + "title": "Find the Child Who Has the Ball After K Seconds", + "titleSlug": "find-the-child-who-has-the-ball-after-k-seconds", + "content": "You are given two positive integers n and k. There are n children numbered from 0 to n - 1 standing in a queue in order from left to right.
Initially, child 0 holds a ball and the direction of passing the ball is towards the right direction. After each second, the child holding the ball passes it to the child next to them. Once the ball reaches either end of the line, i.e. child 0 or child n - 1, the direction of passing is reversed.
Return the number of the child who receives the ball after k seconds.
\n
Example 1:
\n\nInput: n = 3, k = 5
\n\nOutput: 1
\n\nExplanation:
\n\n| Time elapsed | \n\t\t\tChildren | \n\t\t
|---|---|
0 | \n\t\t\t[0, 1, 2] | \n\t\t
1 | \n\t\t\t[0, 1, 2] | \n\t\t
2 | \n\t\t\t[0, 1, 2] | \n\t\t
3 | \n\t\t\t[0, 1, 2] | \n\t\t
4 | \n\t\t\t[0, 1, 2] | \n\t\t
5 | \n\t\t\t[0, 1, 2] | \n\t\t
Example 2:
\n\nInput: n = 5, k = 6
\n\nOutput: 2
\n\nExplanation:
\n\n| Time elapsed | \n\t\t\tChildren | \n\t\t
|---|---|
0 | \n\t\t\t[0, 1, 2, 3, 4] | \n\t\t
1 | \n\t\t\t[0, 1, 2, 3, 4] | \n\t\t
2 | \n\t\t\t[0, 1, 2, 3, 4] | \n\t\t
3 | \n\t\t\t[0, 1, 2, 3, 4] | \n\t\t
4 | \n\t\t\t[0, 1, 2, 3, 4] | \n\t\t
5 | \n\t\t\t[0, 1, 2, 3, 4] | \n\t\t
6 | \n\t\t\t[0, 1, 2, 3, 4] | \n\t\t
Example 3:
\n\nInput: n = 4, k = 2
\n\nOutput: 2
\n\nExplanation:
\n\n| Time elapsed | \n\t\t\tChildren | \n\t\t
|---|---|
0 | \n\t\t\t[0, 1, 2, 3] | \n\t\t
1 | \n\t\t\t[0, 1, 2, 3] | \n\t\t
2 | \n\t\t\t[0, 1, 2, 3] | \n\t\t
\n
Constraints:
\n\n2 <= n <= 501 <= k <= 502 * (n - 1) seconds and everything is the same as time 0.",
+ "So the answer for k is the same as the answer for k % (2 * (n - 1))."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "3\n5",
+ "metaData": "{\n \"name\": \"numberOfChild\",\n \"params\": [\n {\n \"name\": \"n\",\n \"type\": \"integer\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"k\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}",
+ "judgerAvailable": true,
+ "judgeType": "large",
+ "mysqlSchemas": [],
+ "enableRunCode": true,
+ "enableTestMode": false,
+ "enableDebugger": true,
+ "envInfo": "{\"cpp\": [\"C++\", \"Compiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour code will be run directly without compiling
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/find-the-first-player-to-win-k-games-in-a-row.json b/leetcode/originData/find-the-first-player-to-win-k-games-in-a-row.json new file mode 100644 index 00000000..a9aec69f --- /dev/null +++ b/leetcode/originData/find-the-first-player-to-win-k-games-in-a-row.json @@ -0,0 +1,174 @@ +{ + "data": { + "question": { + "questionId": "3413", + "questionFrontendId": "3175", + "boundTopicId": null, + "title": "Find The First Player to win K Games in a Row", + "titleSlug": "find-the-first-player-to-win-k-games-in-a-row", + "content": "A competition consists of n players numbered from 0 to n - 1.
You are given an integer array skills of size n and a positive integer k, where skills[i] is the skill level of player i. All integers in skills are unique.
All players are standing in a queue in order from player 0 to player n - 1.
The competition process is as follows:
\n\nThe winner of the competition is the first player who wins k games in a row.
Return the initial index of the winning player.
\n\n\n
Example 1:
\n\nInput: skills = [4,2,6,3,9], k = 2
\n\nOutput: 2
\n\nExplanation:
\n\nInitially, the queue of players is [0,1,2,3,4]. The following process happens:
[0,2,3,4,1].[2,3,4,1,0].[2,4,1,0,3].Player 2 won k = 2 games in a row, so the winner is player 2.
Example 2:
\n\nInput: skills = [2,5,4], k = 3
\n\nOutput: 1
\n\nExplanation:
\n\nInitially, the queue of players is [0,1,2]. The following process happens:
[1,2,0].[1,0,2].[1,2,0].Player 1 won k = 3 games in a row, so the winner is player 1.
\n
Constraints:
\n\nn == skills.length2 <= n <= 1051 <= k <= 1091 <= skills[i] <= 106skills are unique.k ≥ n, there is exactly one player who can win k games in a row. Who is it?",
+ "In case k < n, you can simulate the competition process described."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "[4,2,6,3,9]\n2",
+ "metaData": "{\n \"name\": \"findWinningPlayer\",\n \"params\": [\n {\n \"name\": \"skills\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"k\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}",
+ "judgerAvailable": true,
+ "judgeType": "large",
+ "mysqlSchemas": [],
+ "enableRunCode": true,
+ "enableTestMode": false,
+ "enableDebugger": true,
+ "envInfo": "{\"cpp\": [\"C++\", \"Compiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour code will be run directly without compiling
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/find-the-maximum-length-of-a-good-subsequence-i.json b/leetcode/originData/find-the-maximum-length-of-a-good-subsequence-i.json new file mode 100644 index 00000000..c6e3d54c --- /dev/null +++ b/leetcode/originData/find-the-maximum-length-of-a-good-subsequence-i.json @@ -0,0 +1,181 @@ +{ + "data": { + "question": { + "questionId": "3456", + "questionFrontendId": "3176", + "boundTopicId": null, + "title": "Find the Maximum Length of a Good Subsequence I", + "titleSlug": "find-the-maximum-length-of-a-good-subsequence-i", + "content": "You are given an integer array nums and a non-negative integer k. A sequence of integers seq is called good if there are at most k indices i in the range [0, seq.length - 2] such that seq[i] != seq[i + 1].
Return the maximum possible length of a good subsequence of nums.
\n
Example 1:
\n\nInput: nums = [1,2,1,1,3], k = 2
\n\nOutput: 4
\n\nExplanation:
\n\nThe maximum length subsequence is [1,2,1,1,3].
Example 2:
\n\nInput: nums = [1,2,3,4,5,1], k = 0
\n\nOutput: 2
\n\nExplanation:
\n\nThe maximum length subsequence is [1,2,3,4,5,1].
\n
Constraints:
\n\n1 <= nums.length <= 5001 <= nums[i] <= 1090 <= k <= min(nums.length, 25)nums don’t really matter. So we can remap the set of values to the range [0, n - 1].",
+ "Let dp[i][j] be the length of the longest subsequence till index j with at most i positions such that seq[i] != seq[i + 1].",
+ "For each value x from left to right, update dp[i][x] = max(dp[i][x] + 1, dp[i - 1][y] + 1), where y != x."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "[1,2,1,1,3]\n2",
+ "metaData": "{\n \"name\": \"maximumLength\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"k\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}",
+ "judgerAvailable": true,
+ "judgeType": "large",
+ "mysqlSchemas": [],
+ "enableRunCode": true,
+ "enableTestMode": false,
+ "enableDebugger": true,
+ "envInfo": "{\"cpp\": [\"C++\", \"Compiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour code will be run directly without compiling
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/find-the-maximum-length-of-a-good-subsequence-ii.json b/leetcode/originData/find-the-maximum-length-of-a-good-subsequence-ii.json new file mode 100644 index 00000000..174303c7 --- /dev/null +++ b/leetcode/originData/find-the-maximum-length-of-a-good-subsequence-ii.json @@ -0,0 +1,181 @@ +{ + "data": { + "question": { + "questionId": "3452", + "questionFrontendId": "3177", + "boundTopicId": null, + "title": "Find the Maximum Length of a Good Subsequence II", + "titleSlug": "find-the-maximum-length-of-a-good-subsequence-ii", + "content": "You are given an integer array nums and a non-negative integer k. A sequence of integers seq is called good if there are at most k indices i in the range [0, seq.length - 2] such that seq[i] != seq[i + 1].
Return the maximum possible length of a good subsequence of nums.
\n
Example 1:
\n\nInput: nums = [1,2,1,1,3], k = 2
\n\nOutput: 4
\n\nExplanation:
\n\nThe maximum length subsequence is [1,2,1,1,3].
Example 2:
\n\nInput: nums = [1,2,3,4,5,1], k = 0
\n\nOutput: 2
\n\nExplanation:
\n\nThe maximum length subsequence is [1,2,3,4,5,1].
\n
Constraints:
\n\n1 <= nums.length <= 5 * 1031 <= nums[i] <= 1090 <= k <= min(50, nums.length)nums don’t really matter. So we can remap the set of values to the range [0, n - 1].",
+ "Let dp[i][j] be the length of the longest subsequence till index j with at most i positions such that seq[i] != seq[i + 1].",
+ "For each value x from left to right, update dp[i][x] = max(dp[i][x] + 1, dp[i - 1][y] + 1), where y != x."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "[1,2,1,1,3]\n2",
+ "metaData": "{\n \"name\": \"maximumLength\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"k\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}",
+ "judgerAvailable": true,
+ "judgeType": "large",
+ "mysqlSchemas": [],
+ "enableRunCode": true,
+ "enableTestMode": false,
+ "enableDebugger": true,
+ "envInfo": "{\"cpp\": [\"C++\", \"Compiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour code will be run directly without compiling
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/find-the-minimum-area-to-cover-all-ones-i.json b/leetcode/originData/find-the-minimum-area-to-cover-all-ones-i.json new file mode 100644 index 00000000..acc25e6a --- /dev/null +++ b/leetcode/originData/find-the-minimum-area-to-cover-all-ones-i.json @@ -0,0 +1,173 @@ +{ + "data": { + "question": { + "questionId": "3461", + "questionFrontendId": "3195", + "boundTopicId": null, + "title": "Find the Minimum Area to Cover All Ones I", + "titleSlug": "find-the-minimum-area-to-cover-all-ones-i", + "content": "You are given a 2D binary array grid. Find a rectangle with horizontal and vertical sides with the smallest area, such that all the 1's in grid lie inside this rectangle.
Return the minimum possible area of the rectangle.
\n\n\n
Example 1:
\n\nInput: grid = [[0,1,0],[1,0,1]]
\n\nOutput: 6
\n\nExplanation:
\n\n![\"\"](\"https://assets.leetcode.com/uploads/2024/05/08/examplerect0.png\")
The smallest rectangle has a height of 2 and a width of 3, so it has an area of 2 * 3 = 6.
Example 2:
\n\nInput: grid = [[1,0],[0,0]]
\n\nOutput: 1
\n\nExplanation:
\n\n![\"\"](\"https://assets.leetcode.com/uploads/2024/05/08/examplerect1.png\")
The smallest rectangle has both height and width 1, so its area is 1 * 1 = 1.
\n
Constraints:
\n\n1 <= grid.length, grid[i].length <= 1000grid[i][j] is either 0 or 1.grid.Compiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour code will be run directly without compiling
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/find-the-minimum-area-to-cover-all-ones-ii.json b/leetcode/originData/find-the-minimum-area-to-cover-all-ones-ii.json new file mode 100644 index 00000000..6eac6c74 --- /dev/null +++ b/leetcode/originData/find-the-minimum-area-to-cover-all-ones-ii.json @@ -0,0 +1,181 @@ +{ + "data": { + "question": { + "questionId": "3459", + "questionFrontendId": "3197", + "boundTopicId": null, + "title": "Find the Minimum Area to Cover All Ones II", + "titleSlug": "find-the-minimum-area-to-cover-all-ones-ii", + "content": "You are given a 2D binary array grid. You need to find 3 non-overlapping rectangles having non-zero areas with horizontal and vertical sides such that all the 1's in grid lie inside these rectangles.
Return the minimum possible sum of the area of these rectangles.
\n\nNote that the rectangles are allowed to touch.
\n\n\n
Example 1:
\n\nInput: grid = [[1,0,1],[1,1,1]]
\n\nOutput: 5
\n\nExplanation:
\n\n![\"\"](\"https://assets.leetcode.com/uploads/2024/05/14/example0rect21.png\")
(0, 0) and (1, 0) are covered by a rectangle of area 2.(0, 2) and (1, 2) are covered by a rectangle of area 2.(1, 1) is covered by a rectangle of area 1.Example 2:
\n\nInput: grid = [[1,0,1,0],[0,1,0,1]]
\n\nOutput: 5
\n\nExplanation:
\n\n![\"\"](\"https://assets.leetcode.com/uploads/2024/05/14/example1rect2.png\")
(0, 0) and (0, 2) are covered by a rectangle of area 3.(1, 1) is covered by a rectangle of area 1.(1, 3) is covered by a rectangle of area 1.\n
Constraints:
\n\n1 <= grid.length, grid[i].length <= 30grid[i][j] is either 0 or 1.grid.Compiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour code will be run directly without compiling
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/find-the-n-th-value-after-k-seconds.json b/leetcode/originData/find-the-n-th-value-after-k-seconds.json new file mode 100644 index 00000000..fd86c368 --- /dev/null +++ b/leetcode/originData/find-the-n-th-value-after-k-seconds.json @@ -0,0 +1,191 @@ +{ + "data": { + "question": { + "questionId": "3422", + "questionFrontendId": "3179", + "boundTopicId": null, + "title": "Find the N-th Value After K Seconds", + "titleSlug": "find-the-n-th-value-after-k-seconds", + "content": "You are given two integers n and k.
Initially, you start with an array a of n integers where a[i] = 1 for all 0 <= i <= n - 1. After each second, you simultaneously update each element to be the sum of all its preceding elements plus the element itself. For example, after one second, a[0] remains the same, a[1] becomes a[0] + a[1], a[2] becomes a[0] + a[1] + a[2], and so on.
Return the value of a[n - 1] after k seconds.
Since the answer may be very large, return it modulo 109 + 7.
\n
Example 1:
\n\nInput: n = 4, k = 5
\n\nOutput: 56
\n\nExplanation:
\n\n| Second | \n\t\t\tState After | \n\t\t
|---|---|
| 0 | \n\t\t\t[1,1,1,1] | \n\t\t
| 1 | \n\t\t\t[1,2,3,4] | \n\t\t
| 2 | \n\t\t\t[1,3,6,10] | \n\t\t
| 3 | \n\t\t\t[1,4,10,20] | \n\t\t
| 4 | \n\t\t\t[1,5,15,35] | \n\t\t
| 5 | \n\t\t\t[1,6,21,56] | \n\t\t
Example 2:
\n\nInput: n = 5, k = 3
\n\nOutput: 35
\n\nExplanation:
\n\n| Second | \n\t\t\tState After | \n\t\t
|---|---|
| 0 | \n\t\t\t[1,1,1,1,1] | \n\t\t
| 1 | \n\t\t\t[1,2,3,4,5] | \n\t\t
| 2 | \n\t\t\t[1,3,6,10,15] | \n\t\t
| 3 | \n\t\t\t[1,4,10,20,35] | \n\t\t
\n
Constraints:
\n\n1 <= n, k <= 1000nums, k times."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "4\n5",
+ "metaData": "{\n \"name\": \"valueAfterKSeconds\",\n \"params\": [\n {\n \"name\": \"n\",\n \"type\": \"integer\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"k\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}",
+ "judgerAvailable": true,
+ "judgeType": "large",
+ "mysqlSchemas": [],
+ "enableRunCode": true,
+ "enableTestMode": false,
+ "enableDebugger": true,
+ "envInfo": "{\"cpp\": [\"C++\", \"Compiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour code will be run directly without compiling
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/find-the-number-of-good-pairs-i.json b/leetcode/originData/find-the-number-of-good-pairs-i.json new file mode 100644 index 00000000..ea031dc1 --- /dev/null +++ b/leetcode/originData/find-the-number-of-good-pairs-i.json @@ -0,0 +1,173 @@ +{ + "data": { + "question": { + "questionId": "3446", + "questionFrontendId": "3162", + "boundTopicId": null, + "title": "Find the Number of Good Pairs I", + "titleSlug": "find-the-number-of-good-pairs-i", + "content": "You are given 2 integer arrays nums1 and nums2 of lengths n and m respectively. You are also given a positive integer k.
A pair (i, j) is called good if nums1[i] is divisible by nums2[j] * k (0 <= i <= n - 1, 0 <= j <= m - 1).
Return the total number of good pairs.
\n\n\n
Example 1:
\n\nInput: nums1 = [1,3,4], nums2 = [1,3,4], k = 1
\n\nOutput: 5
\n\nExplanation:
\nThe 5 good pairs are(0, 0), (1, 0), (1, 1), (2, 0), and (2, 2).Example 2:
\n\nInput: nums1 = [1,2,4,12], nums2 = [2,4], k = 3
\n\nOutput: 2
\n\nExplanation:
\n\nThe 2 good pairs are (3, 0) and (3, 1).
\n
Constraints:
\n\n1 <= n, m <= 501 <= nums1[i], nums2[j] <= 501 <= k <= 50Compiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour code will be run directly without compiling
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/find-the-xor-of-numbers-which-appear-twice.json b/leetcode/originData/find-the-xor-of-numbers-which-appear-twice.json new file mode 100644 index 00000000..fbe316f0 --- /dev/null +++ b/leetcode/originData/find-the-xor-of-numbers-which-appear-twice.json @@ -0,0 +1,179 @@ +{ + "data": { + "question": { + "questionId": "3428", + "questionFrontendId": "3158", + "boundTopicId": null, + "title": "Find the XOR of Numbers Which Appear Twice", + "titleSlug": "find-the-xor-of-numbers-which-appear-twice", + "content": "You are given an array nums, where each number in the array appears either once or twice.
Return the bitwise XOR of all the numbers that appear twice in the array, or 0 if no number appears twice.
\n
Example 1:
\n\nInput: nums = [1,2,1,3]
\n\nOutput: 1
\n\nExplanation:
\n\nThe only number that appears twice in nums is 1.
Example 2:
\n\nInput: nums = [1,2,3]
\n\nOutput: 0
\n\nExplanation:
\n\nNo number appears twice in nums.
Example 3:
\n\nInput: nums = [1,2,2,1]
\n\nOutput: 3
\n\nExplanation:
\n\nNumbers 1 and 2 appeared twice. 1 XOR 2 == 3.
\n
Constraints:
\n\n1 <= nums.length <= 501 <= nums[i] <= 50nums appears either once or twice.Compiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour code will be run directly without compiling
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/maximize-total-cost-of-alternating-subarrays.json b/leetcode/originData/maximize-total-cost-of-alternating-subarrays.json new file mode 100644 index 00000000..79034ad0 --- /dev/null +++ b/leetcode/originData/maximize-total-cost-of-alternating-subarrays.json @@ -0,0 +1,178 @@ +{ + "data": { + "question": { + "questionId": "3464", + "questionFrontendId": "3196", + "boundTopicId": null, + "title": "Maximize Total Cost of Alternating Subarrays", + "titleSlug": "maximize-total-cost-of-alternating-subarrays", + "content": "You are given an integer array nums with length n.
The cost of a subarray nums[l..r], where 0 <= l <= r < n, is defined as:
cost(l, r) = nums[l] - nums[l + 1] + ... + nums[r] * (−1)r − l
Your task is to split nums into subarrays such that the total cost of the subarrays is maximized, ensuring each element belongs to exactly one subarray.
Formally, if nums is split into k subarrays, where k > 1, at indices i1, i2, ..., ik − 1, where 0 <= i1 < i2 < ... < ik - 1 < n - 1, then the total cost will be:
cost(0, i1) + cost(i1 + 1, i2) + ... + cost(ik − 1 + 1, n − 1)
Return an integer denoting the maximum total cost of the subarrays after splitting the array optimally.
\n\nNote: If nums is not split into subarrays, i.e. k = 1, the total cost is simply cost(0, n - 1).
\n
Example 1:
\n\nInput: nums = [1,-2,3,4]
\n\nOutput: 10
\n\nExplanation:
\n\nOne way to maximize the total cost is by splitting [1, -2, 3, 4] into subarrays [1, -2, 3] and [4]. The total cost will be (1 + 2 + 3) + 4 = 10.
Example 2:
\n\nInput: nums = [1,-1,1,-1]
\n\nOutput: 4
\n\nExplanation:
\n\nOne way to maximize the total cost is by splitting [1, -1, 1, -1] into subarrays [1, -1] and [1, -1]. The total cost will be (1 + 1) + (1 + 1) = 4.
Example 3:
\n\nInput: nums = [0]
\n\nOutput: 0
\n\nExplanation:
\n\nWe cannot split the array further, so the answer is 0.
\nExample 4:
\n\nInput: nums = [1,-1]
\n\nOutput: 2
\n\nExplanation:
\n\nSelecting the whole array gives a total cost of 1 + 1 = 2, which is the maximum.
\n
Constraints:
\n\n1 <= nums.length <= 105-109 <= nums[i] <= 109dp[i][0/1] be the largest sum we can get for prefix nums[0..i], where dp[i][0] is the maximum if the ith element wasn't flipped, and dp[i][1] is the maximum if the ith element was flipped.",
+ "Based on the restriction:dp[i][0] = min(dp[i - 1][0], dp[i - 1][1]) + nums[i]dp[i][1] = dp[i - 1][0] - nums[i]",
+ "The initial state is:dp[1][0] = nums[0] + nums[1]dp[1][1] = nums[0] - nums[1]max(dp[n - 1][0], dp[n - 1][1]).",
+ "Can you optimize the space complexity?"
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "[1,-2,3,4]",
+ "metaData": "{\n \"name\": \"maximumTotalCost\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[]\"\n }\n ],\n \"return\": {\n \"type\": \"long\"\n }\n}",
+ "judgerAvailable": true,
+ "judgeType": "large",
+ "mysqlSchemas": [],
+ "enableRunCode": true,
+ "enableTestMode": false,
+ "enableDebugger": true,
+ "envInfo": "{\"cpp\": [\"C++\", \"Compiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour 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-difference-score-in-a-grid.json b/leetcode/originData/maximum-difference-score-in-a-grid.json new file mode 100644 index 00000000..c4396215 --- /dev/null +++ b/leetcode/originData/maximum-difference-score-in-a-grid.json @@ -0,0 +1,180 @@ +{ + "data": { + "question": { + "questionId": "3391", + "questionFrontendId": "3148", + "boundTopicId": null, + "title": "Maximum Difference Score in a Grid", + "titleSlug": "maximum-difference-score-in-a-grid", + "content": "You are given an m x n matrix grid consisting of positive integers. You can move from a cell in the matrix to any other cell that is either to the bottom or to the right (not necessarily adjacent). The score of a move from a cell with the value c1 to a cell with the value c2 is c2 - c1.
You can start at any cell, and you have to make at least one move.
\n\nReturn the maximum total score you can achieve.
\n\n\n
Example 1:
\n![\"\"](\"https://assets.leetcode.com/uploads/2024/03/14/grid1.png\")
\nInput: grid = [[9,5,7,3],[8,9,6,1],[6,7,14,3],[2,5,3,1]]
\n\nOutput: 9
\n\nExplanation: We start at the cell (0, 1), and we perform the following moves:
\n- Move from the cell (0, 1) to (2, 1) with a score of 7 - 5 = 2.
\n- Move from the cell (2, 1) to (2, 2) with a score of 14 - 7 = 7.
\nThe total score is 2 + 7 = 9.
Example 2:
\n\n![\"\"](\"https://assets.leetcode.com/uploads/2024/04/08/moregridsdrawio-1.png\")
Input: grid = [[4,3,2],[3,2,1]]
\n\nOutput: -1
\n\nExplanation: We start at the cell (0, 0), and we perform one move: (0, 0) to (0, 1). The score is 3 - 4 = -1.
\n
Constraints:
\n\nm == grid.lengthn == grid[i].length2 <= m, n <= 10004 <= m * n <= 1051 <= grid[i][j] <= 105(x1, y1) to another cell (x2, y2) will always have a score of grid[x2][y2] - grid[x1][y1].",
+ "Let’s say we fix the starting cell (x1, y1), how to the find a cell (x2, y2) such that the value grid[x2][y2] - grid[x1][y1] is the maximum possible?"
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "[[9,5,7,3],[8,9,6,1],[6,7,14,3],[2,5,3,1]]",
+ "metaData": "{\n \"name\": \"maxScore\",\n \"params\": [\n {\n \"name\": \"grid\",\n \"type\": \"listCompiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour 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-points-inside-the-square.json b/leetcode/originData/maximum-points-inside-the-square.json new file mode 100644 index 00000000..ffe7c809 --- /dev/null +++ b/leetcode/originData/maximum-points-inside-the-square.json @@ -0,0 +1,192 @@ +{ + "data": { + "question": { + "questionId": "3419", + "questionFrontendId": "3143", + "boundTopicId": null, + "title": "Maximum Points Inside the Square", + "titleSlug": "maximum-points-inside-the-square", + "content": "You are given a 2D array points and a string s where, points[i] represents the coordinates of point i, and s[i] represents the tag of point i.
A valid square is a square centered at the origin (0, 0), has edges parallel to the axes, and does not contain two points with the same tag.
Return the maximum number of points contained in a valid square.
\n\nNote:
\n\n\n
Example 1:
\n\n![\"\"](\"https://assets.leetcode.com/uploads/2024/03/29/3708-tc1.png\")
Input: points = [[2,2],[-1,-2],[-4,4],[-3,1],[3,-3]], s = "abdca"
\n\nOutput: 2
\n\nExplanation:
\n\nThe square of side length 4 covers two points points[0] and points[1].
Example 2:
\n\n![\"\"](\"https://assets.leetcode.com/uploads/2024/03/29/3708-tc2.png\")
Input: points = [[1,1],[-2,-2],[-2,2]], s = "abb"
\n\nOutput: 1
\n\nExplanation:
\n\nThe square of side length 2 covers one point, which is points[0].
Example 3:
\n\nInput: points = [[1,1],[-1,-1],[2,-2]], s = "ccd"
\n\nOutput: 0
\n\nExplanation:
\n\nIt's impossible to make any valid squares centered at the origin such that it covers only one point among points[0] and points[1].
\n
Constraints:
\n\n1 <= s.length, points.length <= 105points[i].length == 2-109 <= points[i][0], points[i][1] <= 109s.length == points.lengthpoints consists of distinct coordinates.s consists only of lowercase English letters.(x, y) is max(abs(x), abs(y)) * 2.",
+ "Sort the points by max(abs(x), abs(y)) and try each edge length, check the included point tags."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "[[2,2],[-1,-2],[-4,4],[-3,1],[3,-3]]\n\"abdca\"",
+ "metaData": "{\n \"name\": \"maxPointsInsideSquare\",\n \"params\": [\n {\n \"name\": \"points\",\n \"type\": \"integer[][]\"\n },\n {\n \"type\": \"string\",\n \"name\": \"s\"\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 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour 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-prime-difference.json b/leetcode/originData/maximum-prime-difference.json new file mode 100644 index 00000000..4e189ae6 --- /dev/null +++ b/leetcode/originData/maximum-prime-difference.json @@ -0,0 +1,180 @@ +{ + "data": { + "question": { + "questionId": "3373", + "questionFrontendId": "3115", + "boundTopicId": null, + "title": "Maximum Prime Difference", + "titleSlug": "maximum-prime-difference", + "content": "You are given an integer array nums.
Return an integer that is the maximum distance between the indices of two (not necessarily different) prime numbers in nums.
\n
Example 1:
\n\nInput: nums = [4,2,9,5,3]
\n\nOutput: 3
\n\nExplanation: nums[1], nums[3], and nums[4] are prime. So the answer is |4 - 1| = 3.
Example 2:
\n\nInput: nums = [4,8,2,8]
\n\nOutput: 0
\n\nExplanation: nums[2] is prime. Because there is just one prime number, the answer is |2 - 2| = 0.
\n
Constraints:
\n\n1 <= nums.length <= 3 * 1051 <= nums[i] <= 100nums is at least one.nums.",
+ "Find the first and the last prime number in the nums."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "[4,2,9,5,3]",
+ "metaData": "{\n \"name\": \"maximumPrimeDifference\",\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 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour 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-subsequence-with-non-adjacent-elements.json b/leetcode/originData/maximum-sum-of-subsequence-with-non-adjacent-elements.json new file mode 100644 index 00000000..99c25ce8 --- /dev/null +++ b/leetcode/originData/maximum-sum-of-subsequence-with-non-adjacent-elements.json @@ -0,0 +1,186 @@ +{ + "data": { + "question": { + "questionId": "3423", + "questionFrontendId": "3165", + "boundTopicId": null, + "title": "Maximum Sum of Subsequence With Non-adjacent Elements", + "titleSlug": "maximum-sum-of-subsequence-with-non-adjacent-elements", + "content": "You are given an array nums consisting of integers. You are also given a 2D array queries, where queries[i] = [posi, xi].
For query i, we first set nums[posi] equal to xi, then we calculate the answer to query i which is the maximum sum of a subsequence of nums where no two adjacent elements are selected.
Return the sum of the answers to all queries.
\n\nSince the final answer may be very large, return it modulo 109 + 7.
A subsequence is an array that can be derived from another array by deleting some or no elements without changing the order of the remaining elements.
\n\n\n
Example 1:
\n\nInput: nums = [3,5,9], queries = [[1,-2],[0,-3]]
\n\nOutput: 21
\n\nExplanation:
\nAfter the 1st query, nums = [3,-2,9] and the maximum sum of a subsequence with non-adjacent elements is 3 + 9 = 12.
\nAfter the 2nd query, nums = [-3,-2,9] and the maximum sum of a subsequence with non-adjacent elements is 9.
Example 2:
\n\nInput: nums = [0,-1], queries = [[0,-5]]
\n\nOutput: 0
\n\nExplanation:
\nAfter the 1st query, nums = [-5,-1] and the maximum sum of a subsequence with non-adjacent elements is 0 (choosing an empty subsequence).
\n
Constraints:
\n\n1 <= nums.length <= 5 * 104-105 <= nums[i] <= 1051 <= queries.length <= 5 * 104queries[i] == [posi, xi]0 <= posi <= nums.length - 1-105 <= xi <= 105O(nums.length) with dynamic programming?",
+ "In order to optimize, we will use segment tree where each node contains the maximum value of (front element has been chosen or not, back element has been chosen or not)."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "[3,5,9]\n[[1,-2],[0,-3]]",
+ "metaData": "{\n \"name\": \"maximumSumSubsequence\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer[][]\",\n \"name\": \"queries\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}",
+ "judgerAvailable": true,
+ "judgeType": "large",
+ "mysqlSchemas": [],
+ "enableRunCode": true,
+ "enableTestMode": false,
+ "enableDebugger": true,
+ "envInfo": "{\"cpp\": [\"C++\", \"Compiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour 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-total-damage-with-spell-casting.json b/leetcode/originData/maximum-total-damage-with-spell-casting.json new file mode 100644 index 00000000..4ca8a7d0 --- /dev/null +++ b/leetcode/originData/maximum-total-damage-with-spell-casting.json @@ -0,0 +1,205 @@ +{ + "data": { + "question": { + "questionId": "3437", + "questionFrontendId": "3186", + "boundTopicId": null, + "title": "Maximum Total Damage With Spell Casting", + "titleSlug": "maximum-total-damage-with-spell-casting", + "content": "A magician has various spells.
\n\nYou are given an array power, where each element represents the damage of a spell. Multiple spells can have the same damage value.
It is a known fact that if a magician decides to cast a spell with a damage of power[i], they cannot cast any spell with a damage of power[i] - 2, power[i] - 1, power[i] + 1, or power[i] + 2.
Each spell can be cast only once.
\n\nReturn the maximum possible total damage that a magician can cast.
\n\n\n
Example 1:
\n\nInput: power = [1,1,3,4]
\n\nOutput: 6
\n\nExplanation:
\n\nThe maximum possible damage of 6 is produced by casting spells 0, 1, 3 with damage 1, 1, 4.
\nExample 2:
\n\nInput: power = [7,1,6,6]
\n\nOutput: 13
\n\nExplanation:
\n\nThe maximum possible damage of 13 is produced by casting spells 1, 2, 3 with damage 1, 6, 6.
\n\n
Constraints:
\n\n1 <= power.length <= 1051 <= power[i] <= 109x, then we will use all spells with power x.",
+ "Think of dynamic programming.",
+ "dp[i][j] represents the maximum damage considering up to the i-th unique spell and j represents the number of spells skipped (up to 3 as per constraints)."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "[1,1,3,4]",
+ "metaData": "{\n \"name\": \"maximumTotalDamage\",\n \"params\": [\n {\n \"name\": \"power\",\n \"type\": \"integer[]\"\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 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour 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-total-reward-using-operations-i.json b/leetcode/originData/maximum-total-reward-using-operations-i.json new file mode 100644 index 00000000..a07c5288 --- /dev/null +++ b/leetcode/originData/maximum-total-reward-using-operations-i.json @@ -0,0 +1,176 @@ +{ + "data": { + "question": { + "questionId": "3442", + "questionFrontendId": "3180", + "boundTopicId": null, + "title": "Maximum Total Reward Using Operations I", + "titleSlug": "maximum-total-reward-using-operations-i", + "content": "You are given an integer array rewardValues of length n, representing the values of rewards.
Initially, your total reward x is 0, and all indices are unmarked. You are allowed to perform the following operation any number of times:
i from the range [0, n - 1].rewardValues[i] is greater than your current total reward x, then add rewardValues[i] to x (i.e., x = x + rewardValues[i]), and mark the index i.Return an integer denoting the maximum total reward you can collect by performing the operations optimally.
\n\n\n
Example 1:
\n\nInput: rewardValues = [1,1,3,3]
\n\nOutput: 4
\n\nExplanation:
\n\nDuring the operations, we can choose to mark the indices 0 and 2 in order, and the total reward will be 4, which is the maximum.
\nExample 2:
\n\nInput: rewardValues = [1,6,4,3,2]
\n\nOutput: 11
\n\nExplanation:
\n\nMark the indices 0, 2, and 1 in order. The total reward will then be 11, which is the maximum.
\n\n
Constraints:
\n\n1 <= rewardValues.length <= 20001 <= rewardValues[i] <= 2000dp[i][j] (true/false) be the state after the first i rewards, indicating whether we can get exactly j points.",
+ "The transition is given by: dp[i][j] = dp[i - 1][j − rewardValues[i]] if j − rewardValues[i] < rewardValues[i]."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "[1,1,3,3]",
+ "metaData": "{\n \"name\": \"maxTotalReward\",\n \"params\": [\n {\n \"name\": \"rewardValues\",\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 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour 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-total-reward-using-operations-ii.json b/leetcode/originData/maximum-total-reward-using-operations-ii.json new file mode 100644 index 00000000..40b93e30 --- /dev/null +++ b/leetcode/originData/maximum-total-reward-using-operations-ii.json @@ -0,0 +1,182 @@ +{ + "data": { + "question": { + "questionId": "3443", + "questionFrontendId": "3181", + "boundTopicId": null, + "title": "Maximum Total Reward Using Operations II", + "titleSlug": "maximum-total-reward-using-operations-ii", + "content": "You are given an integer array rewardValues of length n, representing the values of rewards.
Initially, your total reward x is 0, and all indices are unmarked. You are allowed to perform the following operation any number of times:
i from the range [0, n - 1].rewardValues[i] is greater than your current total reward x, then add rewardValues[i] to x (i.e., x = x + rewardValues[i]), and mark the index i.Return an integer denoting the maximum total reward you can collect by performing the operations optimally.
\n\n\n
Example 1:
\n\nInput: rewardValues = [1,1,3,3]
\n\nOutput: 4
\n\nExplanation:
\n\nDuring the operations, we can choose to mark the indices 0 and 2 in order, and the total reward will be 4, which is the maximum.
\nExample 2:
\n\nInput: rewardValues = [1,6,4,3,2]
\n\nOutput: 11
\n\nExplanation:
\n\nMark the indices 0, 2, and 1 in order. The total reward will then be 11, which is the maximum.
\n\n
Constraints:
\n\n1 <= rewardValues.length <= 5 * 1041 <= rewardValues[i] <= 5 * 104dp[i][j] = dp[i - 1][j − rewardValues[i]] if j − rewardValues[i] < rewardValues[i].",
+ "Note that the dp array is a boolean array. We just need 1 bit per element, so we can use a bitset or something similar. We just need a \"stream\" of bits and apply bitwise operations to optimize the computations by a constant factor."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "[1,1,3,3]",
+ "metaData": "{\n \"name\": \"maxTotalReward\",\n \"params\": [\n {\n \"name\": \"rewardValues\",\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 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour 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-average-of-smallest-and-largest-elements.json b/leetcode/originData/minimum-average-of-smallest-and-largest-elements.json new file mode 100644 index 00000000..e35dfd76 --- /dev/null +++ b/leetcode/originData/minimum-average-of-smallest-and-largest-elements.json @@ -0,0 +1,179 @@ +{ + "data": { + "question": { + "questionId": "3471", + "questionFrontendId": "3194", + "boundTopicId": null, + "title": "Minimum Average of Smallest and Largest Elements", + "titleSlug": "minimum-average-of-smallest-and-largest-elements", + "content": "You have an array of floating point numbers averages which is initially empty. You are given an array nums of n integers where n is even.
You repeat the following procedure n / 2 times:
minElement, and the largest element maxElement, from nums.(minElement + maxElement) / 2 to averages.Return the minimum element in averages.
\n
Example 1:
\n\nInput: nums = [7,8,3,4,15,13,4,1]
\n\nOutput: 5.5
\n\nExplanation:
\n\n| step | \n\t\t\tnums | \n\t\t\taverages | \n\t\t
|---|---|---|
| 0 | \n\t\t\t[7,8,3,4,15,13,4,1] | \n\t\t\t[] | \n\t\t
| 1 | \n\t\t\t[7,8,3,4,13,4] | \n\t\t\t[8] | \n\t\t
| 2 | \n\t\t\t[7,8,4,4] | \n\t\t\t[8,8] | \n\t\t
| 3 | \n\t\t\t[7,4] | \n\t\t\t[8,8,6] | \n\t\t
| 4 | \n\t\t\t[] | \n\t\t\t[8,8,6,5.5] | \n\t\t
Example 2:
\n\nInput: nums = [1,9,8,3,10,5]
\n\nOutput: 5.5
\n\nExplanation:
\n\n| step | \n\t\t\tnums | \n\t\t\taverages | \n\t\t
|---|---|---|
| 0 | \n\t\t\t[1,9,8,3,10,5] | \n\t\t\t[] | \n\t\t
| 1 | \n\t\t\t[9,8,3,5] | \n\t\t\t[5.5] | \n\t\t
| 2 | \n\t\t\t[8,5] | \n\t\t\t[5.5,6] | \n\t\t
| 3 | \n\t\t\t[] | \n\t\t\t[5.5,6,6.5] | \n\t\t
Example 3:
\n\nInput: nums = [1,2,3,7,8,9]
\n\nOutput: 5.0
\n\nExplanation:
\n\n| step | \n\t\t\tnums | \n\t\t\taverages | \n\t\t
|---|---|---|
| 0 | \n\t\t\t[1,2,3,7,8,9] | \n\t\t\t[] | \n\t\t
| 1 | \n\t\t\t[2,3,7,8] | \n\t\t\t[5] | \n\t\t
| 2 | \n\t\t\t[3,7] | \n\t\t\t[5,5] | \n\t\t
| 3 | \n\t\t\t[] | \n\t\t\t[5,5,5] | \n\t\t
\n
Constraints:
\n\n2 <= n == nums.length <= 50n is even.1 <= nums[i] <= 50nums is sorted, then the elements of averages are (nums[i] + nums[n - i - 1]) / 2 for all i < n / 2."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "[7,8,3,4,15,13,4,1]",
+ "metaData": "{\n \"name\": \"minimumAverage\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[]\"\n }\n ],\n \"return\": {\n \"type\": \"double\"\n }\n}",
+ "judgerAvailable": true,
+ "judgeType": "large",
+ "mysqlSchemas": [],
+ "enableRunCode": true,
+ "enableTestMode": false,
+ "enableDebugger": true,
+ "envInfo": "{\"cpp\": [\"C++\", \"Compiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour 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-chairs-in-a-waiting-room.json b/leetcode/originData/minimum-number-of-chairs-in-a-waiting-room.json new file mode 100644 index 00000000..59ec79bf --- /dev/null +++ b/leetcode/originData/minimum-number-of-chairs-in-a-waiting-room.json @@ -0,0 +1,174 @@ +{ + "data": { + "question": { + "questionId": "3426", + "questionFrontendId": "3168", + "boundTopicId": null, + "title": "Minimum Number of Chairs in a Waiting Room", + "titleSlug": "minimum-number-of-chairs-in-a-waiting-room", + "content": "You are given a string s. Simulate events at each second i:
s[i] == 'E', a person enters the waiting room and takes one of the chairs in it.s[i] == 'L', a person leaves the waiting room, freeing up a chair.Return the minimum number of chairs needed so that a chair is available for every person who enters the waiting room given that it is initially empty.
\n\n\n
Example 1:
\n\nInput: s = "EEEEEEE"
\n\nOutput: 7
\n\nExplanation:
\n\nAfter each second, a person enters the waiting room and no person leaves it. Therefore, a minimum of 7 chairs is needed.
\nExample 2:
\n\nInput: s = "ELELEEL"
\n\nOutput: 2
\n\nExplanation:
\n\nLet's consider that there are 2 chairs in the waiting room. The table below shows the state of the waiting room at each second.
\n| Second | \n\t\t\tEvent | \n\t\t\tPeople in the Waiting Room | \n\t\t\tAvailable Chairs | \n\t\t
|---|---|---|---|
| 0 | \n\t\t\tEnter | \n\t\t\t1 | \n\t\t\t1 | \n\t\t
| 1 | \n\t\t\tLeave | \n\t\t\t0 | \n\t\t\t2 | \n\t\t
| 2 | \n\t\t\tEnter | \n\t\t\t1 | \n\t\t\t1 | \n\t\t
| 3 | \n\t\t\tLeave | \n\t\t\t0 | \n\t\t\t2 | \n\t\t
| 4 | \n\t\t\tEnter | \n\t\t\t1 | \n\t\t\t1 | \n\t\t
| 5 | \n\t\t\tEnter | \n\t\t\t2 | \n\t\t\t0 | \n\t\t
| 6 | \n\t\t\tLeave | \n\t\t\t1 | \n\t\t\t1 | \n\t\t
Example 3:
\n\nInput: s = "ELEELEELLL"
\n\nOutput: 3
\n\nExplanation:
\n\nLet's consider that there are 3 chairs in the waiting room. The table below shows the state of the waiting room at each second.
\n| Second | \n\t\t\tEvent | \n\t\t\tPeople in the Waiting Room | \n\t\t\tAvailable Chairs | \n\t\t
|---|---|---|---|
| 0 | \n\t\t\tEnter | \n\t\t\t1 | \n\t\t\t2 | \n\t\t
| 1 | \n\t\t\tLeave | \n\t\t\t0 | \n\t\t\t3 | \n\t\t
| 2 | \n\t\t\tEnter | \n\t\t\t1 | \n\t\t\t2 | \n\t\t
| 3 | \n\t\t\tEnter | \n\t\t\t2 | \n\t\t\t1 | \n\t\t
| 4 | \n\t\t\tLeave | \n\t\t\t1 | \n\t\t\t2 | \n\t\t
| 5 | \n\t\t\tEnter | \n\t\t\t2 | \n\t\t\t1 | \n\t\t
| 6 | \n\t\t\tEnter | \n\t\t\t3 | \n\t\t\t0 | \n\t\t
| 7 | \n\t\t\tLeave | \n\t\t\t2 | \n\t\t\t1 | \n\t\t
| 8 | \n\t\t\tLeave | \n\t\t\t1 | \n\t\t\t2 | \n\t\t
| 9 | \n\t\t\tLeave | \n\t\t\t0 | \n\t\t\t3 | \n\t\t
\n
Constraints:
\n\n1 <= s.length <= 50s consists only of the letters 'E' and 'L'.s represents a valid sequence of entries and exits.Compiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour 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-operations-to-make-word-k-periodic.json b/leetcode/originData/minimum-number-of-operations-to-make-word-k-periodic.json new file mode 100644 index 00000000..4f0eebe8 --- /dev/null +++ b/leetcode/originData/minimum-number-of-operations-to-make-word-k-periodic.json @@ -0,0 +1,180 @@ +{ + "data": { + "question": { + "questionId": "3384", + "questionFrontendId": "3137", + "boundTopicId": null, + "title": "Minimum Number of Operations to Make Word K-Periodic", + "titleSlug": "minimum-number-of-operations-to-make-word-k-periodic", + "content": "You are given a string word of size n, and an integer k such that k divides n.
In one operation, you can pick any two indices i and j, that are divisible by k, then replace the substring of length k starting at i with the substring of length k starting at j. That is, replace the substring word[i..i + k - 1] with the substring word[j..j + k - 1].
Return the minimum number of operations required to make word k-periodic.
We say that word is k-periodic if there is some string s of length k such that word can be obtained by concatenating s an arbitrary number of times. For example, if word == “ababab”, then word is 2-periodic for s = "ab".
\n
Example 1:
\n\nInput: word = "leetcodeleet", k = 4
\n\nOutput: 1
\n\nExplanation:
\n\nWe can obtain a 4-periodic string by picking i = 4 and j = 0. After this operation, word becomes equal to "leetleetleet".
\nExample 2:
\n\nInput: word = "leetcoleet", k = 2
\n\nOutput: 3
\n\nExplanation:
\n\nWe can obtain a 2-periodic string by applying the operations in the table below.
\n\n| i | \n\t\t\tj | \n\t\t\tword | \n\t\t
|---|---|---|
| 0 | \n\t\t\t2 | \n\t\t\tetetcoleet | \n\t\t
| 4 | \n\t\t\t0 | \n\t\t\tetetetleet | \n\t\t
| 6 | \n\t\t\t0 | \n\t\t\tetetetetet | \n\t\t
\n
Constraints:
\n\n1 <= n == word.length <= 1051 <= k <= word.lengthk divides word.length.word consists only of lowercase English letters.k that starts at an index that is divisible by k.",
+ "The period of the final string will be the substring with the highest frequency."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "\"leetcodeleet\"\n4",
+ "metaData": "{\n \"name\": \"minimumOperationsToMakeKPeriodic\",\n \"params\": [\n {\n \"name\": \"word\",\n \"type\": \"string\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"k\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}",
+ "judgerAvailable": true,
+ "judgeType": "large",
+ "mysqlSchemas": [],
+ "enableRunCode": true,
+ "enableTestMode": false,
+ "enableDebugger": true,
+ "envInfo": "{\"cpp\": [\"C++\", \"Compiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour 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-operations-to-make-binary-array-elements-equal-to-one-i.json b/leetcode/originData/minimum-operations-to-make-binary-array-elements-equal-to-one-i.json new file mode 100644 index 00000000..c10fe47c --- /dev/null +++ b/leetcode/originData/minimum-operations-to-make-binary-array-elements-equal-to-one-i.json @@ -0,0 +1,192 @@ +{ + "data": { + "question": { + "questionId": "3475", + "questionFrontendId": "3191", + "boundTopicId": null, + "title": "Minimum Operations to Make Binary Array Elements Equal to One I", + "titleSlug": "minimum-operations-to-make-binary-array-elements-equal-to-one-i", + "content": "You are given a binary array nums.
You can do the following operation on the array any number of times (possibly zero):
\n\nFlipping an element means changing its value from 0 to 1, and from 1 to 0.
\n\nReturn the minimum number of operations required to make all elements in nums equal to 1. If it is impossible, return -1.
\n
Example 1:
\n\nInput: nums = [0,1,1,1,0,0]
\n\nOutput: 3
\n\nExplanation:
\nWe can do the following operations:
nums = [1,0,0,1,0,0].nums = [1,1,1,0,0,0].nums = [1,1,1,1,1,1].Example 2:
\n\nInput: nums = [0,1,1,1]
\n\nOutput: -1
\n\nExplanation:
\nIt is impossible to make all elements equal to 1.
\n
Constraints:
\n\n3 <= nums.length <= 1050 <= nums[i] <= 1nums[0] is 0, then the only way to change it to 1 is by doing an operation on the first 3 elements of the array.",
+ "After Changing nums[0] to 1, use the same logic on the remaining array."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "[0,1,1,1,0,0]",
+ "metaData": "{\n \"name\": \"minOperations\",\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 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour 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-operations-to-make-binary-array-elements-equal-to-one-ii.json b/leetcode/originData/minimum-operations-to-make-binary-array-elements-equal-to-one-ii.json new file mode 100644 index 00000000..4c73a593 --- /dev/null +++ b/leetcode/originData/minimum-operations-to-make-binary-array-elements-equal-to-one-ii.json @@ -0,0 +1,180 @@ +{ + "data": { + "question": { + "questionId": "3477", + "questionFrontendId": "3192", + "boundTopicId": null, + "title": "Minimum Operations to Make Binary Array Elements Equal to One II", + "titleSlug": "minimum-operations-to-make-binary-array-elements-equal-to-one-ii", + "content": "You are given a binary array nums.
You can do the following operation on the array any number of times (possibly zero):
\n\ni from the array and flip all the elements from index i to the end of the array.Flipping an element means changing its value from 0 to 1, and from 1 to 0.
\n\nReturn the minimum number of operations required to make all elements in nums equal to 1.
\n
Example 1:
\n\nInput: nums = [0,1,1,0,1]
\n\nOutput: 4
\n\nExplanation:
\nWe can do the following operations:
i = 1. The resulting array will be nums = [0,0,0,1,0].i = 0. The resulting array will be nums = [1,1,1,0,1].i = 4. The resulting array will be nums = [1,1,1,0,0].i = 3. The resulting array will be nums = [1,1,1,1,1].Example 2:
\n\nInput: nums = [1,0,0,0]
\n\nOutput: 1
\n\nExplanation:
\nWe can do the following operation:
i = 1. The resulting array will be nums = [1,1,1,1].\n
Constraints:
\n\n1 <= nums.length <= 1050 <= nums[i] <= 1nums[0] to 1 is by performing an operation with index i = 0.",
+ "Iterate from left to right and perform an operation at each index i where nums[i] is 0, and keep track of how many operations are currently performed on the suffix."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "[0,1,1,0,1]",
+ "metaData": "{\n \"name\": \"minOperations\",\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 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour 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/peaks-in-array.json b/leetcode/originData/peaks-in-array.json new file mode 100644 index 00000000..71ba4563 --- /dev/null +++ b/leetcode/originData/peaks-in-array.json @@ -0,0 +1,182 @@ +{ + "data": { + "question": { + "questionId": "3438", + "questionFrontendId": "3187", + "boundTopicId": null, + "title": "Peaks in Array", + "titleSlug": "peaks-in-array", + "content": "A peak in an array arr is an element that is greater than its previous and next element in arr.
You are given an integer array nums and a 2D integer array queries.
You have to process queries of two types:
\n\nqueries[i] = [1, li, ri], determine the count of peak elements in the subarray nums[li..ri].queries[i] = [2, indexi, vali], change nums[indexi] to vali.Return an array answer containing the results of the queries of the first type in order.
Notes:
\n\n\n
Example 1:
\n\nInput: nums = [3,1,4,2,5], queries = [[2,3,4],[1,0,4]]
\n\nOutput: [0]
\n\nExplanation:
\n\nFirst query: We change nums[3] to 4 and nums becomes [3,1,4,4,5].
Second query: The number of peaks in the [3,1,4,4,5] is 0.
Example 2:
\n\nInput: nums = [4,1,4,2,1,5], queries = [[2,2,4],[1,0,2],[1,0,4]]
\n\nOutput: [0,1]
\n\nExplanation:
\n\nFirst query: nums[2] should become 4, but it is already set to 4.
Second query: The number of peaks in the [4,1,4] is 0.
Third query: The second 4 is a peak in the [4,1,4,2,1].
\n
Constraints:
\n\n3 <= nums.length <= 1051 <= nums[i] <= 1051 <= queries.length <= 105queries[i][0] == 1 or queries[i][0] == 2i that:\n\tqueries[i][0] == 1: 0 <= queries[i][1] <= queries[i][2] <= nums.length - 1queries[i][0] == 2: 0 <= queries[i][1] <= nums.length - 1, 1 <= queries[i][2] <= 105p[i] be whether nums[i] is a peak in the original array. Namely p[i] = nums[i] > nums[i - 1] && nums[i] > nums[i + 1].",
+ "Updating nums[i], only affects p[i], p[i - 1] and p[i + 1]. We can recalculate the 3 values in constant time.",
+ "The answer for [li, ri] is p[li + 1] + p[li + 2] + … + p[ri - 1] (note that li and ri are not included).",
+ "Use some data structures (i.e. segment tree or binary indexed tree) to maintain the subarray sum efficiently."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "[3,1,4,2,5]\n[[2,3,4],[1,0,4]]",
+ "metaData": "{\n \"name\": \"countOfPeaks\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer[][]\",\n \"name\": \"queries\"\n }\n ],\n \"return\": {\n \"type\": \"listCompiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour 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/permutation-difference-between-two-strings.json b/leetcode/originData/permutation-difference-between-two-strings.json new file mode 100644 index 00000000..e4ce4095 --- /dev/null +++ b/leetcode/originData/permutation-difference-between-two-strings.json @@ -0,0 +1,173 @@ +{ + "data": { + "question": { + "questionId": "3412", + "questionFrontendId": "3146", + "boundTopicId": null, + "title": "Permutation Difference between Two Strings", + "titleSlug": "permutation-difference-between-two-strings", + "content": "You are given two strings s and t such that every character occurs at most once in s and t is a permutation of s.
The permutation difference between s and t is defined as the sum of the absolute difference between the index of the occurrence of each character in s and the index of the occurrence of the same character in t.
Return the permutation difference between s and t.
\n
Example 1:
\n\nInput: s = "abc", t = "bac"
\n\nOutput: 2
\n\nExplanation:
\n\nFor s = "abc" and t = "bac", the permutation difference of s and t is equal to the sum of:
"a" in s and the index of the occurrence of "a" in t."b" in s and the index of the occurrence of "b" in t."c" in s and the index of the occurrence of "c" in t.That is, the permutation difference between s and t is equal to |0 - 1| + |2 - 2| + |1 - 0| = 2.
Example 2:
\n\nInput: s = "abcde", t = "edbac"
\n\nOutput: 12
\n\nExplanation: The permutation difference between s and t is equal to |0 - 3| + |1 - 2| + |2 - 4| + |3 - 1| + |4 - 0| = 12.
\n
Constraints:
\n\n1 <= s.length <= 26s.t is a permutation of s.s consists only of lowercase English letters.s then in string t."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "\"abc\"\n\"bac\"",
+ "metaData": "{\n \"name\": \"findPermutationDifference\",\n \"params\": [\n {\n \"name\": \"s\",\n \"type\": \"string\"\n },\n {\n \"type\": \"string\",\n \"name\": \"t\"\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 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour 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/special-array-i.json b/leetcode/originData/special-array-i.json new file mode 100644 index 00000000..87a63318 --- /dev/null +++ b/leetcode/originData/special-array-i.json @@ -0,0 +1,167 @@ +{ + "data": { + "question": { + "questionId": "3429", + "questionFrontendId": "3151", + "boundTopicId": null, + "title": "Special Array I", + "titleSlug": "special-array-i", + "content": "An array is considered special if every pair of its adjacent elements contains two numbers with different parity.
\n\nYou are given an array of integers nums. Return true if nums is a special array, otherwise, return false.
\n
Example 1:
\n\nInput: nums = [1]
\n\nOutput: true
\n\nExplanation:
\n\nThere is only one element. So the answer is true.
Example 2:
\n\nInput: nums = [2,1,4]
\n\nOutput: true
\n\nExplanation:
\n\nThere is only two pairs: (2,1) and (1,4), and both of them contain numbers with different parity. So the answer is true.
Example 3:
\n\nInput: nums = [4,3,1,6]
\n\nOutput: false
\n\nExplanation:
\n\nnums[1] and nums[2] are both odd. So the answer is false.
\n
Constraints:
\n\n1 <= nums.length <= 1001 <= nums[i] <= 100Compiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour code will be run directly without compiling
\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/sum-of-digit-differences-of-all-pairs.json b/leetcode/originData/sum-of-digit-differences-of-all-pairs.json new file mode 100644 index 00000000..ab1a9c64 --- /dev/null +++ b/leetcode/originData/sum-of-digit-differences-of-all-pairs.json @@ -0,0 +1,187 @@ +{ + "data": { + "question": { + "questionId": "3416", + "questionFrontendId": "3153", + "boundTopicId": null, + "title": "Sum of Digit Differences of All Pairs", + "titleSlug": "sum-of-digit-differences-of-all-pairs", + "content": "You are given an array nums consisting of positive integers where all integers have the same number of digits.
The digit difference between two integers is the count of different digits that are in the same position in the two integers.
\n\nReturn the sum of the digit differences between all pairs of integers in nums.
\n
Example 1:
\n\nInput: nums = [13,23,12]
\n\nOutput: 4
\n\nExplanation:
\nWe have the following:
\n- The digit difference between 13 and 23 is 1.
\n- The digit difference between 13 and 12 is 1.
\n- The digit difference between 23 and 12 is 2.
\nSo the total sum of digit differences between all pairs of integers is 1 + 1 + 2 = 4.
Example 2:
\n\nInput: nums = [10,10,10,10]
\n\nOutput: 0
\n\nExplanation:
\nAll the integers in the array are the same. So the total sum of digit differences between all pairs of integers will be 0.
\n
Constraints:
\n\n2 <= nums.length <= 1051 <= nums[i] < 109nums have the same number of digits.c be the number of occurences of a digit on a position, that will contribute with c * (n - c) to the final answer, where n is the number of integers in nums."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "[13,23,12]",
+ "metaData": "{\n \"name\": \"sumDigitDifferences\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[]\"\n }\n ],\n \"return\": {\n \"type\": \"long\"\n }\n}",
+ "judgerAvailable": true,
+ "judgeType": "large",
+ "mysqlSchemas": [],
+ "enableRunCode": true,
+ "enableTestMode": false,
+ "enableDebugger": true,
+ "envInfo": "{\"cpp\": [\"C++\", \"Compiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour 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/taking-maximum-energy-from-the-mystic-dungeon.json b/leetcode/originData/taking-maximum-energy-from-the-mystic-dungeon.json new file mode 100644 index 00000000..0099dab3 --- /dev/null +++ b/leetcode/originData/taking-maximum-energy-from-the-mystic-dungeon.json @@ -0,0 +1,174 @@ +{ + "data": { + "question": { + "questionId": "3383", + "questionFrontendId": "3147", + "boundTopicId": null, + "title": "Taking Maximum Energy From the Mystic Dungeon", + "titleSlug": "taking-maximum-energy-from-the-mystic-dungeon", + "content": "In a mystic dungeon, n magicians are standing in a line. Each magician has an attribute that gives you energy. Some magicians can give you negative energy, which means taking energy from you.
You have been cursed in such a way that after absorbing energy from magician i, you will be instantly transported to magician (i + k). This process will be repeated until you reach the magician where (i + k) does not exist.
In other words, you will choose a starting point and then teleport with k jumps until you reach the end of the magicians' sequence, absorbing all the energy during the journey.
You are given an array energy and an integer k. Return the maximum possible energy you can gain.
\n
Example 1:
\n\nInput: energy = [5,2,-10,-5,1], k = 3
\n\nOutput: 3
\n\nExplanation: We can gain a total energy of 3 by starting from magician 1 absorbing 2 + 1 = 3.
\nExample 2:
\n\nInput: energy = [-2,-3,-1], k = 2
\n\nOutput: -1
\n\nExplanation: We can gain a total energy of -1 by starting from magician 2.
\n\n
Constraints:
\n\n1 <= energy.length <= 105-1000 <= energy[i] <= 10001 <= k <= energy.length - 1\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 139, + "dislikes": 11, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "[5,2,-10,-5,1]\n3\n[-2,-3,-1]\n2", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Prefix Sum", + "slug": "prefix-sum", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int maximumEnergy(vector
dp[i] denote the energy we gain starting from index i.",
+ "We can notice, that dp[i] = dp[i + k] + energy[i]."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "[5,2,-10,-5,1]\n3",
+ "metaData": "{\n \"name\": \"maximumEnergy\",\n \"params\": [\n {\n \"name\": \"energy\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"k\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}",
+ "judgerAvailable": true,
+ "judgeType": "large",
+ "mysqlSchemas": [],
+ "enableRunCode": true,
+ "enableTestMode": false,
+ "enableDebugger": true,
+ "envInfo": "{\"cpp\": [\"C++\", \"Compiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour 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/valid-word.json b/leetcode/originData/valid-word.json new file mode 100644 index 00000000..c23cd2cf --- /dev/null +++ b/leetcode/originData/valid-word.json @@ -0,0 +1,167 @@ +{ + "data": { + "question": { + "questionId": "3396", + "questionFrontendId": "3136", + "boundTopicId": null, + "title": "Valid Word", + "titleSlug": "valid-word", + "content": "A word is considered valid if:
\n\nYou are given a string word.
Return true if word is valid, otherwise, return false.
Notes:
\n\n'a', 'e', 'i', 'o', 'u', and their uppercases are vowels.\n
Example 1:
\n\nInput: word = "234Adas"
\n\nOutput: true
\n\nExplanation:
\n\nThis word satisfies the conditions.
\nExample 2:
\n\nInput: word = "b3"
\n\nOutput: false
\n\nExplanation:
\n\nThe length of this word is fewer than 3, and does not have a vowel.
\nExample 3:
\n\nInput: word = "a3$e"
\n\nOutput: false
\n\nExplanation:
\n\nThis word contains a '$' character and does not have a consonant.
\n
Constraints:
\n\n1 <= word.length <= 20word consists of English uppercase and lowercase letters, digits, '@', '#', and '$'.Compiled with clang 17 using the latest C++ 20 standard, and libstdc++ provided by GCC 11.
Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\"], \"java\": [\"Java\", \"OpenJDK 21. Using compile arguments: --enable-preview --release 21
Most standard library headers are already included automatically for your convenience.
\\r\\nIncludes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
Python 2.7.12.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\\r\\n\\r\\nNote that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.
\"], \"c\": [\"C\", \"Compiled with gcc 11 using the gnu11 standard.
Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.
Most standard library headers are already included automatically for your convenience.
\\r\\n\\r\\nFor hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:
\\r\\n\\r\\n1. 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\\n2. 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\\n3. 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# 12 with .NET 8 runtime
\"], \"javascript\": [\"JavaScript\", \"Node.js 20.10.0.
Your code is run with --harmony flag, enabling new ES6 features.
lodash.js library is included by default.
\\r\\n\\r\\nFor Priority Queue / Queue data structures, you may use 5.4.0 version of datastructures-js/priority-queue and 4.2.3 version of datastructures-js/queue.
\"], \"ruby\": [\"Ruby\", \"Ruby 3.2
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms
\"], \"swift\": [\"Swift\", \"Swift 5.9.
You may use swift-algorithms 1.2.0 and swift-collections 1.1.0.
\"], \"golang\": [\"Go\", \"Go 1.21
Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library.
\"], \"python3\": [\"Python3\", \"Python 3.11.
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\\nFor Map/TreeMap data structure, you may use sortedcontainers library.
\"], \"scala\": [\"Scala\", \"Scala 3.3.1.
Kotlin 1.9.0.
We are using an experimental compiler provided by JetBrains.
\"], \"rust\": [\"Rust\", \"Rust 1.74.1. Your code will be compiled with opt-level 2.
Supports rand v0.6\\u00a0from crates.io
\"], \"php\": [\"PHP\", \"PHP 8.2.
With bcmath module
\"], \"typescript\": [\"Typescript\", \"TypeScript 5.1.6, Node.js 20.10.0.
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022
Your code is run with --harmony flag, enabling new ES2022 features.
lodash.js library is included by default.
\"], \"racket\": [\"Racket\", \"Racket CS v8.11
\\r\\n\\r\\nUsing #lang racket
Required data/gvector data/queue data/order data/heap automatically for your convenience
Dart 3.2. You may use package collection
\\r\\n\\r\\nYour 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/check-if-grid-satisfies-conditions.html b/leetcode/problem/check-if-grid-satisfies-conditions.html new file mode 100644 index 00000000..8c244090 --- /dev/null +++ b/leetcode/problem/check-if-grid-satisfies-conditions.html @@ -0,0 +1,59 @@ +You are given a 2D matrix grid of size m x n. You need to check if each cell grid[i][j] is:
grid[i][j] == grid[i + 1][j] (if it exists).grid[i][j] != grid[i][j + 1] (if it exists).Return true if all the cells satisfy these conditions, otherwise, return false.
+
Example 1:
+ +Input: grid = [[1,0,2],[1,0,2]]
+ +Output: true
+ +Explanation:
+ +
All the cells in the grid satisfy the conditions.
+Example 2:
+ +Input: grid = [[1,1,1],[0,0,0]]
+ +Output: false
+ +Explanation:
+ +
All cells in the first row are equal.
+Example 3:
+ +Input: grid = [[1],[2],[3]]
+ +Output: false
+ +Explanation:
+ +
Cells in the first column have different values.
++
Constraints:
+ +1 <= n, m <= 100 <= grid[i][j] <= 9You are given a string s.
Your task is to remove all digits by doing this operation repeatedly:
+ +Return the resulting string after removing all digits.
+ ++
Example 1:
+ +Input: s = "abc"
+ +Output: "abc"
+ +Explanation:
+ +There is no digit in the string.
+Example 2:
+ +Input: s = "cb34"
+ +Output: ""
+ +Explanation:
+ +First, we apply the operation on s[2], and s becomes "c4".
Then we apply the operation on s[1], and s becomes "".
+
Constraints:
+ +1 <= s.length <= 100s consists only of lowercase English letters and digits.Given an integer array hours representing times in hours, return an integer denoting the number of pairs i, j where i < j and hours[i] + hours[j] forms a complete day.
A complete day is defined as a time duration that is an exact multiple of 24 hours.
+ +For example, 1 day is 24 hours, 2 days is 48 hours, 3 days is 72 hours, and so on.
+ ++
Example 1:
+ +Input: hours = [12,12,30,24,24]
+ +Output: 2
+ +Explanation:
+ +The pairs of indices that form a complete day are (0, 1) and (3, 4).
Example 2:
+ +Input: hours = [72,48,24,3]
+ +Output: 3
+ +Explanation:
+ +The pairs of indices that form a complete day are (0, 1), (0, 2), and (1, 2).
+
Constraints:
+ +1 <= hours.length <= 1001 <= hours[i] <= 109Given an integer array hours representing times in hours, return an integer denoting the number of pairs i, j where i < j and hours[i] + hours[j] forms a complete day.
A complete day is defined as a time duration that is an exact multiple of 24 hours.
+ +For example, 1 day is 24 hours, 2 days is 48 hours, 3 days is 72 hours, and so on.
+ ++
Example 1:
+ +Input: hours = [12,12,30,24,24]
+ +Output: 2
+ +Explanation: The pairs of indices that form a complete day are (0, 1) and (3, 4).
Example 2:
+ +Input: hours = [72,48,24,3]
+ +Output: 3
+ +Explanation: The pairs of indices that form a complete day are (0, 1), (0, 2), and (1, 2).
+
Constraints:
+ +1 <= hours.length <= 5 * 1051 <= hours[i] <= 109You are given an integer n and a 2D array requirements, where requirements[i] = [endi, cnti] represents the end index and the inversion count of each requirement.
A pair of indices (i, j) from an integer array nums is called an inversion if:
i < j and nums[i] > nums[j]Return the number of permutations perm of [0, 1, 2, ..., n - 1] such that for all requirements[i], perm[0..endi] has exactly cnti inversions.
Since the answer may be very large, return it modulo 109 + 7.
+
Example 1:
+ +Input: n = 3, requirements = [[2,2],[0,0]]
+ +Output: 2
+ +Explanation:
+ +The two permutations are:
+ +[2, 0, 1]
+
+ [2, 0, 1] has inversions (0, 1) and (0, 2).[2] has 0 inversions.[1, 2, 0]
+ [1, 2, 0] has inversions (0, 2) and (1, 2).[1] has 0 inversions.Example 2:
+ +Input: n = 3, requirements = [[2,2],[1,1],[0,0]]
+ +Output: 1
+ +Explanation:
+ +The only satisfying permutation is [2, 0, 1]:
[2, 0, 1] has inversions (0, 1) and (0, 2).[2, 0] has an inversion (0, 1).[2] has 0 inversions.Example 3:
+ +Input: n = 2, requirements = [[0,0],[1,0]]
+ +Output: 1
+ +Explanation:
+ +The only satisfying permutation is [0, 1]:
[0] has 0 inversions.[0, 1] has an inversion (0, 1).+
Constraints:
+ +2 <= n <= 3001 <= requirements.length <= nrequirements[i] = [endi, cnti]0 <= endi <= n - 10 <= cnti <= 400i such that endi == n - 1.endi are unique.You are given an integer array nums. In one operation, you can add or subtract 1 from any element of nums.
Return the minimum number of operations to make all elements of nums divisible by 3.
+
Example 1:
+ +Input: nums = [1,2,3,4]
+ +Output: 3
+ +Explanation:
+ +All array elements can be made divisible by 3 using 3 operations:
+ +Example 2:
+ +Input: nums = [3,6,9]
+ +Output: 0
++
Constraints:
+ +1 <= nums.length <= 501 <= nums[i] <= 50You are given a non-negative integer k. There exists a staircase with an infinite number of stairs, with the lowest stair numbered 0.
Alice has an integer jump, with an initial value of 0. She starts on stair 1 and wants to reach stair k using any number of operations. If she is on stair i, in one operation she can:
i - 1. This operation cannot be used consecutively or on stair 0.i + 2jump. And then, jump becomes jump + 1.Return the total number of ways Alice can reach stair k.
Note that it is possible that Alice reaches the stair k, and performs some operations to reach the stair k again.
+
Example 1:
+ +Input: k = 0
+ +Output: 2
+ +Explanation:
+ +The 2 possible ways of reaching stair 0 are:
+ +Example 2:
+ +Input: k = 1
+ +Output: 4
+ +Explanation:
+ +The 4 possible ways of reaching stair 1 are:
+ ++
Constraints:
+ +0 <= k <= 109You are given an integer array nums, an integer array queries, and an integer x.
For each queries[i], you need to find the index of the queries[i]th occurrence of x in the nums array. If there are fewer than queries[i] occurrences of x, the answer should be -1 for that query.
Return an integer array answer containing the answers to all queries.
+
Example 1:
+ +Input: nums = [1,3,1,7], queries = [1,3,2,4], x = 1
+ +Output: [0,-1,2,-1]
+ +Explanation:
+ +nums, so the answer is -1.nums, so the answer is -1.Example 2:
+ +Input: nums = [1,2,3], queries = [10], x = 5
+ +Output: [-1]
+ +Explanation:
+ +nums, so the answer is -1.+
Constraints:
+ +1 <= nums.length, queries.length <= 1051 <= queries[i] <= 1051 <= nums[i], x <= 104A powerful array for an integer x is the shortest sorted array of powers of two that sum up to x. For example, the powerful array for 11 is [1, 2, 8].
The array big_nums is created by concatenating the powerful arrays for every positive integer i in ascending order: 1, 2, 3, and so forth. Thus, big_nums starts as [1, 2, 1, 2, 4, 1, 4, 2, 4, 1, 2, 4, 8, ...].
You are given a 2D integer matrix queries, where for queries[i] = [fromi, toi, modi] you should calculate (big_nums[fromi] * big_nums[fromi + 1] * ... * big_nums[toi]) % modi.
Return an integer array answer such that answer[i] is the answer to the ith query.
+
Example 1:
+ +Input: queries = [[1,3,7]]
+ +Output: [4]
+ +Explanation:
+ +There is one query.
+ +big_nums[1..3] = [2,1,2]. The product of them is 4. The remainder of 4 under 7 is 4.
Example 2:
+ +Input: queries = [[2,5,3],[7,7,4]]
+ +Output: [2,2]
+ +Explanation:
+ +There are two queries.
+ +First query: big_nums[2..5] = [1,2,4,1]. The product of them is 8. The remainder of 8 under 3 is 2.
Second query: big_nums[7] = 2. The remainder of 2 under 4 is 2.
+
Constraints:
+ +1 <= queries.length <= 500queries[i].length == 30 <= queries[i][0] <= queries[i][1] <= 10151 <= queries[i][2] <= 105You are given an array nums and an integer k. You need to find a subarray of nums such that the absolute difference between k and the bitwise OR of the subarray elements is as small as possible. In other words, select a subarray nums[l..r] such that |k - (nums[l] OR nums[l + 1] ... OR nums[r])| is minimum.
Return the minimum possible value of the absolute difference.
+ +A subarray is a contiguous non-empty sequence of elements within an array.
+ ++
Example 1:
+ +Input: nums = [1,2,4,5], k = 3
+ +Output: 0
+ +Explanation:
+ +The subarray nums[0..1] has OR value 3, which gives the minimum absolute difference |3 - 3| = 0.
Example 2:
+ +Input: nums = [1,3,1,3], k = 2
+ +Output: 1
+ +Explanation:
+ +The subarray nums[1..1] has OR value 3, which gives the minimum absolute difference |3 - 2| = 1.
Example 3:
+ +Input: nums = [1], k = 10
+ +Output: 9
+ +Explanation:
+ +There is a single subarray with OR value 1, which gives the minimum absolute difference |10 - 1| = 9.
+
Constraints:
+ +1 <= nums.length <= 1051 <= nums[i] <= 1091 <= k <= 109You are given two positive integers n and k. There are n children numbered from 0 to n - 1 standing in a queue in order from left to right.
Initially, child 0 holds a ball and the direction of passing the ball is towards the right direction. After each second, the child holding the ball passes it to the child next to them. Once the ball reaches either end of the line, i.e. child 0 or child n - 1, the direction of passing is reversed.
Return the number of the child who receives the ball after k seconds.
+
Example 1:
+ +Input: n = 3, k = 5
+ +Output: 1
+ +Explanation:
+ +| Time elapsed | +Children | +
|---|---|
0 |
+ [0, 1, 2] |
+
1 |
+ [0, 1, 2] |
+
2 |
+ [0, 1, 2] |
+
3 |
+ [0, 1, 2] |
+
4 |
+ [0, 1, 2] |
+
5 |
+ [0, 1, 2] |
+
Example 2:
+ +Input: n = 5, k = 6
+ +Output: 2
+ +Explanation:
+ +| Time elapsed | +Children | +
|---|---|
0 |
+ [0, 1, 2, 3, 4] |
+
1 |
+ [0, 1, 2, 3, 4] |
+
2 |
+ [0, 1, 2, 3, 4] |
+
3 |
+ [0, 1, 2, 3, 4] |
+
4 |
+ [0, 1, 2, 3, 4] |
+
5 |
+ [0, 1, 2, 3, 4] |
+
6 |
+ [0, 1, 2, 3, 4] |
+
Example 3:
+ +Input: n = 4, k = 2
+ +Output: 2
+ +Explanation:
+ +| Time elapsed | +Children | +
|---|---|
0 |
+ [0, 1, 2, 3] |
+
1 |
+ [0, 1, 2, 3] |
+
2 |
+ [0, 1, 2, 3] |
+
+
Constraints:
+ +2 <= n <= 501 <= k <= 50A competition consists of n players numbered from 0 to n - 1.
You are given an integer array skills of size n and a positive integer k, where skills[i] is the skill level of player i. All integers in skills are unique.
All players are standing in a queue in order from player 0 to player n - 1.
The competition process is as follows:
+ +The winner of the competition is the first player who wins k games in a row.
Return the initial index of the winning player.
+ ++
Example 1:
+ +Input: skills = [4,2,6,3,9], k = 2
+ +Output: 2
+ +Explanation:
+ +Initially, the queue of players is [0,1,2,3,4]. The following process happens:
[0,2,3,4,1].[2,3,4,1,0].[2,4,1,0,3].Player 2 won k = 2 games in a row, so the winner is player 2.
Example 2:
+ +Input: skills = [2,5,4], k = 3
+ +Output: 1
+ +Explanation:
+ +Initially, the queue of players is [0,1,2]. The following process happens:
[1,2,0].[1,0,2].[1,2,0].Player 1 won k = 3 games in a row, so the winner is player 1.
+
Constraints:
+ +n == skills.length2 <= n <= 1051 <= k <= 1091 <= skills[i] <= 106skills are unique.You are given an integer array nums and a non-negative integer k. A sequence of integers seq is called good if there are at most k indices i in the range [0, seq.length - 2] such that seq[i] != seq[i + 1].
Return the maximum possible length of a good subsequence of nums.
+
Example 1:
+ +Input: nums = [1,2,1,1,3], k = 2
+ +Output: 4
+ +Explanation:
+ +The maximum length subsequence is [1,2,1,1,3].
Example 2:
+ +Input: nums = [1,2,3,4,5,1], k = 0
+ +Output: 2
+ +Explanation:
+ +The maximum length subsequence is [1,2,3,4,5,1].
+
Constraints:
+ +1 <= nums.length <= 5001 <= nums[i] <= 1090 <= k <= min(nums.length, 25)You are given an integer array nums and a non-negative integer k. A sequence of integers seq is called good if there are at most k indices i in the range [0, seq.length - 2] such that seq[i] != seq[i + 1].
Return the maximum possible length of a good subsequence of nums.
+
Example 1:
+ +Input: nums = [1,2,1,1,3], k = 2
+ +Output: 4
+ +Explanation:
+ +The maximum length subsequence is [1,2,1,1,3].
Example 2:
+ +Input: nums = [1,2,3,4,5,1], k = 0
+ +Output: 2
+ +Explanation:
+ +The maximum length subsequence is [1,2,3,4,5,1].
+
Constraints:
+ +1 <= nums.length <= 5 * 1031 <= nums[i] <= 1090 <= k <= min(50, nums.length)You are given a 2D binary array grid. Find a rectangle with horizontal and vertical sides with the smallest area, such that all the 1's in grid lie inside this rectangle.
Return the minimum possible area of the rectangle.
+ ++
Example 1:
+ +Input: grid = [[0,1,0],[1,0,1]]
+ +Output: 6
+ +Explanation:
+ +
The smallest rectangle has a height of 2 and a width of 3, so it has an area of 2 * 3 = 6.
Example 2:
+ +Input: grid = [[1,0],[0,0]]
+ +Output: 1
+ +Explanation:
+ +
The smallest rectangle has both height and width 1, so its area is 1 * 1 = 1.
+
Constraints:
+ +1 <= grid.length, grid[i].length <= 1000grid[i][j] is either 0 or 1.grid.You are given a 2D binary array grid. You need to find 3 non-overlapping rectangles having non-zero areas with horizontal and vertical sides such that all the 1's in grid lie inside these rectangles.
Return the minimum possible sum of the area of these rectangles.
+ +Note that the rectangles are allowed to touch.
+ ++
Example 1:
+ +Input: grid = [[1,0,1],[1,1,1]]
+ +Output: 5
+ +Explanation:
+ +
(0, 0) and (1, 0) are covered by a rectangle of area 2.(0, 2) and (1, 2) are covered by a rectangle of area 2.(1, 1) is covered by a rectangle of area 1.Example 2:
+ +Input: grid = [[1,0,1,0],[0,1,0,1]]
+ +Output: 5
+ +Explanation:
+ +
(0, 0) and (0, 2) are covered by a rectangle of area 3.(1, 1) is covered by a rectangle of area 1.(1, 3) is covered by a rectangle of area 1.+
Constraints:
+ +1 <= grid.length, grid[i].length <= 30grid[i][j] is either 0 or 1.grid.You are given two integers n and k.
Initially, you start with an array a of n integers where a[i] = 1 for all 0 <= i <= n - 1. After each second, you simultaneously update each element to be the sum of all its preceding elements plus the element itself. For example, after one second, a[0] remains the same, a[1] becomes a[0] + a[1], a[2] becomes a[0] + a[1] + a[2], and so on.
Return the value of a[n - 1] after k seconds.
Since the answer may be very large, return it modulo 109 + 7.
+
Example 1:
+ +Input: n = 4, k = 5
+ +Output: 56
+ +Explanation:
+ +| Second | +State After | +
|---|---|
| 0 | +[1,1,1,1] | +
| 1 | +[1,2,3,4] | +
| 2 | +[1,3,6,10] | +
| 3 | +[1,4,10,20] | +
| 4 | +[1,5,15,35] | +
| 5 | +[1,6,21,56] | +
Example 2:
+ +Input: n = 5, k = 3
+ +Output: 35
+ +Explanation:
+ +| Second | +State After | +
|---|---|
| 0 | +[1,1,1,1,1] | +
| 1 | +[1,2,3,4,5] | +
| 2 | +[1,3,6,10,15] | +
| 3 | +[1,4,10,20,35] | +
+
Constraints:
+ +1 <= n, k <= 1000You are given 2 integer arrays nums1 and nums2 of lengths n and m respectively. You are also given a positive integer k.
A pair (i, j) is called good if nums1[i] is divisible by nums2[j] * k (0 <= i <= n - 1, 0 <= j <= m - 1).
Return the total number of good pairs.
+ ++
Example 1:
+ +Input: nums1 = [1,3,4], nums2 = [1,3,4], k = 1
+ +Output: 5
+ +Explanation:
+The 5 good pairs are(0, 0), (1, 0), (1, 1), (2, 0), and (2, 2).Example 2:
+ +Input: nums1 = [1,2,4,12], nums2 = [2,4], k = 3
+ +Output: 2
+ +Explanation:
+ +The 2 good pairs are (3, 0) and (3, 1).
+
Constraints:
+ +1 <= n, m <= 501 <= nums1[i], nums2[j] <= 501 <= k <= 50You are given an array nums, where each number in the array appears either once or twice.
Return the bitwise XOR of all the numbers that appear twice in the array, or 0 if no number appears twice.
+
Example 1:
+ +Input: nums = [1,2,1,3]
+ +Output: 1
+ +Explanation:
+ +The only number that appears twice in nums is 1.
Example 2:
+ +Input: nums = [1,2,3]
+ +Output: 0
+ +Explanation:
+ +No number appears twice in nums.
Example 3:
+ +Input: nums = [1,2,2,1]
+ +Output: 3
+ +Explanation:
+ +Numbers 1 and 2 appeared twice. 1 XOR 2 == 3.
+
Constraints:
+ +1 <= nums.length <= 501 <= nums[i] <= 50nums appears either once or twice.You are given an integer array nums with length n.
The cost of a subarray nums[l..r], where 0 <= l <= r < n, is defined as:
cost(l, r) = nums[l] - nums[l + 1] + ... + nums[r] * (−1)r − l
Your task is to split nums into subarrays such that the total cost of the subarrays is maximized, ensuring each element belongs to exactly one subarray.
Formally, if nums is split into k subarrays, where k > 1, at indices i1, i2, ..., ik − 1, where 0 <= i1 < i2 < ... < ik - 1 < n - 1, then the total cost will be:
cost(0, i1) + cost(i1 + 1, i2) + ... + cost(ik − 1 + 1, n − 1)
Return an integer denoting the maximum total cost of the subarrays after splitting the array optimally.
+ +Note: If nums is not split into subarrays, i.e. k = 1, the total cost is simply cost(0, n - 1).
+
Example 1:
+ +Input: nums = [1,-2,3,4]
+ +Output: 10
+ +Explanation:
+ +One way to maximize the total cost is by splitting [1, -2, 3, 4] into subarrays [1, -2, 3] and [4]. The total cost will be (1 + 2 + 3) + 4 = 10.
Example 2:
+ +Input: nums = [1,-1,1,-1]
+ +Output: 4
+ +Explanation:
+ +One way to maximize the total cost is by splitting [1, -1, 1, -1] into subarrays [1, -1] and [1, -1]. The total cost will be (1 + 1) + (1 + 1) = 4.
Example 3:
+ +Input: nums = [0]
+ +Output: 0
+ +Explanation:
+ +We cannot split the array further, so the answer is 0.
+Example 4:
+ +Input: nums = [1,-1]
+ +Output: 2
+ +Explanation:
+ +Selecting the whole array gives a total cost of 1 + 1 = 2, which is the maximum.
+
Constraints:
+ +1 <= nums.length <= 105-109 <= nums[i] <= 109You are given an m x n matrix grid consisting of positive integers. You can move from a cell in the matrix to any other cell that is either to the bottom or to the right (not necessarily adjacent). The score of a move from a cell with the value c1 to a cell with the value c2 is c2 - c1.
You can start at any cell, and you have to make at least one move.
+ +Return the maximum total score you can achieve.
+ ++
Example 1:
+
+Input: grid = [[9,5,7,3],[8,9,6,1],[6,7,14,3],[2,5,3,1]]
+ +Output: 9
+ +Explanation: We start at the cell (0, 1), and we perform the following moves:
+- Move from the cell (0, 1) to (2, 1) with a score of 7 - 5 = 2.
+- Move from the cell (2, 1) to (2, 2) with a score of 14 - 7 = 7.
+The total score is 2 + 7 = 9.
Example 2:
+ +
Input: grid = [[4,3,2],[3,2,1]]
+ +Output: -1
+ +Explanation: We start at the cell (0, 0), and we perform one move: (0, 0) to (0, 1). The score is 3 - 4 = -1.
+
Constraints:
+ +m == grid.lengthn == grid[i].length2 <= m, n <= 10004 <= m * n <= 1051 <= grid[i][j] <= 105You are given a 2D array points and a string s where, points[i] represents the coordinates of point i, and s[i] represents the tag of point i.
A valid square is a square centered at the origin (0, 0), has edges parallel to the axes, and does not contain two points with the same tag.
Return the maximum number of points contained in a valid square.
+ +Note:
+ ++
Example 1:
+ +
Input: points = [[2,2],[-1,-2],[-4,4],[-3,1],[3,-3]], s = "abdca"
+ +Output: 2
+ +Explanation:
+ +The square of side length 4 covers two points points[0] and points[1].
Example 2:
+ +
Input: points = [[1,1],[-2,-2],[-2,2]], s = "abb"
+ +Output: 1
+ +Explanation:
+ +The square of side length 2 covers one point, which is points[0].
Example 3:
+ +Input: points = [[1,1],[-1,-1],[2,-2]], s = "ccd"
+ +Output: 0
+ +Explanation:
+ +It's impossible to make any valid squares centered at the origin such that it covers only one point among points[0] and points[1].
+
Constraints:
+ +1 <= s.length, points.length <= 105points[i].length == 2-109 <= points[i][0], points[i][1] <= 109s.length == points.lengthpoints consists of distinct coordinates.s consists only of lowercase English letters.You are given an integer array nums.
Return an integer that is the maximum distance between the indices of two (not necessarily different) prime numbers in nums.
+
Example 1:
+ +Input: nums = [4,2,9,5,3]
+ +Output: 3
+ +Explanation: nums[1], nums[3], and nums[4] are prime. So the answer is |4 - 1| = 3.
Example 2:
+ +Input: nums = [4,8,2,8]
+ +Output: 0
+ +Explanation: nums[2] is prime. Because there is just one prime number, the answer is |2 - 2| = 0.
+
Constraints:
+ +1 <= nums.length <= 3 * 1051 <= nums[i] <= 100nums is at least one.You are given an array nums consisting of integers. You are also given a 2D array queries, where queries[i] = [posi, xi].
For query i, we first set nums[posi] equal to xi, then we calculate the answer to query i which is the maximum sum of a subsequence of nums where no two adjacent elements are selected.
Return the sum of the answers to all queries.
+ +Since the final answer may be very large, return it modulo 109 + 7.
A subsequence is an array that can be derived from another array by deleting some or no elements without changing the order of the remaining elements.
+ ++
Example 1:
+ +Input: nums = [3,5,9], queries = [[1,-2],[0,-3]]
+ +Output: 21
+ +Explanation:
+After the 1st query, nums = [3,-2,9] and the maximum sum of a subsequence with non-adjacent elements is 3 + 9 = 12.
+After the 2nd query, nums = [-3,-2,9] and the maximum sum of a subsequence with non-adjacent elements is 9.
Example 2:
+ +Input: nums = [0,-1], queries = [[0,-5]]
+ +Output: 0
+ +Explanation:
+After the 1st query, nums = [-5,-1] and the maximum sum of a subsequence with non-adjacent elements is 0 (choosing an empty subsequence).
+
Constraints:
+ +1 <= nums.length <= 5 * 104-105 <= nums[i] <= 1051 <= queries.length <= 5 * 104queries[i] == [posi, xi]0 <= posi <= nums.length - 1-105 <= xi <= 105A magician has various spells.
+ +You are given an array power, where each element represents the damage of a spell. Multiple spells can have the same damage value.
It is a known fact that if a magician decides to cast a spell with a damage of power[i], they cannot cast any spell with a damage of power[i] - 2, power[i] - 1, power[i] + 1, or power[i] + 2.
Each spell can be cast only once.
+ +Return the maximum possible total damage that a magician can cast.
+ ++
Example 1:
+ +Input: power = [1,1,3,4]
+ +Output: 6
+ +Explanation:
+ +The maximum possible damage of 6 is produced by casting spells 0, 1, 3 with damage 1, 1, 4.
+Example 2:
+ +Input: power = [7,1,6,6]
+ +Output: 13
+ +Explanation:
+ +The maximum possible damage of 13 is produced by casting spells 1, 2, 3 with damage 1, 6, 6.
++
Constraints:
+ +1 <= power.length <= 1051 <= power[i] <= 109You are given an integer array rewardValues of length n, representing the values of rewards.
Initially, your total reward x is 0, and all indices are unmarked. You are allowed to perform the following operation any number of times:
i from the range [0, n - 1].rewardValues[i] is greater than your current total reward x, then add rewardValues[i] to x (i.e., x = x + rewardValues[i]), and mark the index i.Return an integer denoting the maximum total reward you can collect by performing the operations optimally.
+ ++
Example 1:
+ +Input: rewardValues = [1,1,3,3]
+ +Output: 4
+ +Explanation:
+ +During the operations, we can choose to mark the indices 0 and 2 in order, and the total reward will be 4, which is the maximum.
+Example 2:
+ +Input: rewardValues = [1,6,4,3,2]
+ +Output: 11
+ +Explanation:
+ +Mark the indices 0, 2, and 1 in order. The total reward will then be 11, which is the maximum.
++
Constraints:
+ +1 <= rewardValues.length <= 20001 <= rewardValues[i] <= 2000You are given an integer array rewardValues of length n, representing the values of rewards.
Initially, your total reward x is 0, and all indices are unmarked. You are allowed to perform the following operation any number of times:
i from the range [0, n - 1].rewardValues[i] is greater than your current total reward x, then add rewardValues[i] to x (i.e., x = x + rewardValues[i]), and mark the index i.Return an integer denoting the maximum total reward you can collect by performing the operations optimally.
+ ++
Example 1:
+ +Input: rewardValues = [1,1,3,3]
+ +Output: 4
+ +Explanation:
+ +During the operations, we can choose to mark the indices 0 and 2 in order, and the total reward will be 4, which is the maximum.
+Example 2:
+ +Input: rewardValues = [1,6,4,3,2]
+ +Output: 11
+ +Explanation:
+ +Mark the indices 0, 2, and 1 in order. The total reward will then be 11, which is the maximum.
++
Constraints:
+ +1 <= rewardValues.length <= 5 * 1041 <= rewardValues[i] <= 5 * 104You have an array of floating point numbers averages which is initially empty. You are given an array nums of n integers where n is even.
You repeat the following procedure n / 2 times:
minElement, and the largest element maxElement, from nums.(minElement + maxElement) / 2 to averages.Return the minimum element in averages.
+
Example 1:
+ +Input: nums = [7,8,3,4,15,13,4,1]
+ +Output: 5.5
+ +Explanation:
+ +| step | +nums | +averages | +
|---|---|---|
| 0 | +[7,8,3,4,15,13,4,1] | +[] | +
| 1 | +[7,8,3,4,13,4] | +[8] | +
| 2 | +[7,8,4,4] | +[8,8] | +
| 3 | +[7,4] | +[8,8,6] | +
| 4 | +[] | +[8,8,6,5.5] | +
Example 2:
+ +Input: nums = [1,9,8,3,10,5]
+ +Output: 5.5
+ +Explanation:
+ +| step | +nums | +averages | +
|---|---|---|
| 0 | +[1,9,8,3,10,5] | +[] | +
| 1 | +[9,8,3,5] | +[5.5] | +
| 2 | +[8,5] | +[5.5,6] | +
| 3 | +[] | +[5.5,6,6.5] | +
Example 3:
+ +Input: nums = [1,2,3,7,8,9]
+ +Output: 5.0
+ +Explanation:
+ +| step | +nums | +averages | +
|---|---|---|
| 0 | +[1,2,3,7,8,9] | +[] | +
| 1 | +[2,3,7,8] | +[5] | +
| 2 | +[3,7] | +[5,5] | +
| 3 | +[] | +[5,5,5] | +
+
Constraints:
+ +2 <= n == nums.length <= 50n is even.1 <= nums[i] <= 50You are given a string s. Simulate events at each second i:
s[i] == 'E', a person enters the waiting room and takes one of the chairs in it.s[i] == 'L', a person leaves the waiting room, freeing up a chair.Return the minimum number of chairs needed so that a chair is available for every person who enters the waiting room given that it is initially empty.
+ ++
Example 1:
+ +Input: s = "EEEEEEE"
+ +Output: 7
+ +Explanation:
+ +After each second, a person enters the waiting room and no person leaves it. Therefore, a minimum of 7 chairs is needed.
+Example 2:
+ +Input: s = "ELELEEL"
+ +Output: 2
+ +Explanation:
+ +Let's consider that there are 2 chairs in the waiting room. The table below shows the state of the waiting room at each second.
+| Second | +Event | +People in the Waiting Room | +Available Chairs | +
|---|---|---|---|
| 0 | +Enter | +1 | +1 | +
| 1 | +Leave | +0 | +2 | +
| 2 | +Enter | +1 | +1 | +
| 3 | +Leave | +0 | +2 | +
| 4 | +Enter | +1 | +1 | +
| 5 | +Enter | +2 | +0 | +
| 6 | +Leave | +1 | +1 | +
Example 3:
+ +Input: s = "ELEELEELLL"
+ +Output: 3
+ +Explanation:
+ +Let's consider that there are 3 chairs in the waiting room. The table below shows the state of the waiting room at each second.
+| Second | +Event | +People in the Waiting Room | +Available Chairs | +
|---|---|---|---|
| 0 | +Enter | +1 | +2 | +
| 1 | +Leave | +0 | +3 | +
| 2 | +Enter | +1 | +2 | +
| 3 | +Enter | +2 | +1 | +
| 4 | +Leave | +1 | +2 | +
| 5 | +Enter | +2 | +1 | +
| 6 | +Enter | +3 | +0 | +
| 7 | +Leave | +2 | +1 | +
| 8 | +Leave | +1 | +2 | +
| 9 | +Leave | +0 | +3 | +
+
Constraints:
+ +1 <= s.length <= 50s consists only of the letters 'E' and 'L'.s represents a valid sequence of entries and exits.You are given a string word of size n, and an integer k such that k divides n.
In one operation, you can pick any two indices i and j, that are divisible by k, then replace the substring of length k starting at i with the substring of length k starting at j. That is, replace the substring word[i..i + k - 1] with the substring word[j..j + k - 1].
Return the minimum number of operations required to make word k-periodic.
We say that word is k-periodic if there is some string s of length k such that word can be obtained by concatenating s an arbitrary number of times. For example, if word == “ababab”, then word is 2-periodic for s = "ab".
+
Example 1:
+ +Input: word = "leetcodeleet", k = 4
+ +Output: 1
+ +Explanation:
+ +We can obtain a 4-periodic string by picking i = 4 and j = 0. After this operation, word becomes equal to "leetleetleet".
+Example 2:
+ +Input: word = "leetcoleet", k = 2
+ +Output: 3
+ +Explanation:
+ +We can obtain a 2-periodic string by applying the operations in the table below.
+ +| i | +j | +word | +
|---|---|---|
| 0 | +2 | +etetcoleet | +
| 4 | +0 | +etetetleet | +
| 6 | +0 | +etetetetet | +
+
Constraints:
+ +1 <= n == word.length <= 1051 <= k <= word.lengthk divides word.length.word consists only of lowercase English letters.You are given a binary array nums.
You can do the following operation on the array any number of times (possibly zero):
+ +Flipping an element means changing its value from 0 to 1, and from 1 to 0.
+ +Return the minimum number of operations required to make all elements in nums equal to 1. If it is impossible, return -1.
+
Example 1:
+ +Input: nums = [0,1,1,1,0,0]
+ +Output: 3
+ +Explanation:
+We can do the following operations:
nums = [1,0,0,1,0,0].nums = [1,1,1,0,0,0].nums = [1,1,1,1,1,1].Example 2:
+ +Input: nums = [0,1,1,1]
+ +Output: -1
+ +Explanation:
+It is impossible to make all elements equal to 1.
+
Constraints:
+ +3 <= nums.length <= 1050 <= nums[i] <= 1You are given a binary array nums.
You can do the following operation on the array any number of times (possibly zero):
+ +i from the array and flip all the elements from index i to the end of the array.Flipping an element means changing its value from 0 to 1, and from 1 to 0.
+ +Return the minimum number of operations required to make all elements in nums equal to 1.
+
Example 1:
+ +Input: nums = [0,1,1,0,1]
+ +Output: 4
+ +Explanation:
+We can do the following operations:
i = 1. The resulting array will be nums = [0,0,0,1,0].i = 0. The resulting array will be nums = [1,1,1,0,1].i = 4. The resulting array will be nums = [1,1,1,0,0].i = 3. The resulting array will be nums = [1,1,1,1,1].Example 2:
+ +Input: nums = [1,0,0,0]
+ +Output: 1
+ +Explanation:
+We can do the following operation:
i = 1. The resulting array will be nums = [1,1,1,1].+
Constraints:
+ +1 <= nums.length <= 1050 <= nums[i] <= 1A peak in an array arr is an element that is greater than its previous and next element in arr.
You are given an integer array nums and a 2D integer array queries.
You have to process queries of two types:
+ +queries[i] = [1, li, ri], determine the count of peak elements in the subarray nums[li..ri].queries[i] = [2, indexi, vali], change nums[indexi] to vali.Return an array answer containing the results of the queries of the first type in order.
Notes:
+ ++
Example 1:
+ +Input: nums = [3,1,4,2,5], queries = [[2,3,4],[1,0,4]]
+ +Output: [0]
+ +Explanation:
+ +First query: We change nums[3] to 4 and nums becomes [3,1,4,4,5].
Second query: The number of peaks in the [3,1,4,4,5] is 0.
Example 2:
+ +Input: nums = [4,1,4,2,1,5], queries = [[2,2,4],[1,0,2],[1,0,4]]
+ +Output: [0,1]
+ +Explanation:
+ +First query: nums[2] should become 4, but it is already set to 4.
Second query: The number of peaks in the [4,1,4] is 0.
Third query: The second 4 is a peak in the [4,1,4,2,1].
+
Constraints:
+ +3 <= nums.length <= 1051 <= nums[i] <= 1051 <= queries.length <= 105queries[i][0] == 1 or queries[i][0] == 2i that:
+ queries[i][0] == 1: 0 <= queries[i][1] <= queries[i][2] <= nums.length - 1queries[i][0] == 2: 0 <= queries[i][1] <= nums.length - 1, 1 <= queries[i][2] <= 105You are given two strings s and t such that every character occurs at most once in s and t is a permutation of s.
The permutation difference between s and t is defined as the sum of the absolute difference between the index of the occurrence of each character in s and the index of the occurrence of the same character in t.
Return the permutation difference between s and t.
+
Example 1:
+ +Input: s = "abc", t = "bac"
+ +Output: 2
+ +Explanation:
+ +For s = "abc" and t = "bac", the permutation difference of s and t is equal to the sum of:
"a" in s and the index of the occurrence of "a" in t."b" in s and the index of the occurrence of "b" in t."c" in s and the index of the occurrence of "c" in t.That is, the permutation difference between s and t is equal to |0 - 1| + |2 - 2| + |1 - 0| = 2.
Example 2:
+ +Input: s = "abcde", t = "edbac"
+ +Output: 12
+ +Explanation: The permutation difference between s and t is equal to |0 - 3| + |1 - 2| + |2 - 4| + |3 - 1| + |4 - 0| = 12.
+
Constraints:
+ +1 <= s.length <= 26s.t is a permutation of s.s consists only of lowercase English letters.An array is considered special if every pair of its adjacent elements contains two numbers with different parity.
+ +You are given an array of integers nums. Return true if nums is a special array, otherwise, return false.
+
Example 1:
+ +Input: nums = [1]
+ +Output: true
+ +Explanation:
+ +There is only one element. So the answer is true.
Example 2:
+ +Input: nums = [2,1,4]
+ +Output: true
+ +Explanation:
+ +There is only two pairs: (2,1) and (1,4), and both of them contain numbers with different parity. So the answer is true.
Example 3:
+ +Input: nums = [4,3,1,6]
+ +Output: false
+ +Explanation:
+ +nums[1] and nums[2] are both odd. So the answer is false.
+
Constraints:
+ +1 <= nums.length <= 1001 <= nums[i] <= 100You are given an array nums consisting of positive integers where all integers have the same number of digits.
The digit difference between two integers is the count of different digits that are in the same position in the two integers.
+ +Return the sum of the digit differences between all pairs of integers in nums.
+
Example 1:
+ +Input: nums = [13,23,12]
+ +Output: 4
+ +Explanation:
+We have the following:
+- The digit difference between 13 and 23 is 1.
+- The digit difference between 13 and 12 is 1.
+- The digit difference between 23 and 12 is 2.
+So the total sum of digit differences between all pairs of integers is 1 + 1 + 2 = 4.
Example 2:
+ +Input: nums = [10,10,10,10]
+ +Output: 0
+ +Explanation:
+All the integers in the array are the same. So the total sum of digit differences between all pairs of integers will be 0.
+
Constraints:
+ +2 <= nums.length <= 1051 <= nums[i] < 109nums have the same number of digits.In a mystic dungeon, n magicians are standing in a line. Each magician has an attribute that gives you energy. Some magicians can give you negative energy, which means taking energy from you.
You have been cursed in such a way that after absorbing energy from magician i, you will be instantly transported to magician (i + k). This process will be repeated until you reach the magician where (i + k) does not exist.
In other words, you will choose a starting point and then teleport with k jumps until you reach the end of the magicians' sequence, absorbing all the energy during the journey.
You are given an array energy and an integer k. Return the maximum possible energy you can gain.
+
Example 1:
+ +Input: energy = [5,2,-10,-5,1], k = 3
+ +Output: 3
+ +Explanation: We can gain a total energy of 3 by starting from magician 1 absorbing 2 + 1 = 3.
+Example 2:
+ +Input: energy = [-2,-3,-1], k = 2
+ +Output: -1
+ +Explanation: We can gain a total energy of -1 by starting from magician 2.
++
Constraints:
+ +1 <= energy.length <= 105-1000 <= energy[i] <= 10001 <= k <= energy.length - 1+ \ No newline at end of file diff --git a/leetcode/problem/valid-word.html b/leetcode/problem/valid-word.html new file mode 100644 index 00000000..8aebb43c --- /dev/null +++ b/leetcode/problem/valid-word.html @@ -0,0 +1,64 @@ +
A word is considered valid if:
+ +You are given a string word.
Return true if word is valid, otherwise, return false.
Notes:
+ +'a', 'e', 'i', 'o', 'u', and their uppercases are vowels.+
Example 1:
+ +Input: word = "234Adas"
+ +Output: true
+ +Explanation:
+ +This word satisfies the conditions.
+Example 2:
+ +Input: word = "b3"
+ +Output: false
+ +Explanation:
+ +The length of this word is fewer than 3, and does not have a vowel.
+Example 3:
+ +Input: word = "a3$e"
+ +Output: false
+ +Explanation:
+ +This word contains a '$' character and does not have a consonant.
+
Constraints:
+ +1 <= word.length <= 20word consists of English uppercase and lowercase letters, digits, '@', '#', and '$'.