{"id":28460265,"url":"https://github.com/nafistarik/leetcode-problems","last_synced_at":"2025-10-10T06:35:17.753Z","repository":{"id":291637119,"uuid":"978255577","full_name":"nafistarik/leetcode-problems","owner":"nafistarik","description":"A collection of my DSA problem solves with a clear thinking strategy from brute force to optimal. Each folder contains my explanation and the most efficient code.","archived":false,"fork":false,"pushed_at":"2025-05-19T20:14:12.000Z","size":17,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-06-07T02:08:59.281Z","etag":null,"topics":["array","binary-search","brute-force","string","two-pointer"],"latest_commit_sha":null,"homepage":"","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/nafistarik.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":"2025-05-05T17:51:41.000Z","updated_at":"2025-05-19T20:14:15.000Z","dependencies_parsed_at":"2025-05-05T19:48:29.088Z","dependency_job_id":"f6ec5616-16b1-4f4d-8a78-61b6f05d9cec","html_url":"https://github.com/nafistarik/leetcode-problems","commit_stats":null,"previous_names":["nafistarik/leetcode-problems"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/nafistarik/leetcode-problems","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nafistarik%2Fleetcode-problems","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nafistarik%2Fleetcode-problems/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nafistarik%2Fleetcode-problems/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nafistarik%2Fleetcode-problems/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/nafistarik","download_url":"https://codeload.github.com/nafistarik/leetcode-problems/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nafistarik%2Fleetcode-problems/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":279002969,"owners_count":26083489,"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-10T02:00:06.843Z","response_time":62,"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":["array","binary-search","brute-force","string","two-pointer"],"created_at":"2025-06-07T02:08:58.593Z","updated_at":"2025-10-10T06:35:17.738Z","avatar_url":"https://github.com/nafistarik.png","language":"JavaScript","readme":"# 🧠 My DSA Problem Solving\n\nThis is **not just a collection of code** — it’s a journey of how I solve problems, reflect on mistakes, improve my logic, and master algorithmic thinking step by step.\n\nI use this repo to document my:\n- ❓ Understanding of the **problem statement**\n- 🔎 Initial **brute-force** logic\n- ⚠️ **Mistakes** or wrong assumptions I made\n- 🔧 **Corrections** and **debugging steps**\n- ⚡ Final **optimized approach**\n- 🧪 **Edge case analysis** and thought clarity\n\nEach problem folder = 📂 One learning story.\n\n---\n\n## 📌 Repository Goals\n\n\u003e Solve with thinking, not just coding.\n\n🔹 **Learn DSA deeply**, one real problem at a time  \n🔹 **Reflect and journal** my thought process  \n🔹 **Avoid copying** — solve from scratch with my logic  \n🔹 **Master problem patterns** via repetition and intuition  \n🔹 **Prepare for interviews** through conceptual clarity and coding confidence\n\n---\n\n## 🚀 My Current Focus: Top Interview 150 on LeetCode\n\n🎯 I’m solving problems from the [**Leetcode Top Interview List**](https://leetcode.com/list/xi4ci4ig/) in the **same sequence as Apna College's DSA Playlist** to follow a structured roadmap.\n\n---\n\n## 📚 Resources That Guide Me\n\n\u003cdetails\u003e\n\u003csummary\u003e\u003cstrong\u003e🎥 Apna College DSA Playlist\u003c/strong\u003e\u003c/summary\u003e\n\n- 🔗 [Watch Here](https://www.youtube.com/playlist?list=PLfqMhTWNBTe0b2nM6JHVCnAkhQRGiZMSJ)\n- 📋 I follow this playlist to plan my problem-solving topics in order (arrays → strings → recursion → etc.).\n\u003c/details\u003e\n\n\u003cdetails\u003e\n\u003csummary\u003e\u003cstrong\u003e🧠 Nikhil Lohia - Algorithmic Paradigms\u003c/strong\u003e\u003c/summary\u003e\n\n- 🔗 [Watch Here](https://www.youtube.com/playlist?list=PLiC1doDIe9rBzGkVgaR9XO_Jj4AA9Wio1)\n- 📌 I watch this to think in terms of brute force → optimization and understand how to *design* an algorithm before coding it.\n\u003c/details\u003e\n\n\u003cdetails\u003e\n\u003csummary\u003e\u003cstrong\u003e📖 O’Reilly: Data Structures \u0026 Algorithms by Michael McMillan\u003c/strong\u003e\u003c/summary\u003e\n\n- 🔗 [Book Link](https://www.oreilly.com/library/view/data-structures-and/9781449364939/)\n- 📘 I read this for strong conceptual foundations — especially on how data structures work under the hood.\n\u003c/details\u003e\n\n\u003cdetails\u003e\n\u003csummary\u003e\u003cstrong\u003e🧩 Leetcode Top Interview 150\u003c/strong\u003e\u003c/summary\u003e\n\n- 🔗 [Target List](https://leetcode.com/list/xi4ci4ig/)\n- 🎯 This is my primary problem set right now — each solved problem goes into this repo.\n\u003c/details\u003e\n\n---\n\n## 📁 Structure of Each Problem Folder\n\nEach problem I solve gets its own folder:\n\n```\n\n📂 /Problem-Name\n┣ 📄 README.md ← My complete thought process, logic, mistakes \u0026 learnings\n┗ 📄 index.js ← Final optimal solution (with clean code \u0026 comments)\n\n```","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnafistarik%2Fleetcode-problems","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fnafistarik%2Fleetcode-problems","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnafistarik%2Fleetcode-problems/lists"}