{"id":30803209,"url":"https://github.com/abdulvahabaa/leetcode-dsa","last_synced_at":"2026-04-11T21:34:07.448Z","repository":{"id":241388187,"uuid":"805893766","full_name":"abdulvahabaa/LeetCode-DSA","owner":"abdulvahabaa","description":"A collection of LeetCode problem solutions written in JavaScript, showcasing clean and optimized code for practicing algorithms and data structures. All solutions are stored in a single folder for easy access.","archived":false,"fork":false,"pushed_at":"2025-09-03T04:02:22.000Z","size":34,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-09-05T22:51:12.422Z","etag":null,"topics":["coding-challenges","datastructures-algorithms","dsa-practice","dsa-questions","javascript","nodejs"],"latest_commit_sha":null,"homepage":"https://leetcode.com/u/abdulvahab/","language":"JavaScript","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/abdulvahabaa.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,"zenodo":null}},"created_at":"2024-05-25T19:12:32.000Z","updated_at":"2025-09-03T17:49:16.000Z","dependencies_parsed_at":"2024-05-28T04:44:25.631Z","dependency_job_id":"1f4a6993-b678-434e-8c5c-638fa324caae","html_url":"https://github.com/abdulvahabaa/LeetCode-DSA","commit_stats":null,"previous_names":["abdulvahabaa/leetcode","abdulvahabaa/leetcode-dsa"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/abdulvahabaa/LeetCode-DSA","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/abdulvahabaa%2FLeetCode-DSA","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/abdulvahabaa%2FLeetCode-DSA/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/abdulvahabaa%2FLeetCode-DSA/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/abdulvahabaa%2FLeetCode-DSA/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/abdulvahabaa","download_url":"https://codeload.github.com/abdulvahabaa/LeetCode-DSA/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/abdulvahabaa%2FLeetCode-DSA/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":279019319,"owners_count":26086711,"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","status":"online","status_checked_at":"2025-10-14T02:00:06.444Z","response_time":60,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["coding-challenges","datastructures-algorithms","dsa-practice","dsa-questions","javascript","nodejs"],"created_at":"2025-09-05T22:50:00.598Z","updated_at":"2025-10-14T15:34:35.901Z","avatar_url":"https://github.com/abdulvahabaa.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# 🧩 LeetCode Solutions\n\n![JavaScript](https://img.shields.io/badge/JavaScript-F7DF1E?logo=javascript\u0026logoColor=black)\n![Algorithms](https://img.shields.io/badge/Algorithms-Yes-brightgreen)\n![LeetHub](https://img.shields.io/badge/LeetHub-3.0-blue)\n\nA collection of **LeetCode problem solutions** written in **JavaScript**, showcasing clean and optimized code for practicing algorithms and data structures.  \nAll solutions are stored in a **single folder** for easy access.  \n\n---\n\n## 🚀 Features\n\n- 📝 **All-in-One Folder** – All solutions in a single place  \n- 🔗 **Problem Links** – Each file contains a reference to the original LeetCode problem  \n- ⚡ **Optimized Code** – Focused on readability and efficiency  \n- 📂 **Automatic Sync** – Solutions can be synced via LeetHub 3.0  \n\n---\n\n## 🛠️ Technologies Used\n\n- **JavaScript**  \n- **Git \u0026 GitHub**  \n- **LeetHub 3.0 Chrome Extension**  \n\n---\n\n- All solution files are in the root folder.  \n- Each file is named after the LeetCode problem for easy identification.  \n\n---\n\n## 🔗 Links\n\n- GitHub Repository: [LeetCode-DSA](https://github.com/abdulvahabaa/LeetCode-DSA.git)  \n- LeetCode Profile: [LeetCode Dashboard](https://leetcode.com/u/abdulvahabaa/)  \n\n---\n\n## 📌 How to Use\n\n1. Browse the repository files.  \n2. Open a solution file to view the code and problem reference link.  \n3. Use it for **learning, reference, and practice**.  \n\n---\n\n**Example Code Preview**  \n\n```javascript\n// Example: Two Sum\nconst twoSum = (nums, target) =\u003e {\n  const map = new Map();\n  for (let i = 0; i \u003c nums.length; i++) {\n    if (map.has(target - nums[i])) return [map.get(target - nums[i]), i];\n    map.set(nums[i], i);\n  }\n};\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fabdulvahabaa%2Fleetcode-dsa","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fabdulvahabaa%2Fleetcode-dsa","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fabdulvahabaa%2Fleetcode-dsa/lists"}