The LeetCode 75 Study Plan is a curated set of problems designed to sharpen core algorithmic and data-structure skills for technical interviews. It covers two tiers:
| Tier | Topics |
|---|---|
| Tier 1 | Arrays & Strings, Linked List, Two Pointers, Stack |
| Tier 2 | Sliding Window, Trees, Binary Search, Backtracking, Heap / Priority Queue, Graphs |
🚧 Repository is actively growing — check back for new solutions!
| # | Problem | Difficulty | Topic | File |
|---|---|---|---|---|
| 1 | Merge Strings Alternately | Easy | Strings | Merge%20Strings%20Alternately.cpp |
| 2 | Greatest Common Divisor of Strings | Easy | Strings | GCD%20of%20Strings.cpp |
| 3 | Kids With the Greatest Number of Candies | Easy | Arrays | Kids%20With%20Candies.cpp |
| 4 | Can Place Flowers | Easy | Arrays | Can%20Place%20Flowers.cpp |
| 5 | Reverse Vowels of a String | Easy | Strings | Reverse%20Vowels.cpp |
| 6 | Reverse Words in a String | Medium | Strings | Reverse%20Words.cpp |
| 7 | Product of Array Except Self | Medium | Arrays | Product%20of%20Array%20Except%20Self.cpp |
| 8 | Increasing Triplet Subsequence | Medium | Arrays | Increasing%20Triplet%20Subsequence.cpp |
| 9 | String Compression | Medium | Strings | String%20Compression.cpp |
LeetCode-75/
└── Array&String/
├── Merge Strings Alternately.cpp
├── GCD of Strings.cpp
├── Kids With Candies.cpp
├── Can Place Flowers.cpp
├── Reverse Vowels.cpp
├── Reverse Words.cpp
├── Product of Array Except Self.cpp
├── Increasing Triplet Subsequence.cpp
└── String Compression.cpp
💡 Additional topic folders (Linked List, Two Pointers, Sliding Window, etc.) will be added as solutions are completed.
-
Clone the repository:
git clone https://github.com/Ereh11/LeetCode-75.git
-
Browse solutions — Each
.cppfile contains one complete solution with clear variable naming. -
Compile & run locally:
g++ "Array&String/Merge Strings Alternately.cpp" -o solution && ./solution
-
Or open in VS Code — Each file is self-contained and ready to submit on LeetCode.
- Language: C++ (GCC / Clang)
- IDE: Visual Studio Code
- Target: LeetCode Online Judge
This repository is licensed under the MIT License — feel free to use and study the solutions.
Happy problem solving! 🎉 If you find this repo helpful, give it a ⭐!