์ผ | ์ | ํ | ์ | ๋ชฉ | ๊ธ | ํ |
---|---|---|---|---|---|---|
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 |
- React
- js
- ๊ณผ์ ํ ์คํธ
- svgํ์ผ ๋ค๋ฃจ๊ธฐ
- ๋์ ๊ณํ๋ฒ
- Redux toolkit
- ์นด์นด์ค์ฑ์ฉ
- ์ฝํ
- ๋ธ๋ฃจํธํฌ์ค
- router v6
- ๋๋๊ทธ ์ด๋ฒคํธ
- ์ด๋ฏธ์ง ์์
- ์ฝ๋ฉํ ์คํธ
- ๋ถ์คํธ์บ ํ์น๋ชจ๋ฐ์ผ
- DP
- ์๋ฐ์คํฌ๋ฆฝํธ
- Node.js
- ํ๋ก๊ทธ๋๋จธ์ค
- ์นด์นด์ค
- ๋ถ์คํธ์ปจํผ๋ฐ์ค
- custom hook
- TypeScript
- ์ด๋ถํ์
- JavaScript
- ์๋ฐฉํฅ ์ฐ๊ฒฐ ๋ฆฌ์คํธ
- icecandidate
- ์๊ณ ๋ฆฌ์ฆ
- ๋ฐฑ์ค
- ์ฝ๋ ํฌ๋ฉง
- ๋ฆฌ๋์ค ํดํท
- Today
- Total
๋ชฉ๋กํ๋ก๊ทธ๋๋จธ์ค (11)
๐ฅ dev-ruby
์ด๋ฒ์ ์ฐํ ์บ 5๊ธฐ 2์ฐจ ๊ณผ์ ํ ์คํธ๋ฅผ ์ค๋นํ๊ธฐ ์ํด ํ๋ก๊ทธ๋๋จธ์ค์ ๊ณ ์์ด ์ฌ์ง์ฒฉ ์ ํ๋ฆฌ์ผ์ด์ ์ด๋ผ๋ ๊ณผ์ ํ ์คํธ๋ฅผ ํ์ด๋ณด์๋ค. ์ง๋๋ฒ์ ๊ณ ์์ด ์ฌ์ง ๊ฒ์ํ๊ธฐ๋ฅผ ํ์๋๋ฐ ๊ทธ๋ ๋ฐ๋๋ผJS๊ฐ ์ฒ์์ด๋ผ ์ง์ง ์๋ฌด๊ฒ๋ ๋ชจ๋ฅด๊ณ ์ด๊ฒ์ ๊ฒ ๋ค์ง๋ฉด์ ๊ตฌํํ๋๋ ๋จธ๋ฆฌ์ ๋จ์์๋๊ฒ ์๋ค.. ๋ฐ๋๋ผ JS์์ฒด๊ฐ ๋๋ฌด ์ฌ๋ฏธ์์ด์ ๊พธ์ญ๊พธ์ญ ํด์ ๊ทธ๋ฐ๊ฒ๋ ์๋ ๊ฒ ๊ฐ๋ค ใ ๋ญ ์จ๋ ์๋ก ์ ์ด๋งํ๊ณ , ์ด๋ฒ ํฌ์คํ ์์๋ ๊ณผ์ ํ ์คํธ๋ฅผ ๋ฑ ์ด์์ ๋ ์๋ฌด๊ฒ๋ ์๋ ์ ํ์ผ์ ์ด๋ป๊ฒ ๊ตฌ์กฐ๋ฅผ ๊ตฌ์ฑํด๋๊ฐ๋ฉด ๋ ์ง ์์๋ณผ ๊ฒ์ด๋ค. ๋จผ์ ์ฒ์์ index.html์ด ์์ ๊ฒ์ด๋ค. ์๋ฐ์คํฌ๋ฆฝํธ๋ฅผ ๊ตฌํํ๋ฉด์ ํด๋น ํ์ผ์์ ์์๊ฐ ๊ณ์ ์ถ๊ฐ ๋ ๊ฒ์ด๋ค. htmlํ์ผ์์ ํ ์ผ์ jsํ์ผ์ ์ฐ๊ฒฐํด์ฃผ๋ฉด ๋๋ค. ๊ณ ์์ด ์ฌ์ง์ฒฉ scriptํ๊ทธ๋ ์์ ๋ฃ์ด๋, ์..
๋ฌธ์ 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; } ..
๋ฌธ์ https://programmers.co.kr/learn/courses/30/lessons/43238 ์ฝ๋ฉํ ์คํธ ์ฐ์ต - ์ ๊ตญ์ฌ์ฌ n๋ช ์ด ์ ๊ตญ์ฌ์ฌ๋ฅผ ์ํด ์ค์ ์์ ๊ธฐ๋ค๋ฆฌ๊ณ ์์ต๋๋ค. ๊ฐ ์ ๊ตญ์ฌ์ฌ๋์ ์๋ ์ฌ์ฌ๊ด๋ง๋ค ์ฌ์ฌํ๋๋ฐ ๊ฑธ๋ฆฌ๋ ์๊ฐ์ ๋ค๋ฆ ๋๋ค. ์ฒ์์ ๋ชจ๋ ์ฌ์ฌ๋๋ ๋น์ด์์ต๋๋ค. ํ ์ฌ์ฌ๋์์๋ ๋์์ ํ programmers.co.kr ํ์ด function solution(n, times) { times.sort((a, b) => a - b); let min = times[0]; let max = n * times[times.length -1]; while(min acc + Math.floor(mid / curr), 0); // ํ ์ฌ๋๋น ๋ช๋ช ํ ์ ์๋์ง console.log(min, ..