Merged
Conversation
TonyKim9401
reviewed
Jan 31, 2025
Contributor
There was a problem hiding this comment.
n의 범위가 int 로 정해져 있으니, 이를 이용해서 32자릿수를 모두 대조해보는 기똥찬 접는 방법이네요!
Contributor
Author
There was a problem hiding this comment.
이번주 문제들이 제 입장에선 꽤 어렵고 생소해서 칭찬해주신 풀이법 모두 달레님의 풀이를 그대로 쓴거라 민망하긴 하지만...ㅎㅎㅎ
감사한 코치님들 격려 덕분에 그래도 어떻게 매주 삐걱삐걱 해내고 있는거 같네요!
다음 주부터 하드 난이도 문제도 추가되서 좀 두렵지만 더 열심히 해보겠습니다
TonyKim9401
approved these changes
Jan 31, 2025
Contributor
TonyKim9401
left a comment
There was a problem hiding this comment.
8주차 문제 풀이 고생하셨습니다.
Number of 1 bits 문제 풀이 방식이 참신하다고 생각되어 디스코드에 공유하였습니다 ㅎㅎ
9주차 문제 풀이도 파이팅입니다! 이제 얼마 안남았어요 :)
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
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.
답안 제출 문제
체크 리스트
In Review로 설정해주세요.