This repository contains my solutions and notes for the LeetCode 75 study plan.
File names follow the format ID. Title.ext.
Most files do not include a main function since the LeetCode platform provides the driver code. For local testing, you can add a small main.
g++ -std=c++17 -O2 -Wall -Wextra -pedantic "1768. Merge Strings Alternately.cpp" -o merge && ./merge| ID | Problem | Solution | Notes |
|---|---|---|---|
| 206 | Reverse Linked List | C++ | Notes |
| 283 | Move Zeroes | C++ • C++ (2) | Notes |
| 345 | Reverse Vowels of a String | C++ • C++ (2) | Notes |
| 392 | Is Subsequence | C++ | Notes |
| 605 | Can Place Flowers | C++ | Notes |
| 1071 | Greatest Common Divisor of Strings | C++ | Notes |
| 1207 | Unique Number of Occurrences | C++ | Notes |
| 1431 | Kids With the Greatest Number of Candies | C++ | Notes |
| 1768 | Merge Strings Alternately | C++ | Notes |
- Feel free to open PRs or issues.
- Keep the file naming format and note structure.
- If you submit an alternative solution, include time and space complexity analysis.
Auto-generated on 2025-08-30 19:54:02 UTC