burning-carrot / study-problem-solving

์•Œ๊ณ ๋ฆฌ์ฆ˜ ๊ณ ์ˆ˜๊ฐ€ ๋˜๊ธฐ ์œ„ํ•œ ์ง€๋ฆ„๊ธธ
5 stars 1 forks source link

๐Ÿ”ฅ๐Ÿฅ• ์•Œ๊ณ ๋ฆฌ์ฆ˜ ๋ฌธ์ œ ์ €์žฅ์†Œ

์•Œ๊ณ ๋ฆฌ์ฆ˜ ๋ฌธ์ œ ํ’€์ด๋ฅผ ์œ„ํ•œ ์ €์žฅ์†Œ์ž…๋‹ˆ๋‹ค.

์•Œ๊ณ ๋ฆฌ์ฆ˜ ๋ถ„๋ฅ˜

์•Œ๊ณ ๋ฆฌ์ฆ˜ ๋ถ„๋ฅ˜๋Š” ๋‹ค์Œ ํ‘œ๋ฅผ ๊ธฐ๋ณธ์œผ๋กœ ํ•ฉ๋‹ˆ๋‹ค.

ํƒœ๊ทธ๋ช… ์˜๋ฏธ
backtracking ๋ฐฑํŠธ๋ž˜ํ‚น
bfs ๋„ˆ๋น„์šฐ์„ ํƒ์ƒ‰
big ๋งค์šฐํฐ์ˆ˜
binary ์ด๋ถ„ํƒ์ƒ‰
brute ๋ถ€๋ฅดํŠธํฌ์Šค(์ „๋ถ€๋Œ€์ž…)
combi ์กฐํ•ฉ
dfs ๊นŠ์ด์šฐ์„ ํƒ์ƒ‰
divide ๋ถ„ํ• ์ •๋ณต๊ธฐ๋ฒ•
dynamic ๋™์ ๊ณ„ํš๋ฒ•
graph ๊ทธ๋ž˜ํ”„
greedy ํƒ์š•์•Œ๊ณ ๋ฆฌ์ฆ˜
map key,value๊ตฌ์กฐ
number ์ •์ˆ˜๋ก (์†Œ์ˆ˜...)
queue ํ
recursive ์žฌ๊ท€
simulation ์‹œ๋ฎฌ๋ ˆ์ด์…˜
sort ์ •๋ ฌ
stack ์Šคํƒ
string ๋ฌธ์ž์—ด
tree ํŠธ๋ฆฌ๊ตฌ์กฐ

๋ฌธ์ œ ํ•ด์„ค ํƒฌํ”Œ๋ฆฟ

๋ฌธ์ œ๋ฅผ ํ’€์ด์ „, ํ˜น์€ ํ’€์ด ํ›„์— ์ฃผ์–ด์ง„ ์–‘์‹์— ๋”ฐ๋ผ์„œ ํšŒ๊ณ ๋ฅผ ํ•ฉ๋‹ˆ๋‹ค.

๋‹ค์Œ ๋‚ด์šฉ๋“ค์„ ์ •๋ฆฌํ•ฉ๋‹ˆ๋‹ค.

ํƒฌํ”Œ๋ฆฟ ๋ณด๊ธฐ