{"id":15740431,"url":"https://github.com/darkmatter18/leetcode","last_synced_at":"2025-06-18T11:40:21.522Z","repository":{"id":64420281,"uuid":"548814061","full_name":"darkmatter18/leetcode","owner":"darkmatter18","description":"Practicing Code, killing time. My Leetcode Solutions. Don't copy, try yourself.","archived":false,"fork":false,"pushed_at":"2025-01-08T15:25:24.000Z","size":585,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-03-31T05:09:27.452Z","etag":null,"topics":["competitive-programming","leetcode","leetcode-solutions"],"latest_commit_sha":null,"homepage":"","language":"C++","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/darkmatter18.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":"2022-10-10T08:15:57.000Z","updated_at":"2025-01-08T15:25:28.000Z","dependencies_parsed_at":"2022-12-17T20:20:07.128Z","dependency_job_id":"0aee784f-098f-4d20-bfd9-ddac86f8ff91","html_url":"https://github.com/darkmatter18/leetcode","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/darkmatter18/leetcode","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/darkmatter18%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/darkmatter18%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/darkmatter18%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/darkmatter18%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/darkmatter18","download_url":"https://codeload.github.com/darkmatter18/leetcode/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/darkmatter18%2Fleetcode/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":260546274,"owners_count":23025908,"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":["competitive-programming","leetcode","leetcode-solutions"],"created_at":"2024-10-04T02:21:25.895Z","updated_at":"2025-06-18T11:40:16.488Z","avatar_url":"https://github.com/darkmatter18.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# My Leetcode solution\n\nI don't know why.......... But I am doing it.\n\n![forthebadge](https://forthebadge.com/images/badges/uses-badges.svg)![forthebadge](https://forthebadge.com/images/badges/built-by-developers.svg)![forthebadge](https://forthebadge.com/images/badges/contains-17-coffee-cups.svg)![forthebadge](https://forthebadge.com/images/badges/ctrl-c-ctrl-v.svg)![forthebadge](https://forthebadge.com/images/badges/for-robots.svg)\n\n## Don't ask how, Just remember it ![forthebadge](https://forthebadge.com/images/badges/works-on-my-machine.svg).\n\n\n[![forthebadge](https://forthebadge.com/images/badges/no-ragrets.svg)](https://forthebadge.com)\n\n\u003c!---LeetCode Topics Start--\u003e\n# LeetCode Topics\n## Array\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/darkmatter18/leetcode/tree/master/0001-two-sum) |\n| [0039-combination-sum](https://github.com/darkmatter18/leetcode/tree/master/0039-combination-sum) |\n| [0078-subsets](https://github.com/darkmatter18/leetcode/tree/master/0078-subsets) |\n| [0128-longest-consecutive-sequence](https://github.com/darkmatter18/leetcode/tree/master/0128-longest-consecutive-sequence) |\n| [0150-evaluate-reverse-polish-notation](https://github.com/darkmatter18/leetcode/tree/master/0150-evaluate-reverse-polish-notation) |\n| [0238-product-of-array-except-self](https://github.com/darkmatter18/leetcode/tree/master/0238-product-of-array-except-self) |\n| [0747-min-cost-climbing-stairs](https://github.com/darkmatter18/leetcode/tree/master/0747-min-cost-climbing-stairs) |\n| [2358-number-of-ways-to-split-array](https://github.com/darkmatter18/leetcode/tree/master/2358-number-of-ways-to-split-array) |\n| [3309-count-prefix-and-suffix-pairs-i](https://github.com/darkmatter18/leetcode/tree/master/3309-count-prefix-and-suffix-pairs-i) |\n## Prefix Sum\n|  |\n| ------- |\n| [0238-product-of-array-except-self](https://github.com/darkmatter18/leetcode/tree/master/0238-product-of-array-except-self) |\n| [2358-number-of-ways-to-split-array](https://github.com/darkmatter18/leetcode/tree/master/2358-number-of-ways-to-split-array) |\n## Hash Table\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/darkmatter18/leetcode/tree/master/0001-two-sum) |\n| [0128-longest-consecutive-sequence](https://github.com/darkmatter18/leetcode/tree/master/0128-longest-consecutive-sequence) |\n## Union Find\n|  |\n| ------- |\n| [0128-longest-consecutive-sequence](https://github.com/darkmatter18/leetcode/tree/master/0128-longest-consecutive-sequence) |\n## Math\n|  |\n| ------- |\n| [0150-evaluate-reverse-polish-notation](https://github.com/darkmatter18/leetcode/tree/master/0150-evaluate-reverse-polish-notation) |\n## Stack\n|  |\n| ------- |\n| [0150-evaluate-reverse-polish-notation](https://github.com/darkmatter18/leetcode/tree/master/0150-evaluate-reverse-polish-notation) |\n## Tree\n|  |\n| ------- |\n| [0100-same-tree](https://github.com/darkmatter18/leetcode/tree/master/0100-same-tree) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/darkmatter18/leetcode/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0110-balanced-binary-tree](https://github.com/darkmatter18/leetcode/tree/master/0110-balanced-binary-tree) |\n| [0226-invert-binary-tree](https://github.com/darkmatter18/leetcode/tree/master/0226-invert-binary-tree) |\n| [0543-diameter-of-binary-tree](https://github.com/darkmatter18/leetcode/tree/master/0543-diameter-of-binary-tree) |\n| [0572-subtree-of-another-tree](https://github.com/darkmatter18/leetcode/tree/master/0572-subtree-of-another-tree) |\n## Depth-First Search\n|  |\n| ------- |\n| [0100-same-tree](https://github.com/darkmatter18/leetcode/tree/master/0100-same-tree) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/darkmatter18/leetcode/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0110-balanced-binary-tree](https://github.com/darkmatter18/leetcode/tree/master/0110-balanced-binary-tree) |\n| [0226-invert-binary-tree](https://github.com/darkmatter18/leetcode/tree/master/0226-invert-binary-tree) |\n| [0543-diameter-of-binary-tree](https://github.com/darkmatter18/leetcode/tree/master/0543-diameter-of-binary-tree) |\n| [0572-subtree-of-another-tree](https://github.com/darkmatter18/leetcode/tree/master/0572-subtree-of-another-tree) |\n## Breadth-First Search\n|  |\n| ------- |\n| [0100-same-tree](https://github.com/darkmatter18/leetcode/tree/master/0100-same-tree) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/darkmatter18/leetcode/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0226-invert-binary-tree](https://github.com/darkmatter18/leetcode/tree/master/0226-invert-binary-tree) |\n## Binary Tree\n|  |\n| ------- |\n| [0100-same-tree](https://github.com/darkmatter18/leetcode/tree/master/0100-same-tree) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/darkmatter18/leetcode/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0110-balanced-binary-tree](https://github.com/darkmatter18/leetcode/tree/master/0110-balanced-binary-tree) |\n| [0226-invert-binary-tree](https://github.com/darkmatter18/leetcode/tree/master/0226-invert-binary-tree) |\n| [0543-diameter-of-binary-tree](https://github.com/darkmatter18/leetcode/tree/master/0543-diameter-of-binary-tree) |\n| [0572-subtree-of-another-tree](https://github.com/darkmatter18/leetcode/tree/master/0572-subtree-of-another-tree) |\n## String Matching\n|  |\n| ------- |\n| [0572-subtree-of-another-tree](https://github.com/darkmatter18/leetcode/tree/master/0572-subtree-of-another-tree) |\n| [3309-count-prefix-and-suffix-pairs-i](https://github.com/darkmatter18/leetcode/tree/master/3309-count-prefix-and-suffix-pairs-i) |\n## Hash Function\n|  |\n| ------- |\n| [0572-subtree-of-another-tree](https://github.com/darkmatter18/leetcode/tree/master/0572-subtree-of-another-tree) |\n| [3309-count-prefix-and-suffix-pairs-i](https://github.com/darkmatter18/leetcode/tree/master/3309-count-prefix-and-suffix-pairs-i) |\n## Backtracking\n|  |\n| ------- |\n| [0039-combination-sum](https://github.com/darkmatter18/leetcode/tree/master/0039-combination-sum) |\n| [0078-subsets](https://github.com/darkmatter18/leetcode/tree/master/0078-subsets) |\n## Bit Manipulation\n|  |\n| ------- |\n| [0078-subsets](https://github.com/darkmatter18/leetcode/tree/master/0078-subsets) |\n## Dynamic Programming\n|  |\n| ------- |\n| [0747-min-cost-climbing-stairs](https://github.com/darkmatter18/leetcode/tree/master/0747-min-cost-climbing-stairs) |\n## Trie\n|  |\n| ------- |\n| [3309-count-prefix-and-suffix-pairs-i](https://github.com/darkmatter18/leetcode/tree/master/3309-count-prefix-and-suffix-pairs-i) |\n## Rolling Hash\n|  |\n| ------- |\n| [3309-count-prefix-and-suffix-pairs-i](https://github.com/darkmatter18/leetcode/tree/master/3309-count-prefix-and-suffix-pairs-i) |\n\u003c!---LeetCode Topics End--\u003e","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdarkmatter18%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdarkmatter18%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdarkmatter18%2Fleetcode/lists"}