DEV Community

Lakshya Tyagi
Lakshya Tyagi

Posted on

1 1

JavaScript Code Daily Challenge #13

About

This is a series of JavaScript Code Daily Challenge. Each day I show a few solutions written in JavaScript. The questions are from coding practice/contest sites such as HackerRank, LeetCode, Codeforces, Atcoder and etc.

Find Digits
https://www.hackerrank.com/challenges/find-digits/problem

'use strict';

const fs = require('fs');

process.stdin.resume();
process.stdin.setEncoding('utf-8');

let inputString = '';
let currentLine = 0;

process.stdin.on('data', inputStdin => {
    inputString += inputStdin;
});

process.stdin.on('end', _ => {
    inputString = inputString.replace(/\s*$/, '')
        .split('\n')
        .map(str => str.replace(/\s*$/, ''));

    main();
});

function readLine() {
    return inputString[currentLine++];
}
Enter fullscreen mode Exit fullscreen mode

Complete the function findDigits(n) in comment

function findDigits(n) {


}
Enter fullscreen mode Exit fullscreen mode
function main() {
    const ws = fs.createWriteStream(process.env.OUTPUT_PATH);

    const t = parseInt(readLine(), 10);

    for (let tItr = 0; tItr < t; tItr++) {
        const n = parseInt(readLine(), 10);

        let result = findDigits(n);

        ws.write(result + "\n");
    }

    ws.end();
}
Enter fullscreen mode Exit fullscreen mode

Sentry image

See why 4M developers consider Sentry, “not bad.”

Fixing code doesn’t have to be the worst part of your day. Learn how Sentry can help.

Learn more

Top comments (1)

Collapse
 
lakshyatyagi24 profile image
Lakshya Tyagi
function findDigits(n) {
    let num="", count=0;
    num=n.toString();
    for(let i=0; i<num.length; i++)
    {
        if(num[i]!=0 && n%num[i]===0)
        {
            count=count+1;
        }
    }
    return count;
}
Enter fullscreen mode Exit fullscreen mode