We are required to write a JavaScript function that takes in a number between the range [0, 25], both inclusive.Return valueThe function should return the corresponding alphabets for that number.ExampleThe code for this will be −const num = 15; const indexToAlpha = (num = 1) => {    // ASCII value of first character    const A = 'A'.charCodeAt(0);    let numberToCharacter = number => {       return String.fromCharCode(A + number);    };    return numberToCharacter(num); }; console.log(indexToAlpha(num));OutputAnd the output in the console will be −P

We are required to write a JavaScript function that takes in an array of Integers. Making use of recursion and the push and pop methods of the array, the function should sort the array inplace.ExampleThe code for this will be −const stack = [−3, 14, 18, −5, 30]; const sortStack = (stack = []) => {    if (stack.length > 0) {       let t = stack.pop();       sortStack(stack);       sortedInsert(stack, t);    }; } const sortedInsert = (stack, e) => {    if (stack.length == 0 || e > stack[stack.length − 1]) {       stack.push(e);    } else {       let x = stack.pop();       sortedInsert(stack, e);       stack.push(x);    } } sortStack(stack); console.log(stack);OutputAnd the output in the console will be −[ −5, −3, 14, 18, 30 ]

We are required to make a calculator with the RPN (reverse polish notation) input method using Stacks in JavaScript.Consider the following input array −const arr = [1, 5, '+', 6, 3, '-', '/', 7, '*'];Process −1 is an operand, push to Stack.5 is an operand, push to Stack.'+' is an operator, pop 1 and 5, calculate them and push result to Stack.6 is an operand, push to Stack.3 is an operand, push to Stack.'−' is an operator, pop 6 and 3, subtract them and push result to Stack.'/' is an operator, pop 6 and 3, divided them and push result ... Read More

Heap Sort is basically a comparison-based sorting algorithm. It can be thought of as an improved selection sort − like that algorithm, it divides its input into a sorted and an unsorted region, and it interactively shrinks the unsorted region by extracting the target (largest or smallest) element and moving that to the sorted region.ExampleThe code for this will be −const constructHeap = (arr, ind) => {    let left = 2 * ind + 1;    let right = 2 * ind + 2;    let max = ind;    if (left < len && arr[left] > arr[max]) { ... Read More

We are required to write a JavaScript function that takes in a string that represents a binary code. The function should return the alphabetical representation of the string.For example −If the binary input string is −const str = '1001000 1100101 1101100 1101100 1101111 100000 1010111 1101111 1110010 1101100 1100100';Then the output should be −const output = 'Hello World';ExampleThe code for this will be −const str = '1001000 1100101 1101100 1101100 1101111 100000 1010111 1101111 1110010 1101100 1100100'; const binaryToString = (binary = '') => {    let strArr = binary.split(' ');    const str = strArr.map(part => {       return String.fromCharCode(parseInt(part, 2));    }).join('');    return str; }; console.log(binaryToString(str));OutputAnd the output in the console will be −Hello World

We are required to write a JavaScript function that takes in a string as the only input. The function should construct and return the binary representation of the input string.For example −If the input string is −const str = 'Hello World';Then the output should be −const output = '1001000 1100101 1101100 1101100 1101111 100000 1010111 1101111 1110010 1101100 1100100';ExampleThe code for this will be −const str = 'Hello World'; const textToBinary = (str = '') => {    let res = '';    res = str.split('').map(char => {       return char.charCodeAt(0).toString(2);    }).join(' ');    return res; }; console.log(textToBinary('Hello World'));OutputAnd the output in the console will be −1001000 1100101 1101100 1101100 1101111 100000 1010111 1101111 1110010 1101100 1100100

We are required to write a JavaScript function that takes in an array of Numbers as the first argument and a number, say n, as the second argument.Our function should then pick the n greatest numbers from the array and return a new array consisting of those numbers.ExampleThe code for this will be −const arr = [3, 4, 12, 1, 0, 5, 22, 20, 18, 30, 52]; const pickGreatest = (arr = [], num = 1) => {    if(num > arr.length){       return [];    };    const sorter = (a, b) => b - a;   ... Read More

We are required to write a JavaScript function that takes in an array of literal values.The array might contain some repeating values.Our function should remove all the values from the array that are repeating. We are required to remove all instances of all such elements.ExampleThe code for this will be −const arr = [1, 2, 3, 2, 4]; const removeAllInstances = (arr = []) => {    filtered = arr.filter(val => {       const lastIndex = arr.lastIndexOf(val);       const firstIndex = arr.indexOf(val);       return lastIndex === firstIndex;    });    return filtered; }; console.log(removeAllInstances(arr));OutputAnd the output in the console will be −[ 1, 3, 4 ]

Suppose, we have an array of objects that contains data about some students like this −const arr = [{    name: 'A',    idNo: 1,    marks: {       math: 98,       sci: 97,       eng: 89    } }, {    name: 'B',    idNo: 2,    marks: {       math: 88,       sci: 87,       eng: 79    } }, {    name: 'C',    idNo: 3,    marks: {       math: 87,       sci: 98,       eng: 91   ... Read More

In this article, we will learn to build a JavaScript function that calculates the complementary color for a given hex color code. In web development working with colors and their relationships is an essential aspect of design and user interface. One of the concepts that designers often use is complementary colors—colors that are opposite each other on the color wheel, providing contrast and enhancing the visual appeal.You can try our Online Color Picker Tool to create new colors. Understanding Complementary Colors The following is the knowledge through which we understand complementary colors − Complementary ... Read More