{"id":22583185,"url":"https://github.com/sloweyyy/dsa","last_synced_at":"2025-12-30T20:31:14.306Z","repository":{"id":199005985,"uuid":"701981215","full_name":"sloweyyy/DSA","owner":"sloweyyy","description":"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.","archived":false,"fork":false,"pushed_at":"2025-03-18T16:26:28.000Z","size":2939,"stargazers_count":4,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-20T10:10:11.140Z","etag":null,"topics":["algorithms","cpp","csharp","dart","java","javascript","leetcode","leetcode-solutions","python","typescript"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/sloweyyy.png","metadata":{"files":{"readme":"README.md","changelog":"changeFileName.ipynb","contributing":null,"funding":null,"license":"LICENSE","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":"2023-10-08T06:25:42.000Z","updated_at":"2025-03-18T16:26:33.000Z","dependencies_parsed_at":"2023-10-15T07:06:31.140Z","dependency_job_id":"c064bf8d-1c1b-47f6-a0c1-78ebdf4bec06","html_url":"https://github.com/sloweyyy/DSA","commit_stats":{"total_commits":75,"total_committers":1,"mean_commits":75.0,"dds":0.0,"last_synced_commit":"5e4e3b2b8dc3bb7e1e61b5e09fa36d0d0b8baf3a"},"previous_names":["sloweyyy/leetcode","sloweyyy/dsa"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sloweyyy%2FDSA","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sloweyyy%2FDSA/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sloweyyy%2FDSA/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sloweyyy%2FDSA/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/sloweyyy","download_url":"https://codeload.github.com/sloweyyy/DSA/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246068269,"owners_count":20718501,"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","cpp","csharp","dart","java","javascript","leetcode","leetcode-solutions","python","typescript"],"created_at":"2024-12-08T06:14:06.383Z","updated_at":"2025-12-30T20:31:14.301Z","avatar_url":"https://github.com/sloweyyy.png","language":"Java","readme":"\n# LeetCode \u0026 Algorithmic Solutions\n\n**Author:** SloWey  \n**Email:** truonglevinhphuc2006@gmail.com\n\nThis 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.\n\n## 🚀 Latest Solutions\n\nHere are my most recent LeetCode solutions:\n\n| Problem | Solution | Language | Commit |\n|---------|----------|----------|--------|\n| [Longest Subarray of 1's After Deleting One Element](https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element) | [View Solution](https://github.com/sloweyyy/DSA/blob/main/LeetCode%20Daily/01493.%20Longest%20Subarray%20of%201's%20After%20Deleting%20One%20Element.go) | Go | [0d2161a](https://github.com/sloweyyy/DSA/commit/0d2161a7d957c9e66af27c2caf13267fcc5c80cc) |\n| [Find the Minimum Area to Cover All Ones II](https://leetcode.com/problems/find-the-minimum-area-to-cover-all-ones-ii) | [View Solution](https://github.com/sloweyyy/DSA/blob/main/LeetCode%20Daily/03197.%20Find%20the%20Minimum%20Area%20to%20Cover%20All%20Ones%20II.go) | Go | [a7a5e59](https://github.com/sloweyyy/DSA/commit/0d2161a7d957c9e66af27c2caf13267fcc5c80cc) |\n| [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.go) | Go | [a7a5e59](https://github.com/sloweyyy/DSA/commit/0d2161a7d957c9e66af27c2caf13267fcc5c80cc) |\n| [Find the Minimum Area to Cover All Ones I](https://leetcode.com/problems/find-the-minimum-area-to-cover-all-ones-i) | [View Solution](https://github.com/sloweyyy/DSA/blob/main/LeetCode%20Daily/03195.%20Find%20the%20Minimum%20Area%20to%20Cover%20All%20Ones%20I.go) | Go | [b6426c3](https://github.com/sloweyyy/DSA/commit/0d2161a7d957c9e66af27c2caf13267fcc5c80cc) |\n| [Count Submatrices With All Ones](https://leetcode.com/problems/count-submatrices-with-all-ones) | [View Solution](https://github.com/sloweyyy/DSA/blob/main/LeetCode%20Daily/001504.%20Count%20Submatrices%20With%20All%20Ones.go) | Go | [1d3ee11](https://github.com/sloweyyy/DSA/commit/0d2161a7d957c9e66af27c2caf13267fcc5c80cc) |\n| [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/0d2161a7d957c9e66af27c2caf13267fcc5c80cc) |\n| [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/0d2161a7d957c9e66af27c2caf13267fcc5c80cc) |\n| [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/0d2161a7d957c9e66af27c2caf13267fcc5c80cc) |\n| [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/0d2161a7d957c9e66af27c2caf13267fcc5c80cc) |\n| [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/0d2161a7d957c9e66af27c2caf13267fcc5c80cc) |\n\n\n## 📊 Languages Used\n\nHere's a breakdown of the languages I've been using, along with their contribution percentage:\n\n- Java: 22.87%\n- JavaScript: 21.58%\n- TypeScript: 17.23%\n- C++: 13.04%\n- C#: 12.88%\n- Go: 6.12%\n- Python: 5.80%\n- Dart: 0.32%\n- PHP: 0.16%\n\n\n## 📁 Contents\n\n*   **Codeforce Contests:** Solutions from Codeforces competitions.\n*   **Codeforce Problemset:** Solutions from specific problems on Codeforces.\n*   **LeetCode Daily:** My solutions to daily LeetCode challenges.\n*   **Weekly Contest:** Solutions from LeetCode Weekly Contests.\n\n## 🚀 Getting Started\n\n### Prerequisites\n\n*   Ensure you have the necessary compilers or interpreters installed for the languages you want to explore.\n\n### Usage\n\n*   Feel free to browse the code and adapt it to your needs. Each file typically contains the solution to one specific problem.\n*   Use these solutions as references for understanding algorithms and coding techniques.\n\n## 🤝 Contributing\n\nI welcome your contributions! If you'd like to contribute a solution or an improvement:\n\n1.  Fork this repository.\n2.  Create a new branch with a descriptive name for your changes.\n3.  Implement your solution and provide clear comments and documentation.\n4.  Test your code thoroughly.\n5.  Open a pull request detailing your changes.\n\n## 📄 License\n\nThis project is licensed under the [MIT License](LICENSE).\n\n## 📧 Contact\n\nFeel free to reach out via email at truonglevinhphuc2006@gmail.com for any questions, feedback, or suggestions.\n\n---\n\n*Last updated: 2025-08-24 15:04:56 UTC*","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsloweyyy%2Fdsa","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsloweyyy%2Fdsa","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsloweyyy%2Fdsa/lists"}