week12 {swjungle}{ALGORITHMS}


README

์•Œ๊ณ ๋ฆฌ์ฆ˜ ์ฃผ์ฐจ, leet code ๋ฌธ์ œ๋ฅผ ํ‘ผ๋‹ค. ๋‚˜๋Š” ์˜ˆ๋น„๊ตฐ์„ ๋‹ค๋…€์™€์„œ ๋ชฉ, ๊ธˆ ์‹ค์‹œํ•œ ํ…Œ์ŠคํŠธ๋ฅผ ์‹ค์‹œํ•˜์ง€ ๋ชปํ–ˆ๋‹ค. ๊ทธ๋ž˜๋„ ์ข‹์€ ๋ฌธ์ œ๋“ค์ด๊ธฐ ๋•Œ๋ฌธ์— ๋ฐ˜๋“œ์‹œ ํ’€์–ด๋ณด๋Š” ์‹œ๊ฐ„์„ ๊ฐ€์ ธ๋ณด์ž. ํ•œ ์‹œ๊ฐ„ ์•ˆ์— ๋‹ค ํ’€์–ด์•ผ ํ•œ๋‹ค.

weekly contests & bi-weekly contests

2023-10-28 ์ฝ”์น˜๋‹˜์˜ ์ œ์•ˆ:

Leetcode weekly ํ˜น์€ bi-weekly์— ์ฐธ๊ฐ€ํ•ด ๋ณด๊ธฐ๋ฅผ ๊ถŒ์žฅํ•ฉ๋‹ˆ๋‹ค.
๋งค์ฃผ ์ผ์š”์ผ 11:30 ~ 13:00 (KST) ์— Leetcode weekly contest๊ฐ€ ์—ด๋ฆฝ๋‹ˆ๋‹ค. (4๋ฌธ์ œ ์ถœ์ œ)
๋˜ํ•œ 2์ฃผ์— ํ•œ๋ฒˆ์”ฉ ์ง€๊ตฌ ๋ฐ˜๋Œ€ํŽธ ์‚ฌ๋žŒ๋“ค์˜ ์‹œ๊ฐ„์— ๋งž์ถ”์–ด ํ† ์š”์ผ 23:30 ~ 25:00 (๊ทธ ๋‹ค์Œ๋‚  01:00)๋„ bi-weekly contest๊ฐ€ ์—ด๋ฆฝ๋‹ˆ๋‹ค.
๋งˆ์นจ ์˜ค๋Š˜ ์ €๋… 11์‹œ ๋ฐ˜์— bi-weekly contest 116์ด, ๋‚ด์ผ ์˜ค์ „ 11์‹œ ๋ฐ˜์— weekly contest 369๊ฐ€ ์—ด๋ฆฝ๋‹ˆ๋‹ค.1์‹œ๊ฐ„ 30๋ถ„๋™์•ˆ ์ตœ์„ ์„ ๋‹คํ•ด ๋ฌธ์ œ๋ฅผ ํ’€๊ณ  ๋‚ด ์‹ค๋ ฅ์ด ์–ด๋Š ์ •๋„์ธ์ง€ Ranking์„ ํ†ตํ•ด ํ™•์ธํ•ด ๋ณด์‹œ๊ณ 
๋‚˜๋Š” ์ด๋ ‡๊ฒŒ ํ’€์—ˆ๋Š”๋ฐ ๋‹ค๋ฅธ ์‚ฌ๋žŒ๋“ค์€ ์–ด๋–ป๊ฒŒ ํ’€์—ˆ๋Š”์ง€ ๋‹ค๋ฅธ ์‚ฌ๋žŒ๋“ค์˜ ์ฝ”๋“œ๋ฅผ ๋ณด๊ณ  ๋น„๊ตํ•ด ๋ณด์‹œ๋Š” ๊ฒƒ๋„ ์ข‹์Šต๋‹ˆ๋‹ค.
ํ˜„์žฌ ๋‚˜์˜ ์ฝ”๋”ฉ ์‹ค๋ ฅ์ด ์–ด๋Š ์ •๋„์ธ์ง€ ๊ฐ๊ด€ํ™” ํ•˜๋Š”๋ฐ ๋„์›€์ด ๋  ๊ฒƒ์ด๋ผ ๋ด…๋‹ˆ๋‹ค.

