Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
-
Economics & Finance
Server Side Programming Articles
Page 1565 of 2109
C++ Program for Generating Lyndon Words of Length n
In this problem, we need to generate the Lyndon words of the length n using the given characters. The Lyndon words are words such that any of its rotations is strictly larger than itself in the lexicographical order. Here are examples of Lyndon words. 01 − The rotations of ‘01’ is ‘10’, which is always strictly greater than ‘01’. 012 − The rotations of ‘012’ is ‘120’ and ‘210’, which is strictly greater than ‘012’. Problem statement − We have given an array s[] containing numeric characters. Also, we have given n representing the length ...
Read MoreMinimum steps to determine the subsequence with max 1s based on given conditions
The aim of this article is to implement a program to find minimum steps to determine the subsequence with max 1s based on given conditions. So as we all know, a one-dimensional array containing characters that is terminated by a null can be used to define a string. Given is a string Str of length K, wherein K is always even, and contains the characters "0, " "1, " and "?" Divide the string to two separate strings, let's call them Str1 and Str2, each of which is going to include the characters at the even values of Str and ...
Read MoreMinimize count of repositioning of characters to make all given Strings equal
The aim here is to determine whether it would be feasible to make all of the strings identical in any amount of operations provided an array Str of strings with size n. Any element can be taken out of the string and put back in at any point in the same or another string all in one action. Return "Yes" if the strings are able to be made to equal one another, and "No" if not, along with the fewest number of operations necessary. Problem Statement Implement a program to minimize count of repositioning of characters to make all given ...
Read MoreCount of strings to be concatenated with a character having frequency greater than sum of others
Our main aim here is to determine the most strings that are capable of being concatenated to ensure that just one letter has a frequency that exceeds the total of all the other characters, provided an array called arr[] containing M strings. Before going further, let's understand some basic concepts of array and string. The array is nothing but a group of identically data-typed elements held in consecutive memory sections. The array in the C programming language has a fixed size, which means that once the size is specified, it cannot be changed; you cannot shrink or extend it. Let's ...
Read MoreSort array of strings after sorting each string after removing characters whose frequencies are not a powers of 2
In this problem, we need to remove the characters from the string whose frequency is not the power of 2. After that, we need to sort each string of the array in non-increasing order. Problem statement- We have given an array arr[] containing total N strings of different lengths. We need to remove the character from the string if its frequency is not the power of 2. After that, we need to sort each string Sample examples Input – arr[] = {"abde", "cpcc", "ddddd", "kk"} Output – edba, p, kk Explanation In the string ‘abde’ string, all characters' frequency is ...
Read MoreReorder characters of a string to valid English representations of digits
In this problem, we need to reorder the characters of a given string to valid English representations of digits. The first approach can be to find all permutations of the string, extract the English words related to numeric digits, and convert them to digits. Another approach that can be used to solve the problem is by finding one unique character from each word. In this tutorial, we will learn both approaches to solving the given problem. Problem statement- We have given a sting containing lowercase characters and a length equal to N. The string contains the English word representation of ...
Read MoreReduce a string to a valid email address of minimum length by replacing specified substrings
In this problem, we have given the email string containing the ‘dot’ and ‘at’ words. We need to replace them with ‘.’ And ‘@’ characters. Note – The valid email address should contain the ‘@’ character only once. It should contain any prefixes before the ‘@’ character and the domain name after that. Also, a valid email can contain multiple ‘.’ Characters. Furthermore, the ‘@’ and ‘.’ Characters should not be at the start or end of the email address. Problem statement – We have given a string str containing the email address, and the length of the string is equal ...
Read MoreNumber of substrings having an equal number of lowercase and uppercase letters
In this problem, we need to count the total number of strings of the given string containing an equal number of lowercase and uppercase characters. The naïve approach to solving the problem is to find all substrings and count the total number of substrings with an equal number of lowercase and uppercase characters. The efficient approach is using the subarray sum problem. We can consider lowercase characters as -1 and uppercase characters as +1, and we will learn both approaches to solve the problem. Problem statement- We have given string str containing the lowercase and uppercase alphabetical characters. We need ...
Read MoreModify a string by circularly shifting each character to the right by respective frequencies
In this problem, we need to right-shift each character of a given string by its frequency. To solve the problem, we can count the frequency of each character and store it in a data structure like an array or map. After that, we can use the ASCII values of the characters to right-shift each character by their frequency. Problem statement- We have given string str containing lowercase characters and a length equal to N. We need to right-shift each character of the string by the frequency of that particular character in the given string. Sample examples Input – str = ‘tutorialspoint’ ...
Read MoreMinimum subsequences of a string A required to be appended to obtain the string B
In this problem, we need to construct the str2 by using the subsequences of the str1. To solve the problem, we can find subsequences of the str1 so that it can cover the substring with a maximum length of str2. Here, we will learn two different approaches to solving the problem. Problem statement – We have given two strings, str1, and str2, of different lengths. We need to construct the str2 from the str1 by following the condition below. Pick any subsequence from the str1, and append it to the new string, which is empty initially. We need to return ...
Read More