{"id":21352612,"url":"https://github.com/elibroftw/contest-questions","last_synced_at":"2025-07-12T21:31:05.128Z","repository":{"id":101206840,"uuid":"99639266","full_name":"elibroftw/contest-questions","owner":"elibroftw","description":"My competition / problem solving solutions in Python and sometimes C++","archived":false,"fork":false,"pushed_at":"2024-04-05T17:35:29.000Z","size":2127,"stargazers_count":7,"open_issues_count":0,"forks_count":3,"subscribers_count":1,"default_branch":"master","last_synced_at":"2024-04-05T18:38:15.791Z","etag":null,"topics":["algorithm","algorithms","canadian-computing-competition","ccc","python","solutions","uwaterloo","waterloo"],"latest_commit_sha":null,"homepage":"","language":"Python","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/elibroftw.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}},"created_at":"2017-08-08T02:07:52.000Z","updated_at":"2023-05-23T06:48:37.000Z","dependencies_parsed_at":null,"dependency_job_id":"a6d2389d-c3ed-4429-a5e6-79d36289880f","html_url":"https://github.com/elibroftw/contest-questions","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/elibroftw%2Fcontest-questions","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/elibroftw%2Fcontest-questions/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/elibroftw%2Fcontest-questions/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/elibroftw%2Fcontest-questions/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/elibroftw","download_url":"https://codeload.github.com/elibroftw/contest-questions/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":225834340,"owners_count":17531471,"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":["algorithm","algorithms","canadian-computing-competition","ccc","python","solutions","uwaterloo","waterloo"],"created_at":"2024-11-22T03:14:23.799Z","updated_at":"2024-11-22T03:14:24.498Z","avatar_url":"https://github.com/elibroftw.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Programming Challenges Solution Repository\n\nIncludes solutions for uWaterloo's CCC, Hackerrank, GeeksForGeeks, LeetCode, Google Kickstart, and some useful graph algorithms in python 3.\n\nNOTE: I made this so that others may learn from the techniques I have used to solve problems that may or may not be mainstream. An example of this is\n[2012 S4](CCC/2012/S4%20A%20Coin%20Game.py). The solution found online for Python3 is made by 4/5 people, uses a technique as if they were programming in C++, and barely passed the test cases (in terms of time). I had first created a solution that couldn't pass on time, but only because I had never used the `set` data structure in Python. As soon as I changed the algorithm to use a `set` instead of a `list`, my solution became more efficient than the existing online Python3 solution. I now use sets a lot and always look for this easy optimization.\n\nAnother note: I've also noticed that there is a lack of organization / design / aesthetic when it comes to programmers sharing their solutions, and so this repository aims fill that void. I'm obviously not the smartest programmer and I like to create projects so this repository might not have everything you look for.\n\n## Canadian Computing Competition\n\nhttps://cemc.math.uwaterloo.ca/contests/computing.html\n\n| **Year**  |  **Type**  |  **Completed**  | **Total Score**\n|---|---|---|---\n| [2019](CCC/2019) |  *Junior* | X - X  | 0/75\n| [2019](CCC/2019) |  *Senior* | 1 - 3  | 40/75\n| [2018](CCC/2018) |  *Junior* | 1 - 4  | 60/75\n| [2018](CCC/2018) |  *Senior* | 1 - 4  | 60/75\n| [2017](CCC/2017) |  *Junior* | 1 - 5  | 75/75\n| [2017](CCC/2017) |  *Senior* | 1 - 3  | 45/75\n| [2016](CCC/2016) |  *Junior* | 1 - 5  | 75/75\n| [2016](CCC/2016) |  *Senior* | X - X  | 0/75\n| [2015](CCC/2015) |  *Junior* | 1 - 5  | 75/75\n| [2015](CCC/2015) |  *Senior* | X - X  | 0/75\n| [2014](CCC/2014) |  *Junior* | X - X  | 0/75\n| [2014](CCC/2014) |  *Senior* | X - X  | 0/75\n| [2013](CCC/2013) |  *Junior* | X - X  | 0/75\n| [2013](CCC/2013) |  *Senior* | X - X  | 0/75\n| [2012](CCC/2012) |  *Junior* | 1 - 5  | 75/75\n| [2012](CCC/2012) |  *Senior* | 4 - 5  | 30/75\n| [2011](CCC/2011) |  *Junior* | 1 - 5  | 60/75\n| [2011](CCC/2011) |  *Senior* | X - X  | 0/75\n| [2010](CCC/2010) |  *Junior* | 1 - 5  | 75/75\n| [2010](CCC/2010) |  *Senior* | 1 - 2  | 30/75\n\n## Optimization Tricks\n\n- [Convex Hull Dynamic Programming Optimization](https://jeffreyxiao.me/blog/convex-hull-trick)\n  - Test knowledge on [Z-Frog 3](https://atcoder.jp/contests/dp/tasks/dp_z)\n    - [Solution](https://youtu.be/HnZKQJtGeHs)\n  - \"technique is \"obvious\" to anybody who has learned the [sweep line algorithm](https://leetcode.com/discuss/study-guide/2166045/line-sweep-algorithms) for the [line segment intersection problem](https://www.geeksforgeeks.org/check-if-two-given-line-segments-intersect/).\"\n  - Introduced by Brucker, P. (1995). Efficient algorithms for some path partitioning problems. Discrete Applied Mathematics, 62(1-3), 77-85.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Felibroftw%2Fcontest-questions","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Felibroftw%2Fcontest-questions","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Felibroftw%2Fcontest-questions/lists"}