์ผ | ์ | ํ | ์ | ๋ชฉ | ๊ธ | ํ |
---|---|---|---|---|---|---|
1 | 2 | |||||
3 | 4 | 5 | 6 | 7 | 8 | 9 |
10 | 11 | 12 | 13 | 14 | 15 | 16 |
17 | 18 | 19 | 20 | 21 | 22 | 23 |
24 | 25 | 26 | 27 | 28 | 29 | 30 |
- ์นด์นด์ค์ฑ์ฉ
- ์ด๋ฏธ์ง ์์
- DP
- TypeScript
- icecandidate
- ์นด์นด์ค
- JavaScript
- js
- svgํ์ผ ๋ค๋ฃจ๊ธฐ
- ํ๋ก๊ทธ๋๋จธ์ค
- Redux toolkit
- custom hook
- React
- ์๋ฐฉํฅ ์ฐ๊ฒฐ ๋ฆฌ์คํธ
- ๋ธ๋ฃจํธํฌ์ค
- ์๋ฐ์คํฌ๋ฆฝํธ
- ๋ถ์คํธ์ปจํผ๋ฐ์ค
- ๋ฆฌ๋์ค ํดํท
- ๋ถ์คํธ์บ ํ์น๋ชจ๋ฐ์ผ
- ์ฝํ
- Node.js
- ๋๋๊ทธ ์ด๋ฒคํธ
- ์๊ณ ๋ฆฌ์ฆ
- ์ฝ๋ฉํ ์คํธ
- ์ด๋ถํ์
- router v6
- ์ฝ๋ ํฌ๋ฉง
- ๊ณผ์ ํ ์คํธ
- ๋ฐฑ์ค
- ๋์ ๊ณํ๋ฒ
- Today
- Total
๋ชฉ๋ก์นด์นด์ค (5)
๐ฅ dev-ruby
๋ฌธ์ https://programmers.co.kr/learn/courses/30/lessons/92343 ์ฝ๋ฉํ ์คํธ ์ฐ์ต - ์๊ณผ ๋๋ [0,0,1,1,1,0,1,0,1,0,1,1] [[0,1],[1,2],[1,4],[0,8],[8,7],[9,10],[9,11],[4,3],[6,5],[4,6],[8,9]] 5 [0,1,0,1,1,0,1,0,0,1,0] [[0,1],[0,2],[1,3],[1,4],[2,5],[2,6],[3,7],[4,8],[6,9],[9,10]] 5 programmers.co.kr ํ์ด function solution(info, edges) { const tree = Array.from({ length: info.length }, () => []); for (const [parent, ..
๋ฌธ์ https://programmers.co.kr/learn/courses/30/lessons/42892 ์ฝ๋ฉํ ์คํธ ์ฐ์ต - ๊ธธ ์ฐพ๊ธฐ ๊ฒ์ [[5,3],[11,5],[13,3],[3,5],[6,1],[1,3],[8,6],[7,2],[2,2]] [[7,4,6,9,1,8,5,2,3],[9,6,5,8,1,4,3,2,7]] programmers.co.kr ํ์ด function solution(nodeinfo) { const sorted = nodeinfo .map((el, index) => [...el, index + 1]) .sort((a, b) => (a[1] === b[1] ? a[0] - b[0] : b[1] - a[1])); function order(sorted, preAnswer, postAnsw..
๋ฌธ์ https://programmers.co.kr/learn/courses/30/lessons/81303 ์ฝ๋ฉํ ์คํธ ์ฐ์ต - ํ ํธ์ง 8 2 ["D 2","C","U 3","C","D 4","C","U 2","Z","Z"] "OOOOXOOO" 8 2 ["D 2","C","U 3","C","D 4","C","U 2","Z","Z","U 1","C"] "OOXOXOOO" programmers.co.kr ํ์ด function solution(n, k, cmd) { const stack = []; const answer = Array.from({ length: n }, () => "O"); const list = Array.from({ length: n }, (_, index) => [index - 1, in..
๋ฌธ์ https://programmers.co.kr/learn/courses/30/lessons/64062 ์ฝ๋ฉํ ์คํธ ์ฐ์ต - ์ง๊ฒ๋ค๋ฆฌ ๊ฑด๋๊ธฐ [2, 4, 5, 3, 2, 1, 4, 2, 5, 1] 3 3 programmers.co.kr ํ์ด ์ ํ์ฑO, ํจ์จ์ฑX ์ฝ๋ function solution2(stones, k) { // ์ ํ์ฑ๋ง ํต๊ณผ let start = 1, end = Math.max(...stones); while (start num - mid); let count = 0; for (const num of temp) { if (num = k) break; } if (count >= k) end = mid - 1; else { start = mid + 1; } } return start; } ..
๋ฌธ์ ์ค๋ช [๋ณธ ๋ฌธ์ ๋ ์ ํ์ฑ๊ณผ ํจ์จ์ฑ ํ ์คํธ ๊ฐ๊ฐ ์ ์๊ฐ ์๋ ๋ฌธ์ ์ ๋๋ค.] ์นด์นด์ค๋ ํ๋ฐ๊ธฐ ๊ฒฝ๋ ฅ ๊ฐ๋ฐ์ ๊ณต๊ฐ์ฑ์ฉ์ ์งํ ์ค์ ์์ผ๋ฉฐ ํ์ฌ ์ง์์ ์ ์์ ์ฝ๋ฉํ ์คํธ๊ฐ ์ข ๋ฃ๋์์ต๋๋ค. ์ด๋ฒ ์ฑ์ฉ์์ ์ง์์๋ ์ง์์ ์์ฑ ์ ์๋์ ๊ฐ์ด 4๊ฐ์ง ํญ๋ชฉ์ ๋ฐ๋์ ์ ํํ๋๋ก ํ์์ต๋๋ค. ์ฝ๋ฉํ ์คํธ ์ฐธ์ฌ ๊ฐ๋ฐ์ธ์ด ํญ๋ชฉ์ cpp, java, python ์ค ํ๋๋ฅผ ์ ํํด์ผ ํฉ๋๋ค. ์ง์ ์ง๊ตฐ ํญ๋ชฉ์ backend์ frontend ์ค ํ๋๋ฅผ ์ ํํด์ผ ํฉ๋๋ค. ์ง์ ๊ฒฝ๋ ฅ๊ตฌ๋ถ ํญ๋ชฉ์ junior์ senior ์ค ํ๋๋ฅผ ์ ํํด์ผ ํฉ๋๋ค. ์ ํธํ๋ ์์ธํธ๋๋ก chicken๊ณผ pizza ์ค ํ๋๋ฅผ ์ ํํด์ผ ํฉ๋๋ค. ์ธ์ฌ์์ ํ์ ๊ทผ๋ฌดํ๊ณ ์๋ ๋๋์ฆ๋ ์ฝ๋ฉํ ์คํธ ๊ฒฐ๊ณผ๋ฅผ ๋ถ์ํ์ฌ ์ฑ์ฉ์ ์ฐธ์ฌํ ๊ฐ๋ฐํ๋ค์ ์ ๊ณตํ๊ธฐ ์ํด ์ง์์..