Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
In this problem, we are given a two-dimensional array arr[][]. Our task is to create a program to find the Maximum trace possible for any sub-matrix of the given matrix in C++.Problem Descriptionwe need to find the maximum trace for any sub-matrix. The trace is the sum of elements of the main diagonal of the matrix.Let’s take an example to understand the problem, Inputarr[][] ={{-2, 5, 3}, {1, 6, 2}, {4, 3, 9}}Output15ExplanationFor the sub-array: {1, 6} {9, 3}Solution ApproachA simple solution is to find the max sum using the ... Read More
In this problem, we are given a number N denoting the number of platforms a station has with two tracks each. And T trains will be passing the station whose arrival and departure time are given. Each train stops at a specific station. Our task is to create a program to find the Maximum trains for which stoppage can be provided in C++.Let’s take an example to understand the problem, InputN = 3, T = 5 Trains = {{0915, 0930, 2}, {0930, 0945, 1}, {0930, 1200, 1}, {0910, 0925, 3}, {0940, 1015, 1}}Output4ExplanationThe train schedules are, Train 1: Train will ... Read More
In this problem, we are given an array arr[] of N elements initialized with 0. Our task is to create a program to find the Maximum value in an array after m range increment operations in C++.Problem DescriptionOn the array, we will perform m range increment operation of the type, update[L, R, K] = Add value K, to all elements in the range.After performing m operations on the array. We need to find the element with maximum value in the array.Let’s take an example to understand the problem, InputN = 6, m = 4 Update[][] = {{1, 4, 12}, {0, ... Read More
The Bucket Sort works by splitting the array of size n into k buckets which holds a specific range of element values.Then, these buckets are then sorted using a sorting algorithm which can be chosen based on the expected input size.We can describe this algorithm as follows −Algorithm:Create the initial bucketSort function Create variables for i, min, max, and bucket size Find min and max value Create amount of buckets Push values to correct buckets Sort bucketsExampleThe code for this will be −const arr = [32, 6, 34, 4, 78, 1, 6767, 4, 65, 34, 879, 7]; const bucketSort = ... Read More
We are required to write a JavaScript function that takes in two 2-D arrays of numbers and returns their matrix multiplication result.Let’s write the code for this function −ExampleThe code for this will be −const multiplyMatrices = (a, b) => { if (!Array.isArray(a) || !Array.isArray(b) || !a.length || !b.length) { throw new Error('arguments should be in 2-dimensional array format'); } let x = a.length, z = a[0].length, y = b[0].length; if (b.length !== z) { // XxZ & ZxY => XxY throw new Error('number of ... Read More
We are required to write a JavaScript function that takes in a string and constructs a new string with all the uppercase characters from the original string converted to lowercase and all the lowercase characters converted to uppercase from the original string.For example: If the string is −const str = 'The Case OF tHis StrinG Will Be FLiPped';OutputThen the output should be −const output = 'tHE cASE of ThIS sTRINg wILL bE flIpPED';ExampleThe code for this will be −const str = 'The Case OF tHis StrinG Will Be FLiPped'; const isUpperCase = char => char.charCodeAt(0) >= 65 && char.charCodeAt(0) char.charCodeAt(0) ... Read More
We are required to write a JavaScript function that takes in a number and returns an array of all the prime numbers that exactly divide the input number.For example, if the input number is 105.Then the output should be −const output = [3, 5, 7];ExampleThe code for this will be −const num = 105; const isPrime = (n) => { for(let i = 2; i { const res = num % 2 === 0 ? [2] : []; let start = 3; while(start
We are required to write a JavaScript function that takes in a string and returns a new string with all the character of the original string just the whitespaces removed.ExampleThe code for this will be −const str = "This is an example string from which all whitespaces will be removed"; const removeWhitespaces = str => { let newStr = ''; for(let i = 0; i < str.length; i++){ if(str[i] !== " "){ newStr += str[i]; }else{ newStr += ''; }; }; return newStr; }; console.log(removeWhitespaces(str));OutputThe output in the console −Thisisanexamplestringfromwhichallwhitespaceswillberemoved
We are required to write a JavaScript function that takes in an array of numbers and uses the quick sort algorithm to sort it.QuickSort:This algorithm is basically a divide and conquer algorithm where we pick a pivot in every pass of loop and put all the elements smaller than pivot to its left and all greater than pivot to its right (if its ascending sort otherwise opposite)ExampleThe code for this will be −const arr = [43, 3, 34, 34, 23, 232, 3434, 4, 23, 2, 54, 6, 54]; // Find a "pivot" element in the array to compare all other ... Read More
Let’s say that we have a string that may contain any of the following characters.'!', "," ,"\'" ,";" ,"\"", ".", "-" ,"?"We are required to write a JavaScript function that takes in a string and count the number of appearances of these characters in the string and return that count.ExampleThe code for this will be −const str = "This, is a-sentence;.Is this a sentence?"; const countSpecial = str => { const punct = "!,\;\.-?"; let count = 0; for(let i = 0; i < str.length; i++){ if(!punct.includes(str[i])){ continue; }; count++; }; return count; }; console.log(countSpecial(str));OutputThe output in the console −5