{"id":24374598,"url":"https://github.com/ereh11/leetcode-75","last_synced_at":"2025-08-16T10:51:53.244Z","repository":{"id":272085353,"uuid":"915484661","full_name":"Ereh11/LeetCode-75","owner":"Ereh11","description":"LeetCode 75 Study Plan ","archived":false,"fork":false,"pushed_at":"2025-01-25T16:33:37.000Z","size":11,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-12T11:48:49.429Z","etag":null,"topics":["competitive-programming","cpp","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/Ereh11.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-12T00:41:47.000Z","updated_at":"2025-01-25T16:33:41.000Z","dependencies_parsed_at":"2025-01-18T22:46:50.443Z","dependency_job_id":null,"html_url":"https://github.com/Ereh11/LeetCode-75","commit_stats":null,"previous_names":["ereh11/leetcode-75"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Ereh11/LeetCode-75","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Ereh11%2FLeetCode-75","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Ereh11%2FLeetCode-75/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Ereh11%2FLeetCode-75/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Ereh11%2FLeetCode-75/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Ereh11","download_url":"https://codeload.github.com/Ereh11/LeetCode-75/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Ereh11%2FLeetCode-75/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":270702479,"owners_count":24630873,"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-08-16T02:00:11.002Z","response_time":91,"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":["competitive-programming","cpp","leetcode-solutions"],"created_at":"2025-01-19T05:40:50.625Z","updated_at":"2025-08-16T10:51:53.226Z","avatar_url":"https://github.com/Ereh11.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# LeetCode 75 Study Plan Solutions\n\nWelcome to my solutions repository for the [LeetCode 75 Study Plan](https://leetcode.com/studyplan/leetcode-75/) challenge! This repository contains my implementations for all the problems in the challenge, organized by difficulty and topic.\n\n## Table of Contents\n\n- [About the Challenge](#about-the-challenge)\n- [Solutions Overview](#solutions-overview)\n- [Directory Structure](#directory-structure)\n- [How to Use](#how-to-use)\n- [Technologies Used](#technologies-used)\n- [License](#license)\n\n## About the Challenge\n\nThe **LeetCode 75 Study Plan** is designed to help developers master fundamental problem-solving skills and prepare for technical interviews. The challenge covers a variety of data structures and algorithms, divided into tiers for structured learning.\n\n## Solutions Overview\n\n| No | Problem Link | Difficulty | Topic |\n|-----|--------------|------------|-------|\n| 1   | [Merge Strings Alternately](https://leetcode.com/problems/merge-strings-alternately/description/?envType=study-plan-v2\u0026envId=leetcode-75) | Easy       | Strings |\n| 2   | [Greatest Common Divisor of Strings](https://leetcode.com/problems/greatest-common-divisor-of-strings/?envType=study-plan-v2\u0026envId=leetcode-75) | Easy     | Strings |\n| 3  | [Kids With the Greatest Number of Candies](https://leetcode.com/problems/kids-with-the-greatest-number-of-candies/description/?envType=study-plan-v2\u0026envId=leetcode-75) | Easy     | Arrays |\n| 4   | [Can Place Flowers](https://leetcode.com/problems/can-place-flowers/description/?envType=study-plan-v2\u0026envId=leetcode-75) | Easy     | Arrays |\n| 5   | [Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string/description/?envType=study-plan-v2\u0026envId=leetcode-75) | Easy     | Strings |\n| 6   | [Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string/description/?envType=study-plan-v2\u0026envId=leetcode-75) | Medium     | Strings |\n| 7   | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/description/?envType=study-plan-v2\u0026envId=leetcode-75) | Medium     | Arrays |\n| 8   | [Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence/description/?envType=study-plan-v2\u0026envId=leetcode-75) | Medium     | Arrays |\n| 9   | [String Compression](https://leetcode.com/problems/string-compression/description/?envType=study-plan-v2\u0026envId=leetcode-75)| Strings |\n\n\u003e **Note:** The solutions are written in C++.\n\n## Directory Structure\n\n```plaintext\n.\n├── Arrays/\n│   ├── Problem1.cs\n│   └── Problem2.cs\n├── Strings/\n│   ├── Problem3.cs\n│   └── Problem4.cs\n├── STLs/\n│   ├── Problem5.cs\n│   └── Problem6.cs\n└── README.md\n```\n\n- Each folder represents a topic.\n- Each file contains the solution for a specific problem.\n\n## How to Use\n\n1. Clone this repository:\n   ```bash\n   git clone https://github.com/Ereh11/leetcode-75.git\n   ```\n2. Navigate to the desired problem's file in the appropriate directory.\n3. Review the solution or run it in your preferred IDE (e.g., Visual Studio).\n\n## Technologies Used\n\n- **Language:** C++\n- **IDE:** VS Code\n\n## License\n\nThis repository is licensed under the MIT License. Feel free to use and modify the code for personal or educational purposes.\n\n---\n\nHappy coding! 🎉 If you find this repository helpful, consider giving it a ⭐!\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fereh11%2Fleetcode-75","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fereh11%2Fleetcode-75","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fereh11%2Fleetcode-75/lists"}