Server Side Programming Articles - Page 1400 of 2650

Suppose we have a list of distinct words, we have to find the number of different ways we can concatenate two different words from the given list of words to make a palindrome.So, if the input is like words = ["time", "emit", "mo", "m"], then the output will be 3, as we can make "timeemit", "emittime", and "mom".To solve this, we will follow these steps −res := 0ln := number of words in the arrayfor k in range 0 to 1, dofor i in range 0 to ln − 1, dofor j in range i + 1 to ln − ... Read More

Suppose we have a list nums and another value k, we have to find the maximum values of each sublist of size k.So, if the input is like nums = [12, 7, 3, 9, 10, 9] k = 3, then the output will be [12, 9, 10, 10]To solve this, we will follow these steps −if k > size of nums, thenreturn a blank listres := a new listtemp := nums[0]temp := npoint := 0for i in range 0 to k − 1, doif nums[i] > temp, thentemp := nums[i]point := iinsert temp at the end of resfor i in ... Read More

Suppose we have a list with only two values 1 and −1. We have to find the length of the longest sublist whose sum is 0.So, if the input is like nums = [1, 1, −1, 1, 1, −1, 1, −1, 1, −1], then the output will be 8, as the longest sublist is [−1, 1, 1, −1, 1, −1, 1, −1] whose sum is 0.To solve this, we will follow these steps −table := a new empty mapcs := 0, max_diff := 0for i in range 0 to size of nums − 1, docs := cs + nums[i]if cs ... Read More

Suppose we have a number k and another string s, we have to find the size of the longest substring that contains at most k distinct characters.So, if the input is like k = 3 s = "kolkata", then the output will be 4, as there are two longest substrings with 3 distinct characters these are "kolk" and "kata", which have length 4.To solve this, we will follow these steps −ans := 0, left := 0table := a new mapfor right is in range 0 to size of s − 1, dotable[s[right]] := 1 + (s[right] if exists otherwise 0)if ... Read More

Suppose we have a string s (lowercase), we have to find the length of the longest substring where each vowel occurs even number of times.So, if the input is like s = "anewcoffeepot", then the output will be 10, as the substring "wcoffeepot" has two vowels "o" and "e", both of which occurs two times.To solve this, we will follow these steps −vowels := a map assigning vowels and numeric values as {a:0, e:1, i:2, o:3, u:4}prefix := an empty map and insert a key-value pair (0, −1) into itmask := 0, n := size of s, res := 0for ... Read More

Suppose we have a string s, which we can rotate at any point exactly once. We have to find the length of the longest palindromic substring we can get by doing this operation.So, if the input is like s = "elklev", then the output will be 7, as we can rotate between "el" and "klev" to get "levelk". So here the longest palinfromic substring length is 5.To solve this, we will follow these steps −s2 := concatenate s twicemax_len := 0for x in range 0 to size of s − 1, dofor y in range 0 to size of s, ... Read More

Suppose we have a string s, we have to find the longest prefix of s, which is also a suffix (excluding itself). If there is no such prefix, then simply return blank string.So, if the input is like "madam", then the output will be "m", it has 4 prefixes excluding itself. These are "m", "ma", "mad", "mada" and 4 suffixes like "m", "am", "dam", "adam". The largest prefix which is also suffix is given by "m".To solve this, we will follow these steps −Define a function lps(), this will take s, n := size of sDefine an array ret of ... Read More

Suppose we have one directed acyclic graph represented by the adjacency list. We have to find the longest path in the graph without node repetition.So, if the input is likethen the output will be 4, as the path is 0 -> 1 -> 3 -> 4 -> 2 with length 4.To solve this, we will follow these steps −ans := 0n := node count of graphtable := a list of size n and fill with -1Define a function dfs() . This will take uif table[u] is not -1, thenreturn table[u]p_len := 0for each vectex v in graph[u], dop_len := maximum ... Read More

Suppose we have a lowercase string s; we have to find the length of the longest palindromic subsequence in s.So, if the input is like s = "aolpeuvekyl", then the output will be 5, as the palindrome is "level".To solve this, we will follow these steps −n := size of sDefine a function dp() . This will take i, jif i is same as j, thenreturn 1otherwise when i > j, thenreturn 0otherwise, if s[i] is same as s[j], thenreturn 2 + dp(i + 1, j - 1)otherwise, return maximum of dp(i + 1, j) and dp(i, j - 1)return ... Read More

Suppose we have a 2D matrix, we have to find the length of the longest strictly increasing path. To traverse the path we can move up, down, left, or right nor diagonally.So, if the input is like246157339then the output will be 6, as The longest path is [1, 2, 4, 6, 7, 9]To solve this, we will follow these steps −n := row count of matrix , m := column count of matrix moves := a list of pairs to move up, down, left and right [[1, 0], [-1, 0], [0, 1], [0, -1]] Define a function dp() . This ... Read More