| 노드깊이 II |
All Kinds of Node Depths |
Trees |
Medium |
366 |
29 |
25 |
63a5ff6a-14a6-498a-802c-5362e12e7e19 |
| 아파트 헌팅 |
Apartment Hunting |
Arrays |
Hard |
424 |
58 |
50 |
bdd555e1-dbba-419d-b5c5-6f5f8d2d8046 |
| 제품 배열 |
Array of Products |
Arrays |
Medium |
339 |
25 |
22 |
29bfed37-34d2-4f7a-9174-41c066710b88 |
| 균형괄호 |
Balance Brackets |
Other Data Structures |
Medium |
283 |
13 |
12 |
33737485-bc54-4d41-85ee-16804331decd |
| 균등분할 |
Balanced Split |
Sorting |
Medium |
317 |
41 |
37 |
dca6bc2f-0709-4af5-b3fc-0bc0caa19e9f |
| 이진수정렬 |
Binary Array Sorting |
Sorting |
Easy |
352 |
13 |
12 |
1d528165-29ad-4786-bb9d-80f0d00e9a44 |
| 이진검색 |
Binary Search |
Search |
Easy |
312 |
13 |
11 |
fa284555-9fa3-41ca-9769-54148c7b7839 |
| 직경 |
Binary Tree Diameter |
Trees |
Medium |
361 |
18 |
15 |
3d0be02d-27bf-4487-9d65-bcc21ca6d1ff |
| 보글보드 |
Boggle Board |
Graphs |
Hard |
357 |
29 |
27 |
a191353b-e04c-4326-824a-1dabffc28959 |
| 가지합 |
Branch Sums |
Trees |
Easy |
273 |
16 |
13 |
f43bd3aa-72ac-4225-b0ec-0093e74f738f |
| Breadth-First Search (Tree) |
Breadth-First Search |
Graphs |
Easy |
324 |
27 |
22 |
d892024f-cb85-4583-8168-700403534e83 |
| Breadth-First Search (Graph) |
Breadth-First Search for a Graph |
Graphs |
Easy |
398 |
41 |
35 |
2fbd1c69-3bfe-4842-8358-37d66acb7a5e |
| Heap 건설 |
Building Heap from Array |
Other Data Structures |
Medium |
325 |
34 |
32 |
62955f2c-35d0-4500-bd6a-f0a3b7957fef |
| 대소문자정렬 |
Case Specific Sorting |
Sorting |
Medium |
267 |
20 |
16 |
370c6495-5582-4c18-a012-7beb7695cf1b |
| 환전 |
Change in a Foreign Currency |
Recursion |
Easy |
316 |
18 |
17 |
0174901c-a84f-431e-b5f1-6ff05223b255 |
| 클래스사진 |
Class Photos |
Greedy Algorithms |
Easy |
286 |
19 |
13 |
a0c40fc6-ed97-4f35-99b2-f9022a874fc0 |
| 잎사귀 여행 |
Compare Leaf Traversal |
Trees |
Hard |
396 |
25 |
21 |
8b9fd5fc-4237-4f54-86f6-a75d3a66f5d9 |
| 연속 부분배열 |
Contiguous Subarrays |
Arrays |
Medium |
368 |
68 |
62 |
29f5de20-a7df-4194-b297-a865ebe30e1d |
| 반전 카운트 |
Count Inversions |
Sorting |
Hard |
313 |
36 |
30 |
a80ba629-ca5e-4c42-a17c-2082122b3302 |
| 삼각형수 |
Counting Triangles |
Sorting |
Easy |
283 |
17 |
14 |
53e1c8e7-6f23-48a4-a80f-de48d37b1cb2 |
| 순환주기 그래프 |
Cycle in Graph |
Graphs |
Medium |
355 |
11 |
10 |
9bfe19e6-33c8-454b-bb03-f28ebd35bfde |
| Depth-First Search (Tree) |
Depth-First Search |
Graphs |
Medium |
291 |
30 |
25 |
8242a88d-9e9d-4243-b812-6ee1fa261f5a |
| Depth-First Search (Graph) |
Depth-First Search for a Graph |
Graphs |
Medium |
736 |
49 |
37 |
edeb2e6f-ba52-416f-8f2d-9792a1653b9d |
| 차익거래감지 |
Detect Arbitrage |
Graphs |
Hard |
284 |
28 |
26 |
c79d939a-d4d7-45fe-b274-71644e84725c |
| Dijkstra 알고리즘 |
Dijkstra's Algorithm |
Graphs |
Hard |
320 |
43 |
31 |
f3a9d0bc-c0a4-4620-8f1e-a20844888b3b |
| 디스크쌓기 |
Disk Stacking |
Dynamic Programming |
Medium |
286 |
34 |
30 |
5a4b41a3-a998-4425-9f4b-eca314b16ded |
| 요소바꾸기 |
Element Swapping |
Greedy Algorithms |
Hard |
339 |
15 |
13 |
546f658f-f529-4f45-89f8-ab1df09c489b |
| 암호문자 |
Encrypted Words |
Recursion |
Easy |
321 |
33 |
31 |
54fb0acf-ad06-41a8-ae78-d68e759c5f3e |
| 친구찾기 |
Find Closest Value in BST |
Trees |
Easy |
337 |
39 |
19 |
dc68f8c6-9dae-4808-b403-e7e75b481ef9 |
| k번째 자식찾기 |
Find kth Largest Value in BST |
Trees |
Medium |
324 |
16 |
13 |
0c5f3b10-9631-41e3-b4bc-1662c32d7eca |
| 루프찾기 |
Find Loop |
Linked Lists |
Medium |
295 |
32 |
17 |
e9641580-dca5-4964-8b81-3e241217a156 |
| K거리 노드찾기 |
Find Nodes Distance K |
Trees |
Hard |
484 |
34 |
32 |
71dc1ee6-4123-4981-82e5-9833d999e7d0 |
| 후계자 찾기 |
Find Successor |
Trees |
Medium |
390 |
21 |
17 |
5f1a6274-d4a8-4ba2-b9a3-a625525591f1 |
| 3큰수 찾기 |
Find Three Largest Numbers |
Search |
Easy |
352 |
14 |
11 |
2784e572-0870-4974-950a-cbe8770aa047 |
| 첫번째 중복값 |
First Duplicate Value |
Arrays |
Medium |
352 |
18 |
17 |
07909752-ca94-4e73-b68c-9b25b985d23d |
| 단한글자 |
First Non-Repeating Character |
Strings |
Easy |
259 |
11 |
10 |
e05695eb-6b14-4197-b467-fd6cc037af9c |
| 쫙펴기 |
Flatten Binary Tree |
Trees |
Hard |
347 |
22 |
19 |
4ef6f1dc-567b-4f36-9692-356796c67598 |
| 4 숫자의 합 |
Four Number Sum |
Arrays |
Hard |
470 |
26 |
24 |
d5b2d436-9fa5-4d89-a0d4-36bc5dec4a6e |
| 빈도정렬 |
Frequency Sorting |
Sorting |
Medium |
241 |
31 |
28 |
44fbfb95-ed85-4932-977d-47b6252fbdc3 |
| DIV 만들기 |
Generate Div Tags |
Recursion |
Hard |
326 |
14 |
12 |
ebc6b388-bca5-4fdc-98ca-1eca1894b974 |
| 문서만들기 |
Generate Document |
Strings |
Easy |
234 |
31 |
28 |
001e33d1-c5b3-496b-9f46-ec1a9d12008a |
| 단어수수께끼 |
Group Anagrams |
Strings |
Medium |
347 |
26 |
22 |
7929f0a9-258e-4b45-916d-6f31eefca5cf |
| 균형나무 |
Height Balanced Binary Tree |
Trees |
Medium |
309 |
36 |
34 |
03b41c72-4927-48b4-b011-4ee71edb6502 |
| 인덱스==값 |
Index Equals Value |
Search |
Medium |
311 |
14 |
13 |
4947883d-b0d5-43fb-ba36-a153a927bd37 |
| 문자열 짜집기 |
Interweaving Strings |
Dynamic Programming |
Hard |
459 |
63 |
59 |
e0b4b7d2-b763-4bbd-a440-d01f8145a22e |
| 뒤집기 |
Invert Binary Tree |
Trees |
Easy |
232 |
15 |
14 |
54982c70-8007-429d-9f32-37288f2d5efa |
| Kadane 알고리즘 |
Kadane's Algorithm |
Dynamic Programming |
Medium |
407 |
20 |
17 |
aea5dd58-e554-4a16-85f6-b14302747baf |
| Knapsack 문제 |
Knapsack Problem |
Dynamic Programming |
Medium |
333 |
34 |
29 |
878a10e2-59ca-477c-be56-06b82b9776e5 |
| Knuth-Morris-Pratt 알고리즘 |
Knuth-Morris-Pratt Algorithm |
Strings |
Hard |
283 |
56 |
53 |
8f0ca5d6-892d-46a3-9c62-cc55076bb13d |
| 노트북대여 |
Laptop Rentals |
Other Data Structures |
Hard |
243 |
18 |
15 |
56778d96-2734-49eb-a899-17d540f38a56 |
| 최대 범위 |
Largest Range |
Arrays |
Hard |
376 |
47 |
45 |
d06883f6-3bfc-4ac4-849b-abb98b91f9ab |
| 최대공간 |
Largest Rectangle Under Skyline |
Other Data Structures |
Hard |
328 |
46 |
42 |
434c475b-84c3-43da-aaeb-3c6387a0df8c |
| 최대 세곱 |
Largest Triple Products |
Other Data Structures |
Easy |
268 |
18 |
14 |
63d8f371-3eab-4f1c-b607-8511b640e6d0 |
| 가장 왼쪽 1 |
Leftmost One |
Search |
Medium |
253 |
19 |
15 |
e8882c9c-a57e-40f1-8d55-e6dc304beb9a |
| Levenshtein 거리 |
Levenshtein Distance |
Dynamic Programming |
Easy |
458 |
23 |
20 |
92eb0b84-5cb1-4d11-8530-6bc0fdc00ba1 |
| 점 통과 선 |
Line Through Points |
Arrays |
Hard |
424 |
37 |
36 |
c77dfa69-ef0e-41c0-bcd5-169ff181f551 |
| 팔린드롬 |
Linked List Palindrome |
Linked Lists |
Hard |
301 |
13 |
10 |
7ea54cf7-7a73-43f3-b3a5-333bd66eb87d |
| 가장긴 균형괄호 |
Longest Balanced Substring |
Strings |
Hard |
446 |
18 |
17 |
f66151b1-0dcd-4a5e-9b27-7dd322427f47 |
| 최대공통부분문자열 |
Longest Common Subsequence |
Dynamic Programming |
Medium |
287 |
30 |
27 |
2f5bb51a-d674-4249-8a34-0b8ca1254d93 |
| 최대증가부분수열 |
Longest Increasing Subsequence |
Dynamic Programming |
Hard |
318 |
30 |
29 |
df4c8ee1-ba20-4048-820d-8a450712a3f0 |
| 가장긴 Palindrome |
Longest Palindromic Substring |
Strings |
Medium |
368 |
45 |
38 |
c981a480-28af-421d-adc0-77069519bddf |
| 가장 긴 피크 |
Longest Peak |
Arrays |
Medium |
651 |
37 |
31 |
451b794e-44ea-4b04-a953-fce025aff168 |
| 최대글자체인 |
Longest String Chain |
Dynamic Programming |
Hard |
347 |
82 |
81 |
54125fdf-fba8-4f47-8a82-f88c6b3027d3 |
| 가장긴 하위문자열 |
Longest Substring without Duplication |
Strings |
Hard |
349 |
34 |
30 |
666c719e-13e3-4955-ac64-cf21b1589a35 |
| 마법의 캔디백 |
Magical Candy Bags |
Other Data Structures |
Easy |
304 |
30 |
22 |
2e832732-d15f-4aee-9463-75807e27ea70 |
| 주류 |
Majority Element |
Other Data Structures |
Easy |
330 |
21 |
19 |
189cf214-5463-4657-8778-b6f337ce7256 |
| Map |
Map Example |
Other Data Structures |
Easy |
414 |
11 |
0 |
44baaca7-07e5-43b6-b021-62f014cc3758 |
| 짝꿍 |
Matching Pairs |
Strings |
Medium |
272 |
34 |
30 |
dd69169b-1294-482c-b867-a52205da1530 |
| 최대경로 |
Max Path Sum in Binary Tree |
Trees |
Hard |
527 |
24 |
21 |
27914402-f57d-4874-97d9-8916a239a794 |
| K거래의 최대이익 |
Max Profit with K Transactions |
Dynamic Programming |
Hard |
366 |
21 |
20 |
9a947131-807b-448f-a4b1-699450953a96 |
| 인접없는 최대하위집합 |
Max Subset Sum No Adjacent |
Dynamic Programming |
Easy |
359 |
17 |
13 |
9e049768-f822-4a17-bd6d-b3e33575737c |
| 증가부분수열의 최대합 |
Max Sum Increasing Subsequence |
Dynamic Programming |
Medium |
324 |
57 |
37 |
57288c92-1ec7-4191-8e49-03079c2ad5a8 |
| 하위배열 최대합 |
Max Sum Submatrix |
Dynamic Programming |
Medium |
564 |
25 |
23 |
1f334109-5dfd-4d5a-9f08-70be7cfc2a2b |
| 최대표현 |
Maximize Expression |
Dynamic Programming |
Medium |
283 |
29 |
27 |
eb1f39c6-d85c-42e9-91f3-36be00e344a8 |
| 중앙줄기 |
Median Stream |
Other Data Structures |
Easy |
284 |
16 |
15 |
8d2f1cb0-ea2e-4b7c-9249-0319aa8f3706 |
| 합병 |
Merge Linked List |
Linked Lists |
Medium |
319 |
18 |
12 |
6bdce984-944e-4449-bbc3-81dbad6988a5 |
| 중복간격 합치기 |
Merge Overlapping Intervals |
Arrays |
Medium |
460 |
17 |
10 |
6c556707-6acf-4dfb-a864-8d4cf94947c0 |
| 합치기 |
Merge Sorted Arrays |
Other Data Structures |
Hard |
309 |
21 |
18 |
47af8151-fcf1-4630-b44a-c610ab1d2e62 |
| 꼬마 BST |
Min Height BST |
Trees |
Medium |
326 |
33 |
29 |
90c205a6-26b1-480c-a53c-779c073dc37a |
| 잔돈의 최소갯수 |
Min Number of Coins for Change |
Dynamic Programming |
Easy |
379 |
30 |
28 |
c828c69d-6e63-4c5e-8252-c782666ae7bd |
| 최소점프 |
Min Number of Jumps |
Dynamic Programming |
Medium |
350 |
26 |
25 |
64d115a3-2bd7-49ae-8ffe-9d68ef019c3e |
| 최소한의 보상 |
Min Rewards |
Arrays |
Hard |
380 |
22 |
22 |
de9b4df9-9cf5-4e17-9a7d-9f57578654e8 |
| 최소치환 |
Minimizing Permutations |
Graphs |
Easy |
300 |
33 |
31 |
08201fea-58ed-4c45-99e7-e470f63192bd |
| 최소한의 사각지역 |
Minimum Area Rectangle |
Arrays |
Hard |
356 |
17 |
16 |
55641f9c-1cf5-4cdd-b660-6e03079d5249 |
| 최소글자 |
Minimum Characters for Words |
Strings |
Easy |
333 |
24 |
23 |
f29794c3-b6d8-4e79-b2c8-6cc005288f50 |
| 가장짧은 하위문자열 |
Minimum Length Substrings |
Strings |
Medium |
334 |
35 |
33 |
1a39f279-be7f-4e4b-8d2f-eb2254a8e871 |
| 음의요소 최소검색 |
Minimum Passes of Matrix |
Graphs |
Hard |
295 |
33 |
32 |
8c4af6b8-7e41-48a3-9d84-cbad6b6eba25 |
| 최소 대기시간 |
Minimum Waiting Time |
Greedy Algorithms |
Easy |
647 |
20 |
18 |
7ec0c085-0127-4bcc-94f7-adaf84824dad |
| 단순배열 |
Monotonic Array |
Arrays |
Easy |
2110 |
322 |
226 |
65e10dad-260f-4e09-a755-27e5d530a627 |
| 끝으로 옮기기 |
Move Element to End |
Arrays |
Medium |
495 |
59 |
51 |
8b457645-de84-4922-a1e2-a0e1a5750671 |
| 다음 큰수 |
Next Greater Element |
Other Data Structures |
Medium |
294 |
25 |
24 |
09ea80d0-5ea4-47b5-9a9f-dca57260baf8 |
| 노드깊이 I |
Node Depths |
Trees |
Easy |
394 |
25 |
22 |
92824029-28c5-442c-81d6-c442139dd958 |
| 노드교환 |
Node Swap |
Linked Lists |
Easy |
309 |
18 |
11 |
a174a124-d41d-4b47-b897-b85159657ca0 |
| 무적여왕 |
Non-Attacking Queens |
Recursion |
Hard |
341 |
43 |
41 |
af8d9d67-ca24-4e28-b68f-0be3532e4530 |
| 만들수 없는 잔돈 |
Non-Constructible Change |
Arrays |
Easy |
846 |
33 |
25 |
71f9864c-7c86-49dd-817e-e37ec0630f14 |
| N번째 피보나찌 |
Nth Fibonacci |
Recursion |
Easy |
484 |
32 |
29 |
cdf30892-a39b-40a3-82c0-bd7fcfca85c6 |
| 나무의 수 |
Number of Binary Tree Topologies |
Trees |
Easy |
277 |
29 |
26 |
bae347ad-8fb3-4058-9082-53964185fb81 |
| 보이는 노드수 |
Number of Visible Nodes |
Trees |
Easy |
250 |
15 |
14 |
4c6ebdd3-3a2e-4cf1-aa6e-8806ff9bb26b |
| 거스름돈 만들기 |
Number of Ways to Make Change |
Dynamic Programming |
Easy |
383 |
16 |
13 |
ac656504-2496-47f4-a2e7-768d9bc9e800 |
| 매트릭스 이동방법 |
Number of Ways to Traverse Graph |
Dynamic Programming |
Easy |
461 |
20 |
18 |
a8177b50-b367-47ab-97ef-23c02504ab4f |
| 10억 사용자 |
One Billion Users |
Search |
Medium |
283 |
21 |
20 |
b95236d1-2a9c-49cd-aae6-a191a3bd79b2 |
| 쌍쌍더하기 |
Pair Sums |
Other Data Structures |
Medium |
269 |
28 |
24 |
7d5b5a56-858e-490c-8add-fbceace72d9a |
| Palindrome 검사 |
Palindrome Check |
Strings |
Easy |
391 |
14 |
11 |
5daf2034-1acd-4582-b6b7-0c01106af91b |
| 최소한의 Palindrome 분할 |
Palindrome Partitioning Min Cuts |
Dynamic Programming |
Hard |
292 |
20 |
19 |
fbedbb6e-3a21-4e13-b518-23299abaa645 |
| 졸업앨범 전달 |
Passing Yearbooks |
Arrays |
Medium |
447 |
29 |
26 |
dad54ed9-f62c-49cf-97c4-8f647d9325a5 |
| 순열 |
Permutations |
Recursion |
Medium |
303 |
36 |
35 |
95bad6cf-1e89-4ff2-934d-e4509c4cd416 |
| 전화번호암기 |
Phone Number Mnemonics |
Recursion |
Medium |
371 |
13 |
10 |
a9c689ce-63ec-4aae-8e00-22d3445c1393 |
| 멱집합 |
Powerset |
Recursion |
Medium |
286 |
19 |
18 |
ff54afb9-95eb-4eb3-b9d9-42dbc830ac88 |
| Priority Queue |
Priority Queue Example |
Other Data Structures |
Easy |
352 |
16 |
0 |
57e982fe-5bad-43df-8765-2232df6b46a6 |
| Queue |
Queue Example |
Other Data Structures |
Easy |
307 |
9 |
0 |
e374dfe3-ea4b-453a-bb93-d7ead5652068 |
| 큐지우기 |
Queue Removals |
Other Data Structures |
Medium |
451 |
18 |
16 |
3a4e9397-d185-45f4-a566-af5502ccd9bc |
| 빠른선택 |
Quickselect |
Search |
Hard |
294 |
35 |
32 |
33cd99d6-9ecb-4d85-b462-efb3887ee1b0 |
| 링드리스트 빨리정렬 |
QuickSort on Singly Linked List |
Sorting |
Hard |
284 |
47 |
35 |
c9d1eba8-5fd2-4682-94c9-df53aadfe239 |
| 재정렬 |
Rearrange Linked List |
Linked Lists |
Hard |
272 |
22 |
16 |
c59429e6-181e-48dd-9621-52ae14690d78 |
| BST 재건축 |
Reconstruct BST |
Trees |
Medium |
324 |
61 |
59 |
81038138-4bd3-496e-baf0-7aded76eb9ee |
| 직사각형 마니아 |
Rectangle Mania |
Other Data Structures |
Hard |
242 |
8 |
7 |
0bbd17ae-00c6-4fd7-b489-a04e99638ca9 |
| 중복제거 |
Remove Duplicates from Linked List |
Linked Lists |
Easy |
273 |
99 |
81 |
262dbb04-d3d2-4fce-8176-d41ac451b222 |
| 섬지우기 |
Remove Islands |
Graphs |
Hard |
278 |
37 |
36 |
3cc32e9d-9618-43f5-b05a-18727bbf7ce6 |
| 끝에서 K번째 지우기 |
Remove Kth Node from End |
Linked Lists |
Easy |
435 |
28 |
23 |
9a30fa11-90ba-449e-ba04-0a7e6e1c1a60 |
| 매출목표 |
Revenue Milestones |
Search |
Medium |
292 |
19 |
16 |
cbbff6cb-1839-40b5-9469-d26a6ab6e588 |
| 뒤집기 |
Reverse Operations |
Linked Lists |
Medium |
247 |
60 |
44 |
626b3937-4f64-415d-a4db-0db88a820e8a |
| 반대로 똑같이 |
Reverse to Make Equal |
Arrays |
Easy |
592 |
39 |
31 |
a51aebb6-a678-4635-a7a5-e2d9500da1e5 |
| 꺼꾸로 |
Reverse Words in String |
Strings |
Medium |
333 |
35 |
32 |
cb88825e-e826-424d-8bb1-d5b35bbf2bda |
| 나보다 적은 |
Right Smaller Than |
Trees |
Hard |
354 |
29 |
20 |
84336977-96fd-4e3a-b2b5-b549797e5be7 |
| 강크기 |
River Sizes |
Graphs |
Medium |
385 |
71 |
65 |
c385ea6f-d3da-41aa-a2e6-c02bbe7e05b7 |
| 회전암호 |
Rotational Cipher |
Strings |
Easy |
245 |
13 |
12 |
1354cbdf-90eb-45af-bf2c-4e912b02f383 |
| 반복글자 압축 |
Run-Length Encoding |
Strings |
Easy |
282 |
21 |
18 |
44dd4767-6ef7-489c-a98e-7f14f2d6b93a |
| 같은 BST |
Same BSTs |
Trees |
Hard |
361 |
27 |
23 |
ac47dbf3-c319-44d1-a008-434e75b14941 |
| 정배열 검색 |
Search in Sorted Matrix |
Search |
Medium |
309 |
17 |
14 |
a63ca0d4-ee2a-41aa-94e4-5a6a9a9c3e3c |
| 자리배열 |
Seating Arrangements |
Greedy Algorithms |
Hard |
291 |
37 |
33 |
637af641-ef9d-4d46-a560-f6b9f953b3ed |
| Set |
Set Example |
Other Data Structures |
Easy |
278 |
6 |
0 |
baceffd1-7e40-4050-9efe-8fdff96d2ae7 |
| k 이동 |
Shift Linked List |
Linked Lists |
Medium |
328 |
17 |
14 |
b5e98436-c87d-4fee-9856-4775733ab49a |
| 변형된 이진검색 |
Shifted Binary Search |
Search |
Hard |
306 |
16 |
13 |
aa01feb8-0b07-4774-ab64-1c9d3e7654ed |
| 지름길 |
Shorten Path |
Other Data Structures |
Hard |
263 |
14 |
12 |
e75e4748-5a02-46b1-b214-0a031e729a49 |
| 단일주기검사 |
Single Cycle Check |
Graphs |
Easy |
378 |
22 |
16 |
c6e3ff7b-651b-41b2-aa98-c2b64bc89827 |
| 천천히 더하기 |
Slow Sums |
Greedy Algorithms |
Medium |
358 |
22 |
18 |
3293e5f2-46a8-4b83-ae89-189423a581b9 |
| 최소차이 |
Smallest Difference |
Arrays |
Medium |
332 |
15 |
13 |
5193d92f-f959-4ae4-ac69-a2a2ee468916 |
| 수도쿠 풀이 |
Solve Sudoku |
Recursion |
Hard |
341 |
43 |
41 |
1c9472c0-e860-44ad-a3b3-bdd147e9e1fd |
| 파도정렬 |
Sort an array in wave form |
Sorting |
Medium |
368 |
19 |
17 |
41f35142-0bca-4179-8c1f-19a07e3cf6c6 |
| 따라정렬 |
Sort by Other Array |
Sorting |
Medium |
396 |
22 |
19 |
ec2d0138-2251-4ad0-89fb-f8992b681b7f |
| K정렬 |
Sort K-Sorted Array |
Sorting |
Hard |
347 |
19 |
17 |
46269132-f273-4733-a5db-50fa0481205f |
| 제곱배열정렬 |
Sorted Squared Array |
Arrays |
Easy |
587 |
53 |
44 |
a862eacc-e754-44f6-9b29-338a5a6d6930 |
| 나선횡단 |
Spiral Traverse |
Arrays |
Medium |
434 |
50 |
42 |
34b99b94-a151-432e-85c1-a52e24402378 |
| Stack |
Stack Example |
Other Data Structures |
Easy |
326 |
12 |
0 |
6120b677-0961-47ab-bd2b-0eb5fa63d048 |
| 계단여행 II |
Staircase Traversal |
Recursion |
Medium |
326 |
18 |
14 |
1a176a1c-3f26-4be8-877b-3f1a0c354ead |
| 계단여행 I |
Staircase Traversal I |
Recursion |
Easy |
327 |
22 |
18 |
bc2c5482-ac4b-4904-b059-1558b96d2ad8 |
| 부분배열정렬 |
Subarray Sort |
Arrays |
Hard |
335 |
21 |
20 |
f38a29fb-f43b-45db-8372-3135c194eed9 |
| 합하기 |
Sum of Linked Lists |
Linked Lists |
Easy |
310 |
24 |
18 |
abd75a64-992d-4a82-bfb2-0c63ae39f43e |
| 일출보기 |
Sunset Views |
Other Data Structures |
Medium |
312 |
32 |
20 |
4d698d3d-a7c3-4bb2-bb09-40c6afdbaa67 |
| 탠덤자전거 |
Tandem Bicycle |
Greedy Algorithms |
Easy |
327 |
21 |
14 |
a08c025e-1f0c-49ba-8c91-2c32820a9008 |
| 할당작업 |
Task Assignment |
Greedy Algorithms |
Medium |
362 |
19 |
17 |
66695917-c85c-4897-8877-b49343da22f6 |
| 3수정렬 |
Three Number Sort |
Sorting |
Easy |
383 |
14 |
13 |
04c471b4-b003-4a5f-a3b9-caed9f13f9d1 |
| 3 숫자의 합 |
Three Number Sum |
Arrays |
Medium |
670 |
46 |
27 |
3ba62f1f-d106-4eab-bb75-edda5598708a |
| 위상정렬 |
Topological Sort |
Sorting |
Hard |
328 |
23 |
22 |
87d8c0ca-766b-41fb-9d9c-4311f7dcbd30 |
| 토너먼트 우승자 |
Tournament Winner |
Arrays |
Easy |
643 |
56 |
53 |
a17e3f84-08d1-4f65-8977-bbc8134b6277 |
| 2 숫자의 합 |
Two Number Sum |
Arrays |
Medium |
774 |
101 |
93 |
581cf164-d1b2-45dc-9649-d48b853e69b0 |
| 두 문자 합 |
Two String Sum |
Strings |
Medium |
326 |
25 |
18 |
c655447c-879f-487b-89f7-ef4c506d7fd3 |
| 홀짝정렬 |
Two Way Sort |
Sorting |
Easy |
393 |
16 |
15 |
15e4c52e-c3ed-4fb9-a43a-c84e815bbc7f |
| 두엣지연결 그래프 |
Two-Edge-Connected Graph |
Graphs |
Hard |
393 |
22 |
21 |
4f52b418-2109-45f3-87d3-881cb94dfa6c |
| 밑줄표시 하위문자열 |
Underscorify Substring |
Strings |
Hard |
391 |
32 |
31 |
6ae614dd-7180-4705-9e7f-eb29b8020b1e |
| 유효한 IP주소 |
Valid IP Addresses |
Strings |
Medium |
506 |
53 |
46 |
064a9a46-4bec-4d3d-b371-2f6664e4ffed |
| 유효한 출발도시 |
Valid Starting City |
Greedy Algorithms |
Medium |
469 |
40 |
36 |
07636303-d81f-4849-87c3-1ccda9e4a163 |
| BST 검사 |
Validate BST |
Trees |
Easy |
492 |
167 |
165 |
aed2f3e8-c05e-4619-80cf-4714759dcb14 |
| 하위시퀀스 검사 |
Validate Subsequence |
Arrays |
Easy |
567 |
23 |
20 |
c82be937-b0d7-4039-b686-1abfe9fcf25e |
| 세노드의 유효성 |
Validate Three Nodes |
Trees |
Hard |
326 |
15 |
12 |
8831e62c-87de-48c3-bd45-e4b01b544d3e |
| 물채우기 |
Water Area |
Dynamic Programming |
Medium |
275 |
17 |
16 |
d75d31c8-e5a6-4f8f-9d78-897f710c0c7f |
| 폭포수줄기 |
Waterfall Streams |
Arrays |
Hard |
333 |
53 |
48 |
b0925547-1edd-456d-b971-c15b7c5b1fec |
| 최연소 공통조상 |
Youngest Common Ancestor |
Graphs |
Medium |
291 |
40 |
37 |
77301a83-c9c4-498a-af12-38db2229a0ff |
| 지그재그횡단 |
Zigzag Traverse |
Arrays |
Hard |
560 |
73 |
58 |
05c7a405-94e1-423e-acc9-9e7a71856cbc |
| 압축 |
Zip Linked List |
Linked Lists |
Hard |
270 |
28 |
23 |
1020e04f-eb20-47f0-a654-f0d6f928d9c2 |
