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

4
leetcode/originData/[no content]before-and-after-puzzle.json
View File

@@ -12,7 +12,7 @@
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 62,
"dislikes": 140,
"dislikes": 141,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[\"writing code\",\"code rocks\"]\n[\"mission statement\",\"a quick bite to eat\",\"a chip off the old block\",\"chocolate bar\",\"mission impossible\",\"a man on a mission\",\"block party\",\"eat my words\",\"bar of soap\"]\n[\"a\",\"b\",\"a\"]",
@@ -46,7 +46,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"8.9K\", \"totalSubmission\": \"19.8K\", \"totalAcceptedRaw\": 8893, \"totalSubmissionRaw\": 19786, \"acRate\": \"44.9%\"}",
"stats": "{\"totalAccepted\": \"8.9K\", \"totalSubmission\": \"19.8K\", \"totalAcceptedRaw\": 8918, \"totalSubmissionRaw\": 19831, \"acRate\": \"45.0%\"}",
"hints": [
"What if you check every pair of strings (bruteforce)?",
"For every two strings, check if they can form a puzzle by comparing their last and first words."