{"id":19195695,"url":"https://github.com/koeonyack/levelup-algorithm","last_synced_at":"2025-05-08T23:45:45.898Z","repository":{"id":114611271,"uuid":"207960163","full_name":"KoEonYack/LevelUp-Algorithm","owner":"KoEonYack","description":"🔥 500문제 돌파🔥  🚀 알고리즘 실력을 올리기 위한 연습 👨‍💻","archived":false,"fork":false,"pushed_at":"2021-03-12T14:39:28.000Z","size":2306,"stargazers_count":8,"open_issues_count":0,"forks_count":3,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-05-08T23:45:39.308Z","etag":null,"topics":["algorithm","algorithm-challenges","algorithmic-trading","algorithms-and-data-structures"],"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/KoEonYack.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":"2019-09-12T03:50:30.000Z","updated_at":"2024-09-12T15:52:06.000Z","dependencies_parsed_at":null,"dependency_job_id":"9acbf2c5-9823-45c4-b228-1fbcbcc7b540","html_url":"https://github.com/KoEonYack/LevelUp-Algorithm","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/KoEonYack%2FLevelUp-Algorithm","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/KoEonYack%2FLevelUp-Algorithm/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/KoEonYack%2FLevelUp-Algorithm/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/KoEonYack%2FLevelUp-Algorithm/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/KoEonYack","download_url":"https://codeload.github.com/KoEonYack/LevelUp-Algorithm/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":253166474,"owners_count":21864467,"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","algorithm-challenges","algorithmic-trading","algorithms-and-data-structures"],"created_at":"2024-11-09T12:11:12.325Z","updated_at":"2025-05-08T23:45:45.893Z","avatar_url":"https://github.com/KoEonYack.png","language":"Python","readme":"\u003cdiv align=center\u003e\n\u003ch1\u003e LevelUp Algorithm \u003c/h1\u003e\n\n🔥 500문제 돌파🔥 🚀 알고리즘 실력을 올리기 위한 연습 👨‍💻\n\n\u003c/div\u003e\n\n\u003chr\u003e\n\u003ch2\u003e 👨‍💻 500 History \u003c/h2\u003e\n\u003cdetails\u003e\n  \u003csummary\u003e 펼쳐보기 (👈 Clink) \u003c/summary\u003e\n\n![500](/_img/500.PNG)\n\n\u003cul\u003e\n  \u003cli\u003e \u003cb\u003e19년 12월 30일: \u003c/b\u003e 백준 첫 문제 풀이 \u003c/li\u003e\n  \u003cli\u003e \u003cb\u003e20년 01월 05일: \u003c/b\u003e 백준 100문제 돌파 \u003c/li\u003e\n  \u003cli\u003e \u003cb\u003e20년 01월 16일: \u003c/b\u003e 백준 200문제 돌파 \u003c/li\u003e\n  \u003cli\u003e \u003cb\u003e20년 03월 04일: \u003c/b\u003e 백준 300문제 돌파 \u003c/li\u003e\n  \u003cli\u003e \u003cb\u003e20년 03월 19일: \u003c/b\u003e 백준 400문제 돌파 \u003c/li\u003e\n  \u003cli\u003e \u003cb\u003e20년 10월 31일: \u003c/b\u003e 백준 500문제 돌파 (프로그래머스 88문제, 리트코드 11문제) \u003c/li\u003e\n\u003c/ul\u003e\n\u003c/details\u003e\n\n\u003chr\u003e\n\n\u003ch2\u003e 💬 알고리즘 공부 후기 \u003c/h2\u003e\n\u003cdetails\u003e\n  \u003csummary\u003e 펼쳐보기 (👈 Clink) \u003c/summary\u003e\n\n- [코딩테스트 대비를 위한 백준 문제 추천](https://covenant.tistory.com/224)\n- [취업을 위한 코딩테스트 공부방법](https://covenant.tistory.com/220)\n- [백준 500문제 풀이 후기](https://covenant.tistory.com/211)\n- [백준 300문제 풀이 후기](https://covenant.tistory.com/136)\n\n\u003c/details\u003e\n\u003chr\u003e\n\n\u003ch2\u003e ✏ 뼈대 문제 기록 \u003c/h2\u003e\n\u003cdetails\u003e\n  \u003csummary\u003e 펼쳐보기 (👈 Clink) \u003c/summary\u003e\n\n- 튼튼한 기본기를 위해서라면\n    - 배열: [백준 14918: 임시 반장 정하기](https://www.acmicpc.net/problem/14918)\n    - 재귀 탐색 기본: [백준 14888: 연산자 끼워넣기](https://www.acmicpc.net/problem/14888)\n- DP 뼈대문제: 백준 2293 동전1\n- DFS로 검사 뼈대문제: [백준 1062: 가르침](https://www.acmicpc.net/problem/1062)\n- KMP 뼈대문제: [백준 16916: 부분 문자열](https://www.acmicpc.net/problem/16916)\n- 위상정렬 뼈대문제: [백준 2252번: 줄 세우기](https://www.acmicpc.net/problem/2252), [백준 1766번: 문제집](https://www.acmicpc.net/problem/1766)\n- MST 뼈대문제\n  - [백준 1197번: 최소 스패닝 트리](https://www.acmicpc.net/problem/1197) (Baek_1197_2: Prime 풀이, Baek_1197_3: Kruskal 풀이)\n  - [백준 1916번: 최소비용 구하기](https://www.acmicpc.net/problem/1916) (Baek_1916_2: Bellman-Ford 풀이)\n  - [백준 11657번: 최소비용 구하기](https://www.acmicpc.net/problem/11657) (Baek_11657_2: Bellman-Ford 풀이)\n\n\u003c/details\u003e\n\u003chr\u003e\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkoeonyack%2Flevelup-algorithm","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fkoeonyack%2Flevelup-algorithm","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkoeonyack%2Flevelup-algorithm/lists"}