update

leetcode/originData/check-if-every-row-and-column-contains-all-numbers.json

@@ -11,8 +11,8 @@
             "translatedContent": null,
             "isPaidOnly": false,
             "difficulty": "Easy",
-            "likes": 285,
-            "dislikes": 17,
+            "likes": 319,
+            "dislikes": 20,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Valid Sudoku\", \"titleSlug\": \"valid-sudoku\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Matrix Diagonal Sum\", \"titleSlug\": \"matrix-diagonal-sum\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
             "exampleTestcases": "[[1,2,3],[3,1,2],[2,3,1]]\n[[1,1,1],[1,2,3],[1,2,3]]",
@@ -149,7 +149,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"24.5K\", \"totalSubmission\": \"47.2K\", \"totalAcceptedRaw\": 24536, \"totalSubmissionRaw\": 47177, \"acRate\": \"52.0%\"}",
+            "stats": "{\"totalAccepted\": \"26.6K\", \"totalSubmission\": \"50.9K\", \"totalAcceptedRaw\": 26568, \"totalSubmissionRaw\": 50860, \"acRate\": \"52.2%\"}",
             "hints": [
                 "Use for loops to check each row for every number from 1 to n. Similarly, do the same for each column.",
                 "For each check, you can keep a set of the unique elements in the checked row/col. By the end of the check, the size of the set should be n."