Skip to content

Commit 3edb560

Browse files
committed
update README.md
1 parent 92613e7 commit 3edb560

File tree

12 files changed

+37
-36
lines changed

12 files changed

+37
-36
lines changed

BAEKJOON/1Bronze.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -30,4 +30,4 @@
3030
|023|구현, 다이나믹 프로그래밍, 문자열|Python|핸드폰 번호 궁합|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/1Bronze/%ED%95%B8%EB%93%9C%ED%8F%B0%20%EB%B2%88%ED%98%B8%20%EA%B6%81%ED%95%A9.py)|[바로가기](https://www.acmicpc.net/problem/17202)|
3131

3232

33-
**Update Date 2024/04/26 20:31:54 KST**
33+
**Update Date 2024/04/26 23:11:12 KST**

BAEKJOON/2Silver.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -108,4 +108,4 @@
108108
|101|그리디 알고리즘, 정렬|Python|회의실 배정|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/2Silver/%ED%9A%8C%EC%9D%98%EC%8B%A4%20%EB%B0%B0%EC%A0%95.py)|[바로가기](https://www.acmicpc.net/problem/1931)|
109109

110110

111-
**Update Date 2024/04/26 20:31:54 KST**
111+
**Update Date 2024/04/26 23:11:12 KST**

BAEKJOON/3Gold.md

Lines changed: 25 additions & 24 deletions
Original file line numberDiff line numberDiff line change
@@ -27,29 +27,30 @@
2727
|020|그래프 이론, 그래프 탐색, 너비 우선 탐색, 데이크스트라, 최단 경로, 0-1 너비 우선 탐색|Python|숨바꼭질 3|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%EC%88%A8%EB%B0%94%EA%BC%AD%EC%A7%88%203.py)|[바로가기](https://www.acmicpc.net/problem/13549)|
2828
|021|그래프 이론, 그래프 탐색, 깊이 우선 탐색, 백트래킹|Python|알파벳|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%EC%95%8C%ED%8C%8C%EB%B2%B3.py)|[바로가기](https://www.acmicpc.net/problem/1987)|
2929
|022|수학, 정수론, 누적 합, 소수 판정, 에라토스테네스의 체|Python|약수의 합|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%EC%95%BD%EC%88%98%EC%9D%98%20%ED%95%A9.py)|[바로가기](https://www.acmicpc.net/problem/17425)|
30-
|023|그래프 이론, 최단 경로, 벨만-포드|Python|웜홀|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%EC%9B%9C%ED%99%80.py)|[바로가기](https://www.acmicpc.net/problem/1865)|
31-
|024|자료 구조, 트리를 사용한 집합과 맵, 우선순위 큐|Python|이중 우선순위 큐|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%EC%9D%B4%EC%A4%91%20%EC%9A%B0%EC%84%A0%EC%88%9C%EC%9C%84%20%ED%81%90.py)|[바로가기](https://www.acmicpc.net/problem/7662)|
32-
|025|그래프 이론, 그래프 탐색, 트리, 재귀|Python|이진 검색 트리|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%EC%9D%B4%EC%A7%84%20%EA%B2%80%EC%83%89%20%ED%8A%B8%EB%A6%AC.py)|[바로가기](https://www.acmicpc.net/problem/5639)|
33-
|026|그래프 이론, 그래프 탐색, 너비 우선 탐색, 깊이 우선 탐색|Python|적록색약|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%EC%A0%81%EB%A1%9D%EC%83%89%EC%95%BD.py)|[바로가기](https://www.acmicpc.net/problem/10026)|
34-
|027|브루트포스 알고리즘|Python|제곱수 찾기|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%EC%A0%9C%EA%B3%B1%EC%88%98%20%EC%B0%BE%EA%B8%B0.py)|[바로가기](https://www.acmicpc.net/problem/1025)|
35-
|028|그래프 이론, 데이크스트라, 최단 경로|Python|최단경로|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%EC%B5%9C%EB%8B%A8%EA%B2%BD%EB%A1%9C.py)|[바로가기](https://www.acmicpc.net/problem/1753)|
36-
|029|그래프 이론, 데이크스트라, 최단 경로|Python|최소비용 구하기 2|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%EC%B5%9C%EC%86%8C%EB%B9%84%EC%9A%A9%20%EA%B5%AC%ED%95%98%EA%B8%B0%202.py)|[바로가기](https://www.acmicpc.net/problem/11779)|
37-
|030|그래프 이론, 데이크스트라, 최단 경로|Python|최소비용 구하기|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%EC%B5%9C%EC%86%8C%EB%B9%84%EC%9A%A9%20%EA%B5%AC%ED%95%98%EA%B8%B0.py)|[바로가기](https://www.acmicpc.net/problem/1916)|
38-
|031|자료구조, 세그먼트 트리|Python|최솟값과 최댓값|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%EC%B5%9C%EC%86%9F%EA%B0%92%EA%B3%BC%20%EC%B5%9C%EB%8C%93%EA%B0%92.py)|[바로가기](https://www.acmicpc.net/problem/2357)|
39-
|032|구현, 그래프 이론, 그래프 탐색, 시뮬레이션, 너비 우선 탐색, 깊이 우선 탐색|Python|치즈|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%EC%B9%98%EC%A6%88.py)|[바로가기](https://www.acmicpc.net/problem/2638)|
40-
|033|구현, 브루트포스 알고리즘|Python|테트로미노|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%ED%85%8C%ED%8A%B8%EB%A1%9C%EB%AF%B8%EB%85%B8.py)|[바로가기](https://www.acmicpc.net/problem/14500)|
41-
|034|그래프 이론, 그래프 탐색, 너비 우선 탐색|Python|토마토|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%ED%86%A0%EB%A7%88%ED%86%A0.py)|[바로가기](https://www.acmicpc.net/problem/7576)|
42-
|035|그래프 이론, 그래프 탐색, 너비 우선 탐색|Python|토마토2|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%ED%86%A0%EB%A7%88%ED%86%A02.py)|[바로가기](https://www.acmicpc.net/problem/7569)|
43-
|036|그래프 이론, 그래프 탐색, 트리, 깊이 우선 탐색|Python|트리의 지름(4)|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%ED%8A%B8%EB%A6%AC%EC%9D%98%20%EC%A7%80%EB%A6%84%284%29.py)|[바로가기](https://www.acmicpc.net/problem/1967)|
44-
|037|그래프 이론, 그래프 탐색, 트리, 깊이 우선 탐색|Python|트리의 지름|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%ED%8A%B8%EB%A6%AC%EC%9D%98%20%EC%A7%80%EB%A6%84.py)|[바로가기](https://www.acmicpc.net/problem/1167)|
45-
|038|그래프 이론, 데이크스트라, 최단 경로|Python|특정한 최단 경로|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%ED%8A%B9%EC%A0%95%ED%95%9C%20%EC%B5%9C%EB%8B%A8%20%EA%B2%BD%EB%A1%9C.py)|[바로가기](https://www.acmicpc.net/problem/1504)|
46-
|039|그래프 이론, 데이크스트라, 최단 경로|Python|파티|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%ED%8C%8C%ED%8B%B0.py)|[바로가기](https://www.acmicpc.net/problem/1238)|
47-
|040||Python|평범한 배낭|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%ED%8F%89%EB%B2%94%ED%95%9C%20%EB%B0%B0%EB%82%AD.py)|[바로가기](https://www.acmicpc.net/problem/12865)|
48-
|041|그래프 이론, 최단 경로, 플로이드-워셜|Python|플로이드|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%ED%94%8C%EB%A1%9C%EC%9D%B4%EB%93%9C.py)|[바로가기](https://www.acmicpc.net/problem/11404)|
49-
|042|수학, 분할 정복을 이용한 거듭 제곱|Python|피보나치 수 6|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%ED%94%BC%EB%B3%B4%EB%82%98%EC%B9%98%20%EC%88%98%206.py)|[바로가기](https://www.acmicpc.net/problem/11444)|
50-
|043|수학, 분할 정복, 분할 정복을 이용한 거듭제곱, 선형대수학|Python|행렬 제곱|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%ED%96%89%EB%A0%AC%20%EC%A0%9C%EA%B3%B1.py)|[바로가기](https://www.acmicpc.net/problem/10830)|
51-
|044|다이나믹 프로그래밍, 배낭 문제|Python|호텔|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%ED%98%B8%ED%85%94.py)|[바로가기](https://www.acmicpc.net/problem/1106)|
52-
|045|자료 구조, 스택|Python|후위 표기식|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%ED%9B%84%EC%9C%84%20%ED%91%9C%EA%B8%B0%EC%8B%9D.py)|[바로가기](https://www.acmicpc.net/problem/1918)|
30+
|023|구현, 그래프 이론, 브루트포스 알고리즘, 그래프 탐색, 너비 우선 탐색|Python|연구소|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%EC%97%B0%EA%B5%AC%EC%86%8C.py)|[바로가기](https://www.acmicpc.net/problem/14502)|
31+
|024|그래프 이론, 최단 경로, 벨만-포드|Python|웜홀|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%EC%9B%9C%ED%99%80.py)|[바로가기](https://www.acmicpc.net/problem/1865)|
32+
|025|자료 구조, 트리를 사용한 집합과 맵, 우선순위 큐|Python|이중 우선순위 큐|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%EC%9D%B4%EC%A4%91%20%EC%9A%B0%EC%84%A0%EC%88%9C%EC%9C%84%20%ED%81%90.py)|[바로가기](https://www.acmicpc.net/problem/7662)|
33+
|026|그래프 이론, 그래프 탐색, 트리, 재귀|Python|이진 검색 트리|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%EC%9D%B4%EC%A7%84%20%EA%B2%80%EC%83%89%20%ED%8A%B8%EB%A6%AC.py)|[바로가기](https://www.acmicpc.net/problem/5639)|
34+
|027|그래프 이론, 그래프 탐색, 너비 우선 탐색, 깊이 우선 탐색|Python|적록색약|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%EC%A0%81%EB%A1%9D%EC%83%89%EC%95%BD.py)|[바로가기](https://www.acmicpc.net/problem/10026)|
35+
|028|브루트포스 알고리즘|Python|제곱수 찾기|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%EC%A0%9C%EA%B3%B1%EC%88%98%20%EC%B0%BE%EA%B8%B0.py)|[바로가기](https://www.acmicpc.net/problem/1025)|
36+
|029|그래프 이론, 데이크스트라, 최단 경로|Python|최단경로|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%EC%B5%9C%EB%8B%A8%EA%B2%BD%EB%A1%9C.py)|[바로가기](https://www.acmicpc.net/problem/1753)|
37+
|030|그래프 이론, 데이크스트라, 최단 경로|Python|최소비용 구하기 2|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%EC%B5%9C%EC%86%8C%EB%B9%84%EC%9A%A9%20%EA%B5%AC%ED%95%98%EA%B8%B0%202.py)|[바로가기](https://www.acmicpc.net/problem/11779)|
38+
|031|그래프 이론, 데이크스트라, 최단 경로|Python|최소비용 구하기|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%EC%B5%9C%EC%86%8C%EB%B9%84%EC%9A%A9%20%EA%B5%AC%ED%95%98%EA%B8%B0.py)|[바로가기](https://www.acmicpc.net/problem/1916)|
39+
|032|자료구조, 세그먼트 트리|Python|최솟값과 최댓값|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%EC%B5%9C%EC%86%9F%EA%B0%92%EA%B3%BC%20%EC%B5%9C%EB%8C%93%EA%B0%92.py)|[바로가기](https://www.acmicpc.net/problem/2357)|
40+
|033|구현, 그래프 이론, 그래프 탐색, 시뮬레이션, 너비 우선 탐색, 깊이 우선 탐색|Python|치즈|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%EC%B9%98%EC%A6%88.py)|[바로가기](https://www.acmicpc.net/problem/2638)|
41+
|034|구현, 브루트포스 알고리즘|Python|테트로미노|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%ED%85%8C%ED%8A%B8%EB%A1%9C%EB%AF%B8%EB%85%B8.py)|[바로가기](https://www.acmicpc.net/problem/14500)|
42+
|035|그래프 이론, 그래프 탐색, 너비 우선 탐색|Python|토마토|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%ED%86%A0%EB%A7%88%ED%86%A0.py)|[바로가기](https://www.acmicpc.net/problem/7576)|
43+
|036|그래프 이론, 그래프 탐색, 너비 우선 탐색|Python|토마토2|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%ED%86%A0%EB%A7%88%ED%86%A02.py)|[바로가기](https://www.acmicpc.net/problem/7569)|
44+
|037|그래프 이론, 그래프 탐색, 트리, 깊이 우선 탐색|Python|트리의 지름(4)|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%ED%8A%B8%EB%A6%AC%EC%9D%98%20%EC%A7%80%EB%A6%84%284%29.py)|[바로가기](https://www.acmicpc.net/problem/1967)|
45+
|038|그래프 이론, 그래프 탐색, 트리, 깊이 우선 탐색|Python|트리의 지름|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%ED%8A%B8%EB%A6%AC%EC%9D%98%20%EC%A7%80%EB%A6%84.py)|[바로가기](https://www.acmicpc.net/problem/1167)|
46+
|039|그래프 이론, 데이크스트라, 최단 경로|Python|특정한 최단 경로|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%ED%8A%B9%EC%A0%95%ED%95%9C%20%EC%B5%9C%EB%8B%A8%20%EA%B2%BD%EB%A1%9C.py)|[바로가기](https://www.acmicpc.net/problem/1504)|
47+
|040|그래프 이론, 데이크스트라, 최단 경로|Python|파티|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%ED%8C%8C%ED%8B%B0.py)|[바로가기](https://www.acmicpc.net/problem/1238)|
48+
|041||Python|평범한 배낭|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%ED%8F%89%EB%B2%94%ED%95%9C%20%EB%B0%B0%EB%82%AD.py)|[바로가기](https://www.acmicpc.net/problem/12865)|
49+
|042|그래프 이론, 최단 경로, 플로이드-워셜|Python|플로이드|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%ED%94%8C%EB%A1%9C%EC%9D%B4%EB%93%9C.py)|[바로가기](https://www.acmicpc.net/problem/11404)|
50+
|043|수학, 분할 정복을 이용한 거듭 제곱|Python|피보나치 수 6|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%ED%94%BC%EB%B3%B4%EB%82%98%EC%B9%98%20%EC%88%98%206.py)|[바로가기](https://www.acmicpc.net/problem/11444)|
51+
|044|수학, 분할 정복, 분할 정복을 이용한 거듭제곱, 선형대수학|Python|행렬 제곱|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%ED%96%89%EB%A0%AC%20%EC%A0%9C%EA%B3%B1.py)|[바로가기](https://www.acmicpc.net/problem/10830)|
52+
|045|다이나믹 프로그래밍, 배낭 문제|Python|호텔|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%ED%98%B8%ED%85%94.py)|[바로가기](https://www.acmicpc.net/problem/1106)|
53+
|046|자료 구조, 스택|Python|후위 표기식|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold/%ED%9B%84%EC%9C%84%20%ED%91%9C%EA%B8%B0%EC%8B%9D.py)|[바로가기](https://www.acmicpc.net/problem/1918)|
5354

5455

55-
**Update Date 2024/04/26 20:31:54 KST**
56+
**Update Date 2024/04/26 23:11:12 KST**

BAEKJOON/4Platinum.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -8,4 +8,4 @@
88
|001|자료구조, 세그먼트 트리, 느리게 갱신되는 세그먼트 트리|Python|구간 합 구하기 2|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/4Platinum/%EA%B5%AC%EA%B0%84%20%ED%95%A9%20%EA%B5%AC%ED%95%98%EA%B8%B0%202.py)|[바로가기](https://www.acmicpc.net/problem/10999)|
99

1010

11-
**Update Date 2024/04/26 20:31:54 KST**
11+
**Update Date 2024/04/26 23:11:12 KST**

Programmers/Level1.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -63,4 +63,4 @@
6363
|056|연습문제|Python|행렬의 덧셈|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/Programmers/Level1/%ED%96%89%EB%A0%AC%EC%9D%98%20%EB%8D%A7%EC%85%88.py)|[바로가기](https://programmers.co.kr/learn/courses/30/lessons/12950)|
6464

6565

66-
**Update Date 2024/04/26 20:31:54 KST**
66+
**Update Date 2024/04/26 23:11:12 KST**

Programmers/Level2.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -69,4 +69,4 @@
6969
|062|2019 KAKAO BLIND RECRUITMENT|Python|후보키|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/Programmers/Level2/%ED%9B%84%EB%B3%B4%ED%82%A4.py)|[바로가기](https://programmers.co.kr/learn/courses/30/lessons/42890)|
7070

7171

72-
**Update Date 2024/04/26 20:31:54 KST**
72+
**Update Date 2024/04/26 23:11:12 KST**

Programmers/Level3.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -33,4 +33,4 @@
3333
|026|2021 KAKAO BLIND RECRUITMENT|Python|합승 택시 요금|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/Programmers/Level3/%ED%95%A9%EC%8A%B9%20%ED%83%9D%EC%8B%9C%20%EC%9A%94%EA%B8%88.py)|[바로가기](https://school.programmers.co.kr/learn/courses/30/lessons/72413)|
3434

3535

36-
**Update Date 2024/04/26 20:31:54 KST**
36+
**Update Date 2024/04/26 23:11:12 KST**

Programmers/Level4.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -8,4 +8,4 @@
88
|001|이분탐색|Python|징검다리|**풀이안됨**|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/Programmers/Level4/%EC%A7%95%EA%B2%80%EB%8B%A4%EB%A6%AC%20X.py)|[바로가기](https://programmers.co.kr/learn/courses/30/lessons/43236)|
99

1010

11-
**Update Date 2024/04/26 20:31:54 KST**
11+
**Update Date 2024/04/26 23:11:12 KST**

README.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -41,7 +41,7 @@ Action에서 다음과 비슷한 오류가 발생했을 때, [Settings]-[Actions
4141
| :--: |:--: |:--: |:--: |:--: |
4242
|1Bronze|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/1Bronze.md)|24|24|100%|
4343
|2Silver|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/2Silver.md)|102|102|100%|
44-
|3Gold|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold.md)|44|46|96%|
44+
|3Gold|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/3Gold.md)|45|47|96%|
4545
|4Platinum|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/BAEKJOON/4Platinum.md)|01|02|50%|
4646

