{"id":20493645,"url":"https://github.com/code-lucidal58/dsa-python","last_synced_at":"2026-03-09T12:32:34.502Z","repository":{"id":88633377,"uuid":"171729472","full_name":"code-lucidal58/dsa-python","owner":"code-lucidal58","description":"Data Structures and Algorithms using Python","archived":false,"fork":false,"pushed_at":"2020-05-17T13:40:12.000Z","size":32,"stargazers_count":5,"open_issues_count":0,"forks_count":2,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-03-27T08:11:19.362Z","etag":null,"topics":["data-structure-and-algorithm","data-structures","python","python3"],"latest_commit_sha":null,"homepage":null,"language":"Jupyter Notebook","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/code-lucidal58.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":"2019-02-20T18:44:28.000Z","updated_at":"2023-10-03T06:07:46.000Z","dependencies_parsed_at":"2024-03-25T14:19:18.833Z","dependency_job_id":null,"html_url":"https://github.com/code-lucidal58/dsa-python","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/code-lucidal58%2Fdsa-python","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/code-lucidal58%2Fdsa-python/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/code-lucidal58%2Fdsa-python/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/code-lucidal58%2Fdsa-python/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/code-lucidal58","download_url":"https://codeload.github.com/code-lucidal58/dsa-python/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248750831,"owners_count":21155791,"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":["data-structure-and-algorithm","data-structures","python","python3"],"created_at":"2024-11-15T17:36:03.850Z","updated_at":"2026-03-09T12:32:34.454Z","avatar_url":"https://github.com/code-lucidal58.png","language":"Jupyter Notebook","readme":"# Python for Data Structures, Algorithms, and Interviews!\nThis repository consists of notes made while going through the course *Python for Data Structures, Algorithms, and Interviews!* \nin Udemy. All modules are separated as Jupiter Notebooks.\n\nThis course mainly has questions based on different data structures and very less questions based on pre-known algorithms.\nKindly refer to [my repo](https://github.com/code-lucidal58/named-algorithms) for list of named algorithms and their implementations.\n\nAll the best and keep coding!! :)\n\n## Algorithms characteristics:\nAlgorithms have associated complexity:  \n* space -\u003e memory occupied  \n* time -\u003e time taken to complete task irrespective of input size  \n* They have set of input and produces output\n\n#Algorithms classification  \n* series-\u003e sequential fashion\n* parallel -\u003e break data set and work on each simultaneously\n* exact -\u003e provides exact value as output\n* approximate -\u003e output may or may not be exact e.g. face recognition\n* deterministic -\u003e steps know\n* non-deterministic -\u003e based on guesses\n\n## Types of Algorithms\n* searching -\u003e search specific data in a larger data\n* sorting -\u003e sort a dataset\n* computational -\u003e take one data set and return another data set\n* collection -\u003e navigating through elements in a dataset\n\n## Algorithms performance\nBig-O notation: classifies performance as input size grows. O represents order of operation\n\u003ctable\u003e\n  \u003ctr\u003e\n    \u003cth\u003eNotation\u003c/th\u003e\n    \u003cth\u003eDescription\u003c/th\u003e\n  \u003c/tr\u003e\n  \u003ctr\u003e\n    \u003ctd\u003eO(1)\u003c/td\u003e\n    \u003ctd\u003eConstant\u003c/td\u003e\n  \u003c/tr\u003e\n  \u003ctr\u003e\n    \u003ctd\u003eO(log n)\u003c/td\u003e\n    \u003ctd\u003eLogarithmic\u003c/td\u003e\n  \u003c/tr\u003e\n  \u003ctr\u003e\n    \u003ctd\u003eO(n)\u003cbr\u003e\u003c/td\u003e\n    \u003ctd\u003eLinear time\u003c/td\u003e\n  \u003c/tr\u003e\n  \u003ctr\u003e\n    \u003ctd\u003eO(nlogn)\u003c/td\u003e\n    \u003ctd\u003eLog-linear\u003c/td\u003e\n  \u003c/tr\u003e\n  \u003ctr\u003e\n    \u003ctd\u003eO(n^2)\u003c/td\u003e\n    \u003ctd\u003eQuadratic\u003c/td\u003e\n  \u003c/tr\u003e\n\u003c/table\u003e\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcode-lucidal58%2Fdsa-python","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fcode-lucidal58%2Fdsa-python","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcode-lucidal58%2Fdsa-python/lists"}