{"id":17059094,"url":"https://github.com/daidai21/leetcode","last_synced_at":"2025-04-12T17:51:58.466Z","repository":{"id":140608122,"uuid":"167968602","full_name":"daidai21/Leetcode","owner":"daidai21","description":"The algorithm of Leetcode with Python3.x and C++. SQL and Shell.","archived":false,"fork":false,"pushed_at":"2024-05-19T11:02:45.000Z","size":2789,"stargazers_count":5,"open_issues_count":0,"forks_count":2,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-03-26T12:11:51.335Z","etag":null,"topics":["algorithm","bash","cpp11","data-structures","leetcode","python3","shell","sql"],"latest_commit_sha":null,"homepage":"","language":"HTML","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/daidai21.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":"2019-01-28T13:40:38.000Z","updated_at":"2024-05-19T11:02:48.000Z","dependencies_parsed_at":"2024-05-19T09:34:16.844Z","dependency_job_id":null,"html_url":"https://github.com/daidai21/Leetcode","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/daidai21%2FLeetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/daidai21%2FLeetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/daidai21%2FLeetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/daidai21%2FLeetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/daidai21","download_url":"https://codeload.github.com/daidai21/Leetcode/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248610407,"owners_count":21132920,"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":["algorithm","bash","cpp11","data-structures","leetcode","python3","shell","sql"],"created_at":"2024-10-14T10:32:35.918Z","updated_at":"2025-04-12T17:51:58.447Z","avatar_url":"https://github.com/daidai21.png","language":"HTML","readme":"# Leetcode-Algorithm\r\n\r\n**Instructions**: This repository is still being updated!\r\n\r\nI write this code about algorithm of leetcode with Python3.x and C++(c11).(There are some minor problems with the C++ code style here. This size of Tab should be 2) You can `Ctrl + F` on browser or clone this repository, then read this code about the leetcode problem. The best solution is the solution and discussion provided by leetcode. Welcome to Fork or Star, if you think this can help you. You can Pull Request or Email to me, if you have any question, please. Finally, recommend some links: [Leetcode Company](http://206.81.6.248:12306/leetcode/Google/algorithm), [azl397985856/leetcode](https://github.com/azl397985856/leetcode) and [LeetCode全部题目](http://206.81.6.248:12306/leetcode/Google/algorithm). \r\n\r\n### Tags\r\n\r\nJust list the classic questions.\r\n\r\n* Data Structure\r\n    * Bit Manipulation\r\n    * Number\r\n    * Array\r\n    * String\r\n    * Linked List\r\n    * Stack\r\n    * Queue\r\n    * Hashing\r\n    * Heap\r\n    * Tree\r\n    * Graph\r\n    * SkipList\r\n* Algorithm\r\n    * Sort\r\n    * Search\r\n        * Binary Search\r\n        * Depth First Search\r\n        * Breadth First Search\r\n    * Dynamic Programming\r\n    * Backtracking\r\n    * Greedy\r\n    * Recursion\r\n    * Trie\r\n    * Divide and Conquer\r\n* Math\r\n* Magic\r\n    * Two Pointer / Sliding Window\r\n    * Slow And Fast Pointer\r\n* Other\r\n    * Design\r\n\r\n### Script\r\n\r\nFinish problem count: `find Algorithms/ -type f -exec basename {} \\; | awk  -F '-'  '{print $1\"\\t\"$2}' | awk '{print $1}' | sort | uniq | grep -E \"[0-9]\" | wc -l`\r\n\r\n#### CopyRight\r\n\r\n- For learning only, Refuse to reprint, please. `Github@daidai21`\r\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdaidai21%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdaidai21%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdaidai21%2Fleetcode/lists"}