차가운세상

Write a function: function solution(A, B, K); that, given three integers A, B and K, returns the number of integers within the range [A..B] that are divisible by K, i.e.: { i : A ≤ i ≤ B, i mod K = 0 } For example, for A = 6, B = 11 and K = 2, your function should return 3, because there are three numbers divisible by 2 within the range [6..11], namely 6, 8 and 10. Write an efficient algorithm f..

You are given N counters, initially set to 0, and you have two possible operations on them: increase(X) − counter X is increased by 1, max counter − all counters are set to the maximum value of any counter. A non-empty array A of M integers is given. This array represents consecutive operations: if A[K] = X, such that 1 ≤ X ≤ N, then operation K is increase(X), if A[K] = N + 1 then operation K i..

A non-empty array A consisting of N integers is given. Array A represents numbers on a tape. Any integer P, such that 0 < P < N, splits this tape into two non-empty parts: A[0], A[1], ..., A[P − 1] and A[P], A[P + 1], ..., A[N − 1]. The difference between the two parts is the value of: |(A[0] + A[1] + ... + A[P − 1]) − (A[P] + A[P + 1] + ... + A[N − 1])| In other words, it is the absolute differ..

오랜만에 코딩테스트 준비를 하기위해 가볍게 한문제를 풀기로 했다. 그냥 생각이 아는대로 심플하게 생각하고 문제를 풀어보았다.... 심플하게 문제를 풀어야 되는데..... 우선 문제없이 테스트를 통과하게 작성하였다. function solution(N) { const binary = N.toString(2); const binaryArr = binary.split(''); let oneCount = 0; let zeroCount = 0; let maxZeroCount = 0; for(let i =0; i m..