{"id":15907069,"url":"https://github.com/kylemit/code-challenges","last_synced_at":"2025-03-21T16:18:16.472Z","repository":{"id":37609166,"uuid":"419907598","full_name":"KyleMit/code-challenges","owner":"KyleMit","description":"Code Challenge Solutions","archived":false,"fork":false,"pushed_at":"2022-12-02T00:51:03.000Z","size":456,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-03-19T22:53:47.439Z","etag":null,"topics":["algorithms","data-structures","hackerrank","hackerrank-solutions","leetcode","leetcode-solutions"],"latest_commit_sha":null,"homepage":"","language":"TypeScript","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/KyleMit.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2021-10-21T23:37:43.000Z","updated_at":"2022-06-08T16:38:37.000Z","dependencies_parsed_at":"2023-01-23T21:31:12.959Z","dependency_job_id":null,"html_url":"https://github.com/KyleMit/code-challenges","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/KyleMit%2Fcode-challenges","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/KyleMit%2Fcode-challenges/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/KyleMit%2Fcode-challenges/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/KyleMit%2Fcode-challenges/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/KyleMit","download_url":"https://codeload.github.com/KyleMit/code-challenges/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244825655,"owners_count":20516592,"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","data-structures","hackerrank","hackerrank-solutions","leetcode","leetcode-solutions"],"created_at":"2024-10-06T14:00:25.808Z","updated_at":"2025-03-21T16:18:16.444Z","avatar_url":"https://github.com/KyleMit.png","language":"TypeScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Code Challenges\n\n* [LeetCode / KyleMit](https://leetcode.com/KyleMit/)\n* [HackerRank / KyleMit](www.hackerrank.com/kylemit)\n\n## Leet Code\n\n* [Data Structure Course](https://leetcode.com/study-plan/data-structure/)\n* [Algorithm Course](https://leetcode.com/study-plan/algorithm/)\n\n## Hacker Rank\n\n### Data Structures\n\n* [x] Arrays\n* [ ] Linked Lists\n* [ ] Trees\n* [ ] Balanced Trees\n* [ ] Stacks\n* [ ] Queues\n* [ ] Heap\n* [ ] Disjoint Set\n* [ ] Multiple Choice\n* [ ] Trie\n* [ ] Advanced\n\n\n### Algorithms\n\n* [ ] Warmup\n* [ ] Implementation\n* [ ] Strings\n* [ ] Sorting\n* [ ] Search\n* [ ] Graph Theory\n* [ ] Greedy\n* [ ] Dynamic Programming\n* [ ] Constructive Algorithms\n* [ ] Bit Manipulation\n* [ ] Recursion\n* [ ] Game Theory\n* [ ] NP Complete\n* [ ] Debugging\n\n### SQL\n\n* [ ] Basic Select\n* [ ] Advanced Select\n* [ ] Aggregation\n* [ ] Basic Join\n* [ ] Advanced Join\n* [ ] Alternative Queries\n\n\n## Prior Art\n\n* [marinskiy/HackerrankPractice](https://github.com/marinskiy/HackerrankPractice)\n\n\n## Resources\n\n* Wikipedia\n  * [Dynamic programming](https://en.wikipedia.org/wiki/Dynamic_programming)\n  * [Sentinel value](https://en.wikipedia.org/wiki/Sentinel_value)\n  * [Dijkstra's algorithm](https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm)\n  * [Graph traversal](https://en.wikipedia.org/wiki/Graph_traversal)\n  * [Binary tree](https://en.wikipedia.org/wiki/Binary_tree)\n  * [Binary search tree](https://en.wikipedia.org/wiki/Binary_search_tree)\n  * [Binary heap](https://en.wikipedia.org/wiki/Binary_heap)\n  * [Min-max heap](https://en.wikipedia.org/wiki/Min-max_heap)\n  * [Priority queue](https://en.wikipedia.org/wiki/Priority_queue)\n  * [Tree traversal](https://en.wikipedia.org/wiki/Tree_traversal)\n  * [Trie (Prefix Tree)](https://en.wikipedia.org/wiki/Trie)\n  * [Lowest common ancestor (LCA)](https://en.wikipedia.org/wiki/Lowest_common_ancestor)\n  * [Lexicographic order](https://en.wikipedia.org/wiki/Lexicographic_order)\n* Geeks for Geeks\n  * [Tree Traversals (Inorder, Preorder and Postorder)](https://www.geeksforgeeks.org/tree-traversals-inorder-preorder-and-postorder)\n  * [Min Heap in Java](https://www.geeksforgeeks.org/min-heap-in-java/)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkylemit%2Fcode-challenges","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fkylemit%2Fcode-challenges","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkylemit%2Fcode-challenges/lists"}