Conversation
Closed
|
우측에 있는 |
Closed
Closed
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
3 participants
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.
Day-15 / 김지호
문제 번호
(Optional) 공유하고 싶은 내용
substring을 구해야 하는 문제는 웬만하면 two pointer / sliding window 통해서 구현되는 듯.
코테를 하다보면, 생각을 오류없이 얼마나 빠르고 정확하게 구현할 수 있는지를 묻는게 많은듯.
특히, 예외Case 처리도 요구하는 능력인듯.