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:
小墨
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/sum-of-beauty-of-all-substrings.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 928,
"likes": 929,
"dislikes": 153,
"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}]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"35.3K\", \"totalSubmission\": \"55.1K\", \"totalAcceptedRaw\": 35255, \"totalSubmissionRaw\": 55088, \"acRate\": \"64.0%\"}",
"stats": "{\"totalAccepted\": \"35.3K\", \"totalSubmission\": \"55.1K\", \"totalAcceptedRaw\": 35271, \"totalSubmissionRaw\": 55113, \"acRate\": \"64.0%\"}",
"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"