Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

[BinarySearch/UnionFind] leetcode/inudev5.kt #1076

Open
wants to merge 9 commits into
base: master
Choose a base branch
from

Conversation

nerdyinu
Copy link

@nerdyinu nerdyinu commented Feb 1, 2023

이분탐색은 어려운 난이도 위주로, UnionFind는 쉬운 난이도 위주로 풀었습니다.
이분탐색이 난이도가 어려울 수록 응용해야할 부분이 늘어나는 것 같아서 연습이 되는 것 같습니다.
알고리즘 아이디어라던가 풀이도 추가할 수 있도록 하겠습니다.
양식에 틀린점 있으면 지적 부탁드립니다.

@nerdyinu nerdyinu changed the title [BinarySearch] Find K-th Smallest Pair Distance 외 1문제 leetcode hard kotlin [UnionFind] The Earliest Moment When Everyone Become Friends 외 2문제 leetcode medium kotlin [BinarySearch/UnionFind] :leetcode: :hard: :kotlin: Feb 1, 2023
@nerdyinu nerdyinu changed the title [BinarySearch/UnionFind] :leetcode: :hard: :kotlin: [BinarySearch/UnionFind] leetcode/inudev5.kt Feb 1, 2023
@nerdyinu nerdyinu closed this Feb 1, 2023
@nerdyinu nerdyinu reopened this Feb 1, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant