{"id":26089090,"url":"https://github.com/ultirequiem/leetcode","last_synced_at":"2025-03-09T08:58:57.059Z","repository":{"id":271920578,"uuid":"914973550","full_name":"UltiRequiem/leetcode","owner":"UltiRequiem","description":":shipit: From noob to chad","archived":false,"fork":false,"pushed_at":"2025-02-11T03:22:54.000Z","size":27,"stargazers_count":0,"open_issues_count":1,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-02T18:53:53.640Z","etag":null,"topics":["daily-coding-problem","leetcode","leetcode-solutions"],"latest_commit_sha":null,"homepage":"https://leetcode.com/u/UltiRequiem","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/UltiRequiem.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},"funding":{"patreon":"ultirequiem"}},"created_at":"2025-01-10T17:35:08.000Z","updated_at":"2025-02-16T20:21:26.000Z","dependencies_parsed_at":null,"dependency_job_id":"fdc45e97-f612-49ec-9b6c-7a2f6ec94ad5","html_url":"https://github.com/UltiRequiem/leetcode","commit_stats":null,"previous_names":["ultirequiem/leetcode"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/UltiRequiem%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/UltiRequiem%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/UltiRequiem%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/UltiRequiem%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/UltiRequiem","download_url":"https://codeload.github.com/UltiRequiem/leetcode/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":242667493,"owners_count":20166306,"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":["daily-coding-problem","leetcode","leetcode-solutions"],"created_at":"2025-03-09T08:58:56.587Z","updated_at":"2025-03-09T08:58:57.054Z","avatar_url":"https://github.com/UltiRequiem.png","language":"Python","funding_links":["https://patreon.com/ultirequiem"],"categories":[],"sub_categories":[],"readme":"## Problems Solved\n\n- [1) Two Sum](./leetcode/01-two-sum)\n- [9) Palindrome Number](./leetcode/09-palindrome-number)\n- [13) Roman To Integer](./leetcode/13-roman-to-integer)\n- [21) Merge Two Sorted Lists](./leetcode/21-merge-two-sorted-lists)\n- [26) Remove Duplicates From Sorted Array](./leetcode/26-remove-duplicates-from-sorted-array)\n- [27) Remove Element](./leetcode/27-remove-element)\n- [35) Search Insert Position](./leetcode/35-search-insert-position)\n- [75) Sort Colors](./leetcode/75-sort-colors)\n- [80) Remove Duplicates From Sorted Array 2](./leetcode/80-remove-duplicates-from-sorted-array-2)\n- [88) Merge Sorted Array](./leetcode/88-merge-sorted-array)\n- [242) Valid Anagram](./leetcode/242-valid-anagram)\n- [283) Move Zeroes](./leetcode/283-move-zeroes)\n- [345) Reverse Vowels Of A String](./leetcode/345-reverse-vowels-of-a-string)\n- [388) Ransom Note](./leetcode/388-ransom-note)\n- [412) Fizz Buzz](./leetcode/412-fizz-buzz)\n- [414) Third Maximum Number](./leetcode/414-third-maximum-number)\n- [447) Find All Numbers Dissapeared In An Array](./leetcode/447-find-all-numbers-dissapeared-in-an-array)\n- [448) Max Consecuitve Ones](./leetcode/448-max-consecuitve-ones)\n- [704) Binary Search](./leetcode/704-binary-search)\n- [724) Find Pitot Index](./leetcode/724-find-pitot-index)\n- [876) Middle Of Linked List](./leetcode/876-middle-of-linked-list)\n- [905) Sort Array By Parity](./leetcode/905-sort-array-by-parity)\n- [941) Valid Mountain Array](./leetcode/941-valid-mountain-array)\n- [977) Squares Of A Sorted Array](./leetcode/977-squares-of-a-sorted-array)\n- [1051) Height Checker](./leetcode/1051-height-checker)\n- [1089) Duplicate Zeros](./leetcode/1089-duplicate-zeros)\n- [1295) Find Numbers With Even Numbers Of Digits](./leetcode/1295-find-numbers-with-even-numbers-of-digits)\n- [1299) Replace Elements With Greatest Element On Right Side](./leetcode/1299-replace-elements-with-greatest-element-on-right-side)\n- [1342) Number Of Steps To Reduce A Number To Zero](./leetcode/1342-number-of-steps-to-reduce-a-number-to-zero)\n- [1346) Check If N And Its Double Exitsts](./leetcode/1346-check-if-n-and-its-double-exitsts)\n- [1480) Running Sum Of 1D Array](./leetcode/1480-running-sum-of-1d-array)\n- [1672) Richest Customer Wealth](./leetcode/1672-richest-customer-wealth)\n- [1768) Merge Strings Alternately](./leetcode/1768-merge-strings-alternately)\n- [1790) Check If One String Swap Can Make Strings Equal](./leetcode/1790-check-if-one-string-swap-can-make-strings-equal)\n- [1991) Find The Middle Index In Array](./leetcode/1991-find-the-middle-index-in-array)\n- [2558) Take Gifst From The Richest Pile](./leetcode/2558-take-gifst-from-the-richest-pile)\n- [2620) Counter](./leetcode/2620-counter)\n- [2623) Memoize](./leetcode/2623-memoize)\n- [2626) Array Reduce Transformation](./leetcode/2626-array-reduce-transformation)\n- [2629) Function Composition](./leetcode/2629-function-composition)\n- [2634) Filter Elements From Array](./leetcode/2634-filter-elements-from-array)\n- [2635) Apply Transform Over Each Element In Array](./leetcode/2635-apply-transform-over-each-element-in-array)\n- [2665) Counter 2](./leetcode/2665-counter-2)\n- [2666) Allow One Function Call](./leetcode/2666-allow-one-function-call)\n- [2667) Create Hello World Function](./leetcode/2667-create-hello-world-function)\n- [2703) Return Length Of Arguments Passed](./leetcode/2703-return-length-of-arguments-passed)\n- [2704) To Be Or Not To Be](./leetcode/2704-to-be-or-not-to-be)\n- [2723) Add Two Promises](./leetcode/2723-add-two-promises)\n\nTotal solved: 48 (Outdated 48/59 | 2025-02-10)\n\nMy account: https://leetcode.com/u/ultirequiem\n\n## Credits\n\n- [Open Source LeetCode API](https://github.com/JeremyTsaii/leetcode-stats-api)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fultirequiem%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fultirequiem%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fultirequiem%2Fleetcode/lists"}