update

leetcode/originData/minimum-cost-homecoming-of-a-robot-in-a-grid.json

@@ -11,8 +11,8 @@
             "translatedContent": null,
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 268,
-            "dislikes": 48,
+            "likes": 287,
+            "dislikes": 50,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Unique Paths\", \"titleSlug\": \"unique-paths\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Minimum Path Sum\", \"titleSlug\": \"minimum-path-sum\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Bomb Enemy\", \"titleSlug\": \"bomb-enemy\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Count Square Submatrices with All Ones\", \"titleSlug\": \"count-square-submatrices-with-all-ones\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
             "exampleTestcases": "[1,0]\n[2,3]\n[5,4,3]\n[8,2,6,7]\n[0,0]\n[0,0]\n[5]\n[26]",
@@ -149,7 +149,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"7.7K\", \"totalSubmission\": \"15.5K\", \"totalAcceptedRaw\": 7710, \"totalSubmissionRaw\": 15452, \"acRate\": \"49.9%\"}",
+            "stats": "{\"totalAccepted\": \"8.1K\", \"totalSubmission\": \"16.2K\", \"totalAcceptedRaw\": 8121, \"totalSubmissionRaw\": 16225, \"acRate\": \"50.1%\"}",
             "hints": [
                 "Irrespective of what path the robot takes, it will have to traverse all the rows between startRow and homeRow and all the columns between startCol and homeCol.",
                 "Hence, making any other move other than traversing the required rows and columns will potentially incur more cost which can be avoided."