Count of numbers in the range [L, R] which satisfy the given conditions

<script>

// JavaScript implementation of the approach

// Maximum possible valid number
let MAX = 543210;

// To store all the required number
// from the range [1, MAX]
let ans = [];

// Function that returns true if x
// satisfies the given conditions
function isValidNum(x)
{
    // To store the digits of x
    let mp = new Map();
  
    for (let i = 0; i < x.length; i++)
    {
  
        // If current digit appears more than once
        if (mp.has(x[i].charCodeAt(0) - '0'.charCodeAt(0))) 
        {
            return false;
        }
  
        // If current digit is greater than 5
        else if (x[i].charCodeAt(0) - '0'.charCodeAt(0) > 5)
        {
            return false;
        }
  
        // Put the digit in the map
        else
        {
            mp.set(x[i].charCodeAt(0) - '0'.charCodeAt(0), 1);
        }
    }
    return true;
}

// Function to generate all the required
// numbers in the range [1, MAX]
function generate()
{
    // Insert first 5 valid numbers
    let q = [];
    q.push("1");
    q.push("2");
    q.push("3");
    q.push("4");
    q.push("5");
  
    let flag = true;
  
    // Inserting 0 externally because 0 cannot
    // be the leading digit in any number
    ans.push("0");
  
    while (q.length!=0)
    {
        let x = q.shift();
        
  
        // If x satisfies the given conditions
        if (isValidNum(x)) 
        {
            ans.push(x);
        }
  
        // Cannot append anymore digit as
        // adding a digit will repeat one of
        // the already present digits
        if (x.length == 6)
            continue;
  
        // Append all the valid digits one by
        // one and push the new generated
        // number to the queue
        for (let i = 0; i <= 5; i++) 
        {
            let z = (i).toString();
  
            // Append the digit
            let temp = x + z;
  
            // Push the newly generated
            // number to the queue
            q.push(temp);
        }
    }
}

// Function to compare two Strings
// which represent a numerical value
function comp(a,b)
{
    if (a.length== b.length)
    {
        
      
        return a < b ? true : false;
    }
    else
        return a.length < b.length;
}

// Function to return the count of
// valid numbers in the range [l, r]
function findcount(l,r)
{
    // Generate all the valid numbers
    // in the range [1, MAX]
    generate();
  
    // To store the count of numbers
    // in the range [l, r]
    let count = 0;
  
    // For every valid number in
    // the range [1, MAX]
    for (let i = 0; i < ans.length; i++) 
    {
  
        let a = ans[i];
  
        // If current number is within
        // the required range
        if (comp(l, a) && comp(a, r)) 
        {
            count++;
        }
  
        // If number is equal to either l or r
        else if (a == l || a == r) 
        {
            count++;
        }
    }
    return count;
}

// Driver code
let l = "1", r = "1000";
  
document.write(findcount(l, r));


// This code is contributed by unknown2108

</script>

// JavaScript implementation of the approach
// for checking if number has all unique digits

// creating function to check if duplicate digit exists
function possible(x) {

    // creating dictionary to check if duplicate digit exists
    var d = {};

    for (var i = 0; i < x.length; i++) {

        if (!(x[i] in d)) {

            d[x[i]] = 1;

        } else {

            return 0;

        }
    }
    return 1;
}

// to create a list containing all possible no.
// with unique digits
// digits <= 5
function total(a) {

    // initializing i for the first index of list 'a'
    var i = 1;

    // traversing till i is less than length of list 'a'
    while (i < a.length) {

        // considering ith index value of list 'a'
        var x = a[i];

        i += 1;

        // Cannot append anymore digit as
        // adding a digit will repeat one of
        // the already present digits
        if (x.length == 6) {

            continue;
        }
        // Append all the valid digits one by
        // one and append the new generated
        for (var j = 0; j < 6; j++) {
            // Append the digit
            var z = j.toString();
            // If combination satisfies the given conditions
            if (possible(x + z)) {
                // Push the newly generated
                a.push(x + z);
            }
        }
    }
}

// function to print the count within range
// using binary search
function PrintSolution(a, l, r) {

    var ans1 = 0;
    var ans2 = 0;

    var low = 0;

    var high = a.length - 1;

    // finding the index for l
    while (low <= high) {
        var mid = Math.floor((low + high) / 2);

        if (parseInt(a[mid]) === l) {

            ans1 = mid;

            break;

        }

        if (parseInt(a[mid]) > l) {

            ans1 = mid;
            high = mid - 1;

        } else {

            low = mid + 1;
        }
    }

    low = 0;

    high = a.length - 1;
    // finding index for r
    while (low <= high) {

        var mid = Math.floor((low + high) / 2);

        if (parseInt(a[mid]) === r) {

            ans2 = mid;

            break;

        }

        if (parseInt(a[mid]) < r) {

            ans2 = mid;
            low = mid + 1;

        } else {

            high = mid - 1;
        }
    }

    console.log(ans2 - ans1 + 1);

}

// Driver Code
var a = ['0', '1', '2', '3', '4', '5'];

// calling function to calculate
// all possible combination available
total(a);

var l = 1;
var r = 1000;

PrintSolution(a, l, r);

// This code is contributed by phasing17