Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
ProblemWe are required to write a JavaScript function that takes in a string, str, as the first and the only argument.The purpose of our function is to partition this string into as many parts as possible so that each letter appears in at most one part, and return an array of integers representing the size of these parts.For example, if the input to the function isInputconst str = "ababcbacadefegdehijhklij";Outputconst output = [9, 7, 8];Output ExplanationThe partition is "ababcbaca", "defegde", "hijhklij". This is a partition so that each letter appears in at most one part. A partition like "ababcbacadefegde", "hijhklij" is ... Read More
ProblemWe are required to write a JavaScript function that takes in a 2-D array of literals, arr, as the first and the only argument.Our function should check if every diagonal from top-left to bottom-right has the same element.If it is so, we should return true, false otherwise.For example, if the input to the function isInputconst arr = [ [6, 7, 8, 9], [2, 6, 7, 8], [1, 2, 6, 7], ];Outputconst output = true;Output ExplanationIn the above array, the diagonals are −[1], [2, 2], [6, 6, 6], [7, 7, 7], [8, 8], [9]In each diagonal all elements ... Read More
ProblemWe are required to write a JavaScript function that takes in two strings, str1 and str2 as the first and second argument respectively.Our function should count and return the number of characters of str1 that makes appearances in str2 as well, and if there are repetitive appearances, we have to count them separately.For example, if the input to the function isInputconst str1 = 'Kk'; const str2 = 'klKKkKsl';Outputconst output = 5;ExampleFollowing is the code − Live Democonst str1 = 'Kk'; const str2 = 'klKKkKsl'; var countAppearances = (str1 = '', str2 = '') => { const map = {} ... Read More
ProblemWe are required to write a JavaScript function that takes in a string of characters, str, as the first and the only argument.Our function can transform every letter individually to be lowercase or uppercase to create another string. And we should return a list of all possible strings we could create.For example, if the input to the function isInputconst str = 'k1l2';Outputconst output = ["k1l2", "k1L2", "K1l2", "K1L2"];ExampleFollowing is the code − Live Democonst str = 'k1l2'; const changeCase = function (S = '') { const res = [] const helper = (ind = 0, current = '') => ... Read More
Strictly Increasing SequenceA sequence is strictly increasing if and only if arr[0] < arr[1] < arr[2] < ... < arr[arr.length - 1].ProblemWe are required to write a JavaScript function that takes in two arrays of numbers, arr1 and arr2 as the first and the second argument respectively.We can swap any number of elements from arr1 to arr2, that happen to live on the same indices. It means we can swap arr1[i] with arr2[i]. Our function should return the minimum number of swaps to make both sequences strictly increasing.For example, if the input to the function isInputconst arr1 = [1, 3, ... Read More
ProblemWe are required to write a JavaScript function that takes in an array of numbers, arr, as the first argument, and a number, num, (num { const sum = (arr = []) => arr.reduce((acc, num) => acc + num, 0) let matrix = new Array(num + 1).fill(0).map(() => new Array(arr.length + 1).fill(0)) for (let index = arr.length; index >= 0; index--) { const current = new Array(num + 1).fill(0).map(() => new Array(arr.length + 1).fill(0)) for (let currentK = num; currentK >= 0; currentK--) { for ... Read More
ProblemWe are required to write a JavaScript function that takes in a string of English lowercase alphabets, str, as the first argument and a single character, char, which exists in the string str, as the second argument.Our function should prepare and return an array which, for each character in string str, contains its distance from the nearest character in the string specified by char.For example, if the input to the function isInputconst str = 'somestring'; const char = 's';Outputconst output = [0, 1, 2, 1, 0, 1, 2, 3, 4, 5]ExampleFollowing is the code − Live Democonst str = 'somestring'; const ... Read More
Circular QueueThe circular queue is a linear data structure in which the operations are performed based on FIFO (First In First Out) principle and the last position is connected back to the first position to make a circle. It is also called "Ring Buffer".One of the benefits of the circular queue is that we can make use of the spaces in front of the queue. In a normal queue, once the queue becomes full, we cannot insert the next element even if there is a space in front of the queue. But using the circular queue, we can use the ... Read More
ProblemWe are required to write a JavaScript function that takes in a 2-D binary array, arr, (an array that consists of only 0 or 1), as the first and the only argument.Our function should first flip the matrix horizontally, then invert it, and return the resulting matrix.To flip the matrix horizontally means that each row of the matrix is reversed. For example, flipping [1, 1, 0] horizontally results in [0, 1, 1].To invert a matrix means that each 0 is replaced by 1, and each 1 is replaced by 0. For example, inverting [0, 1, 1] results in [1, 0, ... Read More
Mountain SubsequenceWe call any (contiguous) subarray sub (of arr) a mountain if the following properties hold −sub.length >= 3There exists some 0 < i < sub.length - 1 such that sub[0] < sub[1] < ... sub[i-1] < sub[i] > B[i+1] > ... > sub[sub.length - 1]ProblemWe are required to write a JavaScript function that takes in an array of numbers, arr, as the first and the only argument.Our function is supposed to return the length of the greatest mountain subsequence present in the array arr, if there exists any, 0 otherwise.For example, if the input to the function isInputconst arr ... Read More