{"id":24988343,"url":"https://github.com/aryamangithub/data-structures-and-algorithm","last_synced_at":"2025-10-23T21:55:57.936Z","repository":{"id":177660997,"uuid":"598301998","full_name":"aryamangithub/data-structures-and-algorithm","owner":"aryamangithub","description":null,"archived":false,"fork":false,"pushed_at":"2024-12-22T17:54:40.000Z","size":236,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-04T12:03:49.249Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"C++","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/aryamangithub.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":"2023-02-06T20:31:28.000Z","updated_at":"2024-12-22T17:54:44.000Z","dependencies_parsed_at":"2024-06-13T03:16:20.958Z","dependency_job_id":"c7ec0199-12c9-4733-a8a9-a600eacd496c","html_url":"https://github.com/aryamangithub/data-structures-and-algorithm","commit_stats":null,"previous_names":["aryamangithub/leetcode"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aryamangithub%2Fdata-structures-and-algorithm","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aryamangithub%2Fdata-structures-and-algorithm/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aryamangithub%2Fdata-structures-and-algorithm/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aryamangithub%2Fdata-structures-and-algorithm/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/aryamangithub","download_url":"https://codeload.github.com/aryamangithub/data-structures-and-algorithm/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246174606,"owners_count":20735417,"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-04T12:03:52.280Z","updated_at":"2025-10-23T21:55:57.879Z","avatar_url":"https://github.com/aryamangithub.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Data Structure And Algorithm\nThis repository contains all the coding problems I solved on platforms GFG and Leetcode.\n\n## Data Structures in Big O Notation\n| Data Structure | Add/Insert | Remove/Delete | Access/Get | Search/Contains | Space Complexity |\n| --- | --- | --- | --- | --- | --- |\n| Array | ```O(n)``` | ```O(n)``` | ```O(1)``` | ```O(n)``` | ```O(n)``` |\n| Set | ```O(logn)``` | ```O(logn)``` |``` -``` | ```O(logn)``` | ```O(n)``` |\n| Unordered Set | ```O(1)Average O(n)Worst``` | ```O(1)Average O(n)Worst``` |``` -``` | ```O(1)Average O(n)Worst``` | ```O(n)``` |\n| Map | ```O(logn)``` | ```O(logn)``` |``` -``` | ```O(logn)``` | ```O(n)``` |\n| Unordered Map | ```O(1)Average O(n)Worst``` | ```O(1)Average O(n)Worst``` |``` -``` | ```O(1)Average O(n)Worst``` | ```O(n)``` |\n| Stack | ```O(1)``` | ```O(1)``` | ```O(n)``` | ```O(n)``` | ```O(n)``` |\n| Queue | ```O(1)``` | ```O(1)``` | ```O(n)``` | ```O(n)``` | ```O(n)``` |\n| Binary Search Tree | ```O(log n)``` | ```O(log n)``` | ```O(log n)``` | ```O(log n)``` | ```O(n)``` |\n| Binary Min Heap | ```O(log n)``` | ```O(log n)``` | ```O(1)``` | ```O(n)``` | ```O(n)``` |\n| Binary Max Heap | ```O(log n)``` | ```O(log n)``` | ```O(1)``` | ```O(n)``` | ```O(n)``` |\n\u003c!-- | Singly LinkedList | ```O(1)``` | ```O(1)``` | ```O(n)``` | ```O(n)``` | ```O(n)``` |\n| Doubly LinkedList | ```O(1)``` | ```O(1)``` | ```O(n)``` | ```O(n)``` | ```O(n)``` |\n| Circular Singly LinkedList | ```O(1)``` | ```O(1)``` | ```O(n)``` | ```O(n)``` | ```O(n)``` |\n| Circular Doubly LinkedList | ```O(1)``` | ```O(1)``` | ```O(n)``` | ```O(n)``` | ```O(n)``` | --\u003e\n\n## Sorting Algorithms in Big O Notation\n| Sort Algorithm | Best | Average | Worst | Space Complexity |\n| --- | --- | --- | --- | --- |\n| Selection Sort | ```O(n^2)``` | ```O(n^2)``` | ```O(n^2)``` | ```O(1)``` |\n| Bubble Sort | ```O(n^2)``` | ```O(n^2)``` | ```O(n^2)``` | ```O(1)``` |\n| Insertion Sort | ```O(n)``` | ```O(n^2)``` | ```O(n^2)``` | ```O(1)``` |\n| Quick Sort | ```O(n logn)``` | ```O(n logn)``` | ```O(n^2)``` | ```O(logn)``` |\n| Merge Sort | ```O(n logn)``` | ```O(n logn)``` | ```O(n logn)``` | ```O(n)``` |\n| Counting Sort | ```O(n+k)``` | ```O(n+k)``` | ```O(n+k)``` | ```O(k)``` |\n| Tim Sort | ```O(n)``` | ```O(n logn)``` | ```O(n logn)``` | ```O(n)``` |\n| Heap Sort | ```O(n long)``` | ```O(n logn)``` | ```O(n logn)``` | ```O(1)``` |\n| Shell Sort | ```O(n)``` | ```O((n logn)^2)``` | ```O((n logn)^2)``` | ```O(1)``` |\n| Bucket Sort | ```O(n+k)``` | ```O(n+k)``` | ```O(n^2)``` | ```O(1)``` |\n| Radix Sort | ```O(nk)``` | ```O(nk)``` | ```O(nk)``` | ```O(n+k)``` |\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Faryamangithub%2Fdata-structures-and-algorithm","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Faryamangithub%2Fdata-structures-and-algorithm","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Faryamangithub%2Fdata-structures-and-algorithm/lists"}