update

leetcode/originData/reverse-nodes-in-even-length-groups.json

@@ -11,8 +11,8 @@
             "translatedContent": null,
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 163,
-            "dislikes": 185,
+            "likes": 182,
+            "dislikes": 195,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Reverse Nodes in k-Group\", \"titleSlug\": \"reverse-nodes-in-k-group\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Reverse Linked List\", \"titleSlug\": \"reverse-linked-list\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
             "exampleTestcases": "[5,2,6,3,9,1,7,3,8,4]\n[1,1,0,6]\n[1,1,0,6,5]",
@@ -137,7 +137,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"9K\", \"totalSubmission\": \"18.1K\", \"totalAcceptedRaw\": 9043, \"totalSubmissionRaw\": 18098, \"acRate\": \"50.0%\"}",
+            "stats": "{\"totalAccepted\": \"9.5K\", \"totalSubmission\": \"18.9K\", \"totalAcceptedRaw\": 9503, \"totalSubmissionRaw\": 18858, \"acRate\": \"50.4%\"}",
             "hints": [
                 "Consider the list structure ...A → (B → ... → C) → D..., where the nodes between B and C (inclusive) form a group, A is the last node of the previous group, and D is the first node of the next group. How can you utilize this structure?",
                 "Suppose you have B → ... → C reversed (because it was of even length) so that it is now C → ... → B. What references do you need to fix so that the transitions between the previous, current, and next groups are correct?",