takeU

const solution = (n, w, num) => { let res = 1 const total = Math.ceil(n / w) const target = Math.ceil(num / w) const nRemain = n % w || n const numRemain = num % w || num if (total % 2 === target % 2 && nRemain total - 전체 쌓여지는 층 수target - num이 쌓인 층 수total과 target이 같은 방향인지, 반대 방향인지 확인 후 타겟의 위에 상자가 있는지 체크하는 코드를 통해 위에 없는 경우 -1을 해줌

const recur = (num) => { if (num % 5 === 2) return 0 if (num { let res = 0 for (let i = l - 1; i 재귀처음에 n을 같이 넘기니 시간이 몇배로 더걸려서 number만 체크하는 로직으로 변경하니 통과

const solution = (data, col, row_begin, row_end) => { return data .sort((a, b) => { const [x, y] = [a[col - 1], b[col - 1]]; return x !== y ? x - y : b[0] - a[0]; }) .slice(row_begin - 1, row_end) .map((row, i) => row.reduce((acc, cur) => acc + (cur % (row_begin + i)), 0)) .reduce((res, cur) => res ^ cur, 0);}배열 단순 가공

const solution = (k, ranges) => { const dp = [0], res = [] while (k > 1) { let next = k next = k % 2 ? 3 * next + 1 : k / 2 dp.push((dp.at(-1) ?? 0) + (k + next) / 2) k = next } const len = dp.length - 1 for (let range of ranges) { let [start, end] = range res.push(len + end 구간합 문제

const check = (hash, start, n) => { let count = 0 const queue = [start] const visited = Array(n).fill(0) visited[start] = 1 while (queue.length) { count += 1 const cur = queue.shift() for (let num of hash[cur]) { if (!visited[num]) { queue.push(num) visited[num] = 1 } } } return count}const solut..

const bfs = (start, end, maps) => { const dx = [-1, 1, 0, 0] const dy = [0, 0, -1, 1] const visited = Array.from({ length: maps.length }, () => Array(maps[0].length).fill(0)) visited[start[0]][start[1]] = 1 const queue = [start] while (queue.length) { const [x, y, time] = queue.shift() for (let i = 0; i { let s, l, e for (let i = 0; i bfs -ㅠ-

const solution = (numbers) => { const stack = [[0, numbers[0]]], res = Array(numbers.length).fill(-1) for (let i = 1; i 스택

function solution(line) { const spot = [] let [minX, maxX, minY, maxY] = [Infinity, -Infinity, Infinity, -Infinity] for (let i = 0; i maxX) maxX = x if (y maxY) maxY = y } } } } const res = Array.from({ length: maxY - minY + 1 }, () => Array(maxX - minX + 1).fill('.')) for (let [x, y] of spot) { res[y - minY][x - min..

const dx = [-1, 0, 1, 0]const dy = [0, -1, 0, 1] const dfs = (maps, visited, x, y, sum) => { visited[x][y] = 1 for (let i = 0; i { const res = [] const [x, y] = [maps.length, maps[0].length] const visited = Array.from({ length: x }, () => Array(y).fill(0)) for (let i = 0; i a - b) : [-1]}dfs

class MaxHeap { constructor() { this.heap = []; } getParentIndex(index) { return Math.floor((index - 1) / 2); } getLeftChildIndex(index) { return 2 * index + 1; } getRightChildIndex(index) { return 2 * index + 2; } swap(index1, index2) { [this.heap[index1], this.heap[index2]] = [this.heap[index2], this.heap[index1]]; } insert(value) { this.heap.push(value); this.h..