์ผ | ์ | ํ | ์ | ๋ชฉ | ๊ธ | ํ |
---|---|---|---|---|---|---|
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 | 31 |
- React
- ๋ถ์คํธ์บ ํ์น๋ชจ๋ฐ์ผ
- ์ฝ๋ฉํ ์คํธ
- ์๋ฐ์คํฌ๋ฆฝํธ
- ๊ณผ์ ํ ์คํธ
- ์ด๋ฏธ์ง ์์
- ์ด๋ถํ์
- ๋ฆฌ๋์ค ํดํท
- ์นด์นด์ค์ฑ์ฉ
- custom hook
- Redux toolkit
- router v6
- ๋๋๊ทธ ์ด๋ฒคํธ
- JavaScript
- svgํ์ผ ๋ค๋ฃจ๊ธฐ
- ์๋ฐฉํฅ ์ฐ๊ฒฐ ๋ฆฌ์คํธ
- ๋ฐฑ์ค
- ๋์ ๊ณํ๋ฒ
- icecandidate
- js
- ์ฝ๋ ํฌ๋ฉง
- ๋ถ์คํธ์ปจํผ๋ฐ์ค
- TypeScript
- ํ๋ก๊ทธ๋๋จธ์ค
- Node.js
- ์นด์นด์ค
- ์ฝํ
- DP
- ์๊ณ ๋ฆฌ์ฆ
- ๋ธ๋ฃจํธํฌ์ค
- 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://www.acmicpc.net/problem/15686 15686๋ฒ: ์นํจ ๋ฐฐ๋ฌ ํฌ๊ธฐ๊ฐ N×N์ธ ๋์๊ฐ ์๋ค. ๋์๋ 1×1ํฌ๊ธฐ์ ์นธ์ผ๋ก ๋๋์ด์ ธ ์๋ค. ๋์์ ๊ฐ ์นธ์ ๋น ์นธ, ์นํจ์ง, ์ง ์ค ํ๋์ด๋ค. ๋์์ ์นธ์ (r, c)์ ๊ฐ์ ํํ๋ก ๋ํ๋ด๊ณ , rํ c์ด ๋๋ ์์์๋ถํฐ r๋ฒ์งธ ์นธ www.acmicpc.net ํ์ด function solve() { const twoIdxList = [], oneIdxList = []; for (let i = 0; i < n; i++) { for (let j = 0; j < n; j++) { if (city[i][j] === 2) twoIdxList.push([i, j]); else if (city[i][j] === 1) oneIdxList.p..
๋ฌธ์ ์ค๋ช 124 ๋๋ผ๊ฐ ์์ต๋๋ค. 124 ๋๋ผ์์๋ 10์ง๋ฒ์ด ์๋ ๋ค์๊ณผ ๊ฐ์ ์์ ๋ค๋ง์ ๊ท์น์ผ๋ก ์๋ฅผ ํํํฉ๋๋ค. 124 ๋๋ผ์๋ ์์ฐ์๋ง ์กด์ฌํฉ๋๋ค. 124 ๋๋ผ์๋ ๋ชจ๋ ์๋ฅผ ํํํ ๋ 1, 2, 4๋ง ์ฌ์ฉํฉ๋๋ค. ์๋ฅผ ๋ค์ด์ 124 ๋๋ผ์์ ์ฌ์ฉํ๋ ์ซ์๋ ๋ค์๊ณผ ๊ฐ์ด ๋ณํ๋ฉ๋๋ค. 10์ง๋ฒ124 ๋๋ผ10์ง๋ฒ124 ๋๋ผ 1 1 6 14 2 2 7 21 3 4 8 22 4 11 9 24 5 12 10 41 ์์ฐ์ n์ด ๋งค๊ฐ๋ณ์๋ก ์ฃผ์ด์ง ๋, n์ 124 ๋๋ผ์์ ์ฌ์ฉํ๋ ์ซ์๋ก ๋ฐ๊พผ ๊ฐ์ return ํ๋๋ก solution ํจ์๋ฅผ ์์ฑํด ์ฃผ์ธ์. ์ ํ์ฌํญ n์ 500,000,000์ดํ์ ์์ฐ์ ์ ๋๋ค. ์ ์ถ๋ ฅ ์nresult 1 1 2 2 3 4 4 11 ๋ด๊ฐ ํผ ํ์ด // ๋ด ํ์ด functio..