{"id":26787295,"url":"https://github.com/sahil-113/dsa-practice-questions","last_synced_at":"2026-02-27T17:06:54.458Z","repository":{"id":280076427,"uuid":"940920266","full_name":"Sahil-113/DSA-Practice-Questions","owner":"Sahil-113","description":"This repository contains a curated collection of Data Structures and Algorithms (DSA) practice questions with detailed solutions. It is designed to help students and professionals improve their problem-solving skills for coding interviews, competitive programming, and technical assessments. The solutions are written in Python, and C++ with  OOPs...","archived":false,"fork":false,"pushed_at":"2025-05-27T20:16:22.000Z","size":138,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-09-25T10:03:26.191Z","etag":null,"topics":["arrays-and-strings","bit-manipulation","dynamic-programming","graph","linked-list","stack","tree"],"latest_commit_sha":null,"homepage":"","language":null,"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/Sahil-113.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-03-01T04:01:04.000Z","updated_at":"2025-05-27T20:16:26.000Z","dependencies_parsed_at":"2025-03-02T18:38:04.147Z","dependency_job_id":"b2bf58d9-fe5d-48da-b9b1-7afb7a445cf0","html_url":"https://github.com/Sahil-113/DSA-Practice-Questions","commit_stats":null,"previous_names":["sahil-113/leetcode-problems","sahil-113/dsa-practice-questions"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Sahil-113/DSA-Practice-Questions","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Sahil-113%2FDSA-Practice-Questions","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Sahil-113%2FDSA-Practice-Questions/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Sahil-113%2FDSA-Practice-Questions/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Sahil-113%2FDSA-Practice-Questions/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Sahil-113","download_url":"https://codeload.github.com/Sahil-113/DSA-Practice-Questions/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Sahil-113%2FDSA-Practice-Questions/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29905624,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-27T14:46:13.553Z","status":"ssl_error","status_checked_at":"2026-02-27T14:46:10.522Z","response_time":57,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.5:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":["arrays-and-strings","bit-manipulation","dynamic-programming","graph","linked-list","stack","tree"],"created_at":"2025-03-29T12:19:04.669Z","updated_at":"2026-02-27T17:06:54.441Z","avatar_url":"https://github.com/Sahil-113.png","language":null,"funding_links":[],"categories":[],"sub_categories":[],"readme":"# DSA Practice Questions with Solutions\n\nWelcome to the DSA Practice Questions with Solutions repository! This repository contains a collection of Data Structures and Algorithms (DSA) problems along with well-structured solutions in multiple programming languages. It is designed to help students and professionals prepare for coding interviews, competitive programming, and technical assessments.\n\n## 📌 Features\n\n📝 Comprehensive Solutions: Each problem includes a detailed explanation and optimized solution.\n\n🏆 Covers Key DSA Topics: Arrays, Linked Lists, Stacks, Queues, Trees, Graphs, Sorting, Searching, Recursion, Dynamic Programming, and more.\n\n🚀 Optimized Code: Solutions focus on efficiency and best practices.\n\n🎯 Difficulty Levels: Problems categorized into Easy, Medium, and Hard.\n\n🌍 Language Support: Solutions provided in C++ and Python.\n\n## 📂 Folder Structure\n\nDSA-Practice-Questions/\n│── Arrays/\n│── LinkedLists/\n│── Stacks/\n│── Queues/\n│── Trees/\n│── Graphs/\n│── Recursion/\n│── DynamicProgramming/\n│── SortingSearching/\n│── Miscellaneous/\n│── README.md\n\n## 🔥 Topics Covered\n\n✅ Arrays – Sliding Window, Two Pointers, Sorting, Searching, Kadane’s Algorithm, etc.\n✅ Linked Lists – Reversal, Cycle Detection, Merge, Partitioning, etc.\n✅ Stacks \u0026 Queues – Next Greater Element, Balanced Parentheses, etc.\n✅ Trees – Traversals, BST, AVL, Heap, Segment Tree, etc.\n✅ Graphs – BFS, DFS, Dijkstra, Floyd-Warshall, Topological Sorting, etc.\n✅ Recursion \u0026 Backtracking – Subsets, Permutations, N-Queens, etc.\n✅ Dynamic Programming – Fibonacci, Knapsack, LIS, Matrix Chain Multiplication, etc.\n✅ Sorting \u0026 Searching – QuickSort, MergeSort, Binary Search Variations, etc.\n\n## 💡 How to Contribute\n\nWe welcome contributions! Follow these steps to contribute:\n\nFork the repository.\n\nClone your forked repository:\n\ngit clone https://github.com/Sahil-113/DSA-Practice-Questions.git\n\nCreate a new branch:\n\ngit checkout -b feature-branch\n\nAdd your solution in the respective folder.\n\nCommit and push:\n\ngit add .\ngit commit -m \"Added solution for XYZ problem\"\ngit push origin feature-branch\n\nSubmit a Pull Request (PR) and wait for review.\n\n## 📌 Prerequisites\n\nTo run the solutions, you need:\n\nPython (\u003e=3.7)\n\nGCC for C++\n\nJava JDK (\u003e=8)\n\n📜 License\n\nThis project is licensed under the MIT License – feel free to use, modify, and share!\n\n### 🌟 Show Your Support\n\nIf you find this helpful, ⭐ star this repository to keep it growing!\n\n### Happy Coding! 🚀\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsahil-113%2Fdsa-practice-questions","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsahil-113%2Fdsa-practice-questions","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsahil-113%2Fdsa-practice-questions/lists"}