{"id":25813379,"url":"https://github.com/ico12319/leetcode-tasks","last_synced_at":"2025-02-28T02:37:54.397Z","repository":{"id":230111362,"uuid":"778521020","full_name":"ico12319/LeetCode-Tasks","owner":"ico12319","description":"LeetCode tasks solved by me","archived":false,"fork":false,"pushed_at":"2025-02-22T12:14:55.000Z","size":686,"stargazers_count":5,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-22T13:25:15.971Z","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/ico12319.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":"2024-03-27T21:49:34.000Z","updated_at":"2025-02-22T12:14:58.000Z","dependencies_parsed_at":null,"dependency_job_id":"5204045e-00c3-4e0a-9200-766abc701079","html_url":"https://github.com/ico12319/LeetCode-Tasks","commit_stats":null,"previous_names":["ico12319/leetcode-tasks"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ico12319%2FLeetCode-Tasks","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ico12319%2FLeetCode-Tasks/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ico12319%2FLeetCode-Tasks/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ico12319%2FLeetCode-Tasks/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ico12319","download_url":"https://codeload.github.com/ico12319/LeetCode-Tasks/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":241090336,"owners_count":19907931,"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","cpp","data-structures"],"created_at":"2025-02-28T02:37:53.861Z","updated_at":"2025-02-28T02:37:54.385Z","avatar_url":"https://github.com/ico12319.png","language":"C++","readme":"# LeetCode_Tasks\n\nThese are tasks I have solved for practice over the time from the LeetCode site. Most of the problems are solved using C++ language and are mostly linked with \nData Structure and Algorithms.\n\nThe main data types in the problems are:\n1. Vector\n2. String\n3. Stack\n4. Queue\n5. Linked Lists(Singly and Doubly)\n6. Binary Trees\n7. N-ary Trees\n8. Binary Search Trees\n9. Graphs(BFS, DFS)\n10. Graphs shortest path(BFS,Dijkstra)\n11. Hash Tables and Hash Sets\n13. Priority Queue (Min \u0026 Max heap)\n14. Sorting Algorithms\n15. AVL Trees (Set \u0026 Map)\n\n# My Profile --\u003e https://leetcode.com/u/ico12319/\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fico12319%2Fleetcode-tasks","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fico12319%2Fleetcode-tasks","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fico12319%2Fleetcode-tasks/lists"}