{"id":24191279,"url":"https://github.com/andrem222/leetcode","last_synced_at":"2025-08-02T00:34:08.997Z","repository":{"id":168428967,"uuid":"644063722","full_name":"AndreM222/Leetcode","owner":"AndreM222","description":"My leetcode challenges","archived":false,"fork":false,"pushed_at":"2024-03-28T16:58:12.000Z","size":68,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-06-06T21:41:41.471Z","etag":null,"topics":["leetcode","leetcode-cpp","leetcode-solutions","study"],"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/AndreM222.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,"zenodo":null}},"created_at":"2023-05-22T18:29:34.000Z","updated_at":"2023-05-22T18:37:25.000Z","dependencies_parsed_at":null,"dependency_job_id":"ef01f3ad-39c4-43f1-9674-0e7ee85f534d","html_url":"https://github.com/AndreM222/Leetcode","commit_stats":null,"previous_names":["andrem222/leetcode"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/AndreM222/Leetcode","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AndreM222%2FLeetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AndreM222%2FLeetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AndreM222%2FLeetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AndreM222%2FLeetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/AndreM222","download_url":"https://codeload.github.com/AndreM222/Leetcode/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AndreM222%2FLeetcode/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":265606691,"owners_count":23796989,"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-cpp","leetcode-solutions","study"],"created_at":"2025-01-13T15:18:13.233Z","updated_at":"2025-07-17T12:34:50.189Z","avatar_url":"https://github.com/AndreM222.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"\u003ch1 align=\"center\"\u003eLeetcode \u003cimg width=\"50\" align=\"center\" justify=\"center\" src=\"doc/Leetcode-Icon.png\"\u003e\u003c/h1\u003e\n\u003ci\u003e\"If you only do what you can do, you will never be more than who you are.\"\u003c/i\u003e\n\n\u003cdiv align=\"right\"\u003e\n    - Kung Fu Panda: Master Shifu \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp;\n\u003c/div\u003e\n\n\u0026nbsp;\n\n\u0026nbsp;\n\n\u003ch2\u003eAbout\u003c/h2\u003e\n\nThis repository contain leetcode challenges answers which I came up with using C++.\nIn order to grow and achieve my dream I take as many challenges as possible and projects to grow\nmy knowledge and understanding.\n\n\u003cimg align=\"right\" src=\"https://media.giphy.com/media/hTlYvDvLU7qnVbv0Qq/giphy.gif\" width=\"200\"/\u003e\n\n\u003ch2\u003eLevels\u003c/h2\u003e\n\n\u003c!--toc:start--\u003e\n- [Hard](#hard)\n- [Medium](#medium)\n- [Easy](#easy)\n\u003c!--toc:end--\u003e\n\n## Hard\n\n| #   | Title                       | Solutions                                                        | Difficulty |\n| --- | --------------------------- | ---------------------------------------------------------------- | ---------- |\n| 4   | Median of Two Sorted Arrays | [C++](/Hard-Level/CPP-Solutions/Median-of-Two-Sorted-Arrays.cpp) | Hard       |\n| 25  | Reverse Nodes in k-Group    | [C++](/Hard-Level/CPP-Solutions/Reverse-Nodes-in-k-Group.cpp)    | Hard       |\n\n## Medium\n\n| #    | Title                                                   | Solutions                                                                                      | Difficulty |\n| ---- | ------------------------------------------------------- | ---------------------------------------------------------------------------------------------- | ---------- |\n| 2    | Add Two Numbers                                         | [C++](/Medium-Level/CPP-Solutions/Add-Two-Numbers.cpp)                                         | Medium     |\n| 3    | Longest Substring Without Repeating Characters          | [C++](/Medium-Level/CPP-Solutions/Longest-Substring-Without-Repeating-Characters.cpp)          | Medium     |\n| 5    | Longest Palindromic Number                              | [C++](/Medium-Level/CPP-Solutions/Longest-Palindromic-Number.cpp)                              | Medium     |\n| 7    | Reverse Integer                                         | [C++](/Medium-Level/CPP-Solutions/Reverse-Integer.cpp)                                         | Medium     |\n| 98   | Validate Binary Search Tree                             | [C++](/Medium-Level/CPP-Solutions/Validate-Binary-Search-Tree.cpp)                             | Medium     |\n| 135  | Copy List with Random Pointer                           | [C++](/Medium-Level/CPP-Solutions/Copy-List-With-Random-Pointer.cpp)                           | Medium     |\n| 785  | Is Graph Bipartite?                                     | [C++](/Medium-Level/CPP-Solutions/Is-Geaph-Bipartite.cpp)                                      | Medium     |\n| 1143 | Longest Common Subsequence                              | [C++](/Medium-Level/CPP-Solutions/Longest-Common-Subsequence.cpp)                              | Medium     |\n| 1476 | Subrectangle Queries                                    | [C++](/Medium-Level/CPP-Solutions/Subrectangle-Queries.cpp)                                    | Medium     |\n| 1689 | Partitioning Into Minimum Number Of Deci-Binary Numbers | [C++](/Medium-Level/CPP-Solutions/Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers.cpp) | Medium     |\n\n## Easy\n\n| #    | Title                                      | Solutions                                                                   | Difficulty |\n| ---- | ------------------------------------------ | --------------------------------------------------------------------------- | ---------- |\n| 1    | Two Sum                                    | [C++](/Easy-Level/CPP-Solutions/Two-Sums.cpp)                               | Easy       |\n| 9    | Palindrome Number                          | [C++](/Easy-Level/CPP-Solutions/Palindrome-Number.cpp)                      | Easy       |\n| 21   | Merge Two Sorted Lists                     | [C++](/Easy-Level/CPP-Solutions/Merge-Two-Sorted-Lists.cpp)                 | Easy       |\n| 1203 | Design Parking System                      | [C++](/Easy-Level/CPP-Solutions/Design-Parking-System.cpp)                  | Easy       |\n| 1232 | Check If It Is a Straight Line             | [C++](/Easy-Level/CPP-Solutions/Check-If-It-Is-a-Straight-Line.cpp)         | Easy       |\n| 2108 | Find First Palindromic String in the Array | [C++](/Easy-Level/CPP-Solutions/Find-First-Palindromic-String-In-Array.cpp) | Easy       |\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fandrem222%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fandrem222%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fandrem222%2Fleetcode/lists"}