Skip to content

[gyeo-ri] WEEK 07 solutions#2552

Open
gyeo-ri wants to merge 7 commits intoDaleStudy:mainfrom
gyeo-ri:main
Open

[gyeo-ri] WEEK 07 solutions#2552
gyeo-ri wants to merge 7 commits intoDaleStudy:mainfrom
gyeo-ri:main

Conversation

@gyeo-ri
Copy link
Copy Markdown
Contributor

@gyeo-ri gyeo-ri commented Apr 18, 2026

๋‹ต์•ˆ ์ œ์ถœ ๋ฌธ์ œ

์ž‘์„ฑ์ž ์ฒดํฌ ๋ฆฌ์ŠคํŠธ

  • Projects์˜ ์˜ค๋ฅธ์ชฝ ๋ฒ„ํŠผ(โ–ผ)์„ ๋ˆŒ๋Ÿฌ ํ™•์žฅํ•œ ๋’ค, Week๋ฅผ ํ˜„์žฌ ์ฃผ์ฐจ๋กœ ์„ค์ •ํ•ด์ฃผ์„ธ์š”.
  • ๋ฌธ์ œ๋ฅผ ๋ชจ๋‘ ํ‘ธ์‹œ๋ฉด ํ”„๋กœ์ ํŠธ์—์„œ Status๋ฅผ In Review๋กœ ์„ค์ •ํ•ด์ฃผ์„ธ์š”.
  • ์ฝ”๋“œ ๊ฒ€ํ† ์ž 1๋ถ„ ์ด์ƒ์œผ๋กœ๋ถ€ํ„ฐ ์Šน์ธ์„ ๋ฐ›์œผ์…จ๋‹ค๋ฉด PR์„ ๋ณ‘ํ•ฉํ•ด์ฃผ์„ธ์š”.

๊ฒ€ํ† ์ž ์ฒดํฌ ๋ฆฌ์ŠคํŠธ

Important

๋ณธ์ธ ๋‹ต์•ˆ ์ œ์ถœ ๋ฟ๋งŒ ์•„๋‹ˆ๋ผ ๋‹ค๋ฅธ ๋ถ„ PR ํ•˜๋‚˜ ์ด์ƒ์„ ๋ฐ˜๋“œ์‹œ ๊ฒ€ํ† ๋ฅผ ํ•ด์ฃผ์…”์•ผ ํ•ฉ๋‹ˆ๋‹ค!

  • ๋ฐ”๋กœ ์ด์ „์— ์˜ฌ๋ผ์˜จ PR์— ๋ณธ์ธ์„ ์ฝ”๋“œ ๋ฆฌ๋ทฐ์–ด๋กœ ์ถ”๊ฐ€ํ•ด์ฃผ์„ธ์š”.
  • ๋ณธ์ธ์ด ๊ฒ€ํ† ํ•ด์•ผํ•˜๋Š” PR์˜ ๋‹ต์•ˆ ์ฝ”๋“œ์— ํ”ผ๋“œ๋ฐฑ์„ ์ฃผ์„ธ์š”.
  • ํ† ์š”์ผ ์ „๊นŒ์ง€ PR์„ ๋ณ‘ํ•ฉํ•  ์ˆ˜ ์žˆ๋„๋ก ์Šน์ธํ•ด์ฃผ์„ธ์š”.

@dalestudy
Copy link
Copy Markdown
Contributor

dalestudy bot commented Apr 18, 2026

๐Ÿ“Š gyeo-ri ๋‹˜์˜ ํ•™์Šต ํ˜„ํ™ฉ

์ด๋ฒˆ ์ฃผ ์ œ์ถœ ๋ฌธ์ œ

๋ฌธ์ œ ๋‚œ์ด๋„ ์œ ํ˜• ๋ถ„์„
reverse-linked-list Easy โœ… ์˜๋„ํ•œ ์œ ํ˜•

๋ˆ„์  ํ•™์Šต ์š”์•ฝ

  • ํ’€์ดํ•œ ๋ฌธ์ œ: 7 / 75๊ฐœ
  • ์ด๋ฒˆ ์ฃผ ์œ ํ˜• ์ผ์น˜์œจ: 100% (1๋ฌธ์ œ ์ค‘ 1๋ฌธ์ œ ์ผ์น˜)

