{"id":20945382,"url":"https://github.com/beebombshell/python-dsa","last_synced_at":"2025-06-26T15:32:36.762Z","repository":{"id":46506951,"uuid":"412455731","full_name":"BeeBombshell/Python-DSA","owner":"BeeBombshell","description":"This repository is a compilation of important Data Structures and Algorithms based on Python.","archived":false,"fork":false,"pushed_at":"2022-10-22T16:22:53.000Z","size":171,"stargazers_count":36,"open_issues_count":14,"forks_count":47,"subscribers_count":3,"default_branch":"main","last_synced_at":"2025-04-02T10:39:29.431Z","etag":null,"topics":["hacktoberfest","hacktoberfest-2021","hacktoberfest-2022","hacktoberfest-accepted","hacktoberfest2021","hacktoberfest2022"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/BeeBombshell.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":"CONTRIBUTING.md","funding":null,"license":"LICENSE","code_of_conduct":"CODE_OF_CONDUCT.md","threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2021-10-01T12:20:24.000Z","updated_at":"2025-03-31T17:03:35.000Z","dependencies_parsed_at":"2023-01-20T08:00:19.507Z","dependency_job_id":null,"html_url":"https://github.com/BeeBombshell/Python-DSA","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/BeeBombshell/Python-DSA","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BeeBombshell%2FPython-DSA","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BeeBombshell%2FPython-DSA/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BeeBombshell%2FPython-DSA/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BeeBombshell%2FPython-DSA/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/BeeBombshell","download_url":"https://codeload.github.com/BeeBombshell/Python-DSA/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BeeBombshell%2FPython-DSA/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":262094629,"owners_count":23258009,"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":["hacktoberfest","hacktoberfest-2021","hacktoberfest-2022","hacktoberfest-accepted","hacktoberfest2021","hacktoberfest2022"],"created_at":"2024-11-18T23:47:56.239Z","updated_at":"2025-06-26T15:32:36.689Z","avatar_url":"https://github.com/BeeBombshell.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Python DSA :snake:\n\nThis repository is a compilation of important Data Structures and Algorithms based on Python.\n\n\u003e **Please make seperate folders for different topics** :innocent:\n\nThe following topics will be elaborated:\n\n* Big O Time Complexity \n* Tuples\n* Dictionaries\n* Lists\n* Arrays\n  * Binary Search\n  * Linear Search \n  * Sliding Window Example\n* Looping\n  * For Loop\n  * While Loop\n  * do While Loop\n* Sorting Algorithms\n  * Bubble Sort\n  * Selection Sort\n  * Insertion Sort\n  * Bucket Sort\n  * Merge Sort\n  * Quick Sort\n  * Heap Sort\n  * Tree Sort\n  * Shell Sort\n  * Count Sort\n  * Radix Sort\n* Searching Algorithms\n  * Linear Search\n  * Binary Search\n* Recursion\n  * Ackermann Function\n* Backtracking\n* Dynamic Programming\n* Linked List\n  * Singly Linked List\n  * Doubly Linked List  \n  * Circular Singly Linked List\n  * Circular Doubly Linked List\n  * Reverse Linked List\n  * Merge Linked List\n  * Middle Linked List\n  * Palindromic Linked List\n  * Cycle exist in Linked List\n  * Start of cycle in Linked List\n  * Happy Number\n* Tree Data Structure\n  * BFS\n  * DFS\n  * Binary Tree\n  * Binary Search Tree\n  * AVL tree\n  * Trie\n  * Inorder Tree Traversal\n  * Preorder Tree Traversal\n  * Postorder Tree Traversal\n  * Binary Tree Max Path\n  * Morris Traversal\n* Graph Data Structure\n  * Breadth First Search\n  * Depth First Search\n  * Number of Islands\n* Divide and Conquer Algorithm\n\n![Markdown](https://img.shields.io/badge/markdown-%23000000.svg?style=for-the-badge\u0026logo=markdown\u0026logoColor=white)![Python](https://img.shields.io/badge/python-3670A0?style=for-the-badge\u0026logo=python\u0026logoColor=ffdd54)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbeebombshell%2Fpython-dsa","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbeebombshell%2Fpython-dsa","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbeebombshell%2Fpython-dsa/lists"}