coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 15:31:43 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/count-beautiful-substrings-ii.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 123,
"likes": 125,
"dislikes": 3,
"isLiked": null,
"similarQuestions": "[]",
@@ -167,7 +167,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"3.3K\", \"totalSubmission\": \"14.1K\", \"totalAcceptedRaw\": 3335, \"totalSubmissionRaw\": 14063, \"acRate\": \"23.7%\"}",
"stats": "{\"totalAccepted\": \"3.4K\", \"totalSubmission\": \"14.1K\", \"totalAcceptedRaw\": 3355, \"totalSubmissionRaw\": 14136, \"acRate\": \"23.7%\"}",
"hints": [
"For the given <code>k</code> find all the <code>x</code> integers such that <code>x^2 % k == 0</code>. Notice, that there aren’t many such candidates.",
"We can iterate over all such <code>x</codes> values and count the number of substrings such that <code>vowels == consonants == x</code>.",