{"id":23940251,"url":"https://github.com/antoniomrtz/leetcode","last_synced_at":"2026-06-09T20:31:22.786Z","repository":{"id":191267332,"uuid":"684297452","full_name":"AntonioMrtz/LeetCode","owner":"AntonioMrtz","description":"Solutions of LeetCode code problems","archived":false,"fork":false,"pushed_at":"2023-11-02T12:22:57.000Z","size":13,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-11-14T21:28:41.458Z","etag":null,"topics":["leet-code-solutions","leetcode","python","python3"],"latest_commit_sha":null,"homepage":"https://leetcode.com/","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/AntonioMrtz.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,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2023-08-28T21:16:05.000Z","updated_at":"2024-12-26T23:04:27.000Z","dependencies_parsed_at":"2023-08-29T05:00:35.791Z","dependency_job_id":"e382e384-6195-4010-aa99-b579c0ddceac","html_url":"https://github.com/AntonioMrtz/LeetCode","commit_stats":null,"previous_names":["antoniomrtz/leetcode"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/AntonioMrtz/LeetCode","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AntonioMrtz%2FLeetCode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AntonioMrtz%2FLeetCode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AntonioMrtz%2FLeetCode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AntonioMrtz%2FLeetCode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/AntonioMrtz","download_url":"https://codeload.github.com/AntonioMrtz/LeetCode/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AntonioMrtz%2FLeetCode/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34125332,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-09T02:00:06.510Z","response_time":63,"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":["leet-code-solutions","leetcode","python","python3"],"created_at":"2025-01-06T03:13:08.663Z","updated_at":"2026-06-09T20:31:22.766Z","avatar_url":"https://github.com/AntonioMrtz.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# LeetCode Challenges\n\n![Leet Code](https://cdn.cdo.mit.edu/wp-content/uploads/sites/67/2021/01/0_zuhXdNAIUoxEem4-.png)\n\n## Done\n\n1. [Median of Two Sorted Arrays in log(n+m)](https://leetcode.com/problems/median-of-two-sorted-arrays/)\n2. [Minimum penalty for a Shop](https://leetcode.com/problems/minimum-penalty-for-a-shop/)\n3. [Can Make Arithmetic Progression From Sequence](https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence)\n4. [Power of four](https://leetcode.com/problems/power-of-four/)\n5. [Minimum Replacements to Sort the Array](https://leetcode.com/problems/minimum-replacements-to-sort-the-array/)\n6. [Counting Bits](https://leetcode.com/problems/counting-bits/)\n7. [Backspace String Compare](https://leetcode.com/problems/backspace-string-compare/)\n8. [Find Smallest Letter Greater Than Target](https://leetcode.com/problems/find-smallest-letter-greater-than-target/solutions/?envType=daily-question\u0026envId=2023-11-02)\n9. [Count Negative Numbers in a Sorted Matrix](https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix/?envType=daily-question\u0026envId=2023-11-02)","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fantoniomrtz%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fantoniomrtz%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fantoniomrtz%2Fleetcode/lists"}