๋ฌธ์ œ ํ’€์ด ํ˜„ํ™ฉ

์นดํ…Œ๊ณ ๋ฆฌ ์ง„ํ–‰๋„ ์™„๋ฃŒ
Stack โ– โ– โ– โ– โ–กโ–กโ–ก 1 / 2 (Easy 1)
Sliding Window โ– โ– โ–กโ–กโ–กโ–กโ–ก 1 / 3 (Medium 1)
Binary Search โ– โ– โ–กโ–กโ–กโ–กโ–ก 1 / 4 (Easy 1)
Greedy โ– โ– โ–กโ–กโ–กโ–กโ–ก 1 / 4 (Medium 1)
Bit Manipulation โ– โ–กโ–กโ–กโ–กโ–กโ–ก 1 / 5 (Easy 1)
Math โ– โ–กโ–กโ–กโ–กโ–กโ–ก 1 / 5 (Easy 1)
Two Pointers โ– โ–กโ–กโ–กโ–กโ–กโ–ก 2 / 10 (Medium 2)
Hash Table โ– โ–กโ–กโ–กโ–กโ–กโ–ก 3 / 16 (Medium 1, Easy 2)
String โ– โ–กโ–กโ–กโ–กโ–กโ–ก 3 / 19 (Medium 2, Easy 1)
Array โ– โ–กโ–กโ–กโ–กโ–กโ–ก 4 / 36 (Easy 3, Medium 1)
Dynamic Programming โ– โ–กโ–กโ–กโ–กโ–กโ–ก 2 / 18 (Easy 1, Medium 1)
Sorting โ– โ–กโ–กโ–กโ–กโ–กโ–ก 1 / 11 (Easy 1)
Backtracking โ–กโ–กโ–กโ–กโ–กโ–กโ–ก 0 / 3 โ† ์•„์ง ์‹œ์ž‘ ์•ˆ ํ•จ
Binary Search Tree โ–กโ–กโ–กโ–กโ–กโ–กโ–ก 0 / 3 โ† ์•„์ง ์‹œ์ž‘ ์•ˆ ํ•จ
Binary Tree โ–กโ–กโ–กโ–กโ–กโ–กโ–ก 0 / 11 โ† ์•„์ง ์‹œ์ž‘ ์•ˆ ํ•จ
Breadth-First Search โ–กโ–กโ–กโ–กโ–กโ–กโ–ก 0 / 13 โ† ์•„์ง ์‹œ์ž‘ ์•ˆ ํ•จ
Bucket Sort โ–กโ–กโ–กโ–กโ–กโ–กโ–ก 0 / 1 โ† ์•„์ง ์‹œ์ž‘ ์•ˆ ํ•จ
Combinatorics โ–กโ–กโ–กโ–กโ–กโ–กโ–ก 0 / 1 โ† ์•„์ง ์‹œ์ž‘ ์•ˆ ํ•จ
Counting โ–กโ–กโ–กโ–กโ–กโ–กโ–ก 0 / 1 โ† ์•„์ง ์‹œ์ž‘ ์•ˆ ํ•จ
Data Stream โ–กโ–กโ–กโ–กโ–กโ–กโ–ก 0 / 1 โ† ์•„์ง ์‹œ์ž‘ ์•ˆ ํ•จ
Depth-First Search โ–กโ–กโ–กโ–กโ–กโ–กโ–ก 0 / 18 โ† ์•„์ง ์‹œ์ž‘ ์•ˆ ํ•จ
Design โ–กโ–กโ–กโ–กโ–กโ–กโ–ก 0 / 5 โ† ์•„์ง ์‹œ์ž‘ ์•ˆ ํ•จ
Divide and Conquer โ–กโ–กโ–กโ–กโ–กโ–กโ–ก 0 / 6 โ† ์•„์ง ์‹œ์ž‘ ์•ˆ ํ•จ
Graph Theory โ–กโ–กโ–กโ–กโ–กโ–กโ–ก 0 / 5 โ† ์•„์ง ์‹œ์ž‘ ์•ˆ ํ•จ
Hash Function โ–กโ–กโ–กโ–กโ–กโ–กโ–ก 0 / 1 โ† ์•„์ง ์‹œ์ž‘ ์•ˆ ํ•จ
Heap (Priority Queue) โ–กโ–กโ–กโ–กโ–กโ–กโ–ก 0 / 4 โ† ์•„์ง ์‹œ์ž‘ ์•ˆ ํ•จ
Linked List โ–กโ–กโ–กโ–กโ–กโ–กโ–ก 0 / 6 โ† ์•„์ง ์‹œ์ž‘ ์•ˆ ํ•จ
Matrix โ–กโ–กโ–กโ–กโ–กโ–กโ–ก 0 / 7 โ† ์•„์ง ์‹œ์ž‘ ์•ˆ ํ•จ
Memoization โ–กโ–กโ–กโ–กโ–กโ–กโ–ก 0 / 2 โ† ์•„์ง ์‹œ์ž‘ ์•ˆ ํ•จ
Merge Sort โ–กโ–กโ–กโ–กโ–กโ–กโ–ก 0 / 1 โ† ์•„์ง ์‹œ์ž‘ ์•ˆ ํ•จ
Prefix Sum โ–กโ–กโ–กโ–กโ–กโ–กโ–ก 0 / 2 โ† ์•„์ง ์‹œ์ž‘ ์•ˆ ํ•จ
Quickselect โ–กโ–กโ–กโ–กโ–กโ–กโ–ก 0 / 1 โ† ์•„์ง ์‹œ์ž‘ ์•ˆ ํ•จ
Recursion โ–กโ–กโ–กโ–กโ–กโ–กโ–ก 0 / 3 โ† ์•„์ง ์‹œ์ž‘ ์•ˆ ํ•จ
Simulation โ–กโ–กโ–กโ–กโ–กโ–กโ–ก 0 / 1 โ† ์•„์ง ์‹œ์ž‘ ์•ˆ ํ•จ
String Matching โ–กโ–กโ–กโ–กโ–กโ–กโ–ก 0 / 1 โ† ์•„์ง ์‹œ์ž‘ ์•ˆ ํ•จ
Topological Sort โ–กโ–กโ–กโ–กโ–กโ–กโ–ก 0 / 2 โ† ์•„์ง ์‹œ์ž‘ ์•ˆ ํ•จ
Tree โ–กโ–กโ–กโ–กโ–กโ–กโ–ก 0 / 11 โ† ์•„์ง ์‹œ์ž‘ ์•ˆ ํ•จ
Trie โ–กโ–กโ–กโ–กโ–กโ–กโ–ก 0 / 4 โ† ์•„์ง ์‹œ์ž‘ ์•ˆ ํ•จ
Union-Find โ–กโ–กโ–กโ–กโ–กโ–กโ–ก 0 / 4 โ† ์•„์ง ์‹œ์ž‘ ์•ˆ ํ•จ

