{"id":26428824,"url":"https://github.com/theoliverlear/leetcode-solutions","last_synced_at":"2025-10-14T12:19:42.389Z","repository":{"id":281744362,"uuid":"945618698","full_name":"theoliverlear/LeetCode-Solutions","owner":"theoliverlear","description":"A helpful guide to solving LeetCode problems in various languages. See solutions and how different implementations affect performance.","archived":false,"fork":false,"pushed_at":"2025-08-07T00:23:23.000Z","size":28,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-08-07T02:29:44.889Z","etag":null,"topics":["algorithms","documentation","educational","guide","leetcode","leetcode-solutions"],"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/theoliverlear.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":"2025-03-09T20:42:27.000Z","updated_at":"2025-08-07T00:23:26.000Z","dependencies_parsed_at":"2025-04-25T14:20:53.779Z","dependency_job_id":null,"html_url":"https://github.com/theoliverlear/LeetCode-Solutions","commit_stats":null,"previous_names":["theoliverlear/leetcode-solutions"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/theoliverlear/LeetCode-Solutions","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/theoliverlear%2FLeetCode-Solutions","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/theoliverlear%2FLeetCode-Solutions/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/theoliverlear%2FLeetCode-Solutions/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/theoliverlear%2FLeetCode-Solutions/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/theoliverlear","download_url":"https://codeload.github.com/theoliverlear/LeetCode-Solutions/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/theoliverlear%2FLeetCode-Solutions/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":279019420,"owners_count":26086576,"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","status":"online","status_checked_at":"2025-10-14T02:00:06.444Z","response_time":60,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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","documentation","educational","guide","leetcode","leetcode-solutions"],"created_at":"2025-03-18T04:41:40.407Z","updated_at":"2025-10-14T12:19:42.380Z","avatar_url":"https://github.com/theoliverlear.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# LeetCode-Solutions\n\n---\n\nThis repository contains my solutions to [LeetCode](https://leetcode.com/) \nproblems. Each problem is solved in multiple languages including, but not \nlimited to:\n- Java\n- Python\n- C\n- C++\n- TypeScript\n- JavaScript\n- C#\n- PHP\n- Go\n- Rust\n\nEach folder corresponds to a specific problem and contains subfolders for \neach language. There are two ways I approach each problem, the optimized \nversion and the clean version. They will each have their respective solutions\nin language sub-folders.\n\n## Problems Solved\n\n| Problem #                                                                  | Problem Name                                   | Tags                                   | Optimized Solutions                                                                           | Clean Solutions                                                                           |\n|----------------------------------------------------------------------------|------------------------------------------------|----------------------------------------|-----------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------------------|\n| **[0001](./Problem-0001-Two-Sum/)**                                        | Two Sum                                        | Array, HashTable                       | [Link](./Problem-0001-Two-Sum/Problem-0001-Optimized/)                                        | [Link](./Problem-0001-Two-Sum/Problem-0001-Clean/)                                        |\n| **[0002](./Problem-0002-Add-Two-Numbers/)**                                | Adding Two Numbers                             | Linked List, Math, Recursion           | [Link](./Problem-0002-Add-Two-Numbers/Problem-0002-Optimized/)                                | [Link](./Problem-0002-Add-Two-Numbers/Problem-0002-Clean/)                                |\n| **[0003](./Problem-0003-Longest-Substring-Without-Repeating-Characters/)** | Longest Substring Without Repeating Characters | Hash Table, String, Sliding Window     | [Link](./Problem-0003-Longest-Substring-Without-Repeating-Characters/Problem-0003-Optimized/) | [Link](./Problem-0003-Longest-Substring-Without-Repeating-Characters/Problem-0003-Clean/) |\n| **[0008](./Problem-0008-String-To-Integer)**                               | String to Integer (atoi)                       | String                                 | [Link](./Problem-0008-String-To-Integer/Problem-0008-Optimized/)                              | [Link](./Problem-0008-String-To-Integer/Problem-0008-Clean/)                              |\n| **[0012](./Problem-0012-Integer-To-Roman/)**                               | Integer to Roman                               | Hash Table, Math, String               | [Link](./Problem-0012-Integer-To-Roman/Problem-0012-Optimized/)                               | [Link](./Problem-0012-Integer-To-Roman/Problem-0012-Clean/)                               |\n| **[0094](./Problem-0094-Binary-Tree-Inorder-Traversal/)**                  | Binary Tree Inorder Traversal                  | Binary Tree, Depth-First Search, Stack | [Link](./Problem-0094-Binary-Tree-Inorder-Traversal/Problem-0094-Optimized/)                  | [Link](./Problem-0002-Add-Two-Numbers/Problem-0002-Clean/)                                |\n| **[0509](./Problem-0509-Fibonacci-Number/)**                               | Fibonacci Number                               | Recursion, Math, Memoization           | [Link](./Problem-0509-Fibonacci-Number/Problem-0509-Optimized/)                               | N/A                                                                                       |\n| **[0912](./Problem-0912-Sort-An-Array/)**                                  | Sort an Array                                  | Array, Sorting, Divide and Conquer     | [Link](./Problem-0912-Sort-An-Array/Problem-0912-Optimized/)                                  | N/A                                                                                       |\n\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftheoliverlear%2Fleetcode-solutions","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftheoliverlear%2Fleetcode-solutions","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftheoliverlear%2Fleetcode-solutions/lists"}