Skip to content

[Invidam] Week 7 #132

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.

Sign up for GitHub

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

Jump to bottom
Merged
merged 5 commits into from
Jun 16, 2024
Merged

[Invidam] Week 7 #132

merged 5 commits into from
Jun 16, 2024

Conversation

Invidam
Copy link
Contributor

@Invidam Invidam commented Jun 11, 2024 •
edited
Loading

Status

  • Reorder List
  • Remove Nth Node From End of List
  • Lowest Common Ancestor of a Binary Search Tree
  • Binary Tree Level Order Traversal
  • Validate Binary Search Tree

PR Points

  • 풀이(글)에 어색한 부분이 있는지 봐주세요!
  • GoLang을 구경해주세요(?) ㅋㅋㅋ

@Invidam Invidam self-assigned this Jun 11, 2024
@Invidam Invidam marked this pull request as draft June 11, 2024 06:18
@Invidam Invidam marked this pull request as ready for review June 14, 2024 03:23
@sounmind sounmind self-requested a review June 15, 2024 02:49
sounmind
sounmind approved these changes Jun 15, 2024
View reviewed changes
Copy link
Member

@sounmind sounmind left a comment •
edited
Loading

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

와, 너무 정리 잘해주셨네요! 이번 주도 고생하셨습니다☺️

@Invidam Invidam merged commit a944a26 into DaleStudy:main Jun 16, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers

@sounmind sounmind sounmind approved these changes

Assignees

@Invidam Invidam

Labels
None yet
Projects
No open projects
리트코드 스터디 1기
Status: Done
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.
2 participants
@Invidam @sounmind