Skip to content

[Sehwan] Week7 solution with JavaScript #129

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

Merged
merged 6 commits into from
Jun 16, 2024
Merged

Conversation

nhistory
Copy link
Contributor

@nhistory nhistory commented Jun 10, 2024

  • 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

@nhistory nhistory changed the title Added reorderList solution [Sehwan] Week7 solution with JavaScript Jun 10, 2024
Copy link
Contributor

Choose a reason for hiding this comment

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

노드가 아니라 값을 변경해서 해결하신걸까요?

Copy link
Contributor Author

Choose a reason for hiding this comment

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

네 맞습니다. 근데 문제를 보니 값을 바꾸지 않고 풀라는 언급이 있었네요. ㅎㅎ
그래서 노드를 수정하는 솔루션을 추가하였습니다.

Copy link
Contributor

Choose a reason for hiding this comment

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

넵! 저도 reverse linked list 문제에서 노드 대신 값을 바꾸는 솔루션으로 문제를 풀었는데 달레님께서 그건 문제에서 list를 뒤집으라는 본질과 벗어난다는 피드백을 받았었습니다!

@nhistory nhistory marked this pull request as ready for review June 16, 2024 03:32
@nhistory nhistory merged commit 1061d0d into DaleStudy:main Jun 16, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
No open projects
Status: Done
Development

Successfully merging this pull request may close these issues.

2 participants