This repository is a personal archive of LeetCode solutions written in C.
The goal is to keep solved problems in a clean, repeatable format: each problem has a LeetCode-style short explanation, examples, constraints, the C starter signature, approach notes, and the submitted C solution.
| Item | Status |
|---|---|
| Language | C |
| First 100 C-focused roadmap | Complete |
| Archived problems | 163 total: 100 roadmap problems + 17 daily extras + 33 embedded essentials + 5 matrix essentials + 8 data structure design essentials |
| Main solution format | README.md + solution.c per problem |
- First 100 roadmap: ROADMAP.md
- Full solved-problems table: docs/SOLVED_PROBLEMS.md
- Problem folders: problems/
problems/
0001-two-sum/
README.md
solution.c
docs/
SOLVED_PROBLEMS.md
ROADMAP.md
README.md
Each problem folder uses the original LeetCode number in the folder name and
the page title, for example #0001 - Two Sum.
Each problem README.md should contain:
- LeetCode Style Info: status, difficulty, topics, hint, solved date, source.
- Problem Statement: short TR/EN version of what the question asks.
- Starter Code (C): LeetCode-style C function signature.
- Parameters / Return: what each input and output means.
- Examples: input/output samples with short explanations.
- Constraints: key limits from the problem.
- Approach: the core idea behind the solution.
Official LeetCode statements are not copied verbatim; pages are written in short original wording while staying close enough for revision.
- Create a folder under
problems/with the LeetCode number and slug. - Add a short
README.mdwith TR/EN summary, date, topics, examples, and idea. - Add
solution.cwith the LeetCode-style function and short comments. - Add the problem to docs/SOLVED_PROBLEMS.md.
- Update ROADMAP.md if the problem belongs to the planned roadmap.