TEST01

TEST02

TEST03

๋ฌธ์ œ ํ’€์ด๋งํฌ

TEST04

๋ฌธ์ œ ๋ชฉ๋ก

# ๋ฌธ์ œ๋ฒˆํ˜ธ ๋‚œ์ด๋„ ๋‹ค๋ฃจ๋Š” ์ฃผ์ œ ๋ฌธ์ œ ์ œ๋ชฉ ํ’€์ด์—ฌ๋ถ€
1 1 Easy Hash Table Two Sum โœ…
2 15 Medium Two pointer, Sorting 3 Sum {leetcode} โœ…
3 9 Easy Math Palindrome Number โœ…
4 7 Medium Math Reverse Integer โœ…
5 412 Easy String Fizz Buzz โœ…
6 14 Easy String, Trie Longest Common Prefix
7 20 Easy Stack Valid Parenthesis
8 42 Hard Stack Trapping Rain Water
9 456 Medium Stack, Ordered Set 132 Pattern
10 22 Medium Backtracking, DP Generate Parentheses
11 52 Hard Backtracking N-Queens II
12 282 Hard Backtracking Expression Add Operators
13 56 Medium Sorting Merge Intervals
14 3 Medium Sliding Window Longest Substring Without Repeating Characters
15 560 Medium Prefix Sum Subarray Sum Equals K
16 34 Medium Binary Search Find First and Last Position of Element in Sorted Array
17 215 Medium Sorting, Priority Queue, Quickselect Kth Largest Element in an Array
18 209 Medium Binary Search, Sliding Window Minimum Size Subarray Sum
19 218 Hard Priority Queue, Segment Tree The Skyline Problem
20 200 Medium Graph Number of Islands
21 399 Medium Graph Evaluate Division
22 207 Medium Graph Course Schedule
23 486 Medium Game Theory Predict the Winner
24 121 Easy DP Best Time to Buy and Sell Stock
25 70 Easy DP Climbing Stairs
26 300 Medium Binary Search, DP Longest Increasing Subsequence
27 5 Medium DP Longest Palindromic Substring
28 11 Medium Greedy Container With Most Water
29 1235 Hard Binary Search, DP, Priority Queue Maximum Profit in Job Scheduling
30 847 Hard Graph, DP Shortest Path Visiting All Nodes

์ž๋ฃŒ๊ตฌ์กฐ/์•Œ๊ณ ๋ฆฌ์ฆ˜ ์‹ค์ „ - 100๋ฌธ์ œ

