{"id":26432708,"url":"https://github.com/adityaprasad502/leetcode","last_synced_at":"2025-07-26T20:08:07.997Z","repository":{"id":278435890,"uuid":"867692349","full_name":"adityaprasad502/LeetCode","owner":"adityaprasad502","description":"Doesn't contain all the problems I have solved since day one, but many!","archived":false,"fork":false,"pushed_at":"2025-02-19T18:59:37.000Z","size":56,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-02-19T19:33:34.723Z","etag":null,"topics":["leetcode","leetcode-solutions"],"latest_commit_sha":null,"homepage":"https://leetcode.com/Pu94X","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/adityaprasad502.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":"2024-10-04T14:36:26.000Z","updated_at":"2025-02-19T18:59:40.000Z","dependencies_parsed_at":"2025-02-19T19:43:51.757Z","dependency_job_id":null,"html_url":"https://github.com/adityaprasad502/LeetCode","commit_stats":null,"previous_names":["adityaprasad502/leetcode"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/adityaprasad502%2FLeetCode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/adityaprasad502%2FLeetCode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/adityaprasad502%2FLeetCode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/adityaprasad502%2FLeetCode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/adityaprasad502","download_url":"https://codeload.github.com/adityaprasad502/LeetCode/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244166686,"owners_count":20409180,"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":["leetcode","leetcode-solutions"],"created_at":"2025-03-18T06:19:50.521Z","updated_at":"2025-07-26T20:08:07.990Z","avatar_url":"https://github.com/adityaprasad502.png","language":"Python","readme":"A collection of LeetCode questions to ace the coding interview! - Powered by LeetHub v2\n\n\u003c!---LeetCode Topics Start--\u003e\n# LeetCode Topics\n## Math\n|  |\n| ------- |\n| [0231-power-of-two](https://github.com/adityaprasad502/LeetCode/tree/master/0231-power-of-two) |\n| [0342-power-of-four](https://github.com/adityaprasad502/LeetCode/tree/master/0342-power-of-four) |\n| [0628-maximum-product-of-three-numbers](https://github.com/adityaprasad502/LeetCode/tree/master/0628-maximum-product-of-three-numbers) |\n| [2556-convert-the-temperature](https://github.com/adityaprasad502/LeetCode/tree/master/2556-convert-the-temperature) |\n| [2752-sum-multiples](https://github.com/adityaprasad502/LeetCode/tree/master/2752-sum-multiples) |\n| [3172-divisible-and-non-divisible-sums-difference](https://github.com/adityaprasad502/LeetCode/tree/master/3172-divisible-and-non-divisible-sums-difference) |\n## Bit Manipulation\n|  |\n| ------- |\n| [0231-power-of-two](https://github.com/adityaprasad502/LeetCode/tree/master/0231-power-of-two) |\n| [0342-power-of-four](https://github.com/adityaprasad502/LeetCode/tree/master/0342-power-of-four) |\n## Recursion\n|  |\n| ------- |\n| [0231-power-of-two](https://github.com/adityaprasad502/LeetCode/tree/master/0231-power-of-two) |\n| [0342-power-of-four](https://github.com/adityaprasad502/LeetCode/tree/master/0342-power-of-four) |\n## Array\n|  |\n| ------- |\n| [0628-maximum-product-of-three-numbers](https://github.com/adityaprasad502/LeetCode/tree/master/0628-maximum-product-of-three-numbers) |\n| [1137-height-checker](https://github.com/adityaprasad502/LeetCode/tree/master/1137-height-checker) |\n| [3788-maximum-unique-subarray-sum-after-deletion](https://github.com/adityaprasad502/LeetCode/tree/master/3788-maximum-unique-subarray-sum-after-deletion) |\n## Sorting\n|  |\n| ------- |\n| [0628-maximum-product-of-three-numbers](https://github.com/adityaprasad502/LeetCode/tree/master/0628-maximum-product-of-three-numbers) |\n| [1137-height-checker](https://github.com/adityaprasad502/LeetCode/tree/master/1137-height-checker) |\n## String\n|  |\n| ------- |\n| [0020-valid-parentheses](https://github.com/adityaprasad502/LeetCode/tree/master/0020-valid-parentheses) |\n| [0125-valid-palindrome](https://github.com/adityaprasad502/LeetCode/tree/master/0125-valid-palindrome) |\n| [0520-detect-capital](https://github.com/adityaprasad502/LeetCode/tree/master/0520-detect-capital) |\n| [3379-score-of-a-string](https://github.com/adityaprasad502/LeetCode/tree/master/3379-score-of-a-string) |\n| [3396-valid-word](https://github.com/adityaprasad502/LeetCode/tree/master/3396-valid-word) |\n## Stack\n|  |\n| ------- |\n| [0020-valid-parentheses](https://github.com/adityaprasad502/LeetCode/tree/master/0020-valid-parentheses) |\n## Two Pointers\n|  |\n| ------- |\n| [0125-valid-palindrome](https://github.com/adityaprasad502/LeetCode/tree/master/0125-valid-palindrome) |\n## Counting Sort\n|  |\n| ------- |\n| [1137-height-checker](https://github.com/adityaprasad502/LeetCode/tree/master/1137-height-checker) |\n## Hash Table\n|  |\n| ------- |\n| [3788-maximum-unique-subarray-sum-after-deletion](https://github.com/adityaprasad502/LeetCode/tree/master/3788-maximum-unique-subarray-sum-after-deletion) |\n## Greedy\n|  |\n| ------- |\n| [3788-maximum-unique-subarray-sum-after-deletion](https://github.com/adityaprasad502/LeetCode/tree/master/3788-maximum-unique-subarray-sum-after-deletion) |\n\u003c!---LeetCode Topics End--\u003e\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fadityaprasad502%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fadityaprasad502%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fadityaprasad502%2Fleetcode/lists"}