Skip to content

[soobing] WEEK 09 Solutions #2573

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

Open
soobing wants to merge 1 commit into
base: main
Choose a base branch
from
Open

[soobing] WEEK 09 Solutions #2573

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions linked-list-cycle/soobing.ts
View file
Open in desktop
Copy link
Copy Markdown
Contributor

@dalestudy dalestudy Bot Apr 27, 2026

Choose a reason for hiding this comment

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

🏷️ 알고리즘 패턴 분석

  • 패턴: Hash Map / Hash Set, Fast & Slow Pointers
  • 설명: 이 코드는 방문한 노드를 저장하는 방식으로 cycle 여부를 판단하며, 주석 처리된 부분은 fast와 slow 포인터를 이용한 cycle 검증 방법을 보여줍니다. 두 패턴 모두 이 문제에 적합합니다.

Original file line number Diff line number Diff line change
@@ -1,3 +1,4 @@
// 3rd try
/**
* 문제 설명
* - 링크드리스트 내에 cycle이 존재하는지 확인하는 문제
Expand Down
Loading