# ์ถœ์ฒ˜ ๋ฌธ์ œ๋ฒˆํ˜ธ ๋‚œ์ด๋„ ์ฃผ์ œ ๋น„๊ณ  ๋ฌธ์ œ ์ œ๋ชฉ
1 ๋ฐฑ์ค€ 11653 ํ•˜ ๊ธฐ์ดˆ ์†Œ์ธ์ˆ˜๋ถ„ํ•ด
2 ๋ฐฑ์ค€ 11720 ํ•˜ ๊ธฐ์ดˆ ๋ฌธ์ž์—ด ์ˆซ์ž์˜ ํ•ฉ
3 ๋ฐฑ์ค€ 11816 ํ•˜ ๊ธฐ์ดˆ 8์ง„์ˆ˜, 10์ง„์ˆ˜, 16์ง„์ˆ˜
4 ๋ฐฑ์ค€ 8595 ์ค‘ ๊ธฐ์ดˆ ๋ฌธ์ž์—ด ํžˆ๋“  ๋„˜๋ฒ„
5 ๋ฐฑ์ค€ 1269 ํ•˜ ์ •๋ ฌ ๋Œ€์นญ ์ฐจ์ง‘ํ•ฉ
6 ๋ฐฑ์ค€ 11728 ํ•˜ ์ •๋ ฌ ๋ฐฐ์—ด ํ•ฉ์น˜๊ธฐ
7 ๋ฐฑ์ค€ 1406 ์ค‘ ์Šคํƒ ์—๋””ํ„ฐ
8 ๋ฐฑ์ค€ 9935 ์ค‘ ์Šคํƒ ๋ฌธ์ž์—ด ํญ๋ฐœ
9 ๋ฐฑ์ค€ 2231 ํ•˜ ์™„์ „ ํƒ์ƒ‰ ๋ถ„ํ•ดํ•ฉ
10 ๋ฐฑ์ค€ 2798 ํ•˜ ์™„์ „ ํƒ์ƒ‰ ๋ธ”๋ž™์žญ
11 ๋ฐฑ์ค€ 1062 ์ค‘ ์™„์ „ ํƒ์ƒ‰ ๊ฐ€๋ฅด์นจ
12 ๋ฐฑ์ค€ 10974 ์ค‘ ์™„์ „ ํƒ์ƒ‰ ๋ชจ๋“  ์ˆœ์—ด
13 ๋ฐฑ์ค€ 6603 ์ค‘ ์™„์ „ ํƒ์ƒ‰ DFS๋กœ๋„ ๊ฐ€๋Šฅ ๋กœ๋˜
14 ๋ฐฑ์ค€ 10815 ํ•˜ ์ด๋ถ„ ํƒ์ƒ‰ ์ˆซ์ž ์นด๋“œ
15 ๋ฐฑ์ค€ 2343 ์ค‘ ์ด๋ถ„ ํƒ์ƒ‰ ๊ธฐํƒ€ ๋ ˆ์Šจ
16 ๋ฐฑ์ค€ 1654 ์ค‘ ์ด๋ถ„ ํƒ์ƒ‰ ๋žœ์„  ์ž๋ฅด๊ธฐ
17 ๋ฐฑ์ค€ 1300 ์ƒ ์ด๋ถ„ ํƒ์ƒ‰ K๋ฒˆ์งธ ์ˆ˜
18 ๋ฐฑ์ค€ 2447 ํ•˜ ๋ถ„ํ•  ์ •๋ณต ๋ณ„ ์ฐ๊ธฐ
19 ๋ฐฑ์ค€ 2339 ์ค‘ ๋ถ„ํ•  ์ •๋ณต ์„ํŒ ์ž๋ฅด๊ธฐ
20 ๋ฐฑ์ค€ 13430 ์ƒ ๋ถ„ํ•  ์ •๋ณต ํ•ฉ ๊ตฌํ•˜๊ธฐ
21 ๋ฐฑ์ค€ 1493 ์ƒ ๋ถ„ํ•  ์ •๋ณต ๋ฐ•์Šค ์ฑ„์šฐ๊ธฐ
22 ๋ฐฑ์ค€ 1517 ์ƒ ๋ถ„ํ•  ์ •๋ณต ๋ฒ„๋ธ” ์†ŒํŠธ
23 ๋ฐฑ์ค€ 2606 ํ•˜ ๊ทธ๋ž˜ํ”„ BFS/DFS ๋ฐ”์ด๋Ÿฌ์Šค
24 ๋ฐฑ์ค€ 1303 ํ•˜ ๊ทธ๋ž˜ํ”„ BFS/DFS ์ „์Ÿ - ์ „ํˆฌ
25 ๋ฐฑ์ค€ 1963 ์ค‘ ๊ทธ๋ž˜ํ”„ BFS/DFS ์†Œ์ˆ˜ ๊ฒฝ๋กœ
26 ๋ฐฑ์ค€ 14226 ์ค‘ ๊ทธ๋ž˜ํ”„ BFS/DFS ์ด๋ชจํ‹ฐ์ฝ˜
27 ๋ฐฑ์ค€ 2206 ์ƒ ๊ทธ๋ž˜ํ”„ BFS/DFS ๋ฒฝ ๋ถ€์ˆ˜๊ณ  ์ด๋™ํ•˜๊ธฐ
28 ๋ฐฑ์ค€ 16930 ์ƒ ๊ทธ๋ž˜ํ”„ BFS/DFS ๋‹ฌ๋ฆฌ๊ธฐ
29 ๋ฐฑ์ค€ 1516 ์ค‘ ๊ทธ๋ž˜ํ”„ ์œ„์ƒ ์ •๋ ฌ ๊ฒŒ์ž„ ๊ฐœ๋ฐœ
30 ๋ฐฑ์ค€ 3665 ์ค‘ ๊ทธ๋ž˜ํ”„ ์œ„์ƒ ์ •๋ ฌ ์ตœ์ข… ์ˆœ์œ„
31 ๋ฐฑ์ค€ 1753 ์ค‘ ๊ทธ๋ž˜ํ”„ ๋‹ค์ต์ŠคํŠธ๋ผ ์ตœ๋‹จ๊ฒฝ๋กœ
32 ๋ฐฑ์ค€ 5719 ์ค‘ ๊ทธ๋ž˜ํ”„ ๋‹ค์ต์ŠคํŠธ๋ผ ๊ฑฐ์˜ ์ตœ๋‹จ ๊ฒฝ๋กœ
33 ๋ฐฑ์ค€ 10217 ์ƒ ๊ทธ๋ž˜ํ”„ ๋‹ค์ต์ŠคํŠธ๋ผ KCM Travel
34 ๋ฐฑ์ค€ 11657 ์ƒ ๊ทธ๋ž˜ํ”„ ๋ฒจ๋งŒ-ํฌ๋“œ ํƒ€์ž„๋จธ์‹ 
35 ๋ฐฑ์ค€ 11404 ์ƒ ๊ทธ๋ž˜ํ”„ ํ”Œ๋กœ์ด๋“œ-์›Œ์…œ ํ”Œ๋กœ์ด๋“œ
36 ๋ฐฑ์ค€ 1922 ์ค‘ ๊ทธ๋ž˜ํ”„ MST ๋„คํŠธ์›Œํฌ ์—ฐ๊ฒฐ
37 ๋ฐฑ์ค€ 2887 ์ค‘ ๊ทธ๋ž˜ํ”„ MST ํ–‰์„ฑ ํ„ฐ๋„
38 ๋ฐฑ์ค€ 9373 ์ƒ ๊ทธ๋ž˜ํ”„ MST ๋ณต๋„ ๋šซ๊ธฐ
39 ๋ฐฑ์ค€ 6086 ์ƒ ๊ทธ๋ž˜ํ”„ ๋„คํŠธ์›Œํฌ ์œ ๋Ÿ‰ ์ตœ๋Œ€ ์œ ๋Ÿ‰
40 ๋ฐฑ์ค€ 17412 ์ƒ ๊ทธ๋ž˜ํ”„ ๋„คํŠธ์›Œํฌ ์œ ๋Ÿ‰ ๋„์‹œ ์™•๋ณตํ•˜๊ธฐ 1
41 ๋ฐฑ์ค€ 2188 ์ƒ ๊ทธ๋ž˜ํ”„ ๋„คํŠธ์›Œํฌ ์œ ๋Ÿ‰ (์ด๋ถ„ ๋งค์นญ) ์ถ•์‚ฌ ๋ฐฐ์ •
42 ๋ฐฑ์ค€ 1932 ํ•˜ DP ์ •์ˆ˜ ์‚ผ๊ฐํ˜•
43 ๋ฐฑ์ค€ 2293 ํ•˜ DP ๋™์ „ 1
44 ๋ฐฑ์ค€ 13398 ์ค‘ DP ์—ฐ์†ํ•ฉ 2
45 ๋ฐฑ์ค€ 2643 ์ค‘ DP ์ƒ‰์ข…์ด ์˜ฌ๋ ค ๋†“๊ธฐ
46 ๋ฐฑ์ค€ 2482 ์ค‘ DP ์ƒ‰์ƒํ™˜
47 ๋ฐฑ์ค€ 1695 ์ค‘ DP ํŒฐ๋ฆฐ๋“œ๋กฌ ๋งŒ๋“ค๊ธฐ
48 ๋ฐฑ์ค€ 1562 ์ค‘ DP ๊ณ„๋‹จ ์ˆ˜
49 ๋ฐฑ์ค€ 1965 ์ค‘ DP ์ƒ์ž๋„ฃ๊ธฐ
50 ๋ฐฑ์ค€ 1958 ์ค‘ DP LCS 3
51 ๋ฐฑ์ค€ 7476 ์ƒ DP ์ตœ๋Œ€ ๊ณตํ†ต ์ฆ๊ฐ€ ์ˆ˜์—ด
52 ๋ฐฑ์ค€ 1315 ์ƒ DP RPG
53 ๋ฐฑ์ค€ 2533 ์ค‘ DP Tree DP ์‚ฌํšŒ๋ง ์„œ๋น„์Šค(SNS)
54 ๋ฐฑ์ค€ 1693 ์ƒ DP Tree DP ํŠธ๋ฆฌ ์ƒ‰์น ํ•˜๊ธฐ
55 ๋ฐฑ์ค€ 17365 ์ƒ DP Tree DP (Trie ์ž๋ฃŒ๊ตฌ์กฐ) ๋ณ„๋‹ค์ค„
56 ๋ฐฑ์ค€ 10162 ํ•˜ ๊ทธ๋ฆฌ๋”” ์ „์ž๋ ˆ์ธ์ง€
57 ๋ฐฑ์ค€ 2212 ํ•˜ ๊ทธ๋ฆฌ๋”” ์„ผ์„œ
58 ๋ฐฑ์ค€ 1911 ์ค‘ ๊ทธ๋ฆฌ๋”” ํ™๊ธธ ๋ณด์ˆ˜ํ•˜๊ธฐ
59 ๋ฐฑ์ค€ 8980 ์ค‘ ๊ทธ๋ฆฌ๋”” ํƒ๋ฐฐ
60 ๋ฐฑ์ค€ 2529 ์ค‘ ๊ทธ๋ฆฌ๋”” ๋ถ€๋“ฑํ˜ธ
61 ๋ฐฑ์ค€ 2217 ์ค‘ ๊ทธ๋ฆฌ๋”” ๋กœํ”„
62 ๋ฐฑ์ค€ 3109 ์ƒ ๊ทธ๋ฆฌ๋”” ๋นต์ง‘
63 ๋ฐฑ์ค€ 4716 ์ƒ ๊ทธ๋ฆฌ๋”” ํ’์„ 
64 ๋ฐฑ์ค€ 14499 ํ•˜ ์‚ผ์„ฑ SW ์—ญ๋Ÿ‰ ํ…Œ์ŠคํŠธ ์ฃผ์‚ฌ์œ„ ๊ตด๋ฆฌ๊ธฐ
65 ๋ฐฑ์ค€ 3190 ์ค‘ ์‚ผ์„ฑ SW ์—ญ๋Ÿ‰ ํ…Œ์ŠคํŠธ ๋ฑ€
66 ๋ฐฑ์ค€ 14503 ์ค‘ ์‚ผ์„ฑ SW ์—ญ๋Ÿ‰ ํ…Œ์ŠคํŠธ ๋กœ๋ด‡ ์ฒญ์†Œ๊ธฐ
67 ๋ฐฑ์ค€ 16234 ์ค‘ ์‚ผ์„ฑ SW ์—ญ๋Ÿ‰ ํ…Œ์ŠคํŠธ ์ธ๊ตฌ ์ด๋™
68 ๋ฐฑ์ค€ 5373 ์ค‘ ์‚ผ์„ฑ SW ์—ญ๋Ÿ‰ ํ…Œ์ŠคํŠธ ํ๋น™
69 ๋ฐฑ์ค€ 15684 ์ค‘ ์‚ผ์„ฑ SW ์—ญ๋Ÿ‰ ํ…Œ์ŠคํŠธ ์‚ฌ๋‹ค๋ฆฌ ์กฐ์ž‘
70 ๋ฐฑ์ค€ 17472 ์ค‘ ์‚ผ์„ฑ SW ์—ญ๋Ÿ‰ ํ…Œ์ŠคํŠธ ๋‹ค๋ฆฌ ๋งŒ๋“ค๊ธฐ 2
71 ๋ฐฑ์ค€ 14791 ์ค‘ Google Code Jam Tidy Numbers (Large)
72 ๋ฐฑ์ค€ 14382 ํ•˜ ์ˆซ์ž์„ธ๋Š” ์–‘ (Large)
73 ๋ฐฑ์ค€ 14798 ์ค‘ Google Code Jam Alphabet Cake (Large)
74 ๋ฐฑ์ค€ 14806 ์ค‘ Google Code Jam Stable Neigh-bors (Large)
75 ๋ฐฑ์ค€ 14810 ์ค‘ Google Code Jam Ample Syrup (Large)
76 ๋ฐฑ์ค€ 15958 ์ƒ ์นด์นด์˜ค ์ฝ”๋“œ ํŽ˜์Šคํ‹ฐ๋ฒŒ ํ”„๋กœ๋„์˜ 100์ผ ์ค€๋น„
77 ๋ฐฑ์ค€ 15998 ์ค‘ ์นด์นด์˜ค ์ฝ”๋“œ ํŽ˜์Šคํ‹ฐ๋ฒŒ ์นด์นด์˜ค๋จธ๋‹ˆ
78 ๋ฐฑ์ค€ 15999 ์ƒ ์นด์นด์˜ค ์ฝ”๋“œ ํŽ˜์Šคํ‹ฐ๋ฒŒ ๋’ค์ง‘๊ธฐ
79 ๋ฐฑ์ค€ 16000 ์ค‘ ์นด์นด์˜ค ์ฝ”๋“œ ํŽ˜์Šคํ‹ฐ๋ฒŒ ์„ฌ
80 ๋ฐฑ์ค€ 16002 ์ƒ ์นด์นด์˜ค ์ฝ”๋“œ ํŽ˜์Šคํ‹ฐ๋ฒŒ ์กฐ์šฉํ•œ ์ƒํ™œ๊ด€ ๋งŒ๋“ค๊ธฐ
81 Leetcode 367 ํ•˜ ๊ธฐ์ดˆ Valid Perfect Square
82 Leetcode 166 ์ค‘ ๊ธฐ์ดˆ Fraction to Recurring Decimal
83 Leetcode 274 ์ค‘ ์ •๋ ฌ H-Index
84 Leetcode 110 ํ•˜ ์žฌ๊ท€ํ•จ์ˆ˜ Balanced Binary Tree
85 Leetcode 726 ์ƒ ์žฌ๊ท€ํ•จ์ˆ˜ ๋ฌธ์ž์—ด Number of Atoms
86 Leetcode 53 ํ•˜ ๋ถ„ํ•  ์ •๋ณต Maximum Subarray
87 Leetcode 4 ์ƒ ๋ถ„ํ•  ์ •๋ณต Median of Two Sorted Arrays
88 Leetcode 232 ํ•˜ ์Šคํƒ, ํ Implement Queue using Stacks
89 Leetcode 101 ํ•˜ ๊ทธ๋ž˜ํ”„ BFS/DFS Symmetric Tree
90 Leetcode 130 ์ค‘ ๊ทธ๋ž˜ํ”„ BFS/DFS Surrounded Regions
91 Leetcode 301 ์ƒ ๊ทธ๋ž˜ํ”„ BFS/DFS Remove Invalid Parentheses
92 Leetcode 785 ์ค‘ ๊ทธ๋ž˜ํ”„ BFS/DFS Is Graph Bipartite?
93 Leetcode 864 ์ƒ ๊ทธ๋ž˜ํ”„ BFS/DFS (๋‹ค์ต์ŠคํŠธ๋ผ) Shortest Path to Get All Keys
94 Leetcode 746 ํ•˜ DP Min Cost Climbing Stairs
95 Leetcode 213 ์ค‘ DP House Robber II
96 Leetcode 85 ์ƒ DP Maximal Rectangle
97 Leetcode 10 ์ƒ DP Regular Expression Matching
98 Leetcode 124 ์ƒ DP Binary Tree Maximum Path Sum
99 Leetcode 55 ์ค‘ ๊ทธ๋ฆฌ๋”” Jump Game
100 Leetcode 757 ์ƒ ๊ทธ๋ฆฌ๋”” Set Intersection Size At Least Two