Padovan SequenceThe Padovan sequence is the sequence of integers P(n) defined by the initial values −P(0) = P(1) = P(2) = 1and the recurrence relation,P(n) = P(n-2) + P(n-3)The first few values of P(n) are1, 1, 1, 2, 2, 3, 4, 5, 7, 9, 12, 16, 21, 28, 37, 49, 65, 86, 114, 151, 200, 265, …ProblemWe are required to write a JavaScript function that takes in a number n and return the nth term of the Padovan sequence.ExampleFollowing is the code − Live Democonst num = 32; const padovan = (num = 1) => {    let secondPrev = 1, pPrev = 1, pCurr = 1, pNext = 1;    for (let i = 3; i

ProblemWe are required to write a JavaScript function that takes in a number n. Our function should return an array of all such number pairs that when summed are n and both of them are prime.ExampleFollowing is the code − Live Democonst num = 26; const isPrime = (n) => {    if (n % 2 === 0) return false;    let sqrtn = Math.sqrt(n)+1;    for (let i=3; i < sqrtn; i+=2) {       if (n % i === 0) return false;    }    return true; } const primeList = (a) => {    if (isPrime(a)) return ... Read More

ProblemWe are required to write a JavaScript function that takes in a string of characters, str, and a single character, char.Our function should construct a new string that contains the immediate next character present in str after each instance of char (if any).ExampleFollowing is the code − Live Democonst str = 'this is a string'; const letter = 'i'; const findNextString = (str = '', letter = '') => {    let res = '';    for(let i = 0; i < str.length; i++){       const el = str[i];       const next = str[i + 1];       if(letter === el && next){          res += next;       };    };    return res; }; console.log(findNextString(str, letter));Outputssn

ProblemWe are required to write a JavaScript function that takes in an array of numbers. Our function should try and remove the least number of elements from the array so that the array becomes an increasing sequence.ExampleFollowing is the code − Live Democonst arr = [1, 100, 2, 3, 100, 4, 5]; const findIncreasingArray = (arr = []) => {    const copy = arr.slice();    for(let i = 0; i < copy.length; i++){       const el = arr[i];       const next = arr[i + 1];       if(el > next){          copy[i] = undefined;       };    };    return copy.filter(Boolean); }; console.log(findIncreasingArray(arr));Output[ 1, 2, 3, 4, 5 ]

ProblemWe are required to write a JavaScript function that lives on the prototype object of the Array class. This function should take in a callback function and this function should return that very first element for which the callback function yields true.We should feed the current element and the current index to the callback function as first and second argument.ExampleFollowing is the code − Live Democonst arr = [4, 67, 24, 87, 15, 78, 3]; Array.prototype.customFind = function(callback){    for(let i = 0; i < this.length; i++){       const el = this[i];       if(callback(el, i)){     ... Read More

ProblemWe are required to write a JavaScript function that takes in a number n. Starting with ‘1’ our function should construct a string of length n that contains ‘1’ and ‘0’ alternatingly.ExampleFollowing is the code − Live Democonst num = 12; const buildString = (num = 1) => {    let res = '';    for(let i = 0; i < num; i++){       if(i % 2 === 0){          res += 1;       }else{          res += 0;       };    };    return res; }; console.log(buildString(num));Output101010101010

ProblemWe are required to write a JavaScript function that takes in an array of numbers.Our function should construct and return a new array that contains all the numbers of the input array that are not odd.ExampleFollowing is the code − Live Democonst arr = [5, 32, 67, 23, 55, 44, 23, 12]; const findNonOdd = (arr = []) => {    const res = [];    for(let i = 0; i < arr.length; i++){       const el = arr[i];       if(el % 2 !== 1){          res.push(el);          continue;       };    };    return res; }; console.log(findNonOdd(arr));Output[ 32, 44, 12 ]

ProblemWe are required to write a JavaScript function that takes in a string number of at least five digits. Our function should return the greatest sequence of five consecutive digits found within the number given.ExampleFollowing is the code − Live Democonst num = '123546544'; const findGreatestFiveDigit = (num = '') => {    const str = num.toString();    const arr = [];    for(let i = 0; i < str.length; i++){       arr.push(str.slice(i, i + 5));    };    return Math.max(...arr); }; console.log(findGreatestFiveDigit(num));Output54654

ProblemWe are required to write a JavaScript function that takes in an array of words and punctuations. Our function should join array elements to construct a sentence based on the following rules −there must always be a space between words;there must not be a space between a comma and word on the left;there must always be one and only one period at the end of a sentence.ExampleFollowing is the code − Live Democonst arr = ['hey', ', ', 'and', ', ', 'you']; const buildSentence = (arr = []) => {    let res = '';    for(let i = 0; i ... Read More

ProblemWe are required to write a JavaScript function that takes in a number n(n>0). Our function should return an array that contains the continuous parts of odd or even digits. It means that we should split the number at positions when we encounter different numbers (odd for even, even for odd).ExampleFollowing is the code − Live Democonst num = 124579; const splitDifferent = (num = 1) => {    const str = String(num);    const res = [];    let temp = '';    for(let i = 0; i < str.length; i++){       const el = str[i];     ... Read More