{"id":26996091,"url":"https://github.com/tobisamcode/dsa-python-indepth","last_synced_at":"2025-04-04T01:17:07.745Z","repository":{"id":284377808,"uuid":"937108597","full_name":"tobisamcode/dsa-python-indepth","owner":"tobisamcode","description":"This repository provides a comprehensive deep dive into Data Structures and Algorithms (DSA) using Python, covering fundamental concepts, advanced techniques, and optimized implementations.","archived":false,"fork":false,"pushed_at":"2025-03-25T15:41:07.000Z","size":9,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-25T16:22:16.287Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"Python","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/tobisamcode.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":"2025-02-22T11:03:29.000Z","updated_at":"2025-03-25T15:41:12.000Z","dependencies_parsed_at":"2025-03-25T16:22:25.770Z","dependency_job_id":"64bf2aaa-d2e0-47c6-901a-8ba0c733063d","html_url":"https://github.com/tobisamcode/dsa-python-indepth","commit_stats":null,"previous_names":["tobisamcode/dsa-python-indepth"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tobisamcode%2Fdsa-python-indepth","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tobisamcode%2Fdsa-python-indepth/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tobisamcode%2Fdsa-python-indepth/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tobisamcode%2Fdsa-python-indepth/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/tobisamcode","download_url":"https://codeload.github.com/tobisamcode/dsa-python-indepth/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247103296,"owners_count":20884024,"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":[],"created_at":"2025-04-04T01:17:07.263Z","updated_at":"2025-04-04T01:17:07.740Z","avatar_url":"https://github.com/tobisamcode.png","language":"Python","readme":"# 📌 DSA-Python-InDepth\n\nWelcome to **DSA-Python-InDepth**! 🚀 This repository provides a **comprehensive deep dive** into Data Structures and Algorithms (DSA) using Python, covering fundamental concepts, advanced techniques, and optimized implementations.\n\n---\n\n## 📖 **About This Repository**\nThis repo is designed to help programmers, students, and coding enthusiasts **master DSA in Python** with:\n- **Detailed Explanations** of each data structure and algorithm\n- **Python Implementations** with optimized code\n- **Time \u0026 Space Complexity Analysis**\n- **Practice Problems** and solutions\n- **Best Practices \u0026 Interview Tips**\n\n---\n\n## 📂 **Folder Structure**\n📌 The repository is organized as follows:\n```\n📦 dsa-python-indepth\n├── 📁 data_structures\n│   ├── arrays.py\n│   ├── linked_list.py\n│   ├── stack.py\n│   ├── queue.py\n│   ├── hash_table.py\n│   ├── binary_tree.py\n│   ├── graph.py\n│   └── heap.py\n│\n├── 📁 algorithms\n│   ├── sorting\n│   │   ├── bubble_sort.py\n│   │   ├── merge_sort.py\n│   │   ├── quick_sort.py\n│   │   └── heap_sort.py\n│   ├── searching\n│   │   ├── linear_search.py\n│   │   ├── binary_search.py\n│   ├── recursion\n│   │   ├── fibonacci.py\n│   │   ├── factorial.py\n│   ├── dynamic_programming\n│   │   ├── knapsack.py\n│   │   ├── longest_common_subsequence.py\n│   ├── graph_algorithms\n│   │   ├── dijkstra.py\n│   │   ├── bfs.py\n│   │   ├── dfs.py\n│   ├── greedy\n│   │   ├── job_scheduling.py\n│   └── backtracking\n│       ├── n_queens.py\n│       ├── sudoku_solver.py\n│\n├── 📁 practice_problems\n│   ├── leetcode\n│   ├── hackerrank\n│   ├── codeforces\n│\n├── README.md\n└── CONTRIBUTING.md\n```\n\n---\n\n## 🚀 **Topics Covered**\n### ✅ **Data Structures**\n- Arrays \u0026 Strings\n- Linked Lists (Singly \u0026 Doubly)\n- Stacks \u0026 Queues\n- Hash Tables\n- Trees (Binary, BST, AVL, Trie, etc.)\n- Graphs (Adjacency List, Adjacency Matrix)\n- Heaps (Min Heap, Max Heap)\n\n### ✅ **Algorithms**\n- Sorting (Bubble, Merge, Quick, Heap Sort, etc.)\n- Searching (Linear, Binary Search, etc.)\n- Recursion \u0026 Backtracking\n- Greedy Algorithms\n- Dynamic Programming (DP)\n- Graph Algorithms (DFS, BFS, Dijkstra, Floyd-Warshall, etc.)\n- Divide \u0026 Conquer Techniques\n\n---\n\n## 🛠 **How to Use This Repository?**\n1. **Clone the repository**\n   ```sh\n   git clone https://github.com/your-username/dsa-python-indepth.git\n   cd dsa-python-indepth\n   ```\n2. **Explore different data structures and algorithms** in the respective folders.\n3. **Run Python scripts** to test implementations.\n4. **Solve practice problems** and improve problem-solving skills.\n\n---\n\n## 💡 **Contributing**\nWe welcome contributions! Feel free to:\n- Fix bugs or optimize existing code.\n- Add new algorithms or data structures.\n- Solve and contribute practice problems.\n- Improve documentation.\n\n📜 Check the [CONTRIBUTING.md](./CONTRIBUTING.md) file for guidelines.\n\n---\n\n## 📚 **Resources \u0026 References**\n- [GeeksforGeeks](https://www.geeksforgeeks.org/)\n- [LeetCode](https://leetcode.com/)\n- [HackerRank](https://www.hackerrank.com/)\n- [MIT OpenCourseWare - Algorithms](https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011/)\n\n---\n\n## 📩 **Contact \u0026 Support**\nIf you find this repository helpful, give it a ⭐ and follow for updates!\n\n📧 Feel free to reach out via GitHub Issues for questions and suggestions.\n\nHappy Coding! 🚀\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftobisamcode%2Fdsa-python-indepth","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftobisamcode%2Fdsa-python-indepth","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftobisamcode%2Fdsa-python-indepth/lists"}