{"id":21327200,"url":"https://github.com/beingnikil07/dsa","last_synced_at":"2025-03-16T00:13:20.207Z","repository":{"id":179375885,"uuid":"619520485","full_name":"beingnikil07/DSA","owner":"beingnikil07","description":null,"archived":false,"fork":false,"pushed_at":"2025-02-15T15:55:40.000Z","size":196,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-15T16:32:13.466Z","etag":null,"topics":["array","arraylist","backtracking","hashmap","hashset","heaps","linked-list","matrix","queues","sorting-algorithms","stack","strings","trees"],"latest_commit_sha":null,"homepage":"","language":"Java","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/beingnikil07.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}},"created_at":"2023-03-27T09:57:51.000Z","updated_at":"2025-02-15T15:55:43.000Z","dependencies_parsed_at":"2023-10-16T03:51:51.927Z","dependency_job_id":"1189c26e-5680-4dd9-a72a-f24d2f19807f","html_url":"https://github.com/beingnikil07/DSA","commit_stats":null,"previous_names":["beingnikil07/dsa"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/beingnikil07%2FDSA","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/beingnikil07%2FDSA/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/beingnikil07%2FDSA/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/beingnikil07%2FDSA/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/beingnikil07","download_url":"https://codeload.github.com/beingnikil07/DSA/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243806072,"owners_count":20350775,"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":["array","arraylist","backtracking","hashmap","hashset","heaps","linked-list","matrix","queues","sorting-algorithms","stack","strings","trees"],"created_at":"2024-11-21T21:16:20.727Z","updated_at":"2025-03-16T00:13:20.202Z","avatar_url":"https://github.com/beingnikil07.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# DSA Practice Repository 🚀\n\nWelcome to the **DSA Practice Repository**, a collection of well-structured and optimized solutions for **Data Structures and Algorithms** problems. This repository is designed to help developers and students strengthen their problem-solving skills with practical examples and efficient solutions.\n\n---\n\n## 🔥 Features\n\n✅ Well-structured DSA problems and solutions  \n✅ Optimized code with detailed explanations  \n✅ Categorized by topics for easy navigation  \n✅ Beginner-friendly and interview-focused  \n✅ Contributions welcome! 🚀  \n\n---\n\n## 📌 Topics Covered\n\n- 🔹 **Arrays** (Sorting, Searching, Sliding Window, etc.)\n- 🔹 **Linked Lists** (Singly, Doubly, Circular, Fast \u0026 Slow pointers)\n- 🔹 **Stacks \u0026 Queues** (Monotonic Stack, Priority Queue, etc.)\n- 🔹 **Recursion \u0026 Backtracking** (Sudoku Solver, N-Queens, etc.)\n- 🔹 **Trees \u0026 Graphs** (Binary Trees, BFS, DFS, Dijkstra, etc.)\n- 🔹 **Dynamic Programming** (Knapsack, Fibonacci, LCS, etc.)\n- 🔹 **Bit Manipulation** (XOR tricks, Power of Two, etc.)\n- 🔹 **Greedy Algorithms** (Activity Selection, Huffman Coding, etc.)\n\n---\n\n## 🚀 Getting Started\n\n### Prerequisites\n- Install **Java/Python/C++** (depending on the language used in the repo)\n- A basic understanding of data structures and algorithms\n\n### Clone the Repository\n```sh\ngit clone https://github.com/beingnikil07/DSA.git\ncd DSA\n```\n\n### Running the Code\nEach problem is stored under its respective topic folder. Run the code using:\n\n#### Java\n```sh\njavac ProblemName.java\njava ProblemName\n```\n\n#### Python\n```sh\npython problem_name.py\n```\n\n#### C++\n```sh\ng++ problem_name.cpp -o output\n./output\n```\n\n---\n\n## 📁 Repository Structure\n\n```\nDSA-Practice/\n│── Arrays/\n│   ├── TwoSum.java\n│   ├── MergeSort.cpp\n│   └── BinarySearch.py\n│── LinkedLists/\n│   ├── ReverseLinkedList.java\n│   ├── DetectCycle.cpp\n│   └── MergeTwoLists.py\n│── DynamicProgramming/\n│   ├── Fibonacci.java\n│   ├── Knapsack.cpp\n│   └── LongestCommonSubsequence.py\n│── Graphs/\n│   ├── BFS.java\n│   ├── Dijkstra.cpp\n│   └── TopologicalSort.py\n│── README.md\n```\n\n---\n\n## 📜 Contribution Guidelines\n\nWant to contribute? Follow these steps:\n\n1. **Fork** the repository\n2. **Clone** it to your local machine\n3. Create a **new branch**\n4. Add your DSA solution\n5. Submit a **pull request** 🚀\n\n---\n\n## 📚 Resources for Learning\n\nHere are some great resources to improve your DSA skills:\n- **[GeeksforGeeks](https://www.geeksforgeeks.org/)**\n- **[LeetCode](https://leetcode.com/)**\n- **[Codeforces](https://codeforces.com/)**\n- **[HackerRank](https://www.hackerrank.com/)**\n\n---\n\n## ⭐ Support\nIf you find this repository helpful, **star** ⭐ it to show your support!\n\nHappy Coding! 🚀\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbeingnikil07%2Fdsa","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbeingnikil07%2Fdsa","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbeingnikil07%2Fdsa/lists"}