{"id":26446511,"url":"https://github.com/sbidwaibing/leetcode_ay2425","last_synced_at":"2026-05-22T14:03:47.217Z","repository":{"id":282662529,"uuid":"948263999","full_name":"sbidwaibing/LeetCode_AY2425","owner":"sbidwaibing","description":"Leetcode Activity","archived":false,"fork":false,"pushed_at":"2025-03-16T05:11:16.000Z","size":23,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-16T06:18:26.947Z","etag":null,"topics":["cpp","java"],"latest_commit_sha":null,"homepage":"","language":"Java","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/sbidwaibing.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":"2025-03-14T02:48:45.000Z","updated_at":"2025-03-16T05:11:17.000Z","dependencies_parsed_at":"2025-03-16T06:28:27.567Z","dependency_job_id":null,"html_url":"https://github.com/sbidwaibing/LeetCode_AY2425","commit_stats":null,"previous_names":["sbidwaibing/leetcode_ay2425"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sbidwaibing%2FLeetCode_AY2425","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sbidwaibing%2FLeetCode_AY2425/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sbidwaibing%2FLeetCode_AY2425/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sbidwaibing%2FLeetCode_AY2425/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/sbidwaibing","download_url":"https://codeload.github.com/sbidwaibing/LeetCode_AY2425/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244217950,"owners_count":20417677,"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":["cpp","java"],"created_at":"2025-03-18T12:18:01.898Z","updated_at":"2026-05-22T14:03:42.180Z","avatar_url":"https://github.com/sbidwaibing.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# LeetCode_AY2425\n\n\u003c!---LeetCode Topics Start--\u003e\n# LeetCode Topics\n## Math\n|  |\n| ------- |\n| [0013-roman-to-integer](https://github.com/sbidwaibing/LeetCode_AY2425/tree/master/0013-roman-to-integer) |\n| [1146-greatest-common-divisor-of-strings](https://github.com/sbidwaibing/LeetCode_AY2425/tree/master/1146-greatest-common-divisor-of-strings) |\n## String\n|  |\n| ------- |\n| [0013-roman-to-integer](https://github.com/sbidwaibing/LeetCode_AY2425/tree/master/0013-roman-to-integer) |\n| [0392-is-subsequence](https://github.com/sbidwaibing/LeetCode_AY2425/tree/master/0392-is-subsequence) |\n| [1146-greatest-common-divisor-of-strings](https://github.com/sbidwaibing/LeetCode_AY2425/tree/master/1146-greatest-common-divisor-of-strings) |\n| [1894-merge-strings-alternately](https://github.com/sbidwaibing/LeetCode_AY2425/tree/master/1894-merge-strings-alternately) |\n## Array\n|  |\n| ------- |\n| [0121-best-time-to-buy-and-sell-stock](https://github.com/sbidwaibing/LeetCode_AY2425/tree/master/0121-best-time-to-buy-and-sell-stock) |\n| [0238-product-of-array-except-self](https://github.com/sbidwaibing/LeetCode_AY2425/tree/master/0238-product-of-array-except-self) |\n| [0605-can-place-flowers](https://github.com/sbidwaibing/LeetCode_AY2425/tree/master/0605-can-place-flowers) |\n| [0739-daily-temperatures](https://github.com/sbidwaibing/LeetCode_AY2425/tree/master/0739-daily-temperatures) |\n| [2350-find-closest-number-to-zero](https://github.com/sbidwaibing/LeetCode_AY2425/tree/master/2350-find-closest-number-to-zero) |\n## Prefix Sum\n|  |\n| ------- |\n| [0238-product-of-array-except-self](https://github.com/sbidwaibing/LeetCode_AY2425/tree/master/0238-product-of-array-except-self) |\n## Greedy\n|  |\n| ------- |\n| [0605-can-place-flowers](https://github.com/sbidwaibing/LeetCode_AY2425/tree/master/0605-can-place-flowers) |\n## Stack\n|  |\n| ------- |\n| [0739-daily-temperatures](https://github.com/sbidwaibing/LeetCode_AY2425/tree/master/0739-daily-temperatures) |\n## Monotonic Stack\n|  |\n| ------- |\n| [0739-daily-temperatures](https://github.com/sbidwaibing/LeetCode_AY2425/tree/master/0739-daily-temperatures) |\n## Two Pointers\n|  |\n| ------- |\n| [0392-is-subsequence](https://github.com/sbidwaibing/LeetCode_AY2425/tree/master/0392-is-subsequence) |\n| [1894-merge-strings-alternately](https://github.com/sbidwaibing/LeetCode_AY2425/tree/master/1894-merge-strings-alternately) |\n## Hash Table\n|  |\n| ------- |\n| [0013-roman-to-integer](https://github.com/sbidwaibing/LeetCode_AY2425/tree/master/0013-roman-to-integer) |\n## Dynamic Programming\n|  |\n| ------- |\n| [0121-best-time-to-buy-and-sell-stock](https://github.com/sbidwaibing/LeetCode_AY2425/tree/master/0121-best-time-to-buy-and-sell-stock) |\n| [0392-is-subsequence](https://github.com/sbidwaibing/LeetCode_AY2425/tree/master/0392-is-subsequence) |\n\u003c!---LeetCode Topics End--\u003e\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsbidwaibing%2Fleetcode_ay2425","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsbidwaibing%2Fleetcode_ay2425","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsbidwaibing%2Fleetcode_ay2425/lists"}