Found 9326 Articles for Object Oriented Programming

We are required to write a JavaScript function that takes in two strings. Let’s call them str1 and str2. The function should then find out the longest consecutive string that is common to both the input strings and return that common string.For example −If the input strings are −const str1 = 'ABABC'; const str2 = 'BABCA';Then the output string should be −const output = 'BABC';ExampleFollowing is the code −const str1 = 'ABABC'; const str2 = 'BABCA'; const findCommon = (str1 = '', str2 = '') => {    const s1 = [...str1];    const s2 = [...str2];    const arr ... Read More

Radix Sort Radix sort is a sorting algorithm that sorts data with integer keys by grouping keys by the individual digits which share the same significant position and value.We are required to write a JavaScript function that takes in an array of literals as the only argument. The function should sort the array in either increasing or decreasing order using the radix sort algorithm.ExampleFollowing is the code −const arr = [45, 2, 56, 2, 5, 6, 34, 1, 56, 89, 33]; const radixSort = (arr = []) => {    const base = 10;    let divider = 1;    let ... Read More

Caesar Cipher AlgorithmThe Caesar Cipher algorithm is one of the simplest and most widely known encryption techniques. It is a type of substitution cipher in which each letter in the plaintext is replaced by a letter some fixed number of positions down the alphabet.For exampleWith a left shift of 3, D would be replaced by A, E would become B, and so on. We are required to write a JavaScript function that takes in a string to be encrypted as the first argument and a shift amount as the second argument.The shift amount can be a positive or negative integer ... Read More

Suppose we have an array of m * n order. A person starts at the start block of the 2-D array (0, 0) and he wants to reach the end (m, n). The limitation is that at once, he can either move one step down or one step right.We are required to write a JavaScript function that takes in the height and width of the 2-D grid.The function should find out the number of unique paths that are available to the person to reach to the end.ExampleFollowing is the code −const height = 3; const width = 4; const findUniquePath ... Read More

We are required to write a JavaScript function that takes in an array of arrays of n * n order (square matrix). The function should rotate the array by 90 degrees (clockwise). The condition is that we have to do this in place (without allocating any extra array).For example −If the input array is −const arr = [    [1, 2, 3],    [4, 5, 6],    [7, 8, 9] ];Then the rotated array should look like −const output = [    [7, 4, 1],    [8, 5, 2],    [9, 6, 3], ];ExampleFollowing is the code −const arr = ... Read More

Interpolation SearchInterpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values).For exampleSuppose, we have a sorted array of n uniformly distributed values arr[], and we need to write a function to search for a particular element target in the array.It does the following operations to find the position −// The idea of the formula is to return a higher value of pos// when element to be searched is closer to arr[hi]. And// smaller value when closer to arr[lo]pos = lo + ((x - arr[lo]) ... Read More

Levenshtein DistanceThe Levenshtein distance is a string metric for measuring the difference between two sequences. It is the minimum number of single-character edits required to change one word into the other.For example −Consider, we have these two strings −const str1 = 'hitting'; const str2 = 'kitten';The Levenshtein distance between these two strings is 3 because we are required to make these three edits −kitten → hitten (substitution of "h" for "k")hitten → hittin (substitution of "i" for "e")hittin → hitting (insertion of "g" at the end)We are required to write a JavaScript function that takes in two strings and calculates ... Read More

The power set of a set S is the set of all of the subsets of S, including the empty set and S itself. The power set of set S is denoted as P(S).For exampleIf S = {x, y, z}, the subsets are −{    {},    {x},    {y},    {z},    {x, y},    {x, z},    {y, z},    {x, y, z} }We are required to write a JavaScript function that takes in an array as the only argument. The function should find and return the power set for the input array.ExampleFollowing is the code −const set ... Read More

RadianThe radian is the unit for measuring angles and is the standard unit of angular measure used in many areas of mathematics.We are required to write a JavaScript function that takes in a number that represents some degree and returns its corresponding radian.ExampleFollowing is the code −const deg = 180; const degreeToRadian = (degree) => {    const factor = (Math.PI / 180);    const rad = degree / factor;    return rad; }; console.log(degreeToRadian(deg));OutputFollowing is the output on console −10313.240312354817

Suppose we have the following problem −There are n stairs, a person standing at the bottom wants to reach the top. The person can climb either 1 or 2 stairs at a time. We are required to count the number of ways, the person can reach the top.We are required to write a JavaScript function that takes in a number n that denotes the number of stairs. The function should count and return the number of ways in which the stairs can be climbed.ExampleFollowing is the code −const recursiveStaircase = (num = 10) => {    if (num