๐Ÿค– ์ด ๋Œ“๊ธ€์€ GitHub App์„ ํ†ตํ•ด ์ž๋™์œผ๋กœ ์ž‘์„ฑ๋˜์—ˆ์Šต๋‹ˆ๋‹ค.

๐Ÿ”ข API ์‚ฌ์šฉ๋Ÿ‰ (gpt-4.1-nano)
์š”์ฒญ ์ž…๋ ฅ ํ† ํฐ ์ถœ๋ ฅ ํ† ํฐ ํ•ฉ๊ณ„ ๋น„์šฉ
#1 987 34 1,021 $0.000112

Copy link
Copy Markdown
Contributor

Choose a reason for hiding this comment

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

๐Ÿท๏ธ ์•Œ๊ณ ๋ฆฌ์ฆ˜ ํŒจํ„ด ๋ถ„์„

  • ํŒจํ„ด: Recursion
  • ์„ค๋ช…: ์ด ์ฝ”๋“œ๋Š” ์žฌ๊ท€ ํ˜ธ์ถœ์„ ์ด์šฉํ•˜์—ฌ ์—ฐ๊ฒฐ ๋ฆฌ์ŠคํŠธ๋ฅผ ๋’ค์ง‘๋Š” ๋ฐฉ์‹์œผ๋กœ, ๋…ธ๋“œ์˜ ์—ฐ๊ฒฐ์„ ์žฌ๊ท€์ ์œผ๋กœ ๋’ค์ง‘์œผ๋ฉฐ ํ•ด๊ฒฐํ•ฉ๋‹ˆ๋‹ค.

