{"id":26166240,"url":"https://github.com/tienminh25/leetcode_solution","last_synced_at":"2026-02-24T07:11:51.016Z","repository":{"id":267989200,"uuid":"902956295","full_name":"TienMinh25/leetcode_solution","owner":"TienMinh25","description":"LeetCode Solution ","archived":false,"fork":false,"pushed_at":"2025-03-25T15:40:25.000Z","size":167,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-25T16:42:41.548Z","etag":null,"topics":["algorithms-and-data-structures","array","backtracking","binary-search","concurrency","dynamic-programming","java","tree","two-pointers"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/TienMinh25.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-12-13T16:08:01.000Z","updated_at":"2025-03-25T15:40:29.000Z","dependencies_parsed_at":"2024-12-13T18:28:37.536Z","dependency_job_id":"dadf1303-a40f-4864-9134-3a128be18911","html_url":"https://github.com/TienMinh25/leetcode_solution","commit_stats":null,"previous_names":["tienminh25/leetcode_solution"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TienMinh25%2Fleetcode_solution","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TienMinh25%2Fleetcode_solution/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TienMinh25%2Fleetcode_solution/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TienMinh25%2Fleetcode_solution/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/TienMinh25","download_url":"https://codeload.github.com/TienMinh25/leetcode_solution/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248916935,"owners_count":21182895,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms-and-data-structures","array","backtracking","binary-search","concurrency","dynamic-programming","java","tree","two-pointers"],"created_at":"2025-03-11T16:39:38.448Z","updated_at":"2025-10-29T05:47:04.072Z","avatar_url":"https://github.com/TienMinh25.png","language":"Java","readme":"# LeetCode Solutions\n\nWelcome 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.\n\n## 🌟 Features\n\n- **Structured Solutions**: Each solution is well-organized, with clear explanations and optimized code.\n- **Diverse Topics**: Covers a wide range of algorithmic topics, including:\n  - Array Manipulation\n  - Dynamic Programming\n  - Graph Theory\n  - String Processing\n  - Sorting and Searching\n  - Tree and Binary Search Trees\n  - Recursion and Backtracking\n- **Java Only**: All solutions are implemented exclusively in Java.\n- **Problem Insights**: Each solution includes:\n  - Problem description and constraints\n  - Explanation of the approach\n  - Time and space complexity analysis\n\n## 📂 Repository Structure\n\n```plaintext\n.\n├── README.md                 # Project overview and guidelines\n├── array/                    # Directory containing Java solution files with topic array\n├── backtracking/             # Directory containing Java solution files with topic backtracking\n├── dynamic-programming/      # Directory containing Java solution files with topic dynamic programming\n├── string/                   # Directory containing Java solution files with topic string\n├── tree/                     # Directory containing Java solution files with topic tree\n├── two-pointers/             # Directory containing Java solution files with topic two pointers\n└── dynamic-progamming-vnoi   # Addtional resource about learning more on website.\n```\nFor more resources on dynamic programming, check out the [VNOI Wiki](https://wiki.vnoi.info/).\n\n## 🛠 Getting Started\n\n1. Clone this repository to your local machine:\n\n   ```bash\n   git clone https://github.com/TienMinh25/leetcode_solution.git\n   ```\n\n2. Navigate to the `solutions` folder to browse the Java solutions.\n\n3. Learn from the explanations and try solving the problems yourself!\n\n## 🧩 Contributing\n\nContributions are welcome! If you'd like to add new solutions, improve existing ones, or fix any issues, follow these steps:\n\n1. Fork this repository.\n2. Create a new branch for your feature or fix:\n   ```bash\n   git checkout -b feature/add-new-solution\n   ```\n3. Commit your changes:\n   ```bash\n   git commit -m \"Add solution for problem XYZ\"\n   ```\n4. Push to your branch:\n   ```bash\n   git push origin feature/add-new-solution\n   ```\n5. Open a pull request describing your changes.\n\n## 📖 Resources\n\n- [LeetCode Explore](https://leetcode.com/explore/): Explore topics and learn techniques.\n- [Big-O Cheat Sheet](https://www.bigocheatsheet.com/): A handy guide to algorithm complexity.\n- [Official Documentation](https://leetcode.com/faq/): LeetCode FAQ and help.\n\n## 💡 Tips for Success\n\n- Start with easier problems and gradually move to advanced topics.\n- Focus on understanding the problem and constraints before coding.\n- Practice consistently to build intuition and efficiency.\n\n## 📜 License\n\nThis project is licensed under the MIT License. Feel free to use and modify the code as you wish.\n\n---\n\nHappy coding and problem-solving! 💻🎉\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftienminh25%2Fleetcode_solution","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftienminh25%2Fleetcode_solution","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftienminh25%2Fleetcode_solution/lists"}