Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
푼 문제
프로그래머스 - 컬러링북
백준 - 25307
BFS라는 알고리즘을 동일하게 활용하여 이차원 배열 내에서 영역의 갯수나 최단거리를 구하는 문제들이었음
[프로그래머스 - 멀쩡한 사각형] : 최대공약수를 활용하여 특정한 규칙을 찾아야 하는 문제
[백준 - 13415] : 단순한 정렬문제가 아님. 기준에 따라 덱을 활용하여 성능을 향상시켜 정렬