{"id":27382243,"url":"https://github.com/kartikcode/data-structures-algorithms","last_synced_at":"2025-04-13T15:27:22.832Z","repository":{"id":46539856,"uuid":"288639236","full_name":"kartikcode/Data-Structures-Algorithms","owner":"kartikcode","description":"Contains the implementation of various data structures and algorithms. The go-to resource for all your technical interviews and CP contests.","archived":false,"fork":false,"pushed_at":"2021-10-09T09:03:53.000Z","size":16280,"stargazers_count":4,"open_issues_count":0,"forks_count":5,"subscribers_count":2,"default_branch":"master","last_synced_at":"2023-11-23T19:54:24.243Z","etag":null,"topics":["algorithms","algorithms-datastructures","cp-contests","cpp","data-structures","hacktoberfest","hacktoberfest2021","java"],"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/kartikcode.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}},"created_at":"2020-08-19T05:11:52.000Z","updated_at":"2023-11-23T19:54:24.244Z","dependencies_parsed_at":"2022-09-10T03:53:37.619Z","dependency_job_id":null,"html_url":"https://github.com/kartikcode/Data-Structures-Algorithms","commit_stats":null,"previous_names":[],"tags_count":0,"template":null,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kartikcode%2FData-Structures-Algorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kartikcode%2FData-Structures-Algorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kartikcode%2FData-Structures-Algorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kartikcode%2FData-Structures-Algorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/kartikcode","download_url":"https://codeload.github.com/kartikcode/Data-Structures-Algorithms/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248734567,"owners_count":21153236,"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":["algorithms","algorithms-datastructures","cp-contests","cpp","data-structures","hacktoberfest","hacktoberfest2021","java"],"created_at":"2025-04-13T15:27:21.715Z","updated_at":"2025-04-13T15:27:22.824Z","avatar_url":"https://github.com/kartikcode.png","language":"C++","readme":"# Data Structures and Algorithms\nAll the assignments and coursework done as a part of Coursera DSA course by Princeton University. Also, this repository contains the implementation of various data structures and various algorithms. This repository can be the one go-to resource for various technical interviews and even for getting a shorthand implementation of algos during your CP contest.😉\n\n### List of implemented Data Structures\n- Linked List\n- Stacks\n- Queues\n- Union-Find (Set implementation)\n- Binary Search Tree (BST)\n- Segment Tree \n\n### List of implemented Algorithms\n- Various Sorting Algos\n- Knapsack Problem (Both Variants 1 and 2)\n- Binary Search\n- Dijkstra ALgorithm for finding the shortest path\n- Bellman Ford Algorithm for finding the shortest path \n- Floyd Warshall Algorithm for finding shortest path between all pairs of vertices\n- Kruskal's Algorithm for finding the shortest path\n- Kadane's Algorithm for Maximum Sum of Contiguous Subarray\n- Circular Kadane's Algorithm for Maximum Sum of Contiguous Subarray with both ends connected\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkartikcode%2Fdata-structures-algorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fkartikcode%2Fdata-structures-algorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkartikcode%2Fdata-structures-algorithms/lists"}