https://github.com/tienminh25/leetcode_solution
LeetCode Solution
https://github.com/tienminh25/leetcode_solution
algorithms-and-data-structures array backtracking binary-search concurrency dynamic-programming java tree two-pointers
Last synced: 3 months ago
JSON representation
LeetCode Solution
- Host: GitHub
- URL: https://github.com/tienminh25/leetcode_solution
- Owner: TienMinh25
- Created: 2024-12-13T16:08:01.000Z (7 months ago)
- Default Branch: main
- Last Pushed: 2025-03-25T15:40:25.000Z (3 months ago)
- Last Synced: 2025-03-25T16:42:41.548Z (3 months ago)
- Topics: algorithms-and-data-structures, array, backtracking, binary-search, concurrency, dynamic-programming, java, tree, two-pointers
- Language: Java
- Homepage:
- Size: 163 KB
- Stars: 2
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# LeetCode Solutions
Welcome to the **LeetCode Solutions** repository! 🚀 This project is dedicated to improving algorithmic problem-solving skills through curated solutions to problems on [LeetCode](https://leetcode.com/). Whether you're a beginner or a seasoned coder, this repository serves as a valuable resource for learning and enhancing your understanding of algorithms and data structures.
## 🌟 Features
- **Structured Solutions**: Each solution is well-organized, with clear explanations and optimized code.
- **Diverse Topics**: Covers a wide range of algorithmic topics, including:
- Array Manipulation
- Dynamic Programming
- Graph Theory
- String Processing
- Sorting and Searching
- Tree and Binary Search Trees
- Recursion and Backtracking
- **Java Only**: All solutions are implemented exclusively in Java.
- **Problem Insights**: Each solution includes:
- Problem description and constraints
- Explanation of the approach
- Time and space complexity analysis
## 📂 Repository Structure
```plaintext
.
├── README.md # Project overview and guidelines
├── array/ # Directory containing Java solution files with topic array
├── backtracking/ # Directory containing Java solution files with topic backtracking
├── dynamic-programming/ # Directory containing Java solution files with topic dynamic programming
├── string/ # Directory containing Java solution files with topic string
├── tree/ # Directory containing Java solution files with topic tree
├── two-pointers/ # Directory containing Java solution files with topic two pointers
└── dynamic-progamming-vnoi # Addtional resource about learning more on website.
```
For more resources on dynamic programming, check out the [VNOI Wiki](https://wiki.vnoi.info/).
## 🛠Getting Started
1. Clone this repository to your local machine:
```bash
git clone https://github.com/TienMinh25/leetcode_solution.git
```
2. Navigate to the `solutions` folder to browse the Java solutions.
3. Learn from the explanations and try solving the problems yourself!
## 🧩 Contributing
Contributions are welcome! If you'd like to add new solutions, improve existing ones, or fix any issues, follow these steps:
1. Fork this repository.
2. Create a new branch for your feature or fix:
```bash
git checkout -b feature/add-new-solution
```
3. Commit your changes:
```bash
git commit -m "Add solution for problem XYZ"
```
4. Push to your branch:
```bash
git push origin feature/add-new-solution
```
5. Open a pull request describing your changes.
## 📖 Resources
- [LeetCode Explore](https://leetcode.com/explore/): Explore topics and learn techniques.
- [Big-O Cheat Sheet](https://www.bigocheatsheet.com/): A handy guide to algorithm complexity.
- [Official Documentation](https://leetcode.com/faq/): LeetCode FAQ and help.
## 💡 Tips for Success
- Start with easier problems and gradually move to advanced topics.
- Focus on understanding the problem and constraints before coding.
- Practice consistently to build intuition and efficiency.
## 📜 License
This project is licensed under the MIT License. Feel free to use and modify the code as you wish.
---
Happy coding and problem-solving! 💻🎉