{"id":24772748,"url":"https://github.com/jmarove/leetcode-playground","last_synced_at":"2025-03-23T21:14:39.986Z","repository":{"id":271633622,"uuid":"914078367","full_name":"JMarOve/LeetCode-Playground","owner":"JMarOve","description":"Another repo with the solutions of the Leetcode problems of the owner. Planning to expand all the solutions to Rust, just for fun. ","archived":false,"fork":false,"pushed_at":"2025-01-26T19:25:13.000Z","size":150,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-26T20:25:53.037Z","etag":null,"topics":["algorithms","leetcode","leetcode-solutions","python"],"latest_commit_sha":null,"homepage":"","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/JMarOve.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-01-08T22:53:07.000Z","updated_at":"2025-01-26T19:25:15.000Z","dependencies_parsed_at":"2025-01-09T00:28:27.516Z","dependency_job_id":"e7378101-48cf-4ffe-96ad-4f5a485aaa68","html_url":"https://github.com/JMarOve/LeetCode-Playground","commit_stats":null,"previous_names":["jmarove/leetcode-playground"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/JMarOve%2FLeetCode-Playground","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/JMarOve%2FLeetCode-Playground/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/JMarOve%2FLeetCode-Playground/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/JMarOve%2FLeetCode-Playground/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/JMarOve","download_url":"https://codeload.github.com/JMarOve/LeetCode-Playground/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245168912,"owners_count":20571804,"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":["algorithms","leetcode","leetcode-solutions","python"],"created_at":"2025-01-29T04:32:19.207Z","updated_at":"2025-03-23T21:14:39.944Z","avatar_url":"https://github.com/JMarOve.png","language":"Python","readme":"# LeetCode-Playground\nJust me wrestling with LeetCode problems in Python (for now)  for fun\"\n\n# To do:\n- [ ] Organize the repo with folders. It's not clear if it's better to have easy-medium-hard or just by numbers.\n- [ ] Create a parallel repo with C++/Rust solutions\n\u003c!---LeetCode Topics Start--\u003e\n# LeetCode Topics\n## Array\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/JMarOve/LeetCode-Playground/tree/master/0001-two-sum) |\n| [0026-remove-duplicates-from-sorted-array](https://github.com/JMarOve/LeetCode-Playground/tree/master/0026-remove-duplicates-from-sorted-array) |\n| [0027-remove-element](https://github.com/JMarOve/LeetCode-Playground/tree/master/0027-remove-element) |\n| [0035-search-insert-position](https://github.com/JMarOve/LeetCode-Playground/tree/master/0035-search-insert-position) |\n| [0054-spiral-matrix](https://github.com/JMarOve/LeetCode-Playground/tree/master/0054-spiral-matrix) |\n| [0066-plus-one](https://github.com/JMarOve/LeetCode-Playground/tree/master/0066-plus-one) |\n| [0118-pascals-triangle](https://github.com/JMarOve/LeetCode-Playground/tree/master/0118-pascals-triangle) |\n| [0119-pascals-triangle-ii](https://github.com/JMarOve/LeetCode-Playground/tree/master/0119-pascals-triangle-ii) |\n| [0121-best-time-to-buy-and-sell-stock](https://github.com/JMarOve/LeetCode-Playground/tree/master/0121-best-time-to-buy-and-sell-stock) |\n| [0136-single-number](https://github.com/JMarOve/LeetCode-Playground/tree/master/0136-single-number) |\n| [0169-majority-element](https://github.com/JMarOve/LeetCode-Playground/tree/master/0169-majority-element) |\n| [0268-missing-number](https://github.com/JMarOve/LeetCode-Playground/tree/master/0268-missing-number) |\n| [0448-find-all-numbers-disappeared-in-an-array](https://github.com/JMarOve/LeetCode-Playground/tree/master/0448-find-all-numbers-disappeared-in-an-array) |\n| [1395-minimum-time-visiting-all-points](https://github.com/JMarOve/LeetCode-Playground/tree/master/1395-minimum-time-visiting-all-points) |\n| [1482-how-many-numbers-are-smaller-than-the-current-number](https://github.com/JMarOve/LeetCode-Playground/tree/master/1482-how-many-numbers-are-smaller-than-the-current-number) |\n## Hash Table\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/JMarOve/LeetCode-Playground/tree/master/0001-two-sum) |\n| [0013-roman-to-integer](https://github.com/JMarOve/LeetCode-Playground/tree/master/0013-roman-to-integer) |\n| [0169-majority-element](https://github.com/JMarOve/LeetCode-Playground/tree/master/0169-majority-element) |\n| [0268-missing-number](https://github.com/JMarOve/LeetCode-Playground/tree/master/0268-missing-number) |\n| [0448-find-all-numbers-disappeared-in-an-array](https://github.com/JMarOve/LeetCode-Playground/tree/master/0448-find-all-numbers-disappeared-in-an-array) |\n| [1482-how-many-numbers-are-smaller-than-the-current-number](https://github.com/JMarOve/LeetCode-Playground/tree/master/1482-how-many-numbers-are-smaller-than-the-current-number) |\n## Math\n|  |\n| ------- |\n| [0007-reverse-integer](https://github.com/JMarOve/LeetCode-Playground/tree/master/0007-reverse-integer) |\n| [0009-palindrome-number](https://github.com/JMarOve/LeetCode-Playground/tree/master/0009-palindrome-number) |\n| [0013-roman-to-integer](https://github.com/JMarOve/LeetCode-Playground/tree/master/0013-roman-to-integer) |\n| [0029-divide-two-integers](https://github.com/JMarOve/LeetCode-Playground/tree/master/0029-divide-two-integers) |\n| [0050-powx-n](https://github.com/JMarOve/LeetCode-Playground/tree/master/0050-powx-n) |\n| [0066-plus-one](https://github.com/JMarOve/LeetCode-Playground/tree/master/0066-plus-one) |\n| [0069-sqrtx](https://github.com/JMarOve/LeetCode-Playground/tree/master/0069-sqrtx) |\n| [0070-climbing-stairs](https://github.com/JMarOve/LeetCode-Playground/tree/master/0070-climbing-stairs) |\n| [0231-power-of-two](https://github.com/JMarOve/LeetCode-Playground/tree/master/0231-power-of-two) |\n| [0258-add-digits](https://github.com/JMarOve/LeetCode-Playground/tree/master/0258-add-digits) |\n| [0263-ugly-number](https://github.com/JMarOve/LeetCode-Playground/tree/master/0263-ugly-number) |\n| [0268-missing-number](https://github.com/JMarOve/LeetCode-Playground/tree/master/0268-missing-number) |\n| [0412-fizz-buzz](https://github.com/JMarOve/LeetCode-Playground/tree/master/0412-fizz-buzz) |\n| [1395-minimum-time-visiting-all-points](https://github.com/JMarOve/LeetCode-Playground/tree/master/1395-minimum-time-visiting-all-points) |\n## Binary Search\n|  |\n| ------- |\n| [0035-search-insert-position](https://github.com/JMarOve/LeetCode-Playground/tree/master/0035-search-insert-position) |\n| [0069-sqrtx](https://github.com/JMarOve/LeetCode-Playground/tree/master/0069-sqrtx) |\n| [0268-missing-number](https://github.com/JMarOve/LeetCode-Playground/tree/master/0268-missing-number) |\n## Bit Manipulation\n|  |\n| ------- |\n| [0029-divide-two-integers](https://github.com/JMarOve/LeetCode-Playground/tree/master/0029-divide-two-integers) |\n| [0136-single-number](https://github.com/JMarOve/LeetCode-Playground/tree/master/0136-single-number) |\n| [0190-reverse-bits](https://github.com/JMarOve/LeetCode-Playground/tree/master/0190-reverse-bits) |\n| [0191-number-of-1-bits](https://github.com/JMarOve/LeetCode-Playground/tree/master/0191-number-of-1-bits) |\n| [0231-power-of-two](https://github.com/JMarOve/LeetCode-Playground/tree/master/0231-power-of-two) |\n| [0268-missing-number](https://github.com/JMarOve/LeetCode-Playground/tree/master/0268-missing-number) |\n## Sorting\n|  |\n| ------- |\n| [0169-majority-element](https://github.com/JMarOve/LeetCode-Playground/tree/master/0169-majority-element) |\n| [0268-missing-number](https://github.com/JMarOve/LeetCode-Playground/tree/master/0268-missing-number) |\n| [1482-how-many-numbers-are-smaller-than-the-current-number](https://github.com/JMarOve/LeetCode-Playground/tree/master/1482-how-many-numbers-are-smaller-than-the-current-number) |\n## Counting\n|  |\n| ------- |\n| [0169-majority-element](https://github.com/JMarOve/LeetCode-Playground/tree/master/0169-majority-element) |\n| [1482-how-many-numbers-are-smaller-than-the-current-number](https://github.com/JMarOve/LeetCode-Playground/tree/master/1482-how-many-numbers-are-smaller-than-the-current-number) |\n## String\n|  |\n| ------- |\n| [0013-roman-to-integer](https://github.com/JMarOve/LeetCode-Playground/tree/master/0013-roman-to-integer) |\n| [0014-longest-common-prefix](https://github.com/JMarOve/LeetCode-Playground/tree/master/0014-longest-common-prefix) |\n| [0020-valid-parentheses](https://github.com/JMarOve/LeetCode-Playground/tree/master/0020-valid-parentheses) |\n| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/JMarOve/LeetCode-Playground/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |\n| [0058-length-of-last-word](https://github.com/JMarOve/LeetCode-Playground/tree/master/0058-length-of-last-word) |\n| [0125-valid-palindrome](https://github.com/JMarOve/LeetCode-Playground/tree/master/0125-valid-palindrome) |\n| [0412-fizz-buzz](https://github.com/JMarOve/LeetCode-Playground/tree/master/0412-fizz-buzz) |\n## Database\n|  |\n| ------- |\n| [0175-combine-two-tables](https://github.com/JMarOve/LeetCode-Playground/tree/master/0175-combine-two-tables) |\n## Geometry\n|  |\n| ------- |\n| [1395-minimum-time-visiting-all-points](https://github.com/JMarOve/LeetCode-Playground/tree/master/1395-minimum-time-visiting-all-points) |\n## Matrix\n|  |\n| ------- |\n| [0054-spiral-matrix](https://github.com/JMarOve/LeetCode-Playground/tree/master/0054-spiral-matrix) |\n## Simulation\n|  |\n| ------- |\n| [0054-spiral-matrix](https://github.com/JMarOve/LeetCode-Playground/tree/master/0054-spiral-matrix) |\n| [0258-add-digits](https://github.com/JMarOve/LeetCode-Playground/tree/master/0258-add-digits) |\n| [0412-fizz-buzz](https://github.com/JMarOve/LeetCode-Playground/tree/master/0412-fizz-buzz) |\n## Trie\n|  |\n| ------- |\n| [0014-longest-common-prefix](https://github.com/JMarOve/LeetCode-Playground/tree/master/0014-longest-common-prefix) |\n## Stack\n|  |\n| ------- |\n| [0020-valid-parentheses](https://github.com/JMarOve/LeetCode-Playground/tree/master/0020-valid-parentheses) |\n## Two Pointers\n|  |\n| ------- |\n| [0026-remove-duplicates-from-sorted-array](https://github.com/JMarOve/LeetCode-Playground/tree/master/0026-remove-duplicates-from-sorted-array) |\n| [0027-remove-element](https://github.com/JMarOve/LeetCode-Playground/tree/master/0027-remove-element) |\n| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/JMarOve/LeetCode-Playground/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |\n| [0125-valid-palindrome](https://github.com/JMarOve/LeetCode-Playground/tree/master/0125-valid-palindrome) |\n## String Matching\n|  |\n| ------- |\n| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/JMarOve/LeetCode-Playground/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |\n## Dynamic Programming\n|  |\n| ------- |\n| [0070-climbing-stairs](https://github.com/JMarOve/LeetCode-Playground/tree/master/0070-climbing-stairs) |\n| [0118-pascals-triangle](https://github.com/JMarOve/LeetCode-Playground/tree/master/0118-pascals-triangle) |\n| [0119-pascals-triangle-ii](https://github.com/JMarOve/LeetCode-Playground/tree/master/0119-pascals-triangle-ii) |\n| [0121-best-time-to-buy-and-sell-stock](https://github.com/JMarOve/LeetCode-Playground/tree/master/0121-best-time-to-buy-and-sell-stock) |\n## Memoization\n|  |\n| ------- |\n| [0070-climbing-stairs](https://github.com/JMarOve/LeetCode-Playground/tree/master/0070-climbing-stairs) |\n## Divide and Conquer\n|  |\n| ------- |\n| [0169-majority-element](https://github.com/JMarOve/LeetCode-Playground/tree/master/0169-majority-element) |\n| [0190-reverse-bits](https://github.com/JMarOve/LeetCode-Playground/tree/master/0190-reverse-bits) |\n| [0191-number-of-1-bits](https://github.com/JMarOve/LeetCode-Playground/tree/master/0191-number-of-1-bits) |\n## Recursion\n|  |\n| ------- |\n| [0021-merge-two-sorted-lists](https://github.com/JMarOve/LeetCode-Playground/tree/master/0021-merge-two-sorted-lists) |\n| [0050-powx-n](https://github.com/JMarOve/LeetCode-Playground/tree/master/0050-powx-n) |\n| [0231-power-of-two](https://github.com/JMarOve/LeetCode-Playground/tree/master/0231-power-of-two) |\n## Number Theory\n|  |\n| ------- |\n| [0258-add-digits](https://github.com/JMarOve/LeetCode-Playground/tree/master/0258-add-digits) |\n## Linked List\n|  |\n| ------- |\n| [0021-merge-two-sorted-lists](https://github.com/JMarOve/LeetCode-Playground/tree/master/0021-merge-two-sorted-lists) |\n\u003c!---LeetCode Topics End--\u003e\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjmarove%2Fleetcode-playground","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjmarove%2Fleetcode-playground","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjmarove%2Fleetcode-playground/lists"}