Programming Articles - Page 2485 of 3366

The string is actually a one-dimensional array of characters which is terminated by a null character '\0'. Thus a null-terminated string contains the characters that comprise the string followed by a null.To find the length of a string we need to loop and count all words in the loop until the ‘\0’ character is matched.For exampleInput −naman Output − string length is 5Explanation − we need to iterate over each index of the string until reach the end of string means ‘\0’ which is the null character. Example#include #include int main() {    char string1[]={"naman"};    int i=0, length;    while(string1[i] !='\0') ... Read More

For a number n given, we need to find whether all digits of n divide it or not i.e. if a number is ‘xy’ then both x and y should divide it.SampleInput - 24 Output - Yes Explanation  - 24 % 2 == 0, 24 % 4 == 0Using conditional statements checking if each digit is non-zero and divides the number. We need to iterate over each digit of the number. And the check for the divisibility of the number for that number.Example#include int main(){    int n = 24;    int temp = n;    int flag=1;    while (temp > ... Read More

A palindrome is a word, number, phrase, or other sequences of characters which reads the same backward as forward. Words such as madam or racecar or the number 10801 are a palindrome.For a given string if reversing the string gives the same string then we can say that the given string is a palindrome. Which means to check for the palindrome, we need to find whether the first and last, second and last-1, and so on elements are equal or not.Input − naman Output − string is a palindrome Input − tutorials point Output − string is not a palindromeIn C++ Program to ... Read More

A program to concatenate a string a given number of times will run the string concatenate method n number of times based on the value of n.The result would be string repeated a number of times.Examplegiven string: “ I love Tutorials point” n = 5OutputI love Tutorials pointI love Tutorials pointI love Tutorials pointI love Tutorials point I love Tutorials pointAfter seeing the output, it is clear that what the function will do.Example#include #include using namespace std; string repeat(string s, int n) {    string s1 = s;    for (int i=1; i

The bitset all() function an inbuilt function of the C++ STL( Standard Template Library). This function returns a Boolean value. The returned value is true if all the bits of the calling bitset are 1 else it will return false.The function does not accept any parameter and returns a Boolean value.SyntaxBool bitset_name .all()SampleBitset = 100101OutputfalseBecause all bits of the set need to be true in order to return a true value.Example#include using namespace std; void printer(bool val){    if(val){       cout

The bitset flip() method is an inbuilt method of C++ STL( Standard Template Library). It flips the bits of the calling bitset. This method flips all 0’s to 1’s and all 1’s to 0’s, which means it reverse each and every bit of the calling bitset when no parameter is passed.If a parameter is passed the flip method will flip only the nth bit for the integer n passed. For example, if 5 is passed then the flip method will flip 5th bit of of the calling bitset.Syntaxbitset_name.flip(int pos)SampleInitial bitset: 011001After applying the bits flip function with no parameter: 100110After ... Read More

To delete a tree we need to traverse each node of the tree and then delete each of them. this one by one delete every node of the tree and makes it empty. For this, we need to use a method that traverses the tree from bottom to up so that we can delete the lower notes first and then their parents so that no extra complexities arise. Based on the condition that we need, The postorder traversal will be the best suited And works efficiently so that our program will be optimum.The post-order for the following tree is -2-6-4-12-17-15The ... Read More

A function that returns 2 for input 1 and 1 for input 2 is to be made. This function can be made in many ways based on the logic you use. The easiest way to do this is to use a conditional statement that if the number is 1 then return 2 otherwise return 1 and ways include using mathematical operations (any will do) and XOR operation.Example#include // Method 1 using the if statement int reverseif(int x) {    if (x == 1) return 2;    else return 1; } // Method 2 using the subtarction form sum of ... Read More

To print any string without using a semicolon we need to find how the standard output work and why is semicolon used.The semicolon is a end of line statement that is used to tell the program that the line is ended here. The standard print statement printf used here is a method of the standard io library. Let's dig deep into the printf() method.int printf(const char *format , ...)This method returns an integer and has a set of arguments format and … . The format is a string that is printed in the output screen. And the … is the ... Read More

In this problem, you are given N painting and we have m color that we can make paintings with and we need to find the number of ways in which we can draw the painting such that none of the same color paintings are to each other.The program’s output can have very large values and handing these values is a bit problem so we will calculate its answer in standard modulo 109 +7.The formula to find the number ways is :Ways = n*(m-1)(n-1)Example to describe the problem, this will need the number of paintings n and number of colors m ... Read More