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

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/[no content]minimum-window-subsequence.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Hard",
"likes": 1208,
"likes": 1209,
"dislikes": 72,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Minimum Window Substring\", \"titleSlug\": \"minimum-window-substring\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Longest Continuous Increasing Subsequence\", \"titleSlug\": \"longest-continuous-increasing-subsequence\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
@@ -40,7 +40,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"75.3K\", \"totalSubmission\": \"175.7K\", \"totalAcceptedRaw\": 75307, \"totalSubmissionRaw\": 175691, \"acRate\": \"42.9%\"}",
"stats": "{\"totalAccepted\": \"75.4K\", \"totalSubmission\": \"175.9K\", \"totalAcceptedRaw\": 75406, \"totalSubmissionRaw\": 175906, \"acRate\": \"42.9%\"}",
"hints": [
"Let dp[j][e] = s be the largest index for which S[s:e+1] has T[:j] as a substring."
],