4747
## 프로그래머스
@@ -64,4 +64,4 @@ Action에서 다음과 비슷한 오류가 발생했을 때, [Settings]-[Actions
6464
|Level3|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/SAMSUNG_SW_Expert_Academy/Level3.md)|59|60|98%|
6565

6666

67-
**Update Date 2024/04/26 20:31:54 KST**
67+
**Update Date 2024/04/26 23:11:12 KST**

SAMSUNG_SW_Expert_Academy/Level1.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -14,4 +14,4 @@
1414
|007|2072|Python|홀수만 더하기|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/SAMSUNG_SW_Expert_Academy/Level1/%ED%99%80%EC%88%98%EB%A7%8C%20%EB%8D%94%ED%95%98%EA%B8%B0.py)|
1515

1616

17-
**Update Date 2024/04/26 20:31:54 KST**
17+
**Update Date 2024/04/26 23:11:12 KST**

SAMSUNG_SW_Expert_Academy/Level2.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -12,4 +12,4 @@
1212
|005|2007|Python|패턴 마디의 길이|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/SAMSUNG_SW_Expert_Academy/Level2/%ED%8C%A8%ED%84%B4%20%EB%A7%88%EB%94%94%EC%9D%98%20%EA%B8%B8%EC%9D%B4.py)|
1313

1414

15-
**Update Date 2024/04/26 20:31:54 KST**
15+
**Update Date 2024/04/26 23:11:12 KST**

SAMSUNG_SW_Expert_Academy/Level3.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -66,4 +66,4 @@
6666
|059|5549|Python|홀수일까 짝수일까|풀이완료|[바로가기](https://github.com/westreed/ProgrammersAlgorithm/blob/main/SAMSUNG_SW_Expert_Academy/Level3/%ED%99%80%EC%88%98%EC%9D%BC%EA%B9%8C%20%EC%A7%9D%EC%88%98%EC%9D%BC%EA%B9%8C.py)|
6767

6868

69-
**Update Date 2024/04/26 20:31:54 KST**
69+
**Update Date 2024/04/26 23:11:12 KST**

0 commit comments

Comments
 (0)