{"id":25403669,"url":"https://github.com/sumit-kr-das/data_structure_and_algo","last_synced_at":"2025-08-21T02:05:17.539Z","repository":{"id":40777386,"uuid":"508042911","full_name":"sumit-kr-das/data_structure_and_algo","owner":"sumit-kr-das","description":null,"archived":false,"fork":false,"pushed_at":"2023-04-12T20:48:05.000Z","size":872,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-04-12T17:00:40.439Z","etag":null,"topics":["algorithms","cpp","data-structures"],"latest_commit_sha":null,"homepage":"","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/sumit-kr-das.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,"zenodo":null}},"created_at":"2022-06-27T19:50:44.000Z","updated_at":"2022-06-27T19:53:04.000Z","dependencies_parsed_at":"2025-04-12T16:33:45.234Z","dependency_job_id":null,"html_url":"https://github.com/sumit-kr-das/data_structure_and_algo","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/sumit-kr-das/data_structure_and_algo","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sumit-kr-das%2Fdata_structure_and_algo","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sumit-kr-das%2Fdata_structure_and_algo/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sumit-kr-das%2Fdata_structure_and_algo/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sumit-kr-das%2Fdata_structure_and_algo/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/sumit-kr-das","download_url":"https://codeload.github.com/sumit-kr-das/data_structure_and_algo/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sumit-kr-das%2Fdata_structure_and_algo/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":271415496,"owners_count":24755639,"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-08-21T02:00:08.990Z","response_time":74,"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":["algorithms","cpp","data-structures"],"created_at":"2025-02-16T02:47:50.498Z","updated_at":"2025-08-21T02:05:17.521Z","avatar_url":"https://github.com/sumit-kr-das.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"## STL \u003cbr /\u003e\n#### The functions associated with ```vector``` are: \n- ```at()``` - It provides a reference to an element.\n- ```back()``` - It gives a reference to the last element.\n- ```front()``` - It gives a reference to the first element.\n- ```swap()``` - It exchanges the elements between two vectors.\n- ```push_back()``` - It adds a new element at the end.\n- ```pop_back()``` - It removes a last element from the vector.\n- ```empty()``` - It determines whether the vector is empty or not.\n- ```insert()``` - It inserts new element at the specified position.\n- ```erase()``` - It deletes the specified element.\n- ```resize()``` - It modifies the size of the vector.\n- ```clear()``` - It removes all the elements from the vector.\n- ```size()``` - It determines a number of elements in the vector.\u003cbr /\u003e\n#### The functions associated with ```stack``` are: \n- ```empty()``` – Returns whether the stack is empty – Time Complexity : O(1) \n- ```size()``` – Returns the size of the stack – Time Complexity : O(1) \n- ```top()``` – Returns a reference to the top most element of the stack – Time Complexity : O(1) \n- ```push(g)``` – Adds the element ‘g’ at the top of the stack – Time Complexity : O(1) \n- ```pop()``` – Deletes the top most element of the stack – Time Complexity : O(1) \n\n# Tree\n- Binary Tree Levelorder traversal\n- Binary Tree Inorder traversal\n- Binary Tree Preorder traversal\n- Binary Tree Postorder traversal","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsumit-kr-das%2Fdata_structure_and_algo","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsumit-kr-das%2Fdata_structure_and_algo","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsumit-kr-das%2Fdata_structure_and_algo/lists"}