DEV Community: Minh Hieu

Gemstones Explain - Solution | Javascript

Minh Hieu — Mon, 21 Sep 2020 16:34:29 +0000

function gemstones(arr) {
  const first = arr[0];
  const checked = {};
  let result = 0;
  for(let i = 0; i < first.length; i++) {
    if (checked[first[i]]) continue;
    checked[first[i]] = true;

    const regex = new RegExp(first[i], 'i');
    let temp = 0;
    for (let j = 1; j < arr.length; j ++) {
      console.log(arr[j], regex.test(arr[j]));
      if (regex.test(arr[j])) {
        temp ++;
      } else {
        break;
      }
    }
    if (temp === (arr.length - 1)) {
result ++;
    }

  }
  return result;
}

gemstones(['abcdde', 'baccd', 'eeabg']);

Problem

Flatland Space Stations Explain - Solution | Javascript

Minh Hieu — Mon, 21 Sep 2020 15:15:23 +0000


function flatlandSpaceStations(n, c) {
  const distance = [];
  for (let i =0; i < n; i++) {
    let temp = [];
    for (let j =0; j < c.length; j ++) {
      temp.push(Math.abs(c[j] - i));
    }
    distance.push(Math.min(...temp));
  }
  return Math.max(...distance);
}

flatlandSpaceStations(5, [0, 4]);

Problem

Lisa's Workbook Explain - Solution | Javascript

Minh Hieu — Mon, 21 Sep 2020 14:24:56 +0000

function workbook(n, k, arr) {
  let special = 0;
  let page = 1;
  for (let i = 0; i < n; i ++) {
    const problems = arr[i];
    let temp = 1;
    const up = Math.ceil(problems / k);
    while (temp <= up) {
      const start = temp === 1 ? 1 : (k * (temp -1)) + 1;
      console.log(start, up);
      const end = temp === up ? problems : temp * k;
      if ( page >= start && page <= end) {
        special++;
      }
      page ++;
      temp++;
    } 
  }
  return special
}

workbook(10, 5, [3, 8, 15, 11, 14, 1, 9, 2, 24, 31])

Problem

CamelCase Explain Solution | Javascript

Minh Hieu — Sun, 20 Sep 2020 11:40:21 +0000

function camelcase(s) {
 const regex = new RegExp(/[A-Z]/g);
  const match = s.match(regex) || [];
  return match.length + 1;

}

Problem

Save the Prisoner Explain Solution | Javascript

Minh Hieu — Sun, 20 Sep 2020 10:22:26 +0000

function saveThePrisoner(n, m, s) {
  console.log((m-1 + s) % n)
  return (m-1 + s)%n || n;
}

saveThePrisoner(3, 1, 2);

Problem

Designer PDF Viewer Explain - Solution | Javascript

Minh Hieu — Sun, 20 Sep 2020 06:36:32 +0000

function designerPdfViewer(h, word) {
  let max = 0;
  const wordSize = word.length;
  for (let i = 0; i < wordSize; i ++) {
    const current = word.charCodeAt(i);
    if (h[current-97] > max) max = h[current-97];
  }
  return max * wordSize;
}

designerPdfViewer([1, 3, 1, 3, 1, 4, 1, 3, 2, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 7]
, 'zaba')

Problem

Drawing Book Explain - Solution | Javascript

Minh Hieu — Sat, 19 Sep 2020 15:53:44 +0000

function pageCount(n, p) {
    /*
     * Write your code here.
     */
  const isFromLast = (n - p) <= (p-1);
  if (isFromLast) {
    if (n % 2 === 0) {
      return Math.ceil((n - p) / 2)
    }
    return Math.floor((n - p) / 2)
  } else {
    return Math.floor(p/2);
  }
}

pageCount(7, 4);

Problem

Service Lane Explain - Solution | Javascript

Minh Hieu — Sat, 19 Sep 2020 03:57:16 +0000

function serviceLane(n, cases) {
  let result = [];
  const caseSize = cases.length;
  for( let i = 0; i < caseSize; i ++) {
    const start = cases[i][0];
    const end = cases[i][1];
    const min = Math.min(...n.slice(start, end + 1));
    result.push(min);
  }
  return result;

}

serviceLane([2, 3, 1, 2, 3, 2, 3, 3], [ [ 0, 3 ], [ 4, 6 ], [ 6, 7 ], [ 3, 5 ], [ 0, 7 ] ])

// You must change main function for exactly input
function main() {
    const ws = fs.createWriteStream(process.env.OUTPUT_PATH)

    const [n, t] = [...readLine().split(' ')].map(x => parseInt(x, 10))
    const width = readLine().split(' ').map(x => parseInt(x, 10))
    const cases = Array(t).fill(0).map(x => readLine().split(' ').map(y => parseInt(y, 10)))
    let result = serviceLane(width, cases)

    ws.write(result.join("\n") + "\n")
    ws.end()
}

Problem

Chocolate Feast Explain - Solution | Javascript

Minh Hieu — Sat, 19 Sep 2020 03:05:08 +0000

function chocolateFeast(n, c, m) {
  let candy = Math.floor(n / c);
  let wrapper = candy;
  let result = candy;
  while(wrapper >= m) {
    const exchanged = Math.floor(wrapper / m);
    wrapper = wrapper - (exchanged * m) + exchanged;
    result+= exchanged;
  }
  return result;
}

chocolateFeast(10, 2, 5);

Problem

Repeated String Explain - Solution | Javascript

Minh Hieu — Sat, 19 Sep 2020 02:18:02 +0000

function repeatedString(s, n) {
  const regex = new RegExp(/a/gi);
  const match = s.match(regex) || [];
  const length = match.length;
  if (length) {
    const ratio = Math.floor(n / s.length);
    const remain = n - (ratio * s.length);
    let x = 0;
    for(let i = 0; i < remain; i++) {
      if (s[i] === 'a') x++;
    }
    return (ratio * length) + x;
  }
  return 0;
}


repeatedString('aba', 10);

Problem