{"id":16211594,"url":"https://github.com/laurabeatris/algorithms-and-data-structures","last_synced_at":"2026-01-30T21:37:57.140Z","repository":{"id":100510351,"uuid":"356323147","full_name":"LauraBeatris/algorithms-and-data-structures","owner":"LauraBeatris","description":"Study driven repository to maintain algorithms and data structures knowledge","archived":false,"fork":false,"pushed_at":"2021-04-26T21:22:21.000Z","size":89,"stargazers_count":10,"open_issues_count":0,"forks_count":3,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-06-16T10:01:08.011Z","etag":null,"topics":["algorithms","big-o-notation","computer-science","data-structures","python"],"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/LauraBeatris.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","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":"2021-04-09T15:49:17.000Z","updated_at":"2022-06-01T18:23:54.000Z","dependencies_parsed_at":"2023-05-15T13:45:20.876Z","dependency_job_id":null,"html_url":"https://github.com/LauraBeatris/algorithms-and-data-structures","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/LauraBeatris/algorithms-and-data-structures","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LauraBeatris%2Falgorithms-and-data-structures","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LauraBeatris%2Falgorithms-and-data-structures/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LauraBeatris%2Falgorithms-and-data-structures/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LauraBeatris%2Falgorithms-and-data-structures/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/LauraBeatris","download_url":"https://codeload.github.com/LauraBeatris/algorithms-and-data-structures/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LauraBeatris%2Falgorithms-and-data-structures/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28919752,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-30T20:25:28.696Z","status":"ssl_error","status_checked_at":"2026-01-30T20:25:13.426Z","response_time":66,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.5:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":["algorithms","big-o-notation","computer-science","data-structures","python"],"created_at":"2024-10-10T10:48:38.384Z","updated_at":"2026-01-30T21:37:57.116Z","avatar_url":"https://github.com/LauraBeatris.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"\u003cp align=\"center\"\u003e\n  \u003cimg src=\"./.github/docs/images/logo.png\" width=\"400\"\u003e\n\u003c/p\u003e\n\n# Big O Notation \n\u003e Big O describes how the time is taken, or memory is used, by a program scales with the amount of data it has to work on \n\n\u003e Big O helps us to measure the scalability of our code\n\n\u003e Big O is a way to indicate complexities (Space Complexity \u0026 Time Complexity)\n\n- [Exercises](https://github.com/LauraBeatris/algorithms-and-data-structures/tree/main/big_o_notation/exercises)\n- [Cheat Sheet](https://github.com/LauraBeatris/algorithms-and-data-structures/tree/main/big_o_notation/big_o_cheat_sheet.pdf)\n\n## Time Complexity\n- [Linear Time - O(n)](https://github.com/LauraBeatris/algorithms-and-data-structures/tree/main/big_o_notation/time_complexity/linear_time.py)\n- [Constant Time - O(1)](https://github.com/LauraBeatris/algorithms-and-data-structures/tree/main/big_o_notation/time_complexity/constant_time.py)\n- [Quadratic Time - O(n^2)](https://github.com/LauraBeatris/algorithms-and-data-structures/tree/main/big_o_notation/time_complexity/quadratic_time.py)\n\n## Space Complexity\n- [Linear Space - O(n)](https://github.com/LauraBeatris/algorithms-and-data-structures/tree/main/big_o_notation/space_complexity/linear_space.py)\n- [Constant Space - O(1)](https://github.com/LauraBeatris/algorithms-and-data-structures/tree/main/big_o_notation/space_complexity/constant_space.py)\n\n## Rules\n- [Worst Case](https://github.com/LauraBeatris/algorithms-and-data-structures/tree/main/big_o_notation/rules/worst_case.py)\n- [Remove Constants](https://github.com/LauraBeatris/algorithms-and-data-structures/tree/main/big_o_notation/rules/remove_constants.py)\n- [Different Terms for Inputs](https://github.com/LauraBeatris/algorithms-and-data-structures/tree/main/big_o_notation/rules/different_terms_for_inputs.py)\n- [Drop Non Dominants](https://github.com/LauraBeatris/algorithms-and-data-structures/tree/main/big_o_notation/rules/drop_non_dominants.py)\n\n\n# Data Structures\n\u003e A data structure is a specialized format for organizing, processing, retrieving and storing data.\n\n\u003e A data structure is a way of organizing the data so that it can be used efficiently. \n\n## Arrays\n\n- [Exercises](https://github.com/LauraBeatris/algorithms-and-data-structures/tree/main/data_structures/arrays/exercises)\n- [Operations](https://github.com/LauraBeatris/algorithms-and-data-structures/tree/main/data_structures/arrays/arrays_operations.py)\n- [Implementing an array from scratch](https://github.com/LauraBeatris/algorithms-and-data-structures/tree/main/data_structures/arrays/implement_array.py)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flaurabeatris%2Falgorithms-and-data-structures","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Flaurabeatris%2Falgorithms-and-data-structures","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flaurabeatris%2Falgorithms-and-data-structures/lists"}