{"id":21723166,"url":"https://github.com/wiirios/leetcode","last_synced_at":"2025-03-20T22:17:50.628Z","repository":{"id":262361876,"uuid":"861988611","full_name":"wiirios/leetcode","owner":"wiirios","description":"my solutions for LeetCode","archived":false,"fork":false,"pushed_at":"2024-11-21T02:19:56.000Z","size":84,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-16T22:52:24.091Z","etag":null,"topics":["java","leetcode","solutions"],"latest_commit_sha":null,"homepage":"https://leetcode.com","language":"Java","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/wiirios.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":"2024-09-23T20:48:59.000Z","updated_at":"2024-11-21T02:20:00.000Z","dependencies_parsed_at":"2024-11-13T18:49:36.846Z","dependency_job_id":null,"html_url":"https://github.com/wiirios/leetcode","commit_stats":null,"previous_names":["winnd11/leetcode","wiirios/leetcode"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wiirios%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wiirios%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wiirios%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wiirios%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/wiirios","download_url":"https://codeload.github.com/wiirios/leetcode/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244700611,"owners_count":20495574,"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":["java","leetcode","solutions"],"created_at":"2024-11-26T02:37:35.150Z","updated_at":"2025-03-20T22:17:50.603Z","avatar_url":"https://github.com/wiirios.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"## LeetCode\n\nLeetcode is a platform with diverse programming problems focused on technical interviews\n\n\u003cdiv align=\"center\"\u003e\n  \u003cimg src=\"https://img.shields.io/badge/Easy-13/826-gray?style=flat\u0026logo=easy\u0026labelColor=green\" alt=\"Version Badge\"/\u003e\n  \u003cimg src=\"https://img.shields.io/badge/Med.-11/1726-gray?style=flat\u0026logo=med\u0026labelColor=yellow\" alt=\"Version Badge\"/\u003e\n  \u003cimg src=\"https://img.shields.io/badge/Hard-1/747-gray?style=flat\u0026logo=hard\u0026labelColor=red\" alt=\"Version Badge\"/\u003e\n\u003c/div\u003e\n\n---\nJava Solutions\n\n| Problem | Java | Difficulty | Topics | Beats |\n| -- | -- | -- | -- | -- |\n| Two Sum | [P01](Java/1-Two-Sum/Problem.java) | ${\\textsf{\\color{Lightgreen}Easy}}$ | Array Hash \\ Table | 98.63% |\n| Median of Two Sorted Arrays | [P04](Java/4-Median-Of-Two-Sorted-Arrays/Problem.java) | ${\\textsf{\\color{Red}Hard}}$ | ArrayBinary \\ Search \\ Divide and Conquer | 31.53% |\n| Reverse Integer | [P07](Java/7-Reverse-Integer/Problem.java) | ${\\textsf{\\color{yellow}Med}}$ | Math | 86.78% | \n| Palindrome Number | [P09](Java/9-Palindrome-Number/Problem.java) | ${\\textsf{\\color{Lightgreen}Easy}}$ | Math | 100.00% |\n| Integer To Roman | [P12](Java/12-Integer-To-Roman/Problem.java) | ${\\textsf{\\color{yellow}Med}}$ | Hash Table \\ Math \\ String | 98.33% |\n| Find The Index Of The First Occurrence In A String | [P28](Java/28-Find-The-Index-Of-The-First-Occurrence-In-A-String/Problem.java) | ${\\textsf{\\color{Lightgreen}Easy}}$ | String Matching \\ String \\ Two Pointers | 100.00% |  \n| Search Insert Position | [P35](Java/35-Search-Insert-Position/Problem.java) | ${\\textsf{\\color{Lightgreen}Easy}}$ | Binary Search \\ Search | 100.00% |\n| Length Of Last Word | [P58](Java/58-Length-Of-Last-Word/Problem.java) | ${\\textsf{\\color{yellow}Med}}$ | String | 100.00% |\n| Sort Colors | [P75](Java/75-Sort-Colors/Problem.java) | ${\\textsf{\\color{yellow}Med}}$ | Array \\ Two Pointers \\ Sorting | 100.00% |\n| Reverse Words In A String | [P151](Java/151-Reverse-Words-in-a-String/Problem.java) | ${\\textsf{\\color{yellow}Med}}$ | Two Pointers \\ String | 20.66% | \n| Move Zeroes | [P283](Java/283-Move-Zeroes/Problem.java) | ${\\textsf{\\color{Lightgreen}Easy}}$ | Array \\ Two Pointers | 83.78%\n| Find The Duplicate Number | [P287](Java/287-Find-The-Duplicate-Number/Problem.java) | ${\\textsf{\\color{yellow}Med}}$ | Bit Manipulation \\ Binary Search \\ Two Pointers \\ Array | 6.00% |\n| Reverse String | [P344](Java/344-Reverse-String/Problem.java) | ${\\textsf{\\color{Lightgreen}Easy}}$ | Array | 90.09% |\n| Is Subsequence | [P392](Java/392-Is-Subsequence/Problem.java) | ${\\textsf{\\color{Lightgreen}Easy}}$ | Dynamic Programming \\ String | 93.17% |\n| Maximum Average Subarray | [P643](Java/643-Maximum-Average-Subarray-I/Problem.java) | ${\\textsf{\\color{Lightgreen}Easy}}$ | Sliding Window \\ Array | 41.99% |\n| Print in Order | [P1114](Java/1114-Print-In-Order/Problem.java) | ${\\textsf{\\color{Lightgreen}Easy}}$ | Concurrency |\n| Print FooBar Alternately | [P1115](Java/1115-Print-FooBar-Alternately/Problem.java) | ${\\textsf{\\color{yellow}Med}}$ | Concurrency | 28.21% |\n| Print Zero Even Odd | [P1116](Java/1116-Print-Zero-Even-Odd/Problem.java) | ${\\textsf{\\color{yellow}Med}}$ | Concurrency | 99.88% |\n| Building H20 | [P1117](Java/1117-Building-H2O/Problem.java) | ${\\textsf{\\color{yellow}Med}}$ | Concurrency | 99.57% |\n| Merge Strings Alternately | [P1768](Java/1768-Merge-Strings-Alternately/Problem.java) | ${\\textsf{\\color{Lightgreen}Easy}}$ | Two Pointers \\ String | 84.50% |\n\n---\n\nSQL Solutions\n\n| Problem | SQL | Difficulty | Topics | Beats |\n| -- | -- | -- | -- | -- |\n| Combine Two Tables | [P175](Sql/175-Combine-Two-Tables/problem.sql) | ${\\textsf{\\color{Lightgreen}Easy}}$ | Database | 96.69% |\n| Second-Highest-Salary | [P176](Sql/176-Second-Highest-Salary/problem.sql) | ${\\textsf{\\color{yellow}Med}}$| Database | 98.31% |\n| Rank Scores | [P178](Sql/178-Rank-Scores/problem.sql) | ${\\textsf{\\color{yellow}Med}}$ | Database | 84.54% |\n| Cosecutive Numbers | [P180](Sql/180-Cosecutive-Numbers/problem.sql) | ${\\textsf{\\color{yellow}Med}}$ | Database | 17.50% |\n| Department-Highest-Salary | [P184](Sql/184-Department-Highest-Salary/problem.sql) | ${\\textsf{\\color{yellow}Med}}$| Database | 89.98% |\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fwiirios%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fwiirios%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fwiirios%2Fleetcode/lists"}