{"id":25098569,"url":"https://github.com/christopheralphonse/re_learning_python","last_synced_at":"2025-04-02T04:11:29.188Z","repository":{"id":275239383,"uuid":"899771192","full_name":"ChristopherAlphonse/re_learning_python","owner":"ChristopherAlphonse","description":null,"archived":false,"fork":false,"pushed_at":"2025-03-29T20:22:13.000Z","size":8600,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-29T21:25:31.418Z","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/ChristopherAlphonse.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":"2024-12-07T01:29:22.000Z","updated_at":"2025-03-29T20:22:16.000Z","dependencies_parsed_at":"2025-03-22T19:37:09.984Z","dependency_job_id":null,"html_url":"https://github.com/ChristopherAlphonse/re_learning_python","commit_stats":null,"previous_names":["christopheralphonse/re_learning_python"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ChristopherAlphonse%2Fre_learning_python","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ChristopherAlphonse%2Fre_learning_python/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ChristopherAlphonse%2Fre_learning_python/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ChristopherAlphonse%2Fre_learning_python/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ChristopherAlphonse","download_url":"https://codeload.github.com/ChristopherAlphonse/re_learning_python/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246752653,"owners_count":20827987,"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-02-07T18:32:56.255Z","updated_at":"2025-04-02T04:11:29.182Z","avatar_url":"https://github.com/ChristopherAlphonse.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"Data Structures:\n\nArrays / List:\n\n-   Read: O(1)\n-   Insertion: O(n)\n-   Deletion: O(n)\n-   Fast at reading but slow at insertion and deletion.\n\n![](/images/list.svg)\n\nLinked Lists:\n\n-   Read: O(n)\n-   Insertion: O(1)\n-   Deletion: O(1)\n-   Slow at reading but efficient for insertion and deletion.\n\n![](/images/linked_list.webp)\n\nHashMaps:\n\n-   Read: O(1)\n-   Insertion: O(1)\n-   Deletion: O(1)\n-   Similar to arrays but with named indexes (keys); unordered but provide fast lookup.\n\n![](/images//map.jpg)\n_hash map use linked list and array list for fast memory access and collision handling_\n\nStacks:\n\n-   Push: O(1)\n-   Pop: O(1)\n-   Peak: O(1)\n-   Follow the LIFO (Last In, First Out) principle; useful for fast retrieval of the topmost element but can be cumbersome for inserting or deleting elements in the middle or end.\n\n![](/images/stack-operations.webp)\n\nQueues:\n\n-   Enqueue: O(1)\n-   Dequeue: O(1)\n-   Front: O(1)\n-   Follow the FIFO (First In, First Out) principle; the first element in line is the first to come out. Think of them as playlists for organizing items in order of arrival.\n    ![](/images/que.png)\n\nTrees:\n\n-   Read/Search: O(log n)\n-   Insertion: O(log n)\n-   Deletion: O(log n)\n-   Nodes connected by edges; root, parent-child connections.\n\n![](/images/Treedatastructure.png)\n\nBinary Trees:\n\n-   Efficient searching of ordered values.\n-   Follow a binary search property where left child nodes are less than the parent and right child nodes are greater.\n-   Useful for tasks like number guessing games or dictionary implementations.\n\n![](/images/B-tree.webp)\nGraphs:\n\n-   Traversal/Search: O(V + E) (V: number of vertices, E: number of edges)\n-   Insertion: O(1)\n-   Deletion: O(1)\n-   Versatile models for connections between nodes and edges; can be directed or undirected with no neighboring limit. Can include cycles and weights on paths. Used for tasks like route optimizationData Structures:\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fchristopheralphonse%2Fre_learning_python","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fchristopheralphonse%2Fre_learning_python","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fchristopheralphonse%2Fre_learning_python/lists"}