Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Suppose we have a given string, we have to find the largest sub-string which is a prefix, a suffix and a sub-string of that given string. If there is no such substring, then return -1.So, if the input is like "languagepythonlanguageinterestinglanguage", then the output will be "language"To solve this, we will follow these steps −Define a function get_lps() . This will take stringn := size of stringlong_pref_suff := an array of size n, and fill with 0size := 0, long_pref_suff[0] := 0, i := 1while i < n is non-zero, doif string[i] is same as string[size], thensize := size + ... Read More
Suppose we have an array A of n numbers, where A[i] indicates the number of distinct characters in the prefix of length (i + 1) of a string s, we have to find the lexicographically smallest string that satisfies the given prefix array. All characters will be lowercase English alphabets [a-z]. If there is no such string then return -1.So, if the input is like A = [1, 1, 2, 3, 4], then the output will be aabcd as prefix[0] has 1 distinct character, prefix[1] has 1 distinct character, prefix[2] has 2 distinct characters, prefix[3] has 3 distinct characters, prefix[4] ... Read More
Suppose we have two arrays A and B with n numbers, we have to rearrange the elements of B in itself in a way such that the sequence formed by (A[i] + B[i]) % n after rearranging it is lexicographically smallest. Finally we will return the lexicographically smallest possible sequence.So, if the input is like A = {1, 2, 3, 2}, B = {4, 3, 2, 2}, then the output will be [0, 0, 1, 2]To solve this, we will follow these steps −n := size of aDefine one map my_mapDefine one set my_setfor initialize i := 0, when i ... Read More
Suppose we have a string S; we have to find the lexicographically largest palindromic subsequence of that string.So, if the input is like "tutorialspointtutorial", then the output will be "uu"To solve this, we will follow these steps −ans := blank stringmax_val := s[0]for i in range 1 to size of s, domax_val := maximum of max_val, s[i]for i in range 0 to size of s, doif s[i] is same as max_val, thenans := ans + s[i]return ansExample Let us see the following implementation to get better understanding − Live Demodef largest_palindromic_substr(s): ans = "" max_val = s[0] for i ... Read More
Suppose we have a list in Scala, this list is defined under scala.collection.immutable package. As we know, a list is a collection of same type elements which contains immutable (cannot be changed) data. We generally apply last function to show last element of a list.Using last keywordThe following Scala code is showing how to print the last element stored in a list of Scala.Example import scala.collection.immutable._ object HelloWorld { def main(args: Array[String]) { val temp_list: List[String] = List("Hello", "World", "SCALA", "is", "awesome") println("Elements of temp_list: " + temp_list.last) } }Output$scala HelloWorld Elements of ... Read More
Suppose we have a binary matrix, we have to find the largest rectangle of all 1's in that given matrix. The rectangle can be built by swapping or exchanging any pair of columns of that matrix.So, if the input is like100101001111010then the output will be the 6 in this case. The rectangle can be generating by exchanging column 1 with 3. The matrix after exchanging will be −001100011110110To solve this, we will follow these steps −row := size of matcol := size of mat[0]temp := a matrix of order (row + 1) x (col + 1), and fill with 0for ... Read More
Suppose we have a given Binary Tree; we have to find the size of largest Perfect sub-tree in that given Binary Tree. As we know the perfect binary tree is a binary tree in which all internal nodes have two children and all leaves are at the identical level.So, if the input is likethen the output will be 3, and the subtree isTo solve this, we will follow these steps −Define one block called RetType, this will hold isPerfect, height and rootTree, they are all initially 0Define a function called get_prefect_subtree(), this takes rootr_type := a new RetTypeif root is ... Read More
Suppose we have an array of different digits; we have to find the largest multiple of 3 that can be generated by concatenating some of the given digits in that array in any order. The answer may be very large so make it as string. If there is no answer return an empty string.So, if the input is like [7, 2, 8], then the output will be 87.To solve this, we will follow these steps −Define one 2D array d, there will be three rowssort the array digitssum := 0for initialize i := 0, when i < size of digits, ... Read More
Suppose we have a 2D matrix mat and a value K, we have to find the longest rectangular submatrix whose sum is same as K.So, if the input is like28-56-778-311-1443-43110And K = 9then the output will be Top-Left point is (1, 0) and Bottom-Right point is (3, 2).-77811-144-431To solve this, we will follow these steps −MAX := 100Define a function sum_k(), this will take one array arr, start, end, n, k, Define one mapsum := 0, maximum_length := 0for initialize i := 0, when i < n, update (increase i by 1), do −sum := sum + arr[i]if sum is ... Read More
We have an array like this −const arr = [{ year: 2020, month: 'January' }, { year: 2017, month: 'March' }, { year: 2010, month: 'January' }, { year: 2010, month: 'December' }, { year: 2020, month: 'April' }, { year: 2017, month: 'August' }, { year: 2010, month: 'February' }, { year: 2020, month: 'October' }, { year: 2017, month: 'June' }]We have to sort this array according to years in ascending order (increasing order). Moreover, if there exist two objects ... Read More