https://github.com/ereh11/leetcode-75
LeetCode 75 Study Plan
https://github.com/ereh11/leetcode-75
competitive-programming cpp leetcode-solutions
Last synced: 11 months ago
JSON representation
LeetCode 75 Study Plan
- Host: GitHub
- URL: https://github.com/ereh11/leetcode-75
- Owner: Ereh11
- Created: 2025-01-12T00:41:47.000Z (over 1 year ago)
- Default Branch: main
- Last Pushed: 2025-01-25T16:33:37.000Z (over 1 year ago)
- Last Synced: 2025-03-12T11:48:49.429Z (over 1 year ago)
- Topics: competitive-programming, cpp, leetcode-solutions
- Language: C++
- Homepage:
- Size: 10.7 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# LeetCode 75 Study Plan Solutions
Welcome 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.
## Table of Contents
- [About the Challenge](#about-the-challenge)
- [Solutions Overview](#solutions-overview)
- [Directory Structure](#directory-structure)
- [How to Use](#how-to-use)
- [Technologies Used](#technologies-used)
- [License](#license)
## About the Challenge
The **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.
## Solutions Overview
| No | Problem Link | Difficulty | Topic |
|-----|--------------|------------|-------|
| 1 | [Merge Strings Alternately](https://leetcode.com/problems/merge-strings-alternately/description/?envType=study-plan-v2&envId=leetcode-75) | Easy | Strings |
| 2 | [Greatest Common Divisor of Strings](https://leetcode.com/problems/greatest-common-divisor-of-strings/?envType=study-plan-v2&envId=leetcode-75) | Easy | Strings |
| 3 | [Kids With the Greatest Number of Candies](https://leetcode.com/problems/kids-with-the-greatest-number-of-candies/description/?envType=study-plan-v2&envId=leetcode-75) | Easy | Arrays |
| 4 | [Can Place Flowers](https://leetcode.com/problems/can-place-flowers/description/?envType=study-plan-v2&envId=leetcode-75) | Easy | Arrays |
| 5 | [Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string/description/?envType=study-plan-v2&envId=leetcode-75) | Easy | Strings |
| 6 | [Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string/description/?envType=study-plan-v2&envId=leetcode-75) | Medium | Strings |
| 7 | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/description/?envType=study-plan-v2&envId=leetcode-75) | Medium | Arrays |
| 8 | [Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence/description/?envType=study-plan-v2&envId=leetcode-75) | Medium | Arrays |
| 9 | [String Compression](https://leetcode.com/problems/string-compression/description/?envType=study-plan-v2&envId=leetcode-75)| Strings |
> **Note:** The solutions are written in C++.
## Directory Structure
```plaintext
.
├── Arrays/
│ ├── Problem1.cs
│ └── Problem2.cs
├── Strings/
│ ├── Problem3.cs
│ └── Problem4.cs
├── STLs/
│ ├── Problem5.cs
│ └── Problem6.cs
└── README.md
```
- Each folder represents a topic.
- Each file contains the solution for a specific problem.
## How to Use
1. Clone this repository:
```bash
git clone https://github.com/Ereh11/leetcode-75.git
```
2. Navigate to the desired problem's file in the appropriate directory.
3. Review the solution or run it in your preferred IDE (e.g., Visual Studio).
## Technologies Used
- **Language:** C++
- **IDE:** VS Code
## License
This repository is licensed under the MIT License. Feel free to use and modify the code for personal or educational purposes.
---
Happy coding! 🎉 If you find this repository helpful, consider giving it a ⭐!