Question Solution function solution(A) { let peaks = new Array(A.length).fill(false); let peakCount = 0; for (let i = 1; i < A.length-1; i++) { if (A[i-1] < A[i] && A[i] > A[i+1]) { peaks[i] = true; peakCount++; } } if (peakCount === 0 || …

Question Solution function solution(A) { let prefixSumPeaks = new Array(A.length+1).fill(0); let peakArray = new Array(A.length).fill(0); let peakCount = 0; for (let i = 1; i < A.length-1; i++) { if (A[i-1] < A[i] && A[i] > A[i+1]) { peakA…

Question Solution function solution(N) { let min = Number.MAX_SAFE_INTEGER; for (let i = 1; i*i <= N; i++) { if (N%i === 0) { min = Math.min(min, i + N/i); } } return 2*min; }

Question Solution function solution(N) { let count = 0; let i = 1; while (i*i < N) { if (N % i === 0) { count += 2; // console.log(i); } i += 1; } if (i*i === N) { count += 1; } return count; }