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

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/sum-of-beauty-of-all-substrings.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 297,
"dislikes": 81,
"likes": 307,
"dislikes": 83,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Substrings That Begin and End With the Same Letter\", \"titleSlug\": \"substrings-that-begin-and-end-with-the-same-letter\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "\"aabcb\"\n\"aabcbaa\"",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"12.7K\", \"totalSubmission\": \"21.2K\", \"totalAcceptedRaw\": 12699, \"totalSubmissionRaw\": 21237, \"acRate\": \"59.8%\"}",
"stats": "{\"totalAccepted\": \"13K\", \"totalSubmission\": \"21.8K\", \"totalAcceptedRaw\": 13044, \"totalSubmissionRaw\": 21827, \"acRate\": \"59.8%\"}",
"hints": [
"Maintain a prefix sum for the frequencies of characters.",
"You can iterate over all substring then iterate over the alphabet and find which character appears most and which appears least using the prefix sum array"