https://github.com/sloweyyy/DSA
This repository contains solutions to various LeetCode problems and contests in C++, C#, Python, Java, and JavaScript, helping you improve your problem-solving skills and prepare for coding interviews.
https://github.com/sloweyyy/DSA
algorithms cpp csharp dart java javascript leetcode leetcode-solutions python typescript
Last synced: 2 months ago
JSON representation
This repository contains solutions to various LeetCode problems and contests in C++, C#, Python, Java, and JavaScript, helping you improve your problem-solving skills and prepare for coding interviews.
- Host: GitHub
- URL: https://github.com/sloweyyy/DSA
- Owner: sloweyyy
- License: mit
- Created: 2023-10-08T06:25:42.000Z (about 2 years ago)
- Default Branch: main
- Last Pushed: 2024-12-07T17:14:30.000Z (10 months ago)
- Last Synced: 2024-12-07T21:49:24.030Z (10 months ago)
- Topics: algorithms, cpp, csharp, dart, java, javascript, leetcode, leetcode-solutions, python, typescript
- Language: JavaScript
- Homepage:
- Size: 2.22 MB
- Stars: 3
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- Changelog: changeFileName.ipynb
- License: LICENSE
Awesome Lists containing this project
README
# LeetCode & Algorithmic Solutions
**Author:** SloWey
**Email:** truonglevinhphuc2006@gmail.com
This repository documents my journey through Data Structures and Algorithms (DSA) by solving LeetCode problems. I'm using this as a way to improve my coding skills and prepare for technical interviews.
## 🚀 Latest Solutions
Here are my most recent LeetCode solutions:
| Problem | Solution | Language | Commit |
|---------|----------|----------|--------|
| [Shortest Distance After Road Addition Queries I](https://leetcode.com/problems/shortest-distance-after-road-addition-queries-i) | [View Solution](https://github.com/sloweyyy/DSA/blob/main/LeetCode%20Daily/03243.%20Shortest%20Distance%20After%20Road%20Addition%20Queries%20I.ts) | TypeScript | [a0f562e](https://github.com/sloweyyy/DSA/commit/a0f562e51f66288ba056f23f1777564934a14b60) |
| [Diagonal Traverse II](https://leetcode.com/problems/diagonal-traverse-ii) | [View Solution](https://github.com/sloweyyy/DSA/blob/main/LeetCode%20Daily/01424.%20Diagonal%20Traverse%20II.py) | Python | [a0f562e](https://github.com/sloweyyy/DSA/commit/a0f562e51f66288ba056f23f1777564934a14b60) |
| [Construct Binary Tree from Preorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-postorder-traversal) | [View Solution](https://github.com/sloweyyy/DSA/blob/main/LeetCode%20Daily/00889.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Postorder%20Traversal.java) | Java | [a0f562e](https://github.com/sloweyyy/DSA/commit/a0f562e51f66288ba056f23f1777564934a14b60) |
| [Find Original Array From Doubled Array](https://leetcode.com/problems/find-original-array-from-doubled-array) | [View Solution](https://github.com/sloweyyy/DSA/blob/main/LeetCode%20Daily/02007.%20Find%20Original%20Array%20From%20Doubled%20Array.py) | Python | [07460d1](https://github.com/sloweyyy/DSA/commit/a0f562e51f66288ba056f23f1777564934a14b60) |
| [Same Tree](https://leetcode.com/problems/same-tree) | [View Solution](https://github.com/sloweyyy/DSA/blob/main/LeetCode%20Daily/00100.%20Same%20Tree.go) | Go | [6de684e](https://github.com/sloweyyy/DSA/commit/a0f562e51f66288ba056f23f1777564934a14b60) |
| [Maximum Earnings From Taxi](https://leetcode.com/problems/maximum-earnings-from-taxi) | [View Solution](https://github.com/sloweyyy/DSA/blob/main/LeetCode%20Daily/02008.%20Maximum%20Earnings%20From%20Taxi.py) | Python | [2a0e284](https://github.com/sloweyyy/DSA/commit/a0f562e51f66288ba056f23f1777564934a14b60) |
| [Count Number of Pairs With Absolute Difference K](https://leetcode.com/problems/count-number-of-pairs-with-absolute-difference-k) | [View Solution](https://github.com/sloweyyy/DSA/blob/main/LeetCode%20Daily/02006.%20Count%20Number%20of%20Pairs%20With%20Absolute%20Difference%20K.py) | Python | [23a4133](https://github.com/sloweyyy/DSA/commit/a0f562e51f66288ba056f23f1777564934a14b60) |
| [Final Value of Variable After Performing Operations](https://leetcode.com/problems/final-value-of-variable-after-performing-operations) | [View Solution](https://github.com/sloweyyy/DSA/blob/main/LeetCode%20Daily/02011.%20Final%20Value%20of%20Variable%20After%20Performing%20Operations.py) | Python | [b0fc48a](https://github.com/sloweyyy/DSA/commit/a0f562e51f66288ba056f23f1777564934a14b60) |
| [Final Value of Variable After Performing Operations](https://leetcode.com/problems/final-value-of-variable-after-performing-operations) | [View Solution](https://github.com/sloweyyy/DSA/blob/main/LeetCode%20Daily/2011.%20Final%20Value%20of%20Variable%20After%20Performing%20Operations.py) | Python | [43364ba](https://github.com/sloweyyy/DSA/commit/a0f562e51f66288ba056f23f1777564934a14b60) |
| [Sum of Beauty in the Array](https://leetcode.com/problems/sum-of-beauty-in-the-array) | [View Solution](https://github.com/sloweyyy/DSA/blob/main/LeetCode%20Daily/02012.%20Sum%20of%20Beauty%20in%20the%20Array.py) | Python | [f5df802](https://github.com/sloweyyy/DSA/commit/a0f562e51f66288ba056f23f1777564934a14b60) |
## 📊 Languages Used
Here's a breakdown of the languages I've been using, along with their contribution percentage:
- Java: 23.05%
- JavaScript: 21.75%
- TypeScript: 17.37%
- C++: 13.15%
- C#: 12.99%
- Python: 5.84%
- Go: 5.36%
- Dart: 0.32%
- PHP: 0.16%
## 📁 Contents
* **Codeforce Contests:** Solutions from Codeforces competitions.
* **Codeforce Problemset:** Solutions from specific problems on Codeforces.
* **LeetCode Daily:** My solutions to daily LeetCode challenges.
* **Weekly Contest:** Solutions from LeetCode Weekly Contests.
## 🚀 Getting Started
### Prerequisites
* Ensure you have the necessary compilers or interpreters installed for the languages you want to explore.
### Usage
* Feel free to browse the code and adapt it to your needs. Each file typically contains the solution to one specific problem.
* Use these solutions as references for understanding algorithms and coding techniques.
## 🤝 Contributing
I welcome your contributions! If you'd like to contribute a solution or an improvement:
1. Fork this repository.
2. Create a new branch with a descriptive name for your changes.
3. Implement your solution and provide clear comments and documentation.
4. Test your code thoroughly.
5. Open a pull request detailing your changes.
## 📄 License
This project is licensed under the [MIT License](LICENSE).
## 📧 Contact
Feel free to reach out via email at truonglevinhphuc2006@gmail.com for any questions, feedback, or suggestions.
---
*Last updated: 2025-06-28 17:32:33 UTC*