In this problem, we will convert the sentence into Pig Latin. We can append the first character of each word at the last and append ‘ay’ after that. We will see three approaches to convert the given sentence into the Pig Latine. The logic is we can append the first character at the end and remove it from the string. After that, we can append ‘ay’ to the word. Problem statement – We have given a string alpha containing multiple words. We need to encode the string into Pig Latin. Note – The Pig Latine is a word encryption ... Read More

In this problem, we need to check whether the string follows the given pattern. We can solve the problem by mapping each character to the word. If any character of the pattern maps more than one word, we can say that the string is not following the pattern. Problem statement – We have given a ‘pat’ string containing N characters and an ‘alpha’ string containing N words. The given task is to check whether the ‘alpha’ string follows the pattern of the ‘pat’ string. Note – We can say that the ‘alpha’ string follows the pattern when the word matches ... Read More

In this problem, we need to find the shortest string, which is a multiple of string A and string B. The problem is very similar to finding the LCM (Least common multiplier) of two numbers. We can find the LCM of both strings’ lengths and make both strings’ lengths equal to LCM by concatenating to itself. After that, we can compare the string to check if it is possible to get the shortest string which multiple of A and B. Problem statement – We have given string A and string B of different lengths. We need to find the shortest ... Read More

In this problem, we need to convert the binary string to the character string. We can convert the binary string to an ASCII number string first, and then we can convert the character string. Problem statement – We have given a binary string bin_str whose size is multiple of 8. We need to convert the binary string to the character string. Sample examples Input bin_str = "0110110001101010" Output 'lj' Explanation – The ‘01101100’ is equivalent to 108 in the decimal, which is equivalent to the ASCII value of the ‘l’. The ‘01101010’ equals 106, and ... Read More

In this problem, we will count the minimum number of characters we need to insert to remove all adjacent duplicate characters. To solve the problem, we need to count the total number of adjacent duplicate character pairs. Problem statement – We have given a string named str containing N alphabetical characters. We need to find the total number of different characters we require to add to the string such that the resultant string shouldn’t contain any adjacent duplicated characters. Sample examples Input str = "ccddrt" Output 2 Explanation – We need to insert one character ... Read More

In this problem, we require to find the minimum jumps required to make to reach the largest and smallest character in the given string. We can move to the next or previous character in one jump. We can solve the problem by finding the position of the lexicographically largest and smallest character in the given string. After that, we can find the minimum jumps required to the found indexes from the left and right sides. Problem statement – We have a string str of length N containing the alphabetical characters in the uppercase. We need to find the minimum number ... Read More

In this problem, we need to find the smallest substring so that we can replace its character and make the frequency of each character equal to the N/3 in the given string. We can use the sliding window technique to solve the problem. We can find the minimum window size, which contains all excess characters, that will be the answer to the problem. Problem statement – We have given a string alpha. The size of the alpha is N which is always divisible by 3. The given task is to find the minimum length of the substring so that we ... Read More

In this problem, we need to find the sum of all prefixes of the given string. The best solution approach is that traverse through each prefix of the string and add them to get the answer. Problem statement - We have given a string named num_Str containing N digits. We need to find the sum of all prefixes of the given string. Sample examples Input num_str = "1123" Output 1247 Explanation - All prefixes of the given strings are 1, 11, 112, and 1123. The sum of all prefixes is 1247. Input num_str = ... Read More

In this problem, we need to convert the given binary string to abababab or aabbaabb format and find the minimum cost for that. Also, we have given the cost to flip any character in the operations array. Problem statement - We have given a bin_str binary string and operations array containing the positive integers. The size of the string and array is the same and even. The task is to find the minimum costs to convert the string in the ababab… or aabbaabb… format. The cost to flip any character in the given string is the value at the ... Read More

In this problem, we need to find the maximum length of the resultant string by appending the array strings to it such that if we choose a string of length x, we can choose the next x/2 strings. We can solve the programming using the recursive function, memoization, and dynamic programming approach. Problem statement - We have given an array of strings named str_array containing the N strings. We need to add the strings given in the array and find the maximum size of the resultant string. While appending the string to the resultant string, we need to ... Read More