{"id":22038772,"url":"https://github.com/connieya/python_algothm","last_synced_at":"2025-03-23T12:45:50.263Z","repository":{"id":63093652,"uuid":"476624869","full_name":"connieya/python_algothm","owner":"connieya","description":"Python Algorithm Source Code Storage","archived":false,"fork":false,"pushed_at":"2024-03-24T00:00:58.000Z","size":1248,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-01-28T19:16:02.994Z","etag":null,"topics":["algorithm","ps","python"],"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/connieya.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":"2022-04-01T07:50:18.000Z","updated_at":"2023-12-10T08:00:14.000Z","dependencies_parsed_at":"2023-10-15T04:04:15.790Z","dependency_job_id":"5e7f4011-bcd5-41f1-af53-39ba1fe169a1","html_url":"https://github.com/connieya/python_algothm","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/connieya%2Fpython_algothm","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/connieya%2Fpython_algothm/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/connieya%2Fpython_algothm/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/connieya%2Fpython_algothm/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/connieya","download_url":"https://codeload.github.com/connieya/python_algothm/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245104460,"owners_count":20561377,"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","ps","python"],"created_at":"2024-11-30T11:07:58.995Z","updated_at":"2025-03-23T12:45:50.168Z","avatar_url":"https://github.com/connieya.png","language":"Python","readme":"# Python algorithm\n\n## ✨ BOJ\n\n| 번호 | 문제 이름 | 난이도 | 코멘트 | 코드 |\n|:------|:------------------------------------------------------------------:|:--------:|:--------------------------------------------------------:|:------|\n| 1000 | [A+B](https://www.acmicpc.net/problem/1000) | 🥉 브론즈 5 | sum() , map() |[코드](baekjoon/bronze5/1000.md)\n| 1001 | [A-B](https://www.acmicpc.net/problem/1001) | 🥉 브론즈 5 | 사칙연산 , 출력 |[코드](baekjoon/bronze5/1001.md)\n| 1008 | [A/B](https://www.acmicpc.net/problem/1008) | 🥉 브론즈 5 | 나누기 연산 |[코드](baekjoon/bronze5/1008.md)\n| 1037 | [약수](https://www.acmicpc.net/problem/1037) | 🥉 브론즈 1 | 수학 |[코드](baekjoon/bronze1/1037.md)\n| 1049 | [기타줄](https://www.acmicpc.net/problem/1049) | 🥈 실버 4 | 조건 분기 , 구현 , 수학 |[코드](baekjoon/silver4/1049.md)\n| 1107 | [리모컨](https://www.acmicpc.net/problem/1107) | 🥇 골드 5 | 브루트포스 |[코드](baekjoon/gold5/1107.md)\n| 1110 | [더하기 사이클](https://www.acmicpc.net/problem/1110) | 🥉 브론즈 1 | 수학,구현 |[코드](baekjoon/bronze1/1110.md)\n| 1138 | [한 줄로 서기](https://www.acmicpc.net/problem/1138) | 🥈 실버 2 | insert |[코드](baekjoon/silver2/1138.md)\n| 1157 | [단어 공부](https://www.acmicpc.net/problem/1157) | 🥉 브론즈 1 | upper() , map(chr ,range(65,91 ) |[코드](baekjoon/bronze1/1157.md)\n| 1182 | [부분집합의 합](https://www.acmicpc.net/problem/1182) | 🥈 실버 2 | 비트마스킹 |[코드](baekjoon/silver2/1182.md)\n| 1183 | [약속](https://www.acmicpc.net/problem/1183) | 🥈 실버 2 | 수학, 정렬 |[코드](baekjoon/silver2/1183.md)\n| 1197 | [최소스패닝트리](https://www.acmicpc.net/problem/1197) |🥇 골드 4 | 최소 신장 트리, 크루스칼 알고리즘 |[코드](solved/gold4/1197.py)\n| 1264 | [모음의 개수](https://www.acmicpc.net/problem/1264) | 🥉 브론즈 4 | input() |[코드](baekjoon/bronze4/1264.md)\n| 1283 | [단축키 지정](https://www.acmicpc.net/problem/1283) | 🥈 실버 2 | 구현 , lower() |[코드](baekjoon/silver2/1283.md)\n| 1439 | [뒤집기](https://www.acmicpc.net/problem/1439) | 🥈 실버 5 | 구현 |[코드](baekjoon/silver5/1439.md)\n| 1448 | [삼각형 만들기](https://www.acmicpc.net/problem/1448) | 🥈 실버 3 | 구현 ,삼각형 조건 , 그리디 |[코드](baekjoon/silver3/1448.md)\n| 1476 | [날짜 계산](https://www.acmicpc.net/problem/1476) | 🥈 실버 5 | 브루트포스 |[코드](baekjoon/silver5/1476.md)\n| 1515 | [수 이어 쓰기](https://www.acmicpc.net/problem/1515) | 🥈 실버 3 | 브루트포스 , 구현 |[코드](baekjoon/silver3/1515.md)\n| 1543 | [문서 검색](https://www.acmicpc.net/problem/1543) | 🥈 실버 4 | 정규 표현식 |[코드](baekjoon/silver4/1543.md)\n| 1551 | [수열의 변화](https://www.acmicpc.net/problem/1551) | 🥉 브론즈 1 | 구현 |[코드](baekjoon/bronze1/1551.md)\n| 1614 | [영식이의 손가락](https://www.acmicpc.net/problem/1614) | 🥈 실버 3 | 수학, 구현 |[코드](baekjoon/silver3/1614.md)\n| 1652 | [누울 자리를 찾아라](https://www.acmicpc.net/problem/1652) | 🥈 실버 5 | copy.deepcopy , 구현 |[코드](baekjoon/silver5/1652.md)\n| 1672 | [DNA 해독](https://www.acmicpc.net/problem/1672) | 🥉 브론즈 1 | 구현, dict |[코드](baekjoon/bronze1/1672.md)\n| 1717 | [집합](https://www.acmicpc.net/problem/1717) | 🥇 골드 5 | 서로소 , 유니온 파인드 |[코드](solved/gold5/1717.py)\n| 1748 | [수 이어 쓰기1](https://www.acmicpc.net/problem/1748) | 🥈 실버 4 | 수학 , 구현 |[코드](baekjoon/silver4/1748.md)\n| 1753 | [최단경로](https://www.acmicpc.net/problem/1753) | 🥇 골드 4 | 다익스트라 |[코드](baekjoon/gold4/1753.md)\n| 1759 | [암호 만들기](https://www.acmicpc.net/problem/1759) | 🥇 골드 5 | 백트래킹 |[코드](baekjoon/gold5/1759.md)\n| 1813 | [논리학 교수](https://www.acmicpc.net/problem/1813) | 🥉 브론즈 1 | lookup 배열 , count |[코드](baekjoon/bronze1/1813.md)\n| 1816 | [암호 키](https://www.acmicpc.net/problem/1816) | 🥉 브론즈 1 | 에라토스테네스의 체 |[코드](baekjoon/bronze1/1816.md)\n| 1924 | [2007년](https://www.acmicpc.net/problem/1924) | 🥉 브론즈 1 | 날짜 계산 , 수학 , 구현 |[코드](baekjoon/bronze1/1924.md)\n| 1929 | [소수 구하기](https://www.acmicpc.net/problem/1929) | 🥈 실버 3 | 에라토스테네스의 체 |[코드](baekjoon/silver3/1929.md)\n| 1978 | [소수 찾기](https://www.acmicpc.net/problem/1978) | 🥈 실버 5 | 에라토스테네스의 체 |[코드](baekjoon/silver5/1978.md)\n| 2037 | [문자메시지](https://www.acmicpc.net/problem/2037) | 🥉 브론즈 1 | 구현 , dict ,2차원 배열 |[코드](baekjoon/bronze1/2037.md)\n| 2217 | [로프](https://www.acmicpc.net/problem/2217) | 🥈 실버 4 | 정렬 |[코드](baekjoon/silver4/2217.md)\n| 2252 | [줄 세우기](https://www.acmicpc.net/problem/2252) | 🥇 골드 3 | 위상 정렬 |[코드](solved/gold3/2252.py)\n| 2309 | [난쟁이](https://www.acmicpc.net/problem/2309) | 🥉 브론즈 1 | 조합 , 브루트포스 |[코드](baekjoon/bronze1/2309.md)\n| 2407 | [조합](https://www.acmicpc.net/problem/2407) | 🥈 실버 3 | DP , 파이썬만 가능한 풀이 |[코드](baekjoon/silver3/2407.md)\n| 2428 | [표절](https://www.acmicpc.net/problem/2428) | 🥈 실버 3 | lower bound ,구현 |[코드](baekjoon/silver3/2428.md)\n| 2437 | [저울](https://www.acmicpc.net/problem/2437) | 🥇 골드 2 | 그리디 ,정렬 |[코드](baekjoon/gold2/2437.md)\n| 2476 | [주사위 게임](https://www.acmicpc.net/problem/2476) | 🥉 브론즈 3 | 구현 |[코드](baekjoon/bronze3/2476.md)\n| 2557 | [Hello World](https://www.acmicpc.net/problem/2557) | 🥉 브론즈 5 | 출력 |[코드](baekjoon/bronze5/2557.md)\n| 2559 | [수열](https://www.acmicpc.net/problem/2559) | 🥈 실버 3 | 부분 합 , prefix sum |[코드](baekjoon/silver3/2559.md)\n| 2566 | [최댓값](https://www.acmicpc.net/problem/2566) | 🥉 브론즈 3 | 정수 입력 list로 받는 법 |[코드](baekjoon/bronze3/2566.md)\n| 2609 | [최대공약수와 최소공배수](https://www.acmicpc.net/problem/2609) | 🥉 브론즈 1 | 유클리드 호제법 |[코드](baekjoon/bronze1/2609.md)\n| 2739 | [구구단](https://www.acmicpc.net/pr\u003cbr/\u003eoblem/2739) | 🥉 브론즈 5 | 반복문, 문자열 포매팅 |[코드](baekjoon/bronze5/2739.md)\n| 2754 | [학점계산](https://www.acmicpc.net/problem/2754) | 🥉 브론즈 5 | 조건문 |[코드](baekjoon/bronze5/2754.md)\n| 2846 | [오르막길](https://www.acmicpc.net/problem/2846) | 🥉 브론즈 1 | 구현 |[코드](baekjoon/bronze1/2846.md)\n| 2857 | [FBI](https://www.acmicpc.net/problem/2857) | 🥉 브론즈 3 | split() , *(asterlisk) unpacking |[코드](baekjoon/bronze3/2857.md)\n| 2903 | [중앙 이동 알고리즘](https://www.acmicpc.net/problem/2903) | 🥉 브론즈 3 | 수학 ,반복문 |[코드](baekjoon/bronze3/2903.md)\n| 2992 | [크면서 작은 수](https://www.acmicpc.net/problem/2992) | 🥈 실버 3 | itertools permutation , join , 리스트 컴프리핸션 |[코드](baekjoon/silver3/2992.md)\n| 3003 | [킹,퀸,룩,비숍,나이트,폰](https://www.acmicpc.net/problem/3003) | 🥉 브론즈 5 | 사칙연산 ,구현 |[코드](baekjoon/bronze5/3003.md)\n| 3077 | [임진왜란](https://www.acmicpc.net/problem/3077) | 🥈 실버 3 | defaultdict , index , remove |[코드](baekjoon/silver3/3077.md)\n| 3085 | [사탕게임](https://www.acmicpc.net/problem/3085) | 🥈 실버 3 | 브루트포스 |[코드](baekjoon/silver3/3085.md)\n| 3474 | [교수가 된 현우](https://www.acmicpc.net/problem/3474) | 🥈 실버 3 | 수학 , 정수론 |[코드](baekjoon/silver3/3474.md)\n| 4101 | [크냐?](https://www.acmicpc.net/problem/4101) | 🥉 브론즈 5 | 사칙연산 ,입출력 |[코드](solved/bronze5/4101.py)\n| 4375 | [1](https://www.acmicpc.net/problem/4375) | 🥈 실버 3 | 브루트포스 |[코드](baekjoon/silver3/4375.md)\n| 5063 | [TGN](https://www.acmicpc.net/problem/5063) | 🥉 브론즈 3 | 사칙연산 ,조건문 |[코드](baekjoon/bronze3/5063.md)\n| 5717 | [상근이의 친구들](https://www.acmicpc.net/problem/5717) | 🥉 브론즈 4 | 사칙연산 ,수학 |[코드](solved/bronze4/5717.py)\n| 6588 | [골드바흐의 추측](https://www.acmicpc.net/problem/6588) | 🥈 실버 1 | 에라토스테네스의 체 |[코드](baekjoon/silver1/6588.md)\n| 8393 | [합](https://www.acmicpc.net/problem/8393) | 🥉 브론즈 5 | 반복문 |[코드](baekjoon/bronze5/8393.md)\n| 9095 | [1,2,3 더하기](https://www.acmicpc.net/problem/9095) | 🥈 실버 3 | 재귀 |[코드](baekjoon/silver3/9095.md)\n| 10102 | [개표](https://www.acmicpc.net/problem/10102) | 🥉 브론즈 3 | 반복문, 조건문 |[코드](solved/bronze3/10102.py)\n| 10156 | [과자](https://www.acmicpc.net/problem/10156) | 🥉 브론즈 4 | 사칙연산, 삼항연산자 |[코드](solved/bronze4/10156.py)\n| 10430 | [나머지](https://www.acmicpc.net/problem/10430) | 🥉 브론즈 5 | 수학, 사칙 연산 |[코드](solved/bronze5/10430.py)\n| 10768 | [특별한 날](https://www.acmicpc.net/problem/10768) | 🥉 브론즈 4 | 구현 |[코드](baekjoon/bronze4/10768.md)\n| 10807 | [개수 세기](https://www.acmicpc.net/problem/10807) | 🥉 브론즈 5 | 배열 , count() |[코드](baekjoon/bronze5/10807.md)\n| 10809 | [알파벳 찾기](https://www.acmicpc.net/problem/10809) | 🥉 브론즈 5 | 문자열 find() 함수 ,chr() 함수 |[코드](baekjoon/bronze5/10807.md)\n| 10810 | [공 넣기](https://www.acmicpc.net/problem/10810) | 🥉 브론즈 3 | join , List asterisk |[코드](baekjoon/bronze3/10810.md)\n| 10811 | [바구니 뒤집기](https://www.acmicpc.net/problem/10811) | 🥉 브론즈 2 | 슬라이스 인덱싱 , reverse ::-1 |[코드](baekjoon/bronze2/10811.md)\n| 10869 | [사칙연산](https://www.acmicpc.net/problem/10869) | 🥉 브론즈 5 | 사칙연산 |[코드](baekjoon/bronze5/10869.md)\n| 10926 | [??!](https://www.acmicpc.net/problem/10926) | 🥉 브론즈 5 | 구현 |[코드](baekjoon/bronze5/10926.md)\n| 10950 | [A+B-3](https://www.acmicpc.net/problem/10950) | 🥉 브론즈 5 | 반복문 , 덧셈 |[코드](baekjoon/bronze5/10950.md)\n| 11654 | [아스키 코드](https://www.acmicpc.net/problem/11654) | 🥉 브론즈 5 | 아스키 코드 , ord() |[코드](baekjoon/bronze5/11654.md)\n| 11663 | [선분 위의 점](https://www.acmicpc.net/problem/11663) | 🥈 실버 3 | lower bound , upper bound , bitsect_left , bitsect_right |[코드](baekjoon/silver3/11663.md)\n| 11720 | [숫자의 합](https://www.acmicpc.net/problem/11720) | 🥉 브론즈 4 | map() 함수 이해하기 |[코드](baekjoon/bronze5/11654.md)\n| 14425 | [문자열 집합](https://www.acmicpc.net/problem/14425) | 🥈 실버 3 | dict |[코드](baekjoon/silver3/14425.md)\n| 14499 | [주사위 굴리기](https://www.acmicpc.net/problem/14499) | 🥇 골드 4 | 시뮬레이션 |[코드](baekjoon/gold4/14499.md)\n| 14500 | [테트로미노](https://www.acmicpc.net/problem/14500) | 🥇 골드 4 | DFS, 브루트포스 |[코드](baekjoon/gold4/14500.md)\n| 14659 | [한조서열정리하고옴ㅋㅋ](https://www.acmicpc.net/problem/14659) | 🥉 브론즈 1 | 그리디 |[코드](baekjoon/bronze1/14659.md)\n| 14890 | [경사로](https://www.acmicpc.net/problem/14890) | 🥇 골드 3 | 시뮬레이션 ,구현 |[코드](baekjoon/gold3/14890.md)\n| 15649 | [N과M(1)](https://www.acmicpc.net/problem/15649) | 🥈 실버 3 | 백트래킹 |[코드](baekjoon/silver3/15649.md)\n| 16139 | [인간-컴퓨터 상호작용](https://www.acmicpc.net/problem/16139) | 🥈 실버 1 | 아스키 코드 ord , 부분 합 |[코드](baekjoon/silver1/16139.md)\n| 16917 | [양념 반 후라이드 반](https://www.acmicpc.net/problem/16917) | 🥉 브론즈 2 | 구현 , 조건문, 사칙연산 , min, max로 클린 코드 |[코드](baekjoon/bronze2/16917.md)\n| 16918 | [봄버맨](https://www.acmicpc.net/problem/16918) | 🥈 실버 1 | 구현 , 그래프이론 |[코드](baekjoon/silver1/16918.md)\n| 16922 | [로마 숫자 만들기](https://www.acmicpc.net/problem/16922) | 🥈 실버 2 | 백트래킹 , 브루트포스 |[코드](baekjoon/silver2/16922.md)\n| 16968 | [차량 번호판 1](https://www.acmicpc.net/problem/16968) | 🥉 브론즈 1 | 구현 ,수학 ,DFS |[코드](baekjoon/bronze1/16968.md)\n| 17425 | [약수의 합](https://www.acmicpc.net/problem/17425) | 🥇 골드 4 | 수학 , 에라토스테네스의 체 |[코드](baekjoon/gold4/17425.md)\n| 17427 | [약수의 합2](https://www.acmicpc.net/problem/17427) | 🥈 실버 2 | 수학,정수론 |[코드](baekjoon/silver2/17427.md)\n| 18108 | [1998년생인 내가 태국에서는 2541년생?!](https://www.acmicpc.net/problem/18108) | 🥉 브론즈 5 | 사칙연산 |[코드](baekjoon/bronze5/18108.md)\n| 19637 | [IF 문좀 대신 써줘](https://www.acmicpc.net/problem/19637) | 🥈 실버 3 | lower bound , bisect_left |[코드](baekjoon/silver3/19637.md)\n| 25304 | [영수증](https://www.acmicpc.net/problem/25304) | 🥉 브론즈 5 | 반복문, 삼항연산자 |[코드](baekjoon/bronze5/25304.md)\n\n## 👻 프로그래머스\n\n|레벨 | 문제 | 코멘트 | 코드 |\n |:------------------------------------------------------------------------------|:-----------------------------------------------------------------------------------|:-------------------------------------------------------|:---------------------------------------\n|Lv.0| [중복된 숫자 개수](https://programmers.co.kr/learn/courses/30/lessons/120583) | count 함수 | [코드](programmers/level00/중복된숫자개수.md) |\n|Lv.0| [머쓱이 보다 키 큰 사람](https://programmers.co.kr/learn/courses/30/lessons/120585) | for 문 or sort(reverse = True) , index | [코드](programmers/level00/머쓱이보다키큰사람.md) |\n|Lv.0| [두 수의 합](https://programmers.co.kr/learn/courses/30/lessons/120802) | 덧셈 연산 | [코드](programmers/level00/두수의합.md) |\n|Lv.0| [두 수의 곱](https://programmers.co.kr/learn/courses/30/lessons/120804) | 곱셈 연산 | [코드](programmers/level00/두수의곱.md) |\n|Lv.0| [몫 구하기](https://programmers.co.kr/learn/courses/30/lessons/120805) | 몫 연산 | [코드](programmers/level00/몫구하기.md) |\n|Lv.0| [두 수의 나눗셈](https://programmers.co.kr/learn/courses/30/lessons/120806) | 사칙 연산 | [코드](programmers/level00/두수의나눗셈.md) |\n|Lv.0| [숫자 비교하기](https://programmers.co.kr/learn/courses/30/lessons/120807) | 삼항 연산자 | [코드](programmers/level00/숫자비교하기.md) |\n|Lv.0| [분수의 덧셈](https://programmers.co.kr/learn/courses/30/lessons/120808) | 최대공약수 ,최소 공배수 , 유클리드 호제법 | [코드](programmers/level00/분수의덧셈.md) |\n|Lv.0| [로그인 성공?](https://programmers.co.kr/learn/courses/30/lessons/120883) | 파이썬 스러운 코드 , dict() , := | [코드](programmers/level00/로그인성공.md) |\n|Lv.0| [배열 두 배 만들기](https://programmers.co.kr/learn/courses/30/lessons/120809) | for 문 탐색 | [코드](programmers/level00/배열두배.md) |\n|Lv.0| [나머지 구하기](https://programmers.co.kr/learn/courses/30/lessons/120810) | 나머지 연산 | [코드](programmers/level00/나머지.md) |\n|Lv.0| [최빈값 구하기](https://programmers.co.kr/learn/courses/30/lessons/120812) | remove , set | [코드](programmers/level00/최빈값.md) |\n|Lv.0| [피자 나눠먹기 (1)](https://programmers.co.kr/learn/courses/30/lessons/120814) | 삼항 연산자 , ceil 쓰지 않고 수학적으로 접근 | [코드](programmers/level00/피자나눠먹기.md) |\n|Lv.0| [배열의 평균 값](https://programmers.co.kr/learn/courses/30/lessons/120817) | sum , len 함수 | [코드](programmers/level00/배열의평균값.md) |\n|Lv.0| [아이스 아메리카노](https://programmers.co.kr/learn/courses/30/lessons/120819) | 몫 ,나미저 연산 | [코드](programmers/level00/아이스아메리카노.md) |\n|Lv.0| [나이 출력](https://programmers.co.kr/learn/courses/30/lessons/120820) | 덧셈 연산 | [코드](programmers/level00/나이출력.md) |\n|Lv.0| [배열 뒤집기](https://programmers.co.kr/learn/courses/30/lessons/120821) | [::-1] ,list(reversed(str) , append \u0026 pop , .reverse() | [코드](programmers/level00/배열뒤집기.md) |\n|Lv.0| [문자열 뒤집기](https://programmers.co.kr/learn/courses/30/lessons/120822) | [::-1] , join(list(reversed(str)) | [코드](programmers/level00/문자열뒤집기.md) |\n|Lv.0| [짝수 홀수 개수](https://programmers.co.kr/learn/courses/30/lessons/120824) | 짝수 홀수 개수 | [코드](programmers/level00/짝수홀수.md) |\n|Lv.0| [특정 문자 제거하기](https://programmers.co.kr/learn/courses/30/lessons/120826) | replace | [코드](programmers/level00/특정문자제거하기.md) |\n|Lv.0| [각도기](https://programmers.co.kr/learn/courses/30/lessons/120829) | 조건문 | [코드](programmers/level00/각도기.md) |\n|Lv.0| [양꼬치](https://programmers.co.kr/learn/courses/30/lessons/120830) | 수학 | [코드](programmers/level00/양꼬치.md) |\n|Lv.0| [짝수의합](https://programmers.co.kr/learn/courses/30/lessons/120831) | for 문 , sum 함수 | [코드](programmers/level00/짝수의합.md) |\n|Lv.0| [순서쌍의 개수](https://programmers.co.kr/learn/courses/30/lessons/120836) | filter | [코드](programmers/level00/순서쌍의개수.md) |\n|Lv.0| [개미 군단](https://programmers.co.kr/learn/courses/30/lessons/120837) | divmod | [코드](programmers/level00/개미군단.md) |\n|Lv.0| [모스 부호(1)](https://programmers.co.kr/learn/courses/30/lessons/120838) | split | [코드](programmers/level00/모스부호.md) |\n|Lv.0| [가위 바위 보 ](https://programmers.co.kr/learn/courses/30/lessons/120839) | dictionary | [코드](programmers/level00/가위바위보.md) |\n|Lv.0| [점의 위치 구하기](https://programmers.co.kr/learn/courses/30/lessons/120841) | 조건문 | [코드](programmers/level00/점의위치.md) |\n|Lv.0| [컨트롤제트](https://programmers.co.kr/learn/courses/30/lessons/120853) | 구현 | [코드](programmers/level00/컨트롤제트.md) |\n|Lv.0| [직사각형 넓이 구하기 ](https://programmers.co.kr/learn/courses/30/lessons/120860) | 수학 | [코드](programmers/level00/직사각형넓이.md) |\n|Lv.0| [캐릭터의 좌표](https://programmers.co.kr/learn/courses/30/lessons/120861) | dict ,dx,dy | [코드](programmers/level00/캐릭터의좌표.md) |\n|Lv.0| [다항식 더하기](https://programmers.co.kr/learn/courses/30/lessons/120863) | 삼항 연산자 | [코드](programmers/level00/다항식.md) |\n|Lv.0| [숨어있는 숫자의 덧셈(2) ](https://programmers.co.kr/learn/courses/30/lessons/120864) | isdigit , split , join | [코드](programmers/level00/숨어있는숫자2.md) |\n|Lv.0| [안전지대](https://programmers.co.kr/learn/courses/30/lessons/120866) | 반복문 | [코드](programmers/level00/안전지대.md) |\n|Lv.0| [저주의 숫자 3 ](https://programmers.co.kr/learn/courses/30/lessons/120871) | str() | [코드](programmers/level00/저주의숫자3.md) |\n|Lv.0| [평행](https://programmers.co.kr/learn/courses/30/lessons/120875) | 직선의 기울기 , 반복문 | [코드](programmers/level00/평행.md) |\n|Lv.0| [겹치는 선분의 길이](https://programmers.co.kr/learn/courses/30/lessons/120876) | 겹치는 선 배열로 체크 | [코드](programmers/level00/겹치는선분의길이.md) |\n|Lv.0| [유한소수 판별하기](https://programmers.co.kr/learn/courses/30/lessons/120878) | 최대공약수, 소인수 | [코드](programmers/level00/유한소수판별.md) |\n|Lv.0| [구슬을 나누는 경우의 수](https://programmers.co.kr/learn/courses/30/lessons/120840) | DP , 조합 , math.comb | [코드](programmers/level00/구슬.md) |\n|Lv.0| [2차원으로 만들기](https://programmers.co.kr/learn/courses/30/lessons/120842) | 인덱싱 | [코드](programmers/level00/2차원으로만들기.md) |\n|Lv.0| [공 던지기](https://programmers.co.kr/learn/courses/30/lessons/12083) | 수학 | [코드](programmers/level00/공던지기.md) |\n|Lv.0| [특이한 정렬](https://programmers.co.kr/learn/courses/30/lessons/120880) | 람다 정렬 조건 2 | [코드](programmers/level00/특이한정렬.md) |\n|Lv.0| [등수 매기기](https://programmers.co.kr/learn/courses/30/lessons/120882) | sort ,dictionary | [코드](programmers/level00/등수매기기.md) |\n|Lv.0| [치킨 쿠폰](https://programmers.co.kr/learn/courses/30/lessons/120884) | 수학 ,divmod | [코드](programmers/level00/치킨쿠폰.md) |\n|Lv.0| [한 번만 등장한 문자 ](https://programmers.co.kr/learn/courses/30/lessons/120896) | Sorted , count , 파이썬 스러운 코드 | [코드](programmers/level00/한번만.md) |\n|Lv.0| [편지](https://programmers.co.kr/learn/courses/30/lessons/120898) | 문자열의 길이 | [코드](programmers/level00/편지.md) |\n|Lv.0| [가장 큰 수 찾기](https://programmers.co.kr/learn/courses/30/lessons/120899) | sorted , enumerate 활용 | [코드](programmers/level00/가장큰수.md) |\n|Lv.0| [문자열 계산하기](https://programmers.co.kr/learn/courses/30/lessons/120902) | eval | [코드](programmers/level00/문자열계산.md) |\n|Lv.0| [배열의 유사도 ](https://programmers.co.kr/learn/courses/30/lessons/120903) | list 컴프리핸션 | [코드](programmers/level00/배열의유사도.md) |\n|Lv.0| [n의 배수 구하기](https://programmers.co.kr/learn/courses/30/lessons/120905) | list , 조건문 | [코드](programmers/level00/배수고르기.md) |\n|Lv.0| [자릿수 더하기](https://programmers.co.kr/learn/courses/30/lessons/120906) | 나머지 연산 | [코드](programmers/level00/자릿수더하기.md) |\n|Lv.0| [OX퀴즈](https://programmers.co.kr/learn/courses/30/lessons/120907) | eval , split() | [코드](programmers/level00/OX퀴즈.md) |\n|Lv.0| [문자열 안에 문자열](https://programmers.co.kr/learn/courses/30/lessons/120908) | count , in , 삼항 연산자 | [코드](programmers/level00/문자열안에문자열.md) |\n|Lv.0| [제곱 수 판별하기](https://programmers.co.kr/learn/courses/30/lessons/120909) | math.sqrt | [코드](programmers/level00/제곱수판별.md) |\n|Lv.0| [7의 개수 ](https://programmers.co.kr/learn/courses/30/lessons/120912) | 구현 | [코드](programmers/level00/7의개수.md) |\n|Lv.0| [문자열 밀기 ](https://programmers.co.kr/learn/courses/30/lessons/120921) | 문자열 슬라이스 인덱싱 | [코드](programmers/level00/문자열밀기.md) |\n|Lv.0| [종이 자르기 ](https://programmers.co.kr/learn/courses/30/lessons/120922) | 수학 | [코드](programmers/level00/종이자르기.md) |\n|Lv.0| [연속된 수의 합 ](https://programmers.co.kr/learn/courses/30/lessons/120923) | 수학 | [코드](programmers/level00/연속된수의합.md) |\n|Lv.0| [다음에 올 숫자 ](https://programmers.co.kr/learn/courses/30/lessons/120924) | 구현 | [코드](programmers/level00/다음에올숫자.md) |\n|Lv.0| [옹알이(1)](https://programmers.co.kr/learn/courses/30/lessons/120956) | replace() , strip() | [코드](programmers/level00/옹알이.md) |\n|Lv.0| [전국 대회 선발 고사](https://programmers.co.kr/learn/courses/30/lessons/181851) | sorted , lambda | [코드](programmers/level00/전국대회선발고사.md) |\n|Lv.0| [뒤에서 5등 위로](https://programmers.co.kr/learn/courses/30/lessons/181852) | sorted() , 슬라이싱 연산 | [코드](programmers/level00/뒤에서5등위로.md) |\n|Lv.0| [A 강조하기](https://programmers.co.kr/learn/courses/30/lessons/181874) | lower() , replace | [코드](programmers/level00/A강조하기.md) |\n|Lv.0| [조건에 맞게 수열 변환하기 2](https://programmers.co.kr/learn/courses/30/lessons/181881) | 구현 | [코드](programmers/level00/수열변환2.md) |\n|Lv.1| [폰켓몬](https://programmers.co.kr/learn/courses/30/lessons/1845) | unordered_set | [코드](programmers/level01/폰켓몬.md) |\n|Lv.1| [가운데 글자 가져오기](https://programmers.co.kr/learn/courses/30/lessons/12903) | substr 활용하기 | [코드](programmers/level01/가운데글자.md) |\n|Lv.1| [약수의 합](https://programmers.co.kr/learn/courses/30/lessons/12928) | sum() , for in range | [코드](programmers/level01/약수의합.md) |\n|Lv.1| [자릿수 더하기](https://programmers.co.kr/learn/courses/30/lessons/12931) | sum() ,int() , str() | [코드](programmers/level01/자릿수더하기.md) |\n|Lv.1| [짝수와 홀수](https://programmers.co.kr/learn/courses/30/lessons/12937) | 삼항 연산자 | [코드](programmers/level01/짝수와홀수.md) |\n|Lv.1| [평균 구하기](https://programmers.co.kr/learn/courses/30/lessons/12944) | sum() , len() | [코드](programmers/level01/평균구하기.md) |\n|Lv.1| [비밀지도](https://programmers.co.kr/learn/courses/30/lessons/17681) | 이진법 연산 | [코드](programmers/level01/비밀지도.md) |\n|Lv.1| [1차 다트게임](https://programmers.co.kr/learn/courses/30/lessons/17682) | 구현, 스택 | [코드](programmers/level01/다트게임.md) |\n|Lv.1| [실패율](https://programmers.co.kr/learn/courses/30/lessons/42889) | 정렬,람다, 예외처리 | [코드](programmers/level01/실패율.md) |\n|Lv.1| [크레인 인형뽑기 게임](https://programmers.co.kr/learn/courses/30/lessons/64061) | 반복문 ,구현 | [코드](programmers/level01/크레인.md) |\n|Lv.1| [키패드 누르기](https://programmers.co.kr/learn/courses/30/lessons/67256) | 딕셔너리, 구현 | [코드](programmers/level01/키패드.md) |\n|Lv.1| [신규 아이디 추천](https://programmers.co.kr/learn/courses/30/lessons/72410) | 문자열 구현 , 정규 표현식 | [코드](programmers/level01/신규아이디추천.md) |\n|Lv.1| [없는 숫자 더하기](https://programmers.co.kr/learn/courses/30/lessons/86051) | look up 테이블 , 수학 | [코드](programmers/level01/없는숫자더하기.md) |\n|Lv.1| [최소직사각형](https://programmers.co.kr/learn/courses/30/lessons/86491) | min ,max , swap | [코드](programmers/level01/최소직사각형.md) |\n|Lv.1| [나머지가 1이 되는 수 찾기](https://programmers.co.kr/learn/courses/30/lessons/87389) | 나머지 연산 | [코드](programmers/level01/나머지1.md) |\n|Lv.1| [신고 결과 받기](https://programmers.co.kr/learn/courses/30/lessons/92334) | 딕셔너리 , 리스트 , Set , index | [코드](programmers/level01/신고결과받기.md) |\n|Lv.1| [성격 유형 검사 ](https://programmers.co.kr/learn/courses/30/lessons/118666) | 딕셔너리 | [코드](programmers/level01/성격유형검사.md) |\n|Lv.1| [숫자 짝꿍 ](https://programmers.co.kr/learn/courses/30/lessons/131128) | count , 문자열 | [코드](programmers/level01/숫자짝꿍.md) |\n|Lv.1| [삼총사](https://programmers.co.kr/learn/courses/30/lessons/131705) | Combinations 조합 | [코드](programmers/level01/삼총사.md) |\n|Lv.1| [콜라 문제 ](https://programmers.co.kr/learn/courses/30/lessons/132267) | 수학 | [코드](programmers/level01/콜라문제.md) |\n|Lv.1| [옹알이 (2) ](https://programmers.co.kr/learn/courses/30/lessons/133499) | not in , replace , strip() | [코드](programmers/level01/옹알이.md) |\n|Lv.1| [햄버거 만들기](https://programmers.co.kr/learn/courses/30/lessons/133502) | 스택 , 슬라이싱 이용하기 | [코드](programmers/level01/햄버거.md) |\n|Lv.1| [푸드 파이트 대회](https://programmers.co.kr/learn/courses/30/lessons/134240) | 문자열 구현 | [코드](programmers/level01/푸드파이터.md) |\n|Lv.1| [과일 장수](https://programmers.co.kr/learn/courses/30/lessons/135808) | 정렬 | [코드](programmers/level01/과일장수.md) |\n|Lv.1| [기사단원의 무기](https://programmers.co.kr/learn/courses/30/lessons/136798) | 구현, 수학 (약수의 개수) | [코드](programmers/level01/기사단원의무기.md) |\n|Lv.1| [명예의 전당(1)](https://programmers.co.kr/learn/courses/30/lessons/138477) | 우선순위 큐 | [코드](programmers/level01/명예의전당.md) |\n|Lv.1| [문자열 나누가](https://programmers.co.kr/learn/courses/30/lessons/140108) | 구현 , deque 활용 | [코드](programmers/level01/문자열나누기.md) |\n|Lv.1| [가장 가까운 같은 글자](https://programmers.co.kr/learn/courses/30/lessons/142086) | 룩업 배열 , 딕셔너리 | [코드](programmers/level01/가장가까운글자.md) |\n|Lv.1| [크기가 작은 부분 문자열](https://programmers.co.kr/learn/courses/30/lessons/147355) | 이중 for 문 , 문자열 인덱싱 | [코드](programmers/level01/부분문자열.md) |\n|Lv.1| [개인정보 수집 유효기간](https://programmers.co.kr/learn/courses/30/lessons/150370) | 문자열 구현 | [코드](programmers/level01/개인정보수집.md) |\n|Lv.1| [둘만의 암호](https://programmers.co.kr/learn/courses/30/lessons/155652) | ascii_lower ,set() , pythonic | [코드](programmers/level01/둘만의암호.md) |\n|Lv.1| [카드 뭉치](https://programmers.co.kr/learn/courses/30/lessons/159994) | pop() | [코드](programmers/level01/카드뭉치.md) |\n|Lv.1| [대충 만든 자판](https://programmers.co.kr/learn/courses/30/lessons/160586) | for문, find() | [코드](programmers/level01/대충만든자판.md) |\n|Lv.1| [바탕화면 정리](https://programmers.co.kr/learn/courses/30/lessons/161990) | 구현 | [코드](programmers/level01/바탕화면정리.md) |\n|Lv.1| [공원 산책](https://programmers.co.kr/learn/courses/30/lessons/172928) | 구현 | [코드](programmers/level01/공원산책.md) |\n|Lv.1| [추억 점수](https://programmers.co.kr/learn/courses/30/lessons/176963) | defaultdict , list comprehension | [코드](programmers/level01/추억점수.md) |\n|Lv.1| [달리기 경주](https://programmers.co.kr/learn/courses/30/lessons/178871) | defaultdict , swap | [코드](programmers/level01/달리기경주.md) |\n|Lv.1| [가장 많이 받은 선물](https://programmers.co.kr/learn/courses/30/lessons/258712) | defaultdict ,2차원 배열 , sum | [코드](programmers/level01/가장많이받은선물.md) |\n|Lv.2| [가장 큰 정사각형 만들기](https://programmers.co.kr/learn/courses/30/lessons/12905) | DP | [코드](programmers/level02/가장큰정사각형.md) |\n|Lv.2| [다음 큰 숫자](https://programmers.co.kr/learn/courses/30/lessons/12911) | 2진법 1의 개수 , bin | [코드](programmers/level02/다음큰숫자.md) |\n|Lv.2| [최댓값과 최솟값](https://programmers.co.kr/learn/courses/30/lessons/12939) | split , min , max | [코드](programmers/level02/최대최소.md) |\n|Lv.2| [JadenCase 문자열 만들기](https://programmers.co.kr/learn/courses/30/lessons/12951) | split() , split(\" \") 구분하기 | [코드](programmers/level02/JadenCase.md) |\n|Lv.2| [[1차] 뉴스 클러스터링](https://programmers.co.kr/learn/courses/30/lessons/17677) | Counter and 연산 , or 연산 , isalpha | [코드](programmers/level02/뉴스클러스터링.md) |\n|Lv.2| [[1차] 프렌즈 4블록](https://programmers.co.kr/learn/courses/30/lessons/17679) | 구현 , 문자열을 중첩리스트로 표현 | [코드](programmers/level02/프렌즈4블록.md) |\n|Lv.2| [[1차] 캐시](https://programmers.co.kr/learn/courses/30/lessons/17680) | deque ( maxlen) , LRU 알고리즘 | [코드](programmers/level02/캐시.md) |\n|Lv.2| [[3차] 방금 그곡](https://programmers.co.kr/learn/courses/30/lessons/17683) | sort , replace , 인덱싱 | [코드](programmers/level02/방금그곡.md) |\n|Lv.2| [n진수 게임](https://programmers.co.kr/learn/courses/30/lessons/17687) | 수학, 구현 | [코드](programmers/level02/n진수.md) |\n|Lv.2| [타켓 넘버](https://programmers.co.kr/learn/courses/30/lessons/43165) | global 키워드 , DFS , itertools product | [코드](programmers/level02/타켓넘버.md) |\n|Lv.2| [스킬트리](https://programmers.co.kr/learn/courses/30/lessons/49993) | 구현 다양한 풀이 , ord , 슬라이싱 , for-else ... etc | [코드](programmers/level02/스킬트리.md) |\n|Lv.2| [튜플](https://programmers.co.kr/learn/courses/30/lessons/64065) | rstrip(),lstrip(), sort 조건 ,람다 | [코드](programmers/level02/튜플.md) |\n|Lv.2| [삼각 달팽이](https://programmers.co.kr/learn/courses/30/lessons/68645) | 재귀 | [코드](programmers/level02/삼각달팽이.md) |\n|Lv.2| [괄호 회전하기](https://programmers.co.kr/learn/courses/30/lessons/76502) | 스택, deque , 인덱스 슬라이싱 | [코드](programmers/level02/괄호회전.md) |\n|Lv.2| [전력망을 둘로 나누기](https://programmers.co.kr/learn/courses/30/lessons/86971) | DFS , 그래프 | [코드](programmers/level02/전력망.md) |\n|Lv.2| [피로도](https://programmers.co.kr/learn/courses/30/lessons/87946) | DFS, 완탐 , global 키워드 | [코드](programmers/level02/피로도.md) |\n|Lv.2| [k진수에서 소수 개수 구하기](https://programmers.co.kr/learn/courses/30/lessons/92335) | 소수 구하기 , split() | [코드](programmers/level02/k진수.md) |\n|Lv.2| [두 큐 합 같게 만들기](https://programmers.co.kr/learn/courses/30/lessons/118667) | deque 사용 | [코드](programmers/level02/두큐합.md) |\n|Lv.2| [할인 행사](https://programmers.co.kr/learn/courses/30/lessons/131127) | 딕셔너리 , Counter | [코드](programmers/level02/할인행사.md) |\n|Lv.2| [혼자 놀기의 달인](https://programmers.co.kr/learn/courses/30/lessons/131130) | union \u0026 find , 딕셔너리 | [코드](programmers/level02/혼자놀기의달인.md) |\n|Lv.2| [연속 부분 수열 합의 개수](https://programmers.co.kr/learn/courses/30/lessons/131701) | for 문 | [코드](programmers/level02/연속부분.md) |\n|Lv.2| [택배상자](https://programmers.co.kr/learn/courses/30/lessons/131704) | 스택 ⭐ | [코드](programmers/level02/택배상자.md) |\n|Lv.2| [롤케이크 자르기](https://programmers.co.kr/learn/courses/30/lessons/132265) | dictionary 문법 익히기 ⭐ | [코드](programmers/level02/롤케이크.md) |\n|Lv.2| [야간 전술 보행](https://programmers.co.kr/learn/courses/30/lessons/133501) | 다시 풀기 | [코드](programmers/level02/야간전술보행.md) |\n|Lv.2| [숫자 카드 나누기](https://programmers.co.kr/learn/courses/30/lessons/135807) | 최대공약수 | [코드](programmers/level02/숫자카드.md) |\n|Lv.2| [귤 고르기](https://programmers.co.kr/learn/courses/30/lessons/138476) | Counter , most_common() | [코드](programmers/level02/귤고르기.md) |\n|Lv.2| [점 찍기](https://programmers.co.kr/learn/courses/30/lessons/140107) | 원의 방정식, 피타고라스 정리 | [코드](programmers/level02/점찍기.md) |\n|Lv.2| [디펜스 게임](https://programmers.co.kr/learn/courses/30/lessons/142085) | 최소 힙 | [코드](programmers/level02/디펜스게임.md) |\n|Lv.2| [마법의 엘리베이터](https://programmers.co.kr/learn/courses/30/lessons/148653) | 백트래킹 ,재귀 | [코드](programmers/level02/마법의엘리베이터.md) |\n|Lv.2| [이모티콘 할인 행사](https://programmers.co.kr/learn/courses/30/lessons/150368) | 브루트 포스 , itertools / product | [코드](programmers/level02/이모티콘할인행사.md) |\n|Lv.2| [택배 배달과 수거하기](https://programmers.co.kr/learn/courses/30/lessons/150369) | 그리디 | [코드](programmers/level02/택배배달.md) |\n|Lv.2| [숫자 변환하기](https://programmers.co.kr/learn/courses/30/lessons/154538) | BFS | [코드](programmers/level02/숫자변환하기.md) |\n|Lv.2| [뒤에 있는 큰 수 찾기](https://programmers.co.kr/learn/courses/30/lessons/154539) | 스택 | [코드](programmers/level02/뒤에큰수찾기.md) |\n|Lv.2| [무인도 여행](https://programmers.co.kr/learn/courses/30/lessons/154540) | deque , BFS | [코드](programmers/level02/무인도여행.md) |\n|Lv.2| [호텔 대실](https://programmers.co.kr/learn/courses/30/lessons/155651) | 우선순위 큐 , 그리디 | [코드](programmers/level02/호텔대실.md) |\n|Lv.2| [미로 탈출](https://programmers.co.kr/learn/courses/30/lessons/159993) | BFS 두번 | [코드](programmers/level02/미로탈출.md) |\n|Lv.2| [혼자서 하는 틱택토](https://school.programmers.co.kr/learn/courses/30/lessons/160585) | 구현 , all 함수 | [코드](programmers/level02/틱택토.md) |\n|Lv.2| [덧칠하기](https://school.programmers.co.kr/learn/courses/30/lessons/161989) | 그리디 | [코드](programmers/level02/덧칠하기.md) |\n|Lv.2| [리코쳇 로봇](https://school.programmers.co.kr/learn/courses/30/lessons/169199) | 구현 , BFS , enumerate , set() , 코드 참고 | [코드](programmers/level02/리코쳇로봇.md) |\n|Lv.2| [광물 캐기](https://school.programmers.co.kr/learn/courses/30/lessons/172927) | 구현 ,정렬 | [코드](programmers/level02/광물캐기.md) |\n|Lv.2| [석유 시추](https://school.programmers.co.kr/learn/courses/30/lessons/250136) | | [코드](programmers/level02/석유시추.md) |\n|Lv.3| [가장 긴 팰린드롬](https://school.programmers.co.kr/learn/courses/30/lessons/12904) | 문자열 슬라이스 인덱싱 | [코드](programmers/level03/긴팰린드롬.md) |\n|Lv.3| [스티커 모으기(2)](https://school.programmers.co.kr/learn/courses/30/lessons/12971) | DP | [코드](programmers/level03/스티커모으기.md) |\n|Lv.3| [기지국 설치](https://school.programmers.co.kr/learn/courses/30/lessons/12979) | 그리디 ,구현 | [코드](programmers/level03/기지국설치.md) |\n|Lv.3| [숫자 게임](https://school.programmers.co.kr/learn/courses/30/lessons/12987) | deque , bfs , 그리디 | [코드](programmers/level03/숫자게임.md) |\n|Lv.3| [[1차] 추석 트래픽 ](https://school.programmers.co.kr/learn/courses/30/lessons/17676) | datetime.strptime() | [코드](programmers/level03/추석트래픽.md) |\n|Lv.3| [[1차] 셔틀버스 ](https://school.programmers.co.kr/learn/courses/30/lessons/17678) | divmode , zfill | [코드](programmers/level03/셔틀버스.md) |\n|Lv.3| [베스트앨범](https://school.programmers.co.kr/learn/courses/30/lessons/42579) | 딕셔너리 , sort , 람다 (내림차순, 오름차순) | [코드](programmers/level03/베스트앨범.md) |\n|Lv.3| [이중우선순위큐](https://school.programmers.co.kr/learn/courses/30/lessons/42628) | 우선순위큐, heapq , remove, 예외처리 | [코드](programmers/level03/이중우선순위큐.md) |\n|Lv.3| [등굣길](https://school.programmers.co.kr/learn/courses/30/lessons/42898) | DP | [코드](programmers/level03/등굣길.md) |\n|Lv.3| [정수 삼각형](https://school.programmers.co.kr/learn/courses/30/lessons/43105) | DP | [코드](programmers/level03/정수삼각형.md) |\n|Lv.3| [네트워크](https://school.programmers.co.kr/learn/courses/30/lessons/43162) | DFS , 플로이드 와샬 | [코드](programmers/level03/네트워크.md) |\n|Lv.3| [여행경로](https://school.programmers.co.kr/learn/courses/30/lessons/43164) | DFS | [코드](programmers/level03/여행경로.md) |\n|Lv.3| [외벽 점검](https://school.programmers.co.kr/learn/courses/30/lessons/60062) | 완전탐색 ,백트래킹 | [코드](programmers/level03/외벽점검.md) |\n|Lv.3| [블록 이동하기](https://school.programmers.co.kr/learn/courses/30/lessons/60063) | 3차원 배열 , BFS , 구현 | [코드](programmers/level03/블록이동하기..md) |\n|Lv.3| [징검다리 건너기](https://school.programmers.co.kr/learn/courses/30/lessons/64062) | 이분 탐색 | [코드](programmers/level03/징검다리.md) |\n|Lv.3| [풍선 터트리기](https://school.programmers.co.kr/learn/courses/30/lessons/68646) | Stack , 구현 | [코드](programmers/level03/풍선.md) |\n|Lv.3| [스타 수열](https://school.programmers.co.kr/learn/courses/30/lessons/70130) | 구현 , Counter | [코드](programmers/level03/수타수열.md) |\n|Lv.3| [카드 짝 맞추기](https://school.programmers.co.kr/learn/courses/30/lessons/72415) | brute force , bfs , dp | [코드](programmers/level03/짝맞추기.md) |\n|Lv.3| [모두 0으로 만들기](https://school.programmers.co.kr/learn/courses/30/lessons/76503) | global , sys.setrecursionlimit 재귀 깊이 , 위상 정렬 | [코드](programmers/level03/모두0으로만들기.md) |\n|Lv.3| [아이템 줍기](https://school.programmers.co.kr/learn/courses/30/lessons/87694) | BFS 응용 | [코드](programmers/level03/아이템줍기.md) |\n|Lv.3| [최고의 집합](https://school.programmers.co.kr/learn/courses/30/lessons/129388) | 수학, 구현 | [코드](programmers/level03/최고의집합.md) |\n|Lv.3| [카운트 다운](https://school.programmers.co.kr/learn/courses/30/lessons/131129) | DP | [코드](programmers/level03/카운트다운.md) |\n|Lv.3| [부대 복귀](https://school.programmers.co.kr/learn/courses/30/lessons/132266) | 다익스트라 , heapq | [코드](programmers/level03/부대복귀..md) |\n|Lv.3| [미로 탈출 명령어](https://school.programmers.co.kr/learn/courses/30/lessons/150365) | deque , bfs , 그리디 | [코드](programmers/level03/미로탈출.md) |\n|Lv.3| [표현 가능한 이진트리](https://school.programmers.co.kr/learn/courses/30/lessons/150367) | 포화 이진 트리 개념, 노드 수 , 높이 , DFS | [코드](programmers/level03/표현가능한이진트리.md) |\n|Lv.3| [인사고과](https://school.programmers.co.kr/learn/courses/30/lessons/152995) | 정렬 , 그리디 | [코드](programmers/level03/인사고과.md) |\n|Lv.3| [연속 펄스 부분 수열의 합](https://school.programmers.co.kr/learn/courses/30/lessons/161988) | DP , 부분합 | [코드](programmers/level03/연속펄스.md) |\n|Lv.4| [단어 퍼즐](https://school.programmers.co.kr/learn/courses/30/lessons/12983) | 정렬 람다 sorted 다중 요소, 그리디 | [코드](programmers/level04/단어퍼즐.md) |\n|Lv.?| [체육대회](https://school.programmers.co.kr/learn/courses/30/lessons/121684) | DFS , 백트래킹 , permutations , enumerate | [코드](programmers/level_기타/체육대회.md) |\n\n## 🎃 LeetCode\n\n| # | Title | Difficulty | Comment | Solution |\n|:----|:---------------------------------------------------------------------------------------------------------------------------------------------------------:|:----------:|:---------------------------------------:|:----|\n| 1 | [ Two Sum ](https://leetcode.com/problems/two-sum/) | Easy | 딕셔너리 사용해서 O(n)에 해결 |[Solution](leetcode/easy/1.md)\n| 2 | [ Add Two Numbers ](https://leetcode.com/problems/add-two-numbers/) | Medium | 연결리스트 사용 |[Solution](leetcode/medium/2.md)\n| 3 | [ Longest Substring Without Repeating Characters ](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium | 슬라이싱 윈도우 |[Solution](leetcode/medium/3.md)\n| 4 | [ Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) | Hard | 슬라이딩 윈도우 |[Solution](leetcode/hard/4.md)\n| 5 | [ Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/) | Medium | 투포인터 |[Solution](leetcode/medium/5.md)\n| 15 | [ 3Sum](https://leetcode.com/problems/3sum/) | Medium | 투포인터 |[Solution](leetcode/medium/15.md)\n| 17 | [ Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/) | Medium | DFS |[Solution](leetcode/medium/17.md)\n| 20 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | 딕셔너리 ,스택 |[Solution](leetcode/easy/20.md)\n| 21 | [ Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/) | Easy | 연결리스트, 재귀 |[Solution](leetcode/easy/21.md)\n| 23 | [ Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | Hard | 우선순위 큐 |[Solution](leetcode/hard/23.md)\n| 24 | [Swap Nodes in Pairs ](https://leetcode.com/problems/swap-nodes-in-pairs/) | Medium | 연결리스트 swap |[Solution](leetcode/medium/24.md)\n| 33 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | Medium | 이진 탐색 , 피벗 설정 |[Solution](leetcode/medium/33.md)\n| 39 | [Combination Sum](https://leetcode.com/problems/combination-sum/) | Medium | DFS , 조합의 합 |[Solution](leetcode/medium/39.md)\n| 42 | [ Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | Hard | 투포인터, 스택 |[Solution](leetcode/hard/42.md)\n| 46 | [ Permutations](https://leetcode.com/problems/permutations/) | Medium | DFS |[Solution](leetcode/medium/46.md)\n| 49 | [ Group Anagrams ](https://leetcode.com/problems/group-anagrams/) | Medium | 딕셔너리 , 정렬 |[Solution](leetcode/medium/49.md)\n| 53 | [ Maximum Subarray ](https://leetcode.com/problems/maximum-subarray/) | Medium | 파이썬 스러운 그리디 ,문자열 정렬 |[Solution](leetcode/medium/56.md)\n| 56 | [ Merge Intervals ](https://leetcode.com/problems/merge-intervals/) | Easy | DP , 카데인 알고리즘 |[Solution](leetcode/medium/53.md)\n| 70 | [ Climbing Stairs ](https://leetcode.com/problems/climbing-stairs/) | Easy | DP |[Solution](leetcode/easy/70.md)\n| 75 | [ Sort Colors ](https://leetcode.com/problems/sort-colors/) | Medium | 네덜란드 국기 문제, 계수 정렬 |[Solution](leetcode/medium/75.md)\n| 76 | [ Minimum Window Substring ](https://leetcode.com/problems/minimum-window-substring/) | Hard | 슬라이싱 윈도우 |[Solution](leetcode/hard/76.md)\n| 77 | [ Combinations ](https://leetcode.com/problems/combinations/) | Medium | DFS , 조합 |[Solution](leetcode/medium/77.md)\n| 78 | [ Subsets ](https://leetcode.com/problems/subsets/) | Medium | DFS |[Solution](leetcode/medium/78.md)\n| 104 | [ Maximum Depth of Binary Tree ](https://leetcode.com/problems/maximum-depth-of-binary-tree/description/) | Easy | 트리 |[Solution](leetcode/easy/104.md)\n| 121 | [ Best Time to Buy ans Sell Stock ](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | min , max |[Solution](leetcode/easy/121.md)\n| 122 | [ Best Time to Buy and Sell Stock II ](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/) | Medium | 그리디 |[Solution](leetcode/medium/122.md)\n| 125 | [ Valid Palindrome ](https://leetcode.com/problems/valid-palindrome/) | Easy | isalnum() , deque popleft() ,문자열 슬라이싱 |[Solution](leetcode/easy/125.md)\n| 134 | [ Gas Station ](https://leetcode.com/problems/gas-station/) | Medium | 그리디 |[Solution](leetcode/medium/134.md)\n| 136 | [ Single Number ](https://leetcode.com/problems/single-number/) | Easy | XOR ,Counter |[Solution](leetcode/easy/136.md)\n| 147 | [ Insertion Sort List ](https://leetcode.com/problems/insertion-sort-list/description/) | Medium | 삽입 정렬 |[Solution](leetcode/medium/147.md)\n| 148 | [ Sort List ](https://leetcode.com/problems/sort-list/description/) | Medium | 정렬 |[Solution](leetcode/medium/148.md)\n| 167 | [ Two Sum II - Input Array Is Sorted ](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/) | Medium | 이진탐색 , bitsect 모듈 , 투포인터 |[Solution](leetcode/medium/167.md)\n| 169 | [ Majority Element ](https://leetcode.com/problems/majority-element/) | Easy | Counter , most_common |[Solution](leetcode/easy/169.md)\n| 179 | [ Largest Number ](https://leetcode.com/problems/largest-number/description) | Medium | 정렬 기법 . swap 커스텀 |[Solution](leetcode/medium/179.md)\n| 191 | [Number of 1 Bits ](https://leetcode.com/problems/number-of-1-bits/) | Easy | bin , and 연산 |[Solution](leetcode/easy/191.md)\n| 198 | [House Robber ](https://leetcode.com/problems/house-robber/) | Medium | DP , collections.OrderedDict() |[Solution](leetcode/medium/198.md)\n| 200 | [ Number of Islands ](https://leetcode.com/problems/number-of-islands/) | Medium | DFS |[Solution](leetcode/medium/200.md)\n| 206 | [ Reverse Linked List ](https://leetcode.com/problems/reverse-linked-list/) | Easy | 연결 리스트 |[Solution](leetcode/easy/206.md)\n| 207 | [ Course Schedule ](https://leetcode.com/problems/course-schedule/) | Medium | 그래프의 Cycle 판별 |[Solution](leetcode/medium/207.md)\n| 208 | [ Implement Trie (Prefix Tree) ](https://leetcode.com/problems/implement-trie-prefix-tree/description/) | Medium | 트라이 직접 구현 |[Solution](leetcode/medium/208.md)\n| 215 | [ Kth Largest Element in an Array ](https://leetcode.com/problems/kth-largest-element-in-an-array/description/) | Medium | sort , heapq , heapq.heapify() 이용 |[Solution](leetcode/medium/215.md)\n| 225 | [ Implement Stack using Queues ](https://leetcode.com/problems/implement-stack-using-queues/) | Easy | 큐를 이용해서 스택 구현하기 |[Solution](leetcode/easy/225.md)\n| 226 | [ Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/description/) | Easy | 이진 트리 반전 |[Solution](leetcode/easy/226.md)\n| 232 | [ Implement Queue using Stacks ](https://leetcode.com/problems/implement-queue-using-stacks/) | Easy | 스택을 이용해서 큐 구현하기 |[Solution](leetcode/easy/232.md)\n| 234 | [ Palindrome Linked List ](https://leetcode.com/problems/palindrome-linked-list/) | Easy | 연결 리스트 |[Solution](leetcode/easy/234.md)\n| 238 | [ Product of Array Except Self ](https://leetcode.com/problems/product-of-array-except-self/) | Medium | 왼쪽의 곱셈 결과 * 오른쪽의 곱셈 결과 |[Solution](leetcode/medium/238.md)\n| 239 | [ Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/description/) | Hard | mono deque |[Solution](leetcode/hard/239.md)\n| 240 | [ Search a 2D Matrix II ](https://leetcode.com/problems/search-a-2d-matrix-ii/) | Medium | 구현, any , for문 이진 탐색 |[Solution](leetcode/medium/240.md)\n| 241 | [Different Ways to Add Parentheses ](https://leetcode.com/problems/different-ways-to-add-parentheses/) | Medium | 분할 정복 |[Solution](leetcode/medium/241.md)\n| 242 | [ Valid Anagram ](https://leetcode.com/problems/valid-anagram/) | Easy | collections.defaultdict , sorted |[Solution](leetcode/easy/242.md)\n| 316 | [ Remove Duplicate Letters ](https://leetcode.com/problems/remove-duplicate-letters/) | Medium | 스택 |[Solution](leetcode/medium/316.md)\n| 332 | [ Reconstruct Itinerary ](https://leetcode.com/problems/reconstruct-itinerary/) | Hard | defaultdict, DFS ,스택 |[Solution](leetcode/hard/332.md)\n| 344 | [ Reverse String ](https://leetcode.com/problems/reverse-string/) | Easy | 투포인터, reverse() |[Solution](leetcode/easy/344.md)\n| 347 | [ Top K Frequent Elements ](https://leetcode.com/problems/top-k-frequent-elements/) | Medium | 우선순위큐, 딕셔너리 |[Solution](leetcode/medium/347.md)\n| 349 | [Intersection of Two Arrays ](https://leetcode.com/problems/intersection-of-two-arrays/) | Easy | 이진 탐색 , 투포인터 |[Solution](leetcode/easy/349.md)\n| 406 | [Queue Reconstruction by Height ](https://leetcode.com/problems/queue-reconstruction-by-height/) | Medium | 그리디 , 우선순위 큐, 2차원 배열 정렬 lambda |[Solution](leetcode/medium/406.md)\n| 424 | [Longest Repeating Character Replacement ](https://leetcode.com/problems/longest-repeating-character-replacement/) | Medium | 투 포인터 ,Counter , most_common |[Solution](leetcode/medium/424.md)\n| 455 | [Assign Cookies ](https://leetcode.com/problems/assign-cookies/) | Easy | 이진탐색 , 그리디 , 정렬 |[Solution](leetcode/easy/455.md)\n| 461 | [Hamming Distance ](https://leetcode.com/problems/hamming-distance/) | Easy | XOR , bin , count() |[Solution](leetcode/easy/461.md)\n| 509 | [ Fibonacci Number ](https://leetcode.com/problems/fibonacci-number/) | Easy | 피보나치 |[Solution](leetcode/easy/509.md)\n| 543 | [ Diameter of Binary Tree ](https://leetcode.com/problems/diameter-of-binary-tree/description/) | Easy | 트리의 직경 |[Solution](leetcode/easy/543.md)\n| 561 | [ Array Partition ](https://leetcode.com/problems/array-partition/) | Easy | 정렬 |[Solution](leetcode/easy/561.md)\n| 596 | [ Classes More Than 5 Students](https://leetcode.com/problems/classes-more-than-5-students/description/) | Easy | group by , having |[Solution](leetcode/easy/596.md)\n| 621 | [ Task Scheduler ](https://leetcode.com/problems/task-scheduler/) | Medium | Counter , most_common , substract |[Solution](leetcode/medium/621.md)\n| 622 | [ Design Circular Queue ](https://leetcode.com/problems/design-circular-queue/) | Medium | 배열로 원형 큐 구현하기 (front , rear) |[Solution](leetcode/medium/622.md)\n| 641 | [ Design Circular Deque ](https://leetcode.com/problems/design-circular-deque/) | Medium | 연결리스트로 원형 데크 구현하기 |[Solution](leetcode/medium/641.md)\n| 687 | [Longest Univalue Path ](https://leetcode.com/problems/longest-univalue-path/description/) | Medium | 가장 긴 동일 값의 경로 |[Solution](leetcode/medium/687.md)\n| 704 | [ Binary Search ](https://leetcode.com/problems/binary-search/) | Easy | 이진 탐색 |[Solution](leetcode/easy/704.md)\n| 706 | [ Design HashMap ](https://leetcode.com/problems/design-hashmap/) | Easy | 체이닝으로 해시 구현 |[Solution](leetcode/easy/706.md)\n| 739 | [ Daily Temperatures ](https://leetcode.com/problems/daily-temperatures/) | Medium | 스택 |[Solution](leetcode/medium/739.md)\n| 743 | [ Network Delay Time ](https://leetcode.com/problems/network-delay-time/) | Medium | 다익스트라 구현 1,2 |[Solution](leetcode/medium/743.md)\n| 771 | [ Jewels and Stones ](https://leetcode.com/problems/jewels-and-stones/) | Easy | 딕셔너리 , defaultdict, Counter , 리스트 컴프리헨션 |[Solution](leetcode/easy/771.md)\n| 819 | [ Most Common Word ](https://leetcode.com/problems/most-common-word/) | Easy | 정규식 , Counter 모듈 |[Solution](leetcode/easy/819.md)\n| 937 | [ Reorder Data in Log Files ](https://leetcode.com/problems/reorder-data-in-log-files/) | Medium | 람다 표현식 | [Solution](leetcode/medium/937.md)\n| 973 | [ K. Closet Points to Origin ](https://leetcode.com/problems/k-closet-to-origin/) | Medium | 정렬 람다식 정의 , 우선순위 큐 | [Solution](leetcode/medium/973.md)\n| 1018 | [Binary Prefix Divisible By 5](https://leetcode.com/problems/binary-prefix-divisible-by-5/) | Easy | 시프트 연산 (\u003c\u003c) | [Solution](leetcode/easy/1018.md)\n\n## 🤡 SQL\n\n|레벨 | 문제 | 코멘트 | 코드 |\n|:-----|:-----------------------------------------------------------------------------------------------|:---------------------------------------------------------|:----------------------------\n|Lv.1| [ 강원도에 위치한 생산공장 목록 출력하기 ️](https://programmers.co.kr/learn/courses/30/lessons/131112) | like 패턴 매칭 | [코드](SQL/lv_1/강원도.md) |\n|Lv.1| [ 경기도에 위치한 식품창고 목록 출력하기 ️](https://programmers.co.kr/learn/courses/30/lessons/131114) | case when , coalesce() 함수 | [코드](SQL/lv_1/경기도에위치한.md) |\n|Lv.1| [ 나이 정보가 없는 회원 수 구하기 ️](https://programmers.co.kr/learn/courses/30/lessons/131528) | is not null | [코드](SQL/lv_1/나이정보.md) |\n|Lv.1| [ 조건에 맞는 회원 수 구하기 ️](https://programmers.co.kr/learn/courses/30/lessons/131535) | where between , count | [코드](SQL/lv_1/조건에맞는회원.md) |\n|Lv.1| [ 가장 비싼 상품 구하기 ️](https://programmers.co.kr/learn/courses/30/lessons/131697) | max | [코드](SQL/lv_1/가장비싼상품구하기.md) |\n|Lv.1| [ 12세 이하인 여자 환자 목록 출력하기 ️](https://programmers.co.kr/learn/courses/30/lessons/132201) | coalesce , order by | [코드](SQL/lv_1/12세이하.md) |\n|Lv.1| [ 과일로 마든 아이스크림 고르기 ️](https://programmers.co.kr/learn/courses/30/lessons/133025) | inner join | [코드](SQL/lv_1/과일로만든.md) |\n|Lv.1| [ 조건에 맞는 도서 리스트 출력하기 ️](https://programmers.co.kr/learn/courses/30/lessons/144853) | year , date_format , order by | [코드](SQL/lv_1/조건에맞는.md) |\n|Lv.1| [ 평균 일일 대여 요금 구하기 ️](https://programmers.co.kr/learn/courses/30/lessons/151136) | round , avg | [코드](SQL/lv_1/일일대여.md) |\n|Lv.1| [ 특정 옵션이 포함된 자동차 리스트 ️](https://programmers.co.kr/learn/courses/30/lessons/157343) | like 키워드 , order by desc | [코드](SQL/lv_1/특정옵션.md) |\n|Lv.1| [ 조건에 부합하는 중고거래 댓글 조회하기️](https://programmers.co.kr/learn/courses/30/lessons/164673) | inner join , where | [코드](SQL/lv_1/조건에.md) |\n|Lv.2| [ 가격이 제일 비싼 식품의 정보 출력하기 ️](https://programmers.co.kr/learn/courses/30/lessons/131115) | set 변수 , max , subquery | [코드](SQL/lv_2/가격이제일비싼.md) |\n|Lv.2| [ 3월에 태어난 여성 회원 목록 출력하기️](https://programmers.co.kr/learn/courses/30/lessons/131120) | Month , date_format | [코드](SQL/lv_2/3월에.md) |\n|Lv.2| [ 카테고리 별 상품 개수 구하기️](https://programmers.co.kr/learn/courses/30/lessons/131529) | substr() , left() | [코드](SQL/lv_2/카테고리별.md) |\n|Lv.2| [ 가격대 별 상품 개수 구하기 ️](https://programmers.co.kr/learn/courses/30/lessons/131530) | truncate | [코드](SQL/lv_2/가격대별.md) |\n|Lv.2| [ 상품 별 오프라인 매출 구하기 ️](https://programmers.co.kr/learn/courses/30/lessons/131533) | order by , grouo by | [코드](SQL/lv_2/상품별.md) |\n|Lv.2| [ 재구매가 일어난 상품과 회원 리스트 구하기 ️](https://programmers.co.kr/learn/courses/30/lessons/131536) | group by 복수 컬럼 | [코드](SQL/lv_2/재구매.md) |\n|Lv.2| [ 진료과별 총 예약 횟수 출력하기 ️](https://programmers.co.kr/learn/courses/30/lessons/132202) | group by ,date_format ('%Y-%m') [코드](SQL/lv_2/진료과별예약.md) |\n|Lv.2| [ 성분으로 구분한 아이스크림 총 주문량 ️](https://programmers.co.kr/learn/courses/30/lessons/133026) | inner join , group by | [코드](SQL/lv_2/성분으로.md) |\n|Lv.2| [ 조건에 맞는 도서와 저자 리스트 출력하기️](https://programmers.co.kr/learn/courses/30/lessons/144854) | inner join | [코드](SQL/lv_2/조건에맞는도서..md) |\n|Lv.2| [ 자동차 평균 대여 기간 구하기 ️](https://programmers.co.kr/learn/courses/30/lessons/157342) | datediff 날짜 일수 구하기 , group by , having ,round | [코드](SQL/lv_2/자동차평균대여.md) |\n|Lv.2| [ 특정 물고기를 잡은 총 수 구하기 ️](https://programmers.co.kr/learn/courses/30/lessons/298518) | inner join | [코드](SQL/lv_2/특정물고기수.md) |\n|Lv.3| [ 조건별로 분류하여 주문상태 출력하기 ️](https://programmers.co.kr/learn/courses/30/lessons/131113) | date_format , case when | [코드](SQL/lv_3/조건별로주문상태.md) |\n|Lv.3| [ 즐겨찾기가 가장 많은 식당 정보 출력하기 ️](https://programmers.co.kr/learn/courses/30/lessons/131123) | inner join , group by 주의하기 !! | [코드](SQL/lv_3/즐겨찾기.md) |\n|Lv.3| [ 카테고리 별 도서 판매량 집계하기 ️](https://programmers.co.kr/learn/courses/30/lessons/144855) | inner join , group by , date_format | [코드](SQL/lv_3/카테고리별.md) |\n|Lv.3| [ 대여 횟수가 많은 자동차들의 월별 대여 횟수 구하기 ️](https://programmers.co.kr/learn/courses/30/lessons/151139) | between , month , group by | [코드](SQL/lv_3/대여횟수.md) |\n|Lv.3| [ 자동차 대여 기록에서 대여중/ 대여 가능 여부 구분하기 ️](https://programmers.co.kr/learn/courses/30/lessons/157340) | 서브쿼리 , case when | [코드](SQL/lv_3/대여중.md) |\n|Lv.3| [ 대여 기록이 존재하는 자동차 리스트 구하기 ️](https://programmers.co.kr/learn/courses/30/lessons/157341) | inner join , distinct | [코드](SQL/lv_3/대여기록이존재하는.md) |\n|Lv.3| [ 조건에 맞는 사용자 정보 조회하기 ️](https://programmers.co.kr/learn/courses/30/lessons/164668) | inner join , group by ,having | [코드](SQL/lv_3/조건에맞는사용자.md) |\n|Lv.3| [ 조건에 맞는 사용자와 총 거래금액 조회하기️ ](https://programmers.co.kr/learn/courses/30/lessons/164670) | 문자열 , concat , left() , right() , mid() | [코드](SQL/lv_3/조건에맞는.md) |\n|Lv.3| [ 조회수가 가장 많은 중고거래 게시판의 첨부파일 조회하기 ](https://programmers.co.kr/learn/courses/30/lessons/164671) | 문자열 , concat , concat | [코드](SQL/lv_3/조회수.md) |\n|Lv.3| [ 물고기 종류 별 대어 찾기 ](https://programmers.co.kr/learn/courses/30/lessons/293261) | 종류 별로 가장 큰 물고기의 정보 , rank() over partition by | [코드](SQL/lv_3/물고기대어.md) |\n|Lv.3| [ 특정 조건을 만족하는 물고기별 수와 최대 길이 구하기 ](https://programmers.co.kr/learn/courses/30/lessons/298519) | case when 집계 함수, 특정 조건 일 때 집계 | [코드](SQL/lv_3/특정조건.md) |\n|Lv.4| [ 식품분류별 가장 비싼 식품의 정보 조회하기 ️](https://programmers.co.kr/learn/courses/30/lessons/131116) | inner join | [코드](SQL/lv_4/식품분류별.md) |\n|Lv.4| [ 주문량이 많은 아이스크림들 조회하기️](https://programmers.co.kr/learn/courses/30/lessons/133027) | with table as , union distinct | [코드](SQL/lv_4/주문량이많은.md) |\n|Lv.4| [ 연간 평가점수에 해당하는 평가 등급 및 성과금 조회하기️](https://programmers.co.kr/learn/courses/30/lessons/284528) | case when , join | [코드](SQL/lv_4/연간평가점수.md) |\n\n\n- [노트](note/index.md)","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fconnieya%2Fpython_algothm","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fconnieya%2Fpython_algothm","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fconnieya%2Fpython_algothm/lists"}