mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-06 07:51:41 +08:00
update
This commit is contained in:
@@ -11,7 +11,7 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Easy",
|
||||
"likes": 871,
|
||||
"likes": 872,
|
||||
"dislikes": 206,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Number of Matching Subsequences\", \"titleSlug\": \"number-of-matching-subsequences\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Subarrays with K Different Integers\", \"titleSlug\": \"subarrays-with-k-different-integers\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Number of Substrings With Only 1s\", \"titleSlug\": \"number-of-substrings-with-only-1s\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Longest Substring Of All Vowels in Order\", \"titleSlug\": \"longest-substring-of-all-vowels-in-order\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Total Appeal of A String\", \"titleSlug\": \"total-appeal-of-a-string\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
|
||||
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"34.2K\", \"totalSubmission\": \"51K\", \"totalAcceptedRaw\": 34178, \"totalSubmissionRaw\": 51040, \"acRate\": \"67.0%\"}",
|
||||
"stats": "{\"totalAccepted\": \"34.2K\", \"totalSubmission\": \"51.1K\", \"totalAcceptedRaw\": 34186, \"totalSubmissionRaw\": 51057, \"acRate\": \"67.0%\"}",
|
||||
"hints": [
|
||||
"While generating substrings starting at any index, do you need to continue generating larger substrings if you encounter a consonant?",
|
||||
"Can you store the count of characters to avoid generating substrings altogether?"
|
||||
|
Reference in New Issue
Block a user