update

leetcode/originData/find-palindrome-with-fixed-length.json

@@ -11,14 +11,20 @@
             "translatedContent": null,
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 227,
-            "dislikes": 137,
+            "likes": 308,
+            "dislikes": 165,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Palindrome Number\", \"titleSlug\": \"palindrome-number\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Find the Closest Palindrome\", \"titleSlug\": \"find-the-closest-palindrome\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
             "exampleTestcases": "[1,2,3,4,5,90]\n3\n[2,4,6]\n4",
             "categoryTitle": "Algorithms",
             "contributors": [],
             "topicTags": [
+                {
+                    "name": "Array",
+                    "slug": "array",
+                    "translatedName": null,
+                    "__typename": "TopicTagNode"
+                },
                 {
                     "name": "Math",
                     "slug": "math",
@@ -137,7 +143,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"7.3K\", \"totalSubmission\": \"23.1K\", \"totalAcceptedRaw\": 7345, \"totalSubmissionRaw\": 23055, \"acRate\": \"31.9%\"}",
+            "stats": "{\"totalAccepted\": \"10K\", \"totalSubmission\": \"29.3K\", \"totalAcceptedRaw\": 10024, \"totalSubmissionRaw\": 29285, \"acRate\": \"34.2%\"}",
             "hints": [
                 "For any value of queries[i] and intLength, how can you check if there exists at least queries[i] palindromes of length intLength?",
                 "Since a palindrome reads the same forwards and backwards, consider how you can efficiently find the first half (ceil(intLength/2) digits) of the palindrome."