{"id":19298448,"url":"https://github.com/dreamoftheredchamber/leetcode","last_synced_at":"2025-04-05T23:11:41.338Z","repository":{"id":210616309,"uuid":"64726339","full_name":"DreamOfTheRedChamber/leetcode","owner":"DreamOfTheRedChamber","description":null,"archived":false,"fork":false,"pushed_at":"2024-06-18T01:36:58.000Z","size":77247,"stargazers_count":253,"open_issues_count":7,"forks_count":95,"subscribers_count":22,"default_branch":"master","last_synced_at":"2025-03-29T22:07:51.295Z","etag":null,"topics":["interview","leetcode"],"latest_commit_sha":null,"homepage":"https://eric-zhang-seattle.gitbook.io/leetcode-1/","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/DreamOfTheRedChamber.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2016-08-02T05:17:36.000Z","updated_at":"2025-02-23T06:47:07.000Z","dependencies_parsed_at":null,"dependency_job_id":"26910c03-4746-4cb1-b62f-15591f4a6c10","html_url":"https://github.com/DreamOfTheRedChamber/leetcode","commit_stats":null,"previous_names":["dreamoftheredchamber/leetcode"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DreamOfTheRedChamber%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DreamOfTheRedChamber%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DreamOfTheRedChamber%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DreamOfTheRedChamber%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/DreamOfTheRedChamber","download_url":"https://codeload.github.com/DreamOfTheRedChamber/leetcode/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247411239,"owners_count":20934653,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["interview","leetcode"],"created_at":"2024-11-09T23:08:03.735Z","updated_at":"2025-04-05T23:11:41.319Z","avatar_url":"https://github.com/DreamOfTheRedChamber.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"- [README](#readme)\n  - [Methodology](#methodology)\n    - [Categorize question types](#categorize-question-types)\n    - [Learn from answers and train my thoughts](#learn-from-answers-and-train-my-thoughts)\n    - [Practice with \"Explain Everything\"](#practice-with-explain-everything)\n  - [Readability](#readability)\n- [Task lists](#task-lists)\n  - [Parenthesis](#parenthesis)\n  - [Dynamic programming](#dynamic-programming)\n  - [Design](#design)\n  - [Other](#other)\n  - [Binary search](#binary-search)\n  - [Greedy](#greedy)\n\n# README\n\n## Methodology\n### Categorize question types\n### Learn from answers and train my thoughts \n### Practice with \"Explain Everything\"\n\n## Readability \n* Gitbook serves as a nice representation engine for this repo. \n* You could see it at https://eric-zhang-seattle.gitbook.io/leetcode-1/\n\n# Task lists\n## Parenthesis\n1. 1249. Minimum Remove to Make Valid Parentheses\n2. 921. Minimum Add to Make Parentheses Valid\n3. 301. Remove invalid parentheses\n\n## Dynamic programming\n1. 629. K Inverse Pairs Array\n2. 1235. Maximum Profit in Job Scheduling\n3. 1420. Build Array Where You Can Find The Maximum Exactly K Comparisons\n4. 1531. String Compression II\n5. 2742. Painting the walls\n6. 2851. String Transformation\n7. 1458. Max Dot Product of Two Subsequences\n8. 1611. Minimum One Bit Operations to Make Integers Zero\n\n## Design\n1. 380. Insert Delete GetRandom O(1)\n2. 381. Insert-Delete-GetRandom-O1-Duplicates-allowed\n3. 362. Design Hit Counter\n4. 2296. Design a Text Editor\n5. 2043. Simple Bank System\n\n\n\n## Other\n1. 1291. Sequential Digits (M)\n\n## Binary search\n1. 2468. Split Message Based on Limit (H)\n\n## Greedy\n1. 2870. Minimum Number of Operations to Make Array Empty","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdreamoftheredchamber%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdreamoftheredchamber%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdreamoftheredchamber%2Fleetcode/lists"}