{"id":18686028,"url":"https://github.com/friendly-banana/always-be-coding","last_synced_at":"2025-09-12T17:43:04.897Z","repository":{"id":122893742,"uuid":"284934160","full_name":"Friendly-Banana/always-be-coding","owner":"Friendly-Banana","description":null,"archived":false,"fork":false,"pushed_at":"2022-11-22T11:50:04.000Z","size":21,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-05-18T19:07:05.375Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"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/Friendly-Banana.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":"2020-08-04T09:23:47.000Z","updated_at":"2022-11-15T11:09:58.000Z","dependencies_parsed_at":null,"dependency_job_id":"993fc1f4-97a0-4bc4-a4f2-2d28ff4a48a2","html_url":"https://github.com/Friendly-Banana/always-be-coding","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Friendly-Banana/always-be-coding","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Friendly-Banana%2Falways-be-coding","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Friendly-Banana%2Falways-be-coding/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Friendly-Banana%2Falways-be-coding/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Friendly-Banana%2Falways-be-coding/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Friendly-Banana","download_url":"https://codeload.github.com/Friendly-Banana/always-be-coding/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Friendly-Banana%2Falways-be-coding/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":274848242,"owners_count":25360981,"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-09-12T02:00:09.324Z","response_time":60,"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":[],"created_at":"2024-11-07T10:25:37.087Z","updated_at":"2025-09-12T17:43:04.871Z","avatar_url":"https://github.com/Friendly-Banana.png","language":"Python","readme":"# Always Be Coding\n\na playground to implement common things\n\n## Algorithmes\n\n- [X] [Insertion sort, Selection sort, Merge Sort, Quicksort](/Algorithmes/SortTypes.py)\n- [X] [Binary Search](/Algorithmes/BinarySearch.py)\n- [ ] [Breadth First Search (BFS)](/Algorithmes/)\n- [ ] [Depth First Search (DFS)](/Algorithmes/)\n- [ ] [Lee algorithm | Shortest path in a Maze](/Algorithmes/)\n- [ ] [Flood fill Algorithm](/Algorithmes/)\n- [X] [Astar](/Algorithmes/astar.py)\n- [X] [Astar Visualization](Algorithmes/astar_visual.py)\n- [ ] [Floyd’s Cycle Detection Algorithm](/Algorithmes/)\n- [ ] [Kadane’s algorithm](/Algorithmes/)\n- [ ] [Longest Increasing Subsequence](/Algorithmes/)\n- [ ] [Inorder, Preorder, Postorder Tree Traversals](/Algorithmes/)\n- [ ] [Heap Sort](/Algorithmes/)\n- [ ] [Topological Sorting in a DAG](/Algorithmes/)\n- [ ] [Disjoint-Set Data Structure (Union-Find Algorithm)](/Algorithmes/)\n- [ ] [Kruskal’s Algorithm for finding Minimum Spanning Tree](/Algorithmes/)\n- [ ] [Single-Source Shortest Paths — Dijkstra’s Algorithm](/Algorithmes/)\n- [ ] [All-Pairs Shortest Paths — Floyd Warshall Algorithm](/Algorithmes/)\n\n## Data Structures\n\n- [X] [List / Vector (dynamic array)](/Collections/List.cs)\n- [X] [Linked List](/Collections/LinkedList.py)\n- [X] [Set](/Collections/Set.py)\n- [X] [Stack](/Collections/Stack.py)\n- [X] [Queue](/Collections/Queue.py)\n- [X] [Circular Queue](/Collections/CircularQueue.py)\n- [X] [Priority Queue](/Collections/PriorityQueue.py)\n- [X] [Binary Tree](/Collections/BinaryTree.py)\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffriendly-banana%2Falways-be-coding","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ffriendly-banana%2Falways-be-coding","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffriendly-banana%2Falways-be-coding/lists"}