@dalestudy
Copy link
Copy Markdown
Contributor

dalestudy bot commented Apr 18, 2026

๐Ÿ“Š ์‹œ๊ฐ„/๊ณต๊ฐ„ ๋ณต์žก๋„ ๋ถ„์„

reverse-linked-list

โ„น๏ธ ์ด ํŒŒ์ผ์—๋Š” 2๊ฐ€์ง€ ํ’€์ด๊ฐ€ ํฌํ•จ๋˜์–ด ์žˆ์–ด ๊ฐ๊ฐ ๋ถ„์„ํ•ฉ๋‹ˆ๋‹ค.

ํ’€์ด 1: reverseList_recursive โ€” Time: โœ… O(n) โ†’ O(n) / Space: โœ… O(n) โ†’ O(n)
์œ ์ € ๋ถ„์„ ์‹ค์ œ ๋ถ„์„ ๊ฒฐ๊ณผ
Time O(n) O(n) โœ…
Space O(n) O(n) โœ…

ํ”ผ๋“œ๋ฐฑ: ์žฌ๊ท€ ๋ฐฉ์‹์„ ์‚ฌ์šฉํ•˜์—ฌ ๋ฆฌ์ŠคํŠธ๋ฅผ ๋’ค์ง‘๋Š” ๋ฐฉ๋ฒ•์ด ์ง๊ด€์ ์ด๋ฉฐ, ์‹œ๊ฐ„๋ณต์žก๋„๋Š” ํšจ์œจ์ ์ž…๋‹ˆ๋‹ค. ๋‹ค๋งŒ, ์žฌ๊ท€ ํ˜ธ์ถœ๋กœ ์ธํ•œ ์Šคํƒ ๊ณต๊ฐ„ ์‚ฌ์šฉ์ด ์žˆ์œผ๋‹ˆ ์ฐธ๊ณ ํ•˜์„ธ์š”.

๊ฐœ์„  ์ œ์•ˆ: ํ˜„์žฌ ๊ตฌํ˜„์ด ์ ์ ˆํ•ด ๋ณด์ž…๋‹ˆ๋‹ค.

ํ’€์ด 2: reverseList_iterative โ€” Time: O(n) / Space: O(1)
๋ณต์žก๋„
Time O(n)
Space O(1)

ํ”ผ๋“œ๋ฐฑ: ๋ฐ˜๋ณต๋ฌธ์„ ํ™œ์šฉํ•œ ๋ฐฉ๋ฒ•์ด ๊ณต๊ฐ„ ํšจ์œจ์ ์ด๋ฉฐ, ์‹œ๊ฐ„๋ณต์žก๋„๋„ ์ตœ์ ์ž…๋‹ˆ๋‹ค. ์ฃผ์„์— ์–ธ๊ธ‰๋œ ๊ฒƒ์ฒ˜๋Ÿผ ๋ถˆํ•„์š”ํ•œ ๋ฉ”๋ชจ๋ฆฌ ์‚ฌ์šฉ์ด ์—†๊ณ , ์—ฐ๊ฒฐ ๊ด€๊ณ„๋งŒ ๋ณ€๊ฒฝํ•˜๋Š” ๋ฐฉ์‹์ž…๋‹ˆ๋‹ค.

๊ฐœ์„  ์ œ์•ˆ: ํ˜„์žฌ ๊ตฌํ˜„์ด ์ ์ ˆํ•ด ๋ณด์ž…๋‹ˆ๋‹ค.

๐Ÿ’ก ํ’€์ด์— ์‹œ๊ฐ„/๊ณต๊ฐ„ ๋ณต์žก๋„๋ฅผ ์ฃผ์„์œผ๋กœ ๋‚จ๊ฒจ๋ณด์„ธ์š”!


๐Ÿค– ์ด ๋Œ“๊ธ€์€ GitHub App์„ ํ†ตํ•ด ์ž๋™์œผ๋กœ ์ž‘์„ฑ๋˜์—ˆ์Šต๋‹ˆ๋‹ค.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

Development

Successfully merging this pull request may close these issues.

1 participant