{"id":18545374,"url":"https://github.com/lesenelir/meta-leetcode-js","last_synced_at":"2025-10-10T00:12:34.161Z","repository":{"id":38248571,"uuid":"435737339","full_name":"lesenelir/meta-leetcode-js","owner":"lesenelir","description":"Leetcode Solutions and Notes","archived":false,"fork":false,"pushed_at":"2023-10-10T07:44:45.000Z","size":420,"stargazers_count":3,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-10-06T21:54:57.206Z","etag":null,"topics":["algorithm","javascript","leetcode"],"latest_commit_sha":null,"homepage":"https://leetcode.cn/u/lesenelir/","language":"JavaScript","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/lesenelir.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","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":"2021-12-07T04:03:36.000Z","updated_at":"2024-07-17T16:59:40.000Z","dependencies_parsed_at":"2025-04-10T12:11:34.565Z","dependency_job_id":"26b33b02-9109-42f3-819c-8cd23bbeaf0a","html_url":"https://github.com/lesenelir/meta-leetcode-js","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/lesenelir/meta-leetcode-js","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lesenelir%2Fmeta-leetcode-js","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lesenelir%2Fmeta-leetcode-js/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lesenelir%2Fmeta-leetcode-js/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lesenelir%2Fmeta-leetcode-js/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/lesenelir","download_url":"https://codeload.github.com/lesenelir/meta-leetcode-js/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lesenelir%2Fmeta-leetcode-js/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":279002373,"owners_count":26083356,"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","status":"online","status_checked_at":"2025-10-09T02:00:07.460Z","response_time":59,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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","javascript","leetcode"],"created_at":"2024-11-06T20:19:52.518Z","updated_at":"2025-10-10T00:12:34.147Z","avatar_url":"https://github.com/lesenelir.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":" # Meta-LeetcodeJS\n\n \u003e You can find me in Leetcode at https://leetcode.cn/u/lesenelir/\n\n  ### JavaScript solutions for Personal Leetcode problems\n\n  The contents of this repository including:\n\n\u003e Learning JavaScript Data Structure \u0026 Algorithm Book\n\u003e\n\u003e Coding Interviews Book\n\u003e\n\u003e Personal Leetcode problems\n\n***\n\n  ### Data Structure \u0026 Algorithm Classification\n\n  - Data Structure\n    - Array\n    - Linked List\n    - Doubly Linked list\n    - Queue\n    - Stack\n    - Hash table\n    - Heap - Max Heap \u0026 Min Heap\n    - Priority Queue\n    - Dictionary Tree\n    - Tree\n    - Graph\n\n  - Algorithm\n    - Sort\n    - Search\n    - Math\n    - String\n    - Simulation\n    - Greedy Algorithm\n    - Recursion\n    - Dynamic Programming (DP)\n    - Depth-First-Search （DFS）\n    - Breadth First Search (BFS)\n\n***\n\n### Leetcode Problems Label\n\n- Hash Table\n  - 0001\n  - CI03\n\n- Two Pointers - Fast \u0026 Slow Pointers\n  - 0026\n  - 0080\n  - CI21\n  - CI22\n  - CI39\n\n- Two Pointers - Begin \u0026 End Pointers\n  - CI21\n\n- Binary Search\n  - 0033\n  - 0035\n  - 0081\n  - 0004\n  - CI11\n\n- Search Number\n  - CI04 (Two Dimension Array)\n\n- Math\n  - CI15\n  - CI17\n\n- Merge Sort\n  - 0004\n\n- String\n  - CI05\n\n- Linked List\n  - CI06\n  - CI18\n  - CI22\n  - CI24\n  - CI25\n\n- Binary Tree\n  - CI07\n  - CI26\n  - CI27\n  - CI28\n\n- Stack\n  - CI09\n  - CI30\n  - CI31\n\n- Recursion\n  - CI16\n  - CI24\n  - CI25\n  - CI26\n  - CI27\n  - CI28\n\n- Dynamic Programming (DP)\n  - CI10\n  - CI10-II\n  - CI14\n\n- Greedy Algorithm\n  - CI14-II\n\n- Depth-First-Search (DFS)\n  - CI12\n\n- Breadth First Search (BFS)\n  - CI13\n\n- Simulation\n  - CI29\n\n\n***\n\n### Leetcode Personal AC Order \u0026 Coding Interviews AC Order\n\n- 0000 Prepare for JS Leetcode\n- 0001 two-sum.js \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; (Hash Table)\n- 0026 Remove-Duplicates-from-Sorted-Array.js \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; (Two Pointers -- Fast \u0026 Slow Pointers)\n- 0080 Remove-Duplicates-from-Sorted-Array-II.js \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; (Two Pointers -- Fast \u0026 Slow Pointers)\n- 0035 Search-Insert-Position.js \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; (Binary Search)\n- 0033 Search-in-Rotated-Sorted-Array.js \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; (Binary Search)\n- 0081 Search-in-Rotated-Sorted-Array-II.js \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; (Binary Search)\n- 0004 Median-of-Two-Sorted-Arrays.js \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; (Binary search - Merge Sort)\n- Code Interviews 03 \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; (Hash Table)\n- Code Interviews 04 \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; (Two Dimension Array -- Search Number)\n- Code Interviews 05 \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; (String)\n- Code Interviews 06 \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; (Linked List)\n- Code Interviews 07 \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; (Binary Tree)\n- Code Interviews 09 \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; (Stack)\n- Code Interviews 10 \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; (Dynamic Programming)\n- Code Interviews 10-II \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; (Dynamic Programming)\n- Code Interviews 11 \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; (Binary Search)\n- Code Interviews 12 \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; (Depth-First-Search)\n- Code Interviews 13 \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; (Depth-First-Search)\n- Code Interviews 14 \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; (Dynamic Programming)\n- Code Interviews 14-II \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; (Greedy Algorithm)\n- Code Interviews 15 \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; (Math)\n- Code Interviews 16 \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; (Recursion)\n- Code Interviews 17 \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; (Math)\n- Code Interviews 18 \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; (Linked List)\n\n\n- Code Interviews 21 \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; (Two Pointers)\n- Code Interviews 22 \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; (Linked List \u0026 Two Pointers)\n- Code Interviews 24 \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; (Linked List \u0026 Recursion)\n- Code Interviews 25 \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; (Linked List \u0026 Recursion)\n- Code Interviews 26 \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; (Binary Tree \u0026 Recursion)\n- Code Interviews 27 \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; (Binary Tree \u0026 Recursion)\n- Code Interviews 28 \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; (Binary Tree \u0026 Recursion)\n- Code Interviews 29 \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; (Simulation)\n- Code Interviews 30 \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; (Stack)\n- Code Interviews 31 \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; (Stack)\n\n\n- Code Interviews 39 \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; (Array \u0026 Two Pointers)\n\n\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flesenelir%2Fmeta-leetcode-js","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Flesenelir%2Fmeta-leetcode-js","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flesenelir%2Fmeta-leetcode-js/lists"}