This repository contains solutions to LeetCode exercises focused on programming logic and data structures. Each exercise is implemented in Python or C and covers one of the main topics in algorithms and data structures.
The goal of this repository is to provide a practical solution to classic programming problems, with an emphasis on understanding and applying essential data structures such as:
- Arrays
- Linked Lists
- Strings
- Graphs
- Trees
- Dynamic Programming
- Searching & Sorting
The problems are solved incrementally, one per week, focusing on fundamental concepts and algorithm efficiency.
The problems are organized into the following categories, with a folder for each topic:
- Dynamic Programming
- Searching & Sorting
- Graphs
- Trees
- Linked List
- String
- Arrays
Each folder contains the following files:
- Python Code: Implementations of the algorithms.
- Problem Description: Explanation of the exercise and the approach for the solution.
- Tests: Unit tests to verify the correctness of the solutions.
-
Clone the repository:
git clone https://github.com/YOUR-USERNAME/leetcode-problems.git
-
Create a new branch:
git checkout -b your-branch-name
-
Solve an exercise and add your code to the corresponding folder.
-
Commit your changes:
git commit -m "Solution for [topic] problem"
-
Push the changes to the remote repository:
git push origin your-branch-name
-
Open a pull request for review.
This project is licensed under the MIT License.