| react-profiling | 0 |
| react-import-map | react,react-dom,react-dom/client,react-dom/profiling,react-is,react/compiler-runtime,react/jsx-dev-runtime,react/jsx-runtime,scheduler@b8488ee2c322 |
| route-pattern | /:user_id/:repository |
| route-controller | files |
| route-action | disambiguate |
| fetch-nonce | v2:ad2eec77-9dd6-e42f-0bd6-8e506a0c45f3 |
| current-catalog-service-hash | f3abb0cc802f3d7b95fc8762b94bdcb13bf39634c40c357301c4aa1d67a256fb |
| request-id | E698:31FE5:BE1538:F87B21:6B028AED |
| html-safe-nonce | cf618be0635ed4b8123fd22b9162cb595bb0dc89fe0d01ed1a7d89a9da1fc77e |
| visitor-payload | eyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJFNjk4OjMxRkU1OkJFMTUzODpGODdCMjE6NkIwMjhBRUQiLCJ2aXNpdG9yX2lkIjoiMzgyMzAyNzU1MTA1MjQwMTM4OSIsInJlZ2lvbl9lZGdlIjoiaWFkIiwicmVnaW9uX3JlbmRlciI6ImlhZCJ9 |
| visitor-hmac | 65add7c69ae208d5ac1ac9dd80b667764b421c8bc10e7b673354b167baeed2dc |
| hovercard-subject-tag | repository:312512419 |
| github-keyboard-shortcuts | repository,copilot |
| google-site-verification | Apib7-x98H0j5cPqHWwSMm6dNU4GmODRoqxLiDzdx9I |
| octolytics-url | https://collector.github.com/github/collect |
| analytics-location | // |
| fb:app_id | 1401488693436528 |
| apple-itunes-app | app-id=1477376905, app-argument=https://github.com/SANGSEOSEO/algorithm-interview |
| twitter:image | https://opengraph.githubassets.com/07bcc1ee050ad30f2287c7832e4707ae3c8cca6c10b81f69203f0ab555399697/SANGSEOSEO/algorithm-interview |
| twitter:card | summary_large_image |
| og:image | https://opengraph.githubassets.com/07bcc1ee050ad30f2287c7832e4707ae3c8cca6c10b81f69203f0ab555399697/SANGSEOSEO/algorithm-interview |
| og:image:alt | <파이썬 알고리즘 인터뷰> 95가지 알고리즘 문제 풀이로 완성하는 코딩 테스트. Contribute to SANGSEOSEO/algorithm-interview development by creating an account on GitHub. |
| og:image:width | 1200 |
| og:image:height | 600 |
| og:site_name | GitHub |
| og:type | object |
| hostname | github.com |
| expected-hostname | github.com |
| None | 87e774ee7c6b3bee0490394e4d3e57ec9dbc956f74b87ea685dc8996c1676456 |
| turbo-cache-control | no-cache |
| go-import | github.com/SANGSEOSEO/algorithm-interview git https://github.com/SANGSEOSEO/algorithm-interview.git |
| octolytics-dimension-user_id | 70785000 |
| octolytics-dimension-user_login | SANGSEOSEO |
| octolytics-dimension-repository_id | 312512419 |
| octolytics-dimension-repository_nwo | SANGSEOSEO/algorithm-interview |
| octolytics-dimension-repository_public | true |
| octolytics-dimension-repository_is_fork | true |
| octolytics-dimension-repository_parent_id | 267825745 |
| octolytics-dimension-repository_parent_nwo | onlybooks/python-algorithm-interview |
| octolytics-dimension-repository_network_root_id | 267825745 |
| octolytics-dimension-repository_network_root_nwo | onlybooks/python-algorithm-interview |
| turbo-body-classes | logged-out env-production page-responsive |
| disable-turbo | false |
| browser-stats-url | https://api.github.com/_private/browser/stats |
| browser-errors-url | https://api.github.com/_private/browser/errors |
| release | 423dbb54c5e7bfecc838eb387c1435eb3d0e760d |
| ui-target | full |
| theme-color | #1e2327 |
| color-scheme | light dark |
| Skip to content | https://github.com/SANGSEOSEO/algorithm-interview#start-of-content |
| https://github.com/ |
| Sign in | https://github.com/login?return_to=https%3A%2F%2Fgithub.com%2FSANGSEOSEO%2Falgorithm-interview |
| GitHubRepository hosting, code review, and collaboration | https://github.com/platform |
| CopilotAI coding agent for tasks, projects, and automated work | https://github.com/features/copilot |
| ActionsCI/CD and automation | https://github.com/features/actions |
| Code QualityQuality analysis, fixes, and enforcement | https://github.com/features/code-quality |
| CodespacesCloud development environments | https://github.com/features/codespaces |
| Code SecurityVulnerability detection and remediation | https://github.com/security/advanced-security/code-security |
| Secret ProtectionSecret scanning and leak prevention | https://github.com/security/advanced-security/secret-protection |
| All Features | https://github.com/features |
| Documentation | https://docs.github.com/en |
| Training | https://learn.github.com/skills |
| Certifications | https://learn.github.com/credentials |
| Build with Copilot | https://github.com/features/ai |
| Customize Copilot | https://docs.github.com/en/copilot/how-tos/copilot-on-github/customize-copilot/customize-copilot-overview |
| Integrations | https://github.com/marketplace |
| Trending repos | https://github.com/trending |
| GitHub Sponsors | https://github.com/open-source/sponsors |
| Developer articles | https://github.com/resources/articles |
| ChangelogYour source for the latest features, improvements, and fixes across GitHub products, all in one place. | https://github.blog/changelog/ |
| Enterprises | https://github.com/enterprise |
| Team | https://github.com/team |
| Startups | https://github.com/enterprise/startups |
| Nonprofits | https://github.com/solutions/industry/nonprofits |
| Healthcare | https://github.com/solutions/industry/healthcare |
| Financial services | https://github.com/solutions/industry/financial-services |
| Manufacturing | https://github.com/solutions/industry/manufacturing |
| Government | https://github.com/solutions/industry/government |
| See all industries | https://github.com/solutions/industry |
| Why GitHub | https://github.com/why-github |
| Customer Stories | https://github.com/customer-stories |
| Business insights | https://github.com/solutions/executive-insights |
| Trust Center | https://github.com/trust-center |
| GitHub Advanced SecurityEnterprise-grade code security | https://github.com/security/advanced-security |
| Copilot for businessEnterprise-grade AI features | https://github.com/features/copilot/copilot-business |
| Premium SupportEnterprise-grade 24/7 support | https://github.com/enterprise/premium-support |
| Documentation | https://docs.github.com/en |
| Resource center | https://github.com/resources |
| Blog | https://github.blog/ |
| Events & webinars | https://github.com/resources/events |
| Community Forum | https://github.com/orgs/community/discussions |
| Customer Stories | https://github.com/customer-stories |
| Integrations | https://github.com/marketplace |
| Customer support | https://help.github.com/ |
| Training | https://learn.github.com/skills |
| GitHub Status | https://www.githubstatus.com/ |
| About | https://github.com/about |
| Partners | https://github.com/partners |
| Changelog | https://github.blog/changelog/ |
| GitHub UniverseThe event for developers, by developers — talks, workshops, and what’s next for GitHub. | https://githubuniverse.com/ |
| Pricing | https://github.com/pricing |
| Sign in | https://github.com/login?return_to=https%3A%2F%2Fgithub.com%2FSANGSEOSEO%2Falgorithm-interview |
| Sign up | https://github.com/signup?ref_cta=Sign+up&ref_loc=header+logged+out&ref_page=%2F%3Cuser-name%3E%2F%3Crepo-name%3E&source=header-repo&source_repo=SANGSEOSEO%2Falgorithm-interview |
| Reload | https://github.com/SANGSEOSEO/algorithm-interview |
| Reload | https://github.com/SANGSEOSEO/algorithm-interview |
| Reload | https://github.com/SANGSEOSEO/algorithm-interview |
| SANGSEOSEO | https://github.com/SANGSEOSEO |
| algorithm-interview | https://github.com/SANGSEOSEO/algorithm-interview |
| Code | https://github.com/SANGSEOSEO/algorithm-interview |
| Pull requests | https://github.com/SANGSEOSEO/algorithm-interview/pulls |
| Actions | https://github.com/SANGSEOSEO/algorithm-interview/actions |
| Projects | https://github.com/SANGSEOSEO/algorithm-interview/projects |
| Security and quality | https://github.com/SANGSEOSEO/algorithm-interview/security |
| Insights | https://github.com/SANGSEOSEO/algorithm-interview/pulse |
| https://github.com/SANGSEOSEO/algorithm-interview |
| algorithm-interview | https://github.com/SANGSEOSEO/algorithm-interview |
| onlybooks/python-algorithm-interview | https://github.com/onlybooks/python-algorithm-interview |
| Notifications | https://github.com/login?return_to=%2FSANGSEOSEO%2Falgorithm-interview |
| Fork0 (0) | https://github.com/login?return_to=%2FSANGSEOSEO%2Falgorithm-interview |
| Star0 (0) | https://github.com/login?return_to=%2FSANGSEOSEO%2Falgorithm-interview |
| Readme | https://github.com/SANGSEOSEO/algorithm-interview#readme-ov-file |
| Activity | https://github.com/SANGSEOSEO/algorithm-interview/activity |
| 0 forks | https://github.com/SANGSEOSEO/algorithm-interview/forks |
| Report repository | https://github.com/contact/report-content?content_url=https%3A%2F%2Fgithub.com%2FSANGSEOSEO%2Falgorithm-interview&report=SANGSEOSEO+%28user%29 |
| Branches | https://github.com/SANGSEOSEO/algorithm-interview/branches |
| Tags | https://github.com/SANGSEOSEO/algorithm-interview/tags |
| https://github.com/SANGSEOSEO/algorithm-interview/branches |
| https://github.com/SANGSEOSEO/algorithm-interview/tags |
| 28 Commits | https://github.com/SANGSEOSEO/algorithm-interview/commits/master/ |
| https://github.com/SANGSEOSEO/algorithm-interview/commits/master/ |
| 2-python/ch06 | https://github.com/SANGSEOSEO/algorithm-interview/tree/master/2-python/ch06 |
| 2-python/ch06 | https://github.com/SANGSEOSEO/algorithm-interview/tree/master/2-python/ch06 |
| 3-linear-data-structures | https://github.com/SANGSEOSEO/algorithm-interview/tree/master/3-linear-data-structures |
| 3-linear-data-structures | https://github.com/SANGSEOSEO/algorithm-interview/tree/master/3-linear-data-structures |
| 4-non-linear-data-structures | https://github.com/SANGSEOSEO/algorithm-interview/tree/master/4-non-linear-data-structures |
| 4-non-linear-data-structures | https://github.com/SANGSEOSEO/algorithm-interview/tree/master/4-non-linear-data-structures |
| 5-algorithms | https://github.com/SANGSEOSEO/algorithm-interview/tree/master/5-algorithms |
| 5-algorithms | https://github.com/SANGSEOSEO/algorithm-interview/tree/master/5-algorithms |
| appendix-B | https://github.com/SANGSEOSEO/algorithm-interview/tree/master/appendix-B |
| appendix-B | https://github.com/SANGSEOSEO/algorithm-interview/tree/master/appendix-B |
| miscellaneous | https://github.com/SANGSEOSEO/algorithm-interview/tree/master/miscellaneous |
| miscellaneous | https://github.com/SANGSEOSEO/algorithm-interview/tree/master/miscellaneous |
| .gitignore | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/.gitignore |
| .gitignore | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/.gitignore |
| README.md | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/README.md |
| README.md | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/README.md |
| README | https://github.com/SANGSEOSEO/algorithm-interview |
| https://github.com/SANGSEOSEO/algorithm-interview#파이썬-알고리즘-인터뷰 |
| https://camo.githubusercontent.com/207911acd1305c887c81121d624f3766ca468b0f777855d7f036726f8e43df24/687474703a2f2f646f63732e6c696b656a617a7a2e636f6d2f696d616765732f323032302f626f6f6b2d636f7665722e6a7067 |
| 교보문고 | https://bit.ly/3feaYxi |
| YES24 | https://bit.ly/3iGw8Gw |
| 알라딘 | http://aladin.kr/p/2fU2N |
| 인터파크 | https://bit.ly/3f9SyOg |
| https://www.onlybook.co.kr/entry/algorithm-interview-errata | https://www.onlybook.co.kr/entry/algorithm-interview-errata |
| https://www.onlybook.co.kr/entry/algorithm-interview | https://www.onlybook.co.kr/entry/algorithm-interview |
| https://www.youtube.com/watch?v=fNyGHpSWhTA | https://www.youtube.com/watch?v=fNyGHpSWhTA |
| https://user-images.githubusercontent.com/1250095/86745916-a62e9a00-c075-11ea-9aa5-8455e2527f87.png |
| 유효한 팰린드롬 | https://leetcode.com/problems/valid-palindrome/ |
| 1-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/2-python/ch06/1-1.py |
| 1-2.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/2-python/ch06/1-2.py |
| 1-3.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/2-python/ch06/1-3.py |
| 1-4.c | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/2-python/ch06/1-4.c |
| 문자열 뒤집기 | https://leetcode.com/problems/reverse-string/ |
| 2-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/2-python/ch06/2-1.py |
| 2-2.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/2-python/ch06/2-2.py |
| 로그 파일 재정렬 | https://leetcode.com/problems/reorder-data-in-log-files/ |
| 3-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/2-python/ch06/3-1.py |
| 가장 흔한 단어 | https://leetcode.com/problems/most-common-word/ |
| 4-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/2-python/ch06/4-1.py |
| 그룹 애너그램 | https://leetcode.com/problems/group-anagrams/ |
| 5-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/2-python/ch06/5-1.py |
| 가장 긴 팰린드롬 부분 문자열 | https://leetcode.com/problems/longest-palindromic-substring/ |
| 6-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/2-python/ch06/6-1.py |
| 두 수의 합 | https://leetcode.com/problems/two-sum/ |
| 7-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch07/7-1.py |
| 7-2.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch07/7-2.py |
| 7-3.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch07/7-3.py |
| 7-4.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch07/7-4.py |
| 7-5.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch07/7-5.py |
| 7-6.go | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch07/7-6.go |
| 빗물 트래핑 | https://leetcode.com/problems/trapping-rain-water/ |
| 8-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch07/8-1.py |
| 8-2.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch07/8-2.py |
| 세 수의 합 | https://leetcode.com/problems/3sum/ |
| 9-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch07/9-1.py |
| 9-2.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch07/9-2.py |
| 배열 파티션 I | https://leetcode.com/problems/array-partition-i/ |
| 10-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch07/10-1.py |
| 10-2.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch07/10-2.py |
| 10-3.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch07/10-3.py |
| 자신을 제외한 배열의 곱 | https://leetcode.com/problems/product-of-array-except-self/ |
| 11-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch07/11-1.py |
| 주식을 사고팔기 가장 좋은 시점 | https://leetcode.com/problems/best-time-to-buy-and-sell-stock/ |
| 12-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch07/12-1.py |
| 12-2.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch07/12-2.py |
| 팰린드롬 연결 리스트 | https://leetcode.com/problems/palindrome-linked-list/ |
| 13-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch08/13-1.py |
| 13-2.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch08/13-2.py |
| 13-3.go | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch08/13-3.go |
| 13-4.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch08/13-4.py |
| 두 정렬 리스트의 병합 | https://leetcode.com/problems/merge-two-sorted-lists/ |
| 14-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch08/14-1.py |
| 역순 연결 리스트 | https://leetcode.com/problems/reverse-linked-list/ |
| 15-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch08/15-1.py |
| 15-2.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch08/15-2.py |
| 두 수의 덧셈 | https://leetcode.com/problems/add-two-numbers/ |
| 16-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch08/16-1.py |
| 16-2.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch08/16-2.py |
| 페어의 노드 스왑 | https://leetcode.com/problems/swap-nodes-in-pairs/ |
| 17-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch08/17-1.py |
| 17-2.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch08/17-2.py |
| 17-3.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch08/17-3.py |
| 홀짝 연결 리스트 | https://leetcode.com/problems/odd-even-linked-list/ |
| 18-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch08/18-1.py |
| 역순 연결 리스트 II | https://leetcode.com/problems/reverse-linked-list-ii/ |
| 19-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch08/19-1.py |
| 유효한 괄호 | https://leetcode.com/problems/valid-parentheses/ |
| 20-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch09/20-1.py |
| 중복 문자 제거 | https://leetcode.com/problems/remove-duplicate-letters/ |
| 21-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch09/21-1.py |
| 21-2.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch09/21-2.py |
| 일일 온도 | https://leetcode.com/problems/daily-temperatures/ |
| 22-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch09/22-1.py |
| 큐를 이용한 스택 구현 | https://leetcode.com/problems/implement-stack-using-queues/ |
| 23-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch09/23-1.py |
| 스택을 이용한 큐 구현 | https://leetcode.com/problems/implement-queue-using-stacks/ |
| 24-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch09/24-1.py |
| 원형 큐 디자인 | https://leetcode.com/problems/design-circular-queue/ |
| 25-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch09/25-1.py |
| 원형 데크 디자인 | https://leetcode.com/problems/design-circular-deque/ |
| 26-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch10/26-1.py |
| k개 정렬 리스트 병합 | https://leetcode.com/problems/merge-k-sorted-lists/ |
| 27-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch10/27-1.py |
| 해시맵 디자인 | https://leetcode.com/problems/design-hashmap/ |
| 28-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch11/28-1.py |
| 보석과 돌 | https://leetcode.com/problems/jewels-and-stones/ |
| 29-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch11/29-1.py |
| 29-2.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch11/29-2.py |
| 29-3.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch11/29-3.py |
| 29-4.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch11/29-4.py |
| 중복 문자 없는 가장 긴 부분 문자열 | https://leetcode.com/problems/longest-substring-without-repeating-characters/ |
| 30-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch11/30-1.py |
| 상위 K 빈도 요소 | https://leetcode.com/problems/top-k-frequent-elements/ |
| 31-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch11/31-1.py |
| 31-2.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/3-linear-data-structures/ch11/31-2.py |
| 섬의 개수 | https://leetcode.com/problems/number-of-islands/ |
| 32-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch12/32-1.py |
| 전화 번호 문자 조합 | https://leetcode.com/problems/letter-combinations-of-a-phone-number/ |
| 33-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch12/33-1.py |
| 순열 | https://leetcode.com/problems/permutations/ |
| 34-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch12/34-1.py |
| 34-2.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch12/34-2.py |
| 조합 | https://leetcode.com/problems/combinations/ |
| 35-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch12/35-1.py |
| 35-2.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch12/35-2.py |
| 조합의 합 | https://leetcode.com/problems/combination-sum/ |
| 36-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch12/36-1.py |
| 부분 집합 | https://leetcode.com/problems/subsets/ |
| 37-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch12/37-1.py |
| 일정 재구성 | https://leetcode.com/problems/reconstruct-itinerary/ |
| 38-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch12/38-1.py |
| 38-2.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch12/38-2.py |
| 38-3.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch12/38-3.py |
| 코스 스케줄 | https://leetcode.com/problems/course-schedule/ |
| 39-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch12/39-1.py |
| 39-2.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch12/39-2.py |
| 네트워크 딜레이 타임 | https://leetcode.com/problems/network-delay-time/ |
| 40-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch13/40-1.py |
| K 경유지 내 가장 저렴한 항공권 | https://leetcode.com/problems/cheapest-flights-within-k-stops/ |
| 41-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch13/41-1.py |
| 이진 트리의 최대 깊이 | https://leetcode.com/problems/maximum-depth-of-binary-tree/ |
| 42-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch14/42-1.py |
| 이진 트리의 직경 | https://leetcode.com/problems/diameter-of-binary-tree/ |
| 43-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch14/43-1.py |
| 가장 긴 동일 값의 경로 | https://leetcode.com/problems/longest-univalue-path/ |
| 44-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch14/44-1.py |
| 이진 트리 반전 | https://leetcode.com/problems/invert-binary-tree/ |
| 45-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch14/45-1.py |
| 45-2.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch14/45-2.py |
| 45-3.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch14/45-3.py |
| 45-4.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch14/45-4.py |
| 두 이진 트리 병합 | https://leetcode.com/problems/merge-two-binary-trees/ |
| 46-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch14/46-1.py |
| 이진 트리 직렬화 & 역직렬화 | https://leetcode.com/problems/serialize-and-deserialize-binary-tree/ |
| 47-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch14/47-1.py |
| 균형 이진 트리 | https://leetcode.com/problems/balanced-binary-tree/ |
| 48-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch14/48-1.py |
| 최소 높이 트리 | https://leetcode.com/problems/minimum-height-trees/ |
| 49-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch14/49-1.py |
| 정렬된 배열의 이진 탐색 트리 변환 | https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/ |
| 50-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch14/50-1.py |
| 이진 탐색 트리(BST)를 더 큰 수 합계 트리로 | https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/ |
| 51-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch14/51-1.py |
| 이진 탐색 트리(BST) 합의 범위 | https://leetcode.com/problems/range-sum-of-bst/ |
| 52-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch14/52-1.py |
| 52-2.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch14/52-2.py |
| 52-3.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch14/52-3.py |
| 52-4.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch14/52-4.py |
| 이진 탐색 트리(BST) 노드 간 최소 거리 | https://leetcode.com/problems/minimum-distance-between-bst-nodes/ |
| 53-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch14/53-1.py |
| 53-2.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch14/53-2.py |
| 전위, 중위 순회 결과로 이진 트리 구축 | https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/ |
| 54-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch14/54-1.py |
| 배열의 K번째 큰 요소 | https://leetcode.com/problems/kth-largest-element-in-an-array/ |
| 55-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch15/55-1.py |
| 55-2.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch15/55-2.py |
| 55-3.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch15/55-3.py |
| 55-4.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch15/55-4.py |
| 트라이 구현 | https://leetcode.com/problems/implement-trie-prefix-tree/ |
| 56-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch16/56-1.py |
| 팰린드롬 페어 | https://leetcode.com/problems/palindrome-pairs/ |
| 57-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch16/57-1.py |
| 57-2.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/4-non-linear-data-structures/ch16/57-2.py |
| 리스트 정렬 | https://leetcode.com/problems/sort-list/ |
| 58-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch17/58-1.py |
| 58-3.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch17/58-3.py |
| 구간 병합 | https://leetcode.com/problems/merge-intervals/ |
| 59-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch17/59-1.py |
| 삽입 정렬 리스트 | https://leetcode.com/problems/insertion-sort-list/ |
| 60-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch17/60-1.py |
| 60-2.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch17/60-2.py |
| 가장 큰 수 | https://leetcode.com/problems/largest-number/ |
| 61-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch17/61-1.py |
| 유효한 애너그램 | https://leetcode.com/problems/valid-anagram/ |
| 62-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch17/62-1.py |
| 색 정렬 | https://leetcode.com/problems/sort-colors/ |
| 63-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch17/63-1.py |
| 원점에 K번째 가까운 점 | https://leetcode.com/problems/k-closest-points-to-origin/ |
| 64-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch17/64-1.py |
| 이진 검색 | https://leetcode.com/problems/binary-search/ |
| 65-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch18/65-1.py |
| 65-2.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch18/65-2.py |
| 65-3.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch18/65-3.py |
| 65-4.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch18/65-4.py |
| 회전 정렬된 배열 검색 | https://leetcode.com/problems/search-in-rotated-sorted-array/ |
| 66-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch18/66-1.py |
| 두 배열의 교집합 | https://leetcode.com/problems/intersection-of-two-arrays/ |
| 67-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch18/67-1.py |
| 67-2.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch18/67-2.py |
| 67-3.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch18/67-3.py |
| 두 수의 합 II | https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/ |
| 68-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch18/68-1.py |
| 68-2.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch18/68-2.py |
| 68-3.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch18/68-3.py |
| 68-4.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch18/68-4.py |
| 68-5.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch18/68-5.py |
| 2D 행렬 검색 II | https://leetcode.com/problems/search-a-2d-matrix-ii/ |
| 69-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch18/69-1.py |
| 69-2.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch18/69-2.py |
| 싱글 넘버 | https://leetcode.com/problems/single-number/ |
| 70-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch19/70-1.py |
| 해밍 거리 | https://leetcode.com/problems/hamming-distance/ |
| 71-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch19/71-1.py |
| 두 정수의 합 | https://leetcode.com/problems/sum-of-two-integers/ |
| 72-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch19/72-1.py |
| 72-2.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch19/72-2.py |
| UTF-8 검증 | https://leetcode.com/problems/utf-8-validation/ |
| 73-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch19/73-1.py |
| 1비트의 개수 | https://leetcode.com/problems/number-of-1-bits/ |
| 74-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch19/74-1.py |
| 74-2.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch19/74-2.py |
| 최대 슬라이딩 윈도우 | https://leetcode.com/problems/sliding-window-maximum/ |
| 75-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch20/75-1.py |
| 75-2.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch20/75-2.py |
| 부분 문자열이 포함된 최소 윈도우 | https://leetcode.com/problems/minimum-window-substring/ |
| 76-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch20/76-1.py |
| 76-2.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch20/76-2.py |
| 76-3.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch20/76-3.py |
| 가장 긴 반복 문자 대체 | https://leetcode.com/problems/longest-repeating-character-replacement/ |
| 77-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch20/77-1.py |
| 주식을 사고 팔기 가장 좋은 시점 II | https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/ |
| 78-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch21/78-1.py |
| 78-2.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch21/78-2.py |
| 키에 따른 대기열 재구성 | https://leetcode.com/problems/queue-reconstruction-by-height/ |
| 79-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch21/79-1.py |
| 태스크 스케줄러 | https://leetcode.com/problems/task-scheduler/ |
| 80-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch21/80-1.py |
| 주유소 | https://leetcode.com/problems/gas-station/ |
| 81-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch21/81-1.py |
| 81-2.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch21/81-2.py |
| 쿠키 부여 | https://leetcode.com/problems/assign-cookies/ |
| 82-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch21/82-1.py |
| 82-2.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch21/82-2.py |
| 과반수 엘리먼트 | https://leetcode.com/problems/majority-element/ |
| 83-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch22/83-1.py |
| 83-2.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch22/83-2.py |
| 83-3.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch22/83-3.py |
| 83-4.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch22/83-4.py |
| 괄호를 삽입하는 여러가지 방법 | https://leetcode.com/problems/different-ways-to-add-parentheses/ |
| 84-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch22/84-1.py |
| 피보나치 수 | https://leetcode.com/problems/fibonacci-number/ |
| 85-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch23/85-1.py |
| 85-2.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch23/85-2.py |
| 85-3.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch23/85-3.py |
| 85-4.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch23/85-4.py |
| 최대 서브 배열 | https://leetcode.com/problems/maximum-subarray/ |
| 86-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch23/86-1.py |
| 86-2.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch23/86-2.py |
| 계단 오르기 | https://leetcode.com/problems/climbing-stairs/ |
| 87-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch23/87-1.py |
| 87-2.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch23/87-2.py |
| 집 도둑 | https://leetcode.com/problems/house-robber/ |
| 88-1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch23/88-1.py |
| 88-2.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/5-algorithms/ch23/88-2.py |
| 비밀 지도 | https://programmers.co.kr/learn/courses/30/lessons/17681 |
| 1.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/appendix-B/1.py |
| 다트 게임 | https://programmers.co.kr/learn/courses/30/lessons/17682 |
| 2.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/appendix-B/2.py |
| 캐시 | https://programmers.co.kr/learn/courses/30/lessons/17680 |
| 3.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/appendix-B/3.py |
| 셔틀버스 | https://programmers.co.kr/learn/courses/30/lessons/17678 |
| 4.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/appendix-B/4.py |
| 뉴스 클러스터링 | https://programmers.co.kr/learn/courses/30/lessons/17677 |
| 5.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/appendix-B/5.py |
| 프렌즈4블록 | https://programmers.co.kr/learn/courses/30/lessons/17679 |
| 6.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/appendix-B/6.py |
| 추석 트래픽 | https://programmers.co.kr/learn/courses/30/lessons/17676 |
| 7.py | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/appendix-B/7.py |
| https://github.com/SANGSEOSEO/algorithm-interview#기타-코드 |
| 계산 속도 비교 | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/miscellaneous/4-performance.py |
| 스택 | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/miscellaneous/9-stack.py |
| 생일 문제 | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/miscellaneous/11-birthday.py |
| 그래프 순회 | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/miscellaneous/12-graph-traversals.py |
| 트리 순회 | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/miscellaneous/14-tree-traversals.py |
| 이진 힙 | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/miscellaneous/15-binary-heap.py |
| 버블 정렬 | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/miscellaneous/17-bubble-sort.py |
| 퀵 정렬 | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/miscellaneous/17-quick-sort.py |
| 분할 가능 배낭 문제 | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/miscellaneous/21-fractional-knapsack.py |
| 0-1 배낭 문제 | https://github.com/SANGSEOSEO/algorithm-interview/blob/master/miscellaneous/23-zero-one-knapsack.py |
| Readme | https://github.com/SANGSEOSEO/algorithm-interview#readme-ov-file |
| Activity | https://github.com/SANGSEOSEO/algorithm-interview/activity |
| 0 forks | https://github.com/SANGSEOSEO/algorithm-interview/forks |
| Report repository | https://github.com/contact/report-content?content_url=https%3A%2F%2Fgithub.com%2FSANGSEOSEO%2Falgorithm-interview&report=SANGSEOSEO+%28user%29 |
|
| https://github.com |
| Terms | https://docs.github.com/site-policy/github-terms/github-terms-of-service |
| Privacy | https://docs.github.com/site-policy/privacy-policies/github-privacy-statement |
| Security | https://github.com/security |
| Status | https://www.githubstatus.com/ |
| Community | https://github.community/ |
| Docs | https://docs.github.com/ |
| Contact | https://support.github.com?tags=dotcom-footer |