Blind75 - Linked List Manipulation (ํฌ์ธํฐ์ ํ๋ฆ๊ณผ ๊ฐ๊ฒฉ์ ๋ฏธํ)
Linked List (์ฐ๊ฒฐ ๋ฆฌ์คํธ) ํต์ฌ ๊ฐ๋
Linked List (์ฐ๊ฒฐ ๋ฆฌ์คํธ) ํต์ฌ ๊ฐ๋
Core Concepts of Linked Lists
Scalable & Reliable Webhook System Design
Scalable & Reliable Webhook System Design
Scalable URL Shortener System Design
Scalable URL Shortener System Design
Valid Parentheses (์ ํจํ ๊ดํธ)
Valid Parentheses
Longest Repeating Character Replacement (๋์น ํ ๊ฐ์ฅ ๊ธด ๋ฐ๋ณต ๋ฌธ์์ด)
Longest Repeating Character Replacement
Longest Substring Without Repeating Characters (์ค๋ณต ์๋ ๊ฐ์ฅ ๊ธด ๋ถ๋ถ ๋ฌธ์์ด)
Longest Substring Without Repeating Characters
Best Time to Buy and Sell Stock (์ฃผ์ ์ต๋ ์์ต ์ฐพ๊ธฐ)
Best Time to Buy and Sell Stock
Valid Palindrome (ํฐ๋ฆฐ๋๋กฌ ๊ฒ์ฆ)
Valid Palindrome
Container with Most Water (๊ฐ์ฅ ๋ง์ ๋ฌผ์ ๋ด์ ์ ์๋ ์ฉ๊ธฐ)
Container with Most Water
3Sum (์ธ ์์ ํฉ)
Top K Frequent Elements
Longest Consecutive Sequence (๊ฐ์ฅ ๊ธด ์ฐ์๋ ์์)
Longest Consecutive Sequence
Group Anagrams (์๋๊ทธ๋จ ๊ทธ๋ฃนํ)
Group Anagrams
Encode and Decode Strings (๋ฌธ์์ด ์ธ์ฝ๋ฉ๊ณผ ๋์ฝ๋ฉ)
Encode and Decode Strings
Hi there! I am Dongchan Kim
์ผ์, ์ ๋ฒ๊ธฐ์ ํ์์ดํ ๋ฌธ์ ์ด๋ค.
์ฝ๋ฉํ ์คํธ์ Dynamic Programming ๊ณผ์ ์ ํ๋ฒ ์ดํดํด๋ณด์
์ ๋ฒ ๊ธฐ์ ๋ฌธ์ ์ค ํ๋์๋ค. ์์ ์ฐพ๊ธฐ
์ซ์ ์ ์ฌ๊ฐํ
ํจ์จ์ ์ธ ํดํน
์ฒด์คํ ๋ค์ ์น ํ๊ธฐ
๋น์ฐ, ์ ๋ฒ๊ธฐ์ ํ์์ดํ ๋ฌธ์ ์๋ค.
๋จ์ง๋ฒํธ๋ถ์ด๊ธฐ
๋จ๊ฑฐ์ด ๋ถ์ด๋นต
๊ทธ๋๋ก ์ถ๋ ฅํ๊ธฐ 2
๋ฌธ์์ด ๋ด p์ y์ ๊ฐ์
Valid Parentheses (์ ํจํ ๊ดํธ)
Valid Parentheses
Longest Repeating Character Replacement (๋์น ํ ๊ฐ์ฅ ๊ธด ๋ฐ๋ณต ๋ฌธ์์ด)
Longest Repeating Character Replacement
Longest Substring Without Repeating Characters (์ค๋ณต ์๋ ๊ฐ์ฅ ๊ธด ๋ถ๋ถ ๋ฌธ์์ด)
Longest Substring Without Repeating Characters
Best Time to Buy and Sell Stock (์ฃผ์ ์ต๋ ์์ต ์ฐพ๊ธฐ)
Best Time to Buy and Sell Stock
Valid Palindrome (ํฐ๋ฆฐ๋๋กฌ ๊ฒ์ฆ)
Valid Palindrome
3Sum (์ธ ์์ ํฉ)
Longest Consecutive Sequence (๊ฐ์ฅ ๊ธด ์ฐ์๋ ์์)
Longest Consecutive Sequence
Valid Parentheses (์ ํจํ ๊ดํธ)
Valid Parentheses
Longest Repeating Character Replacement (๋์น ํ ๊ฐ์ฅ ๊ธด ๋ฐ๋ณต ๋ฌธ์์ด)
Longest Repeating Character Replacement
Longest Substring Without Repeating Characters (์ค๋ณต ์๋ ๊ฐ์ฅ ๊ธด ๋ถ๋ถ ๋ฌธ์์ด)
Longest Substring Without Repeating Characters
Valid Palindrome (ํฐ๋ฆฐ๋๋กฌ ๊ฒ์ฆ)
Valid Palindrome
Encode and Decode Strings (๋ฌธ์์ด ์ธ์ฝ๋ฉ๊ณผ ๋์ฝ๋ฉ)
Encode and Decode Strings
UTC(Cordinated Universal Time)
ํ๋กํ ์ฝ
๊ตฌ์กฐ์ฒด์ ํ์ฅ๊ณผ ์์ฑ์ ๊ด๋ จ ์ธ๋ถ์ฌํญ ํ์ฅ์์๋ ์์ฑ์๋ฅผ ๊ตฌํํ ์ ์์ง๋ง, ๋ชจ๋ ์์ฑ์๋ฅผ ๊ตฌํํ ์๋ ์๋ค.
๊ตฌ์กฐ์ฒด(struct) and ํด๋์ค(class) ์ด ๋์ ๋ชจ๋ ๊ฐ์ฒด์งํฅ โ ๊ณตํต์ ์ผ๋ก ์์ฑ๊ฐ(properties)์ ๊ฐ๋ค. ์ ์ฅ์์ฑ, ์ง์ฐ(Lazy)์ ์ฅ์์ฑ, ๊ณ์ฐ์์ฑ(Computed), ํ์ ์์ฑ, ์์ฑ ๊ฐ์์(observer)
์ด๊ฑฐํ(Enumerations)
์ค์ํํธ ์ปฌ๋ ์
๊ธฐ์กด ํ์ด์ฌ์ด๋ ์๋ฐ์คํฌ๋ฆฝํธ ๋ฌธ๋ฒ์ ์๊ณ ์๊ธฐ ๋๋ฌธ์, ๋น์ทํ ๋ฐฉ์์ ๋ฌธ๋ฒ๊ตฌ์กฐ์ ๊ด๋ จ๋ ๊ฑด ์คํตํ๊ธฐ๋ก ํ๋ค. ๋ค๋ง Swift์์ ๊ผญ ์์์ผ๋ง ํ๋ ๋ฌธ๋ฒ๊ณผ ์ด ์ธ์ด์ ํน์ง๊ณผ ๊ฐ์ ๋ฌธ๋ฒ๋ค์ ๊ผผ๊ผผํ๊ฒ ๋์ง์ด๋ณด์. (์ฌ์ค ์ด๊ฒ ๋ ์ด๋ ค์;;)
Best Time to Buy and Sell Stock (์ฃผ์ ์ต๋ ์์ต ์ฐพ๊ธฐ)
Best Time to Buy and Sell Stock
Valid Palindrome (ํฐ๋ฆฐ๋๋กฌ ๊ฒ์ฆ)
Valid Palindrome
3Sum (์ธ ์์ ํฉ)
Encode and Decode Strings (๋ฌธ์์ด ์ธ์ฝ๋ฉ๊ณผ ๋์ฝ๋ฉ)
Encode and Decode Strings
Best Time to Buy and Sell Stock (์ฃผ์ ์ต๋ ์์ต ์ฐพ๊ธฐ)
Best Time to Buy and Sell Stock
Container with Most Water (๊ฐ์ฅ ๋ง์ ๋ฌผ์ ๋ด์ ์ ์๋ ์ฉ๊ธฐ)
Container with Most Water
3Sum (์ธ ์์ ํฉ)
Longest Consecutive Sequence (๊ฐ์ฅ ๊ธด ์ฐ์๋ ์์)
Longest Consecutive Sequence
Longest Repeating Character Replacement (๋์น ํ ๊ฐ์ฅ ๊ธด ๋ฐ๋ณต ๋ฌธ์์ด)
Longest Repeating Character Replacement
Longest Substring Without Repeating Characters (์ค๋ณต ์๋ ๊ฐ์ฅ ๊ธด ๋ถ๋ถ ๋ฌธ์์ด)
Longest Substring Without Repeating Characters
Best Time to Buy and Sell Stock (์ฃผ์ ์ต๋ ์์ต ์ฐพ๊ธฐ)
Best Time to Buy and Sell Stock
Longest Consecutive Sequence (๊ฐ์ฅ ๊ธด ์ฐ์๋ ์์)
Longest Consecutive Sequence
HeapSort ๋ฉ์๋ ์ ๋ฆฌ
1. Sorting
Linked List (์ฐ๊ฒฐ ๋ฆฌ์คํธ) ํต์ฌ ๊ฐ๋
Core Concepts of Linked Lists
Container with Most Water (๊ฐ์ฅ ๋ง์ ๋ฌผ์ ๋ด์ ์ ์๋ ์ฉ๊ธฐ)
Container with Most Water
Scalable & Reliable Webhook System Design
Scalable & Reliable Webhook System Design
Scalable URL Shortener System Design
Scalable URL Shortener System Design
Scalable & Reliable Webhook System Design
Scalable & Reliable Webhook System Design
Scalable URL Shortener System Design
Scalable URL Shortener System Design
Scalable & Reliable Webhook System Design
Scalable & Reliable Webhook System Design
Scalable URL Shortener System Design
Scalable URL Shortener System Design
Scalable & Reliable Webhook System Design
Scalable & Reliable Webhook System Design
Scalable URL Shortener System Design
Scalable URL Shortener System Design
Scalable & Reliable Webhook System Design
Scalable & Reliable Webhook System Design
Scalable URL Shortener System Design
Scalable URL Shortener System Design
๋ณธ ๊ธ์ ์์ฑํ AI ๋์์์ด ์์ฑ๋ ๊ธ๋ก ๋ค์ ๊ฑฐ์น ์ ์์ต๋๋ค.
๋๋, ๋๋, ๋ ๋๋? ์ ๋๋ค. ๋ค์ ๋์๋ฆฌ ์์์ง์ ํ๋ค๊ณ ? ๋ ๋๋? -ํดํ ํด์ค-
ํ๋กค๋ก๊ทธ ์ธ๊ฐ์ ๋์ฒดํ ๋งํ AI์ ๋ฐ์ , ๊ฐ๋ฐ์ง์ ์ ๋ง ๋ด๊ฐ ์ํ๊ธด ํ๋์ง, ๊ทธ๋์ T์ํ ์ธ๊ฐ์ด ๋๋์ฒด ๋ญ์ผ๊น์ ๋ํ ํ์๊ฐ ๋ฑ๋ฑ ์ง๋ 1๋ ๋์ ์ฐธ ๋ง์ ๊ฒ๋ค์ ๊ณ ๋ฏผํ๋ฉฐ ์ง๋ด์จ ๊ฒ ๊ฐ๋ค. ์ด๋ฐ ์๊ฐ์ ๋ณด๋ด๋ฉด์, VS code๋ฅผ ๋จ ํ๋ฒ๋ ์ด์ด๋ณด์ง ์์๊ณ , ๊ทธ ์๋ถํ๊ณ ์ด๋ก์์ผ๋ก...
Recently, there have been many tips on how to use ChatGPT effectively on the Internet. This skill is called Prompt Engineering. Some people are very good at ...
Unity ๊ฐ๋ ํ์ต ๋ ๋ฒ์งธ ํฌ์คํ
Unity ๊ฐ๋ ํ์ต ์ฒซ ๋ฒ์งธ ํฌ์คํ
Review of Andrej Karpathyโs X, who is Previously Director of AI @Tesla, founding team @OpenAI
What a fast moving industry! MCP totally changes whole the industy!๐คฏโ
Donโt Think AI Is Taking Engineer Jobs! Itโs Empowering Me!๐ โ
Top K Frequent Elements
Group Anagrams (์๋๊ทธ๋จ ๊ทธ๋ฃนํ)
Group Anagrams
Three.js๋ฅผ ์ด์ฉํ 3D ํ๋ซํผ ๊ฐ๋ฐ ๊ฐ๋ ๊ณต๋ถ
Three.js๋ฅผ ์ด์ฉํ 3D ํ๋ซํผ ๊ฐ๋ฐ ๊ฐ๋ ๊ณต๋ถ
Three.js๋ฅผ ์ด์ฉํ 3D ํ๋ซํผ ๊ฐ๋ฐ ๊ฐ๋ ๊ณต๋ถ
Three.js๋ฅผ ์ด์ฉํ 3D ํ๋ซํผ ๊ฐ๋ฐ ๊ฐ๋ ๊ณต๋ถ
Three.js๋ฅผ ์ด์ฉํ 3D ํ๋ซํผ ๊ฐ๋ฐ ๊ฐ๋ ๊ณต๋ถ
Three.js๋ฅผ ์ด์ฉํ 3D ํ๋ซํผ ๊ฐ๋ฐ ๊ฐ๋ ๊ณต๋ถ
Unity ๊ฐ๋ ํ์ต ๋ง์ง๋ง ํฌ์คํ
Unity ๊ฐ๋ ํ์ต ๋ง์ง๋ง ํฌ์คํ
Unity ๊ฐ๋ ํ์ต ๋ง์ง๋ง ํฌ์คํ
Unity ๊ฐ๋ ํ์ต ๋ง์ง๋ง ํฌ์คํ
ํด์ฑ (Hashing)
BinarySearchTree๋ ์ฝ์ , ์ญ์ , ๊ฒ์์์ ํ๊ท ์ ์ผ๋ก O(log n)์ ์๊ฐ ๋ณต์ก๋๋ฅผ ๊ฐ์ง๋ค. ๊ทธ๋ฌ๋ ์ต์ ์ ๊ฒฝ์ฐ์๋ O(n) ์๊ฐ ๋ณต์ก๋๋ฅผ ๊ฐ์ง ์ ์๋ค. ์ด๋ Array, ArrayList, LinkedList์ ํ๊ท O(n) ์ฑ๋ฅ๋ณด๋ค ํจ์ฌ ์ข๋ค.
Understand binary-tree concepts and important properties, such as the Binary Tree Theorem and the External Path Length Theorem. Be able to perfor...
Encode and Decode Strings (๋ฌธ์์ด ์ธ์ฝ๋ฉ๊ณผ ๋์ฝ๋ฉ)
Encode and Decode Strings
Container with Most Water (๊ฐ์ฅ ๋ง์ ๋ฌผ์ ๋ด์ ์ ์๋ ์ฉ๊ธฐ)
Container with Most Water
Valid Parentheses (์ ํจํ ๊ดํธ)
Valid Parentheses
Scalable & Reliable Webhook System Design
Scalable & Reliable Webhook System Design
Linked List (์ฐ๊ฒฐ ๋ฆฌ์คํธ) ํต์ฌ ๊ฐ๋
Core Concepts of Linked Lists
Linked List (์ฐ๊ฒฐ ๋ฆฌ์คํธ) ํต์ฌ ๊ฐ๋
Core Concepts of Linked Lists
Hi there! I am Dongchan Kim
Hi there! I am Dongchan Kim
์ค์ํํธ ์ปฌ๋ ์
์ด๊ฑฐํ(Enumerations)
๊ตฌ์กฐ์ฒด์ ํ์ฅ๊ณผ ์์ฑ์ ๊ด๋ จ ์ธ๋ถ์ฌํญ ํ์ฅ์์๋ ์์ฑ์๋ฅผ ๊ตฌํํ ์ ์์ง๋ง, ๋ชจ๋ ์์ฑ์๋ฅผ ๊ตฌํํ ์๋ ์๋ค.
GIF๋ ์ด์ง๊ฐํ๋ฉด ์ฌ๋ฆฌ์ง ๋ง์โฆ ํ๊ณ ๋ก์ ์ฌ๋ฆฌ๋ฉด์ ์์ ๋ฐ์ดํฐ๋ ์ฌ๋ฆด ์๊ฐ ์์ด์ MOV ํ์ผ์ Gif๋ก ๋ณํํ์ฌ ๊นํ๋ธ์ push๋ฅผ ํ๋ค.
ํ๋กํ ์ฝ
โ 2019. JungHyun Han Korea University Seoul, All rights reserved.
โ 2019. JungHyun Han Korea University Seoul, All rights reserved.
โ 2019. JungHyun Han Korea University Seoul, All rights reserved.
โ 2019. JungHyun Han Korea University Seoul, All rights reserved.
โ 2019. JungHyun Han Korea University Seoul, All rights reserved.
โ 2019. JungHyun Han Korea University Seoul, All rights reserved.
โ 2019. JungHyun Han Korea University Seoul, All rights reserved.
โ 2019. JungHyun Han Korea University Seoul, All rights reserved.
โ 2019. JungHyun Han Korea University Seoul, All rights reserved.
โ 2019. JungHyun Han Korea University Seoul, All rights reserved.
โ 2019. JungHyun Han Korea University Seoul, All rights reserved.
โ 2019. JungHyun Han Korea University Seoul, All rights reserved.
Stack(LIFO) ๋ฐ์ดํฐ์ ์ ๋ ฅ๊ณผ ์ถ๋ ฅ ์์๋ ํ์ ์ ์ถ(FILO)๋ฐฉ์์ด๋ค. ๋ฐ์ดํฐ๋ฅผ ์ ํ์ ์ผ๋ก ์ ๊ทผํ ์ ์๋ ๊ตฌ์กฐ์ด๊ณ , ํ์ชฝ ๋์์๋ง ์๋ฃ๋ฅผ ๋ฃ๊ฑฐ๋ ๋บ ์ ์๋ ๊ตฌ์กฐ (DFS) ์คํ์ ๊ฑฐ์ ๋ชจ๋ ์ ํ๋ฆฌ์ผ์ด์ ์ ๋ง๋ค ๋ ์ฌ์ฉ๋๋ ์๋ฃ๊ตฌ์กฐ๋ก์, ์คํ๊ณผ ์ฐ๊ด๋ ์๊ณ ๋ฆฌ์ฆ์ ์ ๋...
Unity ๊ฐ๋ ํ์ต ์ธ ๋ฒ์งธ ํฌ์คํ
Unity ๊ฐ๋ ํ์ต ๋ค ๋ฒ์งธ ํฌ์คํ
Unity ๊ฐ๋ ํ์ต ๋ค์ฏ ๋ฒ์งธ ํฌ์คํ
Unity ๊ฐ๋ ํ์ต ์ฌ์ฏ ๋ฒ์งธ ํฌ์คํ
Three.js๋ฅผ ์ด์ฉํ 3D ํ๋ซํผ ๊ฐ๋ฐ ๊ฐ๋ ๊ณต๋ถ
Three.js๋ฅผ ์ด์ฉํ 3D ํ๋ซํผ ๊ฐ๋ฐ ๊ฐ๋ ๊ณต๋ถ
Three.js๋ฅผ ์ด์ฉํ 3D ํ๋ซํผ ๊ฐ๋ฐ ๊ฐ๋ ๊ณต๋ถ
ํ๋ฃจ์ข ์ผ ์ฝ์งํ ํ๋ซํผ ํฌ๋๋ฌธ์
Three.js๋ฅผ ์ด์ฉํ 3D ํ๋ซํผ ๊ฐ๋ฐ ๊ฐ๋ ๊ณต๋ถ
Three.js๋ฅผ ์ด์ฉํ 3D ํ๋ซํผ ๊ฐ๋ฐ ๊ฐ๋ ๊ณต๋ถ
์ฝ๋ฉํ ์คํธ์ Greedy ๊ณผ์ ์ ํ๋ฒ ์ดํดํด๋ณด์
Three.js๋ฅผ ์ด์ฉํ 3D ํ๋ซํผ ๊ฐ๋ฐ ๊ฐ๋ ๊ณต๋ถ
Three.js๋ฅผ ์ด์ฉํ 3D ํ๋ซํผ ๊ฐ๋ฐ ๊ฐ๋ ๊ณต๋ถ
์ฝ๋ฉํ ์คํธ์ brute force ๊ณผ์ ์ ํ๋ฒ ์ดํดํด๋ณด์
Unity์์ Prefab์ ์ฒ์ ๋ง๋ค์ด๋ณด๋ฉด์ ๊ณต๋ถํ ๋ด์ฉ์ ๊ธฐ๋กํด๋๋ค.
Unity์์ Collider๋ฅผ ์ฒ์ ๋ง๋ค์ด๋ณด๋ฉด์ ๊ณต๋ถํ ๋ด์ฉ์ ๊ธฐ๋กํด๋๋ค.
Unity์์ Game Manager๋ฅผ ์ฒ์ ๋ง๋ค์ด๋ณด๋ฉด์ ๊ณต๋ถํ ๋ด์ฉ์ ๊ธฐ๋กํด๋๋ค.
Donโt Think AI Is Taking Engineer Jobs! Itโs Empowering Me!๐ โ
What a fast moving industry! MCP totally changes whole the industy!๐คฏโ
Review of Andrej Karpathyโs X, who is Previously Director of AI @Tesla, founding team @OpenAI
Understand binary-tree concepts and important properties, such as the Binary Tree Theorem and the External Path Length Theorem. Be able to perfor...
BinarySearchTree๋ ์ฝ์ , ์ญ์ , ๊ฒ์์์ ํ๊ท ์ ์ผ๋ก O(log n)์ ์๊ฐ ๋ณต์ก๋๋ฅผ ๊ฐ์ง๋ค. ๊ทธ๋ฌ๋ ์ต์ ์ ๊ฒฝ์ฐ์๋ O(n) ์๊ฐ ๋ณต์ก๋๋ฅผ ๊ฐ์ง ์ ์๋ค. ์ด๋ Array, ArrayList, LinkedList์ ํ๊ท O(n) ์ฑ๋ฅ๋ณด๋ค ํจ์ฌ ์ข๋ค.
Priority Queue
Priority Queue
In April 2025, SK Telecom faced a major security breach involving unauthorized access to USIM data. This article analyzes the timeline, response gaps, and ke...
In April 2025, SK Telecom faced a major security breach involving unauthorized access to USIM data. This article analyzes the timeline, response gaps, and ke...
1. Sorting
1. Sorting
1. Sorting
1. Sorting
HeapSort ๋ฉ์๋ ์ ๋ฆฌ
HeapSort ๋ฉ์๋ ์ ๋ฆฌ
Recently, there have been many tips on how to use ChatGPT effectively on the Internet. This skill is called Prompt Engineering. Some people are very good at ...
ํด์ฑ (Hashing)
ํด์ฑ (Hashing)
ํด์ฑ (Hashing)
Dynamic Programming
Graph ์ฐ๋ฆฌ๊ฐ ํํ ์๊ฐํ๋ โ๊ทธ๋ํ(chart)โ๊ฐ ์๋๋ผ, ์์ ๊ฐ์ ๊ด๊ณ๋ฅผ ํํํ๋ ์๋ฃ๊ตฌ์กฐ์. ์ฌ๋ฌ ์์๊ฐ ์ด๋ป๊ฒ ์ฐ๊ฒฐ๋์ด ์๋์ง๋ฅผ ํํํจ. ์์: SNS์์ ์ฌ์ฉ์๋ ์๋ก ํ๋ก์ฐํ๊ฑฐ๋ ํ๋ก์ฐ๋นํจ โ ๋จ์ ๋ฐฐ์ด์ด๋ ํธ๋ฆฌ๋ก๋ ํํ์ด ์ด๋ ค์.
Top K Frequent Elements
Top K Frequent Elements