Example:

String: Helpmestudybro
Reversed String: orbydutsempleH
 
String: Programming is cool
Reverse String: looc si gnimmargorP

The steps required to Reverse a String using stack are as follows:

1. Create an empty character stack.
2. Push all the characters of the string into the stack.
3. Nullify the given string.
4. Pop and concatenate all the character from the stack to given string.
5. Return and print the result.

The time complexity of this solution is O(n) and it is using O(n) extra space.

C++ Program to Reverse a String Using Stack is as follows:

/* C++ Program to Reverse a String Using String */
#include<bits/stdc++.h>
using namespace std;

/* Function to Reverse a Stack */
string reverseUsingStack(string str)
{
    /* Create an empty character Stack */
    stack<char> st;
    
    /* Push all the character of the string into stack */
    for(int i = 0; i < str.length(); i++)
    {
        st.push(str[i]);
    }
    
    /* Nullify a string */
    str = "";
    
    /* Pop and concatenate all characters of the stack */
    while(!st.empty())
    {
        str = str + st.top();
        st.pop();
    }
    
    /* Return the reverse string */
    return str;
}
int main()
{
    string str = "helpmestudybro is an emerging website";
    string reverse_string = reverseUsingStack(str);
    cout<<"The Reversed String is:\n"<<reverse_string;
}

OUTPUT:
The Reversed String is:
etisbew gnigreme na si orbydutsempleh

Related Posts:

1. Implement two stacks in a single array
2. Print Bracket Number
3. Next Greater Frequency Element
4. Sort a Stack using Temporary Stack
5. Infix to Postfix Conversion
6. Infix to Prefix Conversion
7. Prefix to Infix Conversion
8. Prefix to Postfix Conversion
9. Postfix to Infix Conversion
10. Postfix to Prefix Conversion
11. Check whether given Parentheses String are Balanced Parentheses or Not.
12. Next Greater Element
13. Find Minimum number of bracket reversals required to make an expression balanced.
14. Implement Queue Using Two Stacks.
15. Find First Non-Repeating Character of the String.
16. Find Most Frequent Element of the Array.
17. Merge Overlapping Intervals using Stacks
18. Implement Stack Using Linked List
19. Largest Rectangular Area in Histogram
20. Length of Longest Valid Substring

The post Reverse a String Using Stack appeared first on Helpmestudybro.

Here, we are given a string of length ‘n’ and our task is to find the first non-repeating character of the string.

Example:

Input:
COMPUTERSCIENCE
Output:
The first non-repeating character of given string is O

There are various methods to find the first non-repeating character of the string. Some of them are:

METHOD 1: Brute-Force Approach to find first non-repeating character of the string

The Brute-Force solution of this problem is to iterate over complete string, and for every character encountered, again iterate over complete string in nested loop and find the frequency of each character of the string. 

While finding the frequency of each character, if the frequency of the current character is 1, then that character is the first non-repeating character of the given string.

If for any character, the frequency is not 1, then there is no non-repeating character present in the string.

C++ Program to find first non-repeating character of the string is as follows:

/* C++ Program to find first non-repeating character of the string */
#include<bits/stdc++.h>
using namespace std;
int main()
{
  string str;
    
  /* Scan the String */
  cout<<"Enter a string:\n";  
  getline(cin,str); 
  
  /* Count the frequency of each character of the string,
    and the first characrter encountered with frequency 1 
    will be result */
    char res;
    int flag = 0;
    for(int i = 0; i < str.length(); i++)
    {
        int count = 0;
        for(int j = 0; j < str.length(); j++)
        {
            if(str[i] == str[j])
            count++;
            if(count > 1)
            break;
        }
        if(count == 1)
        {
            res = str[i];
            flag = 1;
            break;
        }
    }
    /* Printing the Result */
    if(flag == 1)
    cout<<"The first non-repeating character of the given string is "<<res;
    else
    cout<<"There is no non-repeating character present in the string";
}

Output:
Enter a string: COMPUTERSCIENCE
The first non-repeating character of the given string is O
Time Complexity:
O(n^2), where n is the length of the string.

METHOD 2: Hashing Method to find first non-repeating character of the string

The more time efficient method to find the first non-repeating character of the string is hashed based. 

Create a hash map with key of char type and value of integer type. Iterate over the string and increment the value of every character.

Again, scan the string and for every character, if in the map, the character key-pair value is 1, then break the loop and print the character.

C++ Program to find first non-repeating character of the string is as follows:

/*C++ Program to find first non-repeating character of the string*/  
#include<bits/stdc++.h>  
#define size 1000  
using namespace std;  
int main()  
{  
    string str;  
    cout<<"Enter a string:";  
    getline(cin,str);  
    int flag1 = 0;  
    /* Create a Hash Map */  
    map<char,int>mp;  
    /* For every character, increment the  
       key-pair value for that character */  
    for(int i = 0; i <  str.length(); i++)  
    {  
        mp[str[i]]++;  
    }  
    /* Check if key-pair valu1 of any character is 1 */  
    for(int i = 0; i < str.length(); i++)  
    {  
        /* If key-pair value of any character is 1, then  
        that characte is first non-repeating character*/  
        if(mp[str[i]] == 1)  
        {  
            flag1 = 1;  
            cout<<"\nThe first non-repeating character is "<<str[i];  
            break;  
        }  
    }  
    if(flag1 == 0)  
    {  
        cout<<"\nAll the characters in the string are repeating characters!!";  
    }  
}  

Output:
Enter a string: COMPUTERSCIENCE
The first non-repeating character is O
Time Complexity:
O(nlogn), where n is the length of the string, and ‘logn’ is for insertion and searching operation in map.

Related Posts:

1. Find Most Frequent Character of the String.
2. Check Anagram Strings.
3. Check Whether Given String is Palindromic Anagram or Not.
4. Check Whether Given String is Panagram or Not.
5. Find Most Frequent Element of the Array.
6. Find Pair in an Array with Given Sum.
7. Find First Repeating Element of an Array.
8. Find Majority Element of an Array.
9. Check whether given Parentheses String are Balanced Parentheses or Not.
10. Next Greater Element
11. Find Minimum number of bracket reversals required to make an expression balanced.
12. Implement Queue Using Two Stacks.
13. Merge Overlapping Intervals using Stacks
14. Implement Stack Using Linked List
15. Largest Rectangular Area in Histogram
16. Length of Longest Valid Substring
17. Reverse a String using Stack
18. Implement two stacks in a single array
19. Print Bracket Number
20. Next Greater Frequency Element

The post Find First Non-Repeating Character of the String appeared first on Helpmestudybro.

Panagram String: A string is called Panagram String when it contains all the alphabets, irrespective of capitalization.

Example (Check Pangram String):

INPUT:
Qwertyuiopasdfghjklzxcvbnm
OUTPUT:
The given string is a panagram string.

The steps required to check pangram string or not are as follows:

1. Create an hash array of size 123 and initialize it with 0. ( 123 size is taken because the ascii value of A-Z is from 65 to 90 and ascii value of a-z is from 97 to 122).
2. For every alphabet encountered, increment the hash array value for both small and capital alphabet ascii value index.
3. Finally, iterate over hash array from 65 to 90, if any value is zero, then string is not pangram, else string is pangram.

The time complexity of this solution is O(n), for scanning the length of string.

C++ Program to check pangram string is as follows:

/*C++ Program to check panagram string*/  
#include<bits/stdc++.h>  
#define size 1000  
using namespace std;  
int main()  
{  
    string str;  
    cout<<"Enter a string:\n";  
    getline(cin,str);  
    int flag1 = 0;  
    /* Create a Hash Array */  
    int hash[123] = {0};  
    /* For every alphabet, increment the  
       hash-array value for that character */  
    for(int i = 0; i <  str.length(); i++)  
    {  
        if(str[i]>='a' && str[i]<='z')  
        {  
            hash[str[i]]++; /* Increment for small alphabet character */  
            hash[str[i]-32]++; /* Increment for capital alphabet character */  
        }  
        else if(str[i]>='A' && str[i]<='Z')  
        {  
            hash[str[i]]++; /* Increment for Capital alphabet character */  
            hash[str[i]+32]++; /* Increment for small alphabet character */  
        }  
    }  
    /* Check if any hash array value from 65 to 90 is 0 or not */  
    for(int i = 65; i <= 90; i++)  
    {  
        /* If any hash-array value is 0, then  
        that string is not panagram*/  
        if(hash[i] == 0 || hash[i+32] == 0)  
        {  
            flag1 = 1;  
            cout<<"\nThe given string is not pangram";  
            break;  
        }  
    }  
    if(flag1 == 0)  
    {  
        cout<<"\nThe given string is pangram";  
    }  
}  

OUTPUT:
Enter a string: qwertyuiopasdfghjklzxcvbnm
The given string is panagram

Related Posts:

1. Find First Non-Repeating Character of the String.
2. Find Most Frequent Element of the Array.
3. Find Pair in an Array with Given Sum.
4. Find First Repeating Element of an Array.
5. Find Majority Element of an Array.
6. Find Most Frequent Character of the String.
7. Check Anagram Strings.
8. Check Whether Given String is Palindromic Anagram or Not.
9. Program to count occurrences of a particular element in an array.
10. Program to search an element in an Array (Linear Search).
11. Program to Rotate Array Elements by ‘D’ positions.
12. Program to find most frequent element in an array.
13. Program to find pair in an array with given sum.
14. Program to find first repeating element of an array.
15. Program to merge two sorted arrays.
16. Program to find missing number in an array.
17. Program to sort if array is sorted.
18. Program to print Alternate Elements of an Array.
19. Program to swap kth element from beginning to kth element from end in an Array.
20. Program to print all possible subarrays of the given array.

The post Check Pangram String appeared first on Helpmestudybro.

Palindromic Substring are those substrings of given string, which are also palindrome.

Example:

INPUT:
ABAPXP
OUTPUT:
A
ABA
B
A
P
PXP
X
P
P

The steps required to print all palindromic substrings of the given string are as follows:

1. Three loops will be taken.
2. The outer loop will be used for starting character of palindromic substring.
3. The middle loop will be used for ending character of the palindromic substring.
4. The inner most loop will be used for creating the substring from starting character (outer loop) to ending character (middle loop).
5. For every substring created in inner loop, we will check whether it is palindromic string or not. If it is palindromic string, we will print it.

The time complexity of this solution is O(n⁴), where ‘n’ is the length of the string.

C++ Program to print all palindromic substrings of the given string is as follows:

/* C++ Program to print all palindromic substrings of the given string */  
#include<bits/stdc++.h>  
using namespace std;  
/* Function to check whether string is palindrome or not */  
bool palindromic(string str)  
{  
    string temp = str;  
    reverse(temp.begin(),temp.end());  
    if(str == temp)  
    return true;  
    return false;  
}  
int main()  
{  
    string str;  
    cout<<"Enter a string:\n";  
    cin>>str;  
    cout<<"The Palindromic substring are:\n";  
    int size = str.length();  
    /* Outer loop for starting character of substring */  
    for(int i = 0; i < size; i++)  
    {  
        /* Middle loop for ending character of substring */  
        for(int j = i; j < size; j++)  
        {  
            string substring = "";  
            /* Inner loop for creating substring */  
            for(int k = i; k <= j; k++)  
            {  
                substring = substring + str[k];  
            }  
            /* Function to check whether string is palindrome or not */  
            if(palindromic(substring))  
            cout<<substring<<"\n";  
        }  
    }  
}  

OUTPUT:
Enter a string: 
ABAPXP
The Palindromic substring are:
A
ABA
B
A
P
PXP
X
P

Related Posts:

1. Program to check Panagram String.
2. Program to find first non-repeating character of the String.
3. Program to Reverse a String.
4. Program to Count Number of Characters in a String.
5. Program to Count frequency of particular character of the String.
6. Program to Count Number of Vowels and Number of Consonants in a String.
7. Program to Check if String is alphabetic or numeric or alpha-numeric.
8. Program to copy one String to Another.
9. Program to Concatenate Two Strings.
10. Program to Check whether given String is Palindrome or not.
11. Program to convert lower-case alphabet to upper-case alphabet and vice-versa.
12. Program to count total number of words in a string.
13. Program to find smallest and largest word of the String.
14. Program to find Most Frequent Character of the String.
15. Program to Remove all the blank spaces from the String.
16. Program to check if String is isogram or not.
17. Program to Reverse Each word of the String.
18. Program to Print All the Substring of the Given String.
19. Program to find longest palindromic Substring.
20. Program to check Anagram Strings.

The post Print all Palindromic Substrings of the given string – SET 1 appeared first on Helpmestudybro.

A palindrome Anagram string is a string which can be rearranged to form a palindrome. In technical language, any permutation of given string is palindrome.

Example:

INPUT:
AABBC
OUTPUT:
AABBC is palindromic Anagram
Explanation:
AABBC can be rearranged into ABCBA which is an palindrome.

Properties of Palindromic string

1. A palindromic string is a string that can read same from forward or backward. Examples are: “MADAM”, “NITIN”.

2. If the string is even length string, then the frequency of all the characters of the string must be even, then only it can be palindromic anagram.

3. If the string is odd length string, then the frequency of all the characters of the string must be even, except one character, which will have odd frequency, then only it can be palindromic anagram.

SOLUTION:

The steps required to check whether string is palindromic anagram or not are as follows:

1. Check whether the string is odd length of even length.
2. Store the frequency of every character of string in the hash map.
3. If the string is even length string, traverse the hashmap and check whether frequency of all the character is even or not. If frequency of each character in the string is even, then the given string is palindromic anagram string. Else, the given string is not palindromic anagram.
4. If the string is odd length string, traverse the hashmap and check whether frequency of all the character is even or not, except one character which will have odd frequency. If this condition holds, then the given string is palindromic anagram string. Else, the given string is not palindromic anagram.

The time complexity of this solution is O(nlogn), where ‘n’ is the length of the string and ‘logn’ for inserting and searching in the map.

C++ Program to check whether string is Palindromic Anagram or not is as follows: 

/* C++ Program to check whether string is Palindromic Anagram or not */
#include<bits/stdc++.h>
using namespace std;
void checkPalindrome(string str)
{
    int len = str.length();
    int i;
    map<int,int>mp;
    map<int,int> :: iterator itr;
    for(i=0;i<len;i++)
    mp[str[i]]++;
    // If the length of string is even, then
    // to form a palindrome all the frequency
    // of characters must be even
    if(len % 2 == 0)
    {
        for(itr = mp.begin() ; itr!=mp.end() ; ++itr)
        {
            if(itr -> second % 2 != 0)
            {
                cout<<"The string is not palindrome Anagram\n";
                return;
            }
        }
        cout<<"The string is palindrome Anagram\n";
    }
    // Else,to form a palindrome all the frequency
    // of characters must be even except frequency
    // of one character
    else
    {
        int flag = 0;
        for(itr = mp.begin() ; itr!=mp.end() ; ++itr)
        {
            if(itr -> second % 2 != 0)
            {
                flag++;
            }
        }
        // only one character with odd frequency
        if(flag == 1)
            cout<<"The string is palindrome Anagram\n";
        else
            cout<<"The string is not palindrome Anagram\n";
    }
}
int main()
{
    string str;
    /* Scan String */
    cout<<"Enter a string:\n";
    cin>>str;
    /* Check if string is Palindromic Anagram */
    checkPalindrome(str);
}

Output:
Enter a string:
AABBCCD
The string is palindrome Anagram

Related Posts:

1. Check Whether Given String is Panagram or Not.
2. Find First Non-Repeating Character of the String.
3. Find Most Frequent Element of the Array.
4. Find Pair in an Array with Given Sum.
5. Find First Repeating Element of an Array.
6. Find Majority Element of an Array.
7. Find Most Frequent Character of the String.
8. Check Anagram Strings.
9. Find Minimum number of bracket reversals required to make an expression balanced.
10. Implement Queue Using Two Stacks.
11. Merge Overlapping Intervals using Stacks
12. Implement Stack Using Linked List
13. Largest Rectangular Area in Histogram
14. Length of Longest Valid Substring
15. Reverse a String using Stack
16. Implement two stacks in a single array
17. Print Bracket Number
18. Program to find LCM of two numbers.
19. Next Greater Frequency Element
20. Sort a Stack using Temporary Stack

The post Check Whether String is Palindromic Anagram or Not appeared first on Helpmestudybro.

Example:

INPUT:
String 1: “abcd”
String 2: “bcda”
OUTPUT:
The strings are rotation of each other
INPUT:
String 1: “abcd”
String 2: “bacd”
OUTPUT:
The strings are not in rotation of each other.

There are various methods to check if two strings are rotations of each other. Some of them are:

METHOD 1: Brute-Force Approach to check if two strings are rotations of each other

The brute-force solution of the given problem is to generate all possible rotation of first string and compare each rotation of the first string with second string. If any rotation of first string is equal to second string, then the given strings are rotation of each other. If no possible rotation of first string is equal to second string, then the given strings are not rotation of each other.The time complexity of this solution is O(n²), where ‘n’ is the length of the string.

C++ Program to check if two strings are rotations of each other is as follows:

/* C++ Program to check if two strings are rotations of each other */
#include<bits/stdc++.h>
using namespace std;
void checkStringRotation(string str1,string str2)
{
    /* Check String length */
    if(str1.length()!=str2.length())
    cout<<"Strings are not in rotation of each other\n";


    for(int i = 0 ; i< str1.length() ; i++)
    {
        char ch = str1[0];


        // Erase first character of string str1
        str1.erase(str1.begin()+0);


        // Push it back at the end of string
        str1.push_back(ch);

        /* If any rotation is equal to string2, 
           then it is rotation of each other */
        if(str1 == str2)
        {
            cout<<"Strings are in rotation of each other\n";
            return;
        }
    }
    cout<<"Strings are not in rotation of each other\n";
}
int main()
{
    string str1,str2;
    
    /* Scan strings */
    cout<<"Enter string 1:\n";
    cin>>str1;
    cout<<"Enter string 2:\n";
    cin>>str2;
    
    /* Function to check string rotation */
    checkStringRotation(str1,str2);
}

OUTPUT:
Enter string 1: 
ABBA
Enter string 2:
BBAA
Strings are in rotation of each other

METHOD 2: Efficient Method to check if two strings are rotations of each other

The efficient solution of the given problem is to concatenate first string with itself and called it as final_string. Then, search second in final_string. If second string is present in final_string as substring, then, the given strings are rotation of each other. Else, the given strings are not rotation of each other.

The time complexity of this solution is O(n^2), where ‘n’ is the length of the string.

C++ Program to check if two strings are rotations of each other is as follows:

/* C++ Program to check if two strings are rotations of each other */
#include<bits/stdc++.h>
using namespace std;
void checkStringRotation(string str1,string str2)
{
    // If the length of the string are not same,
    // The answer is false.
    
     if(str1.length()!=str2.length())
        cout<<"Strings are not in rotation of each other\n";
    // Concatenate the string with itself
    string final_string = str1 + str1;
    
    if(final_string.find(str2) != string::npos)
        cout<<"Strings are in rotation of each other\n";
    else
        cout<<"Strings are not in rotation of each other\n";
}
int main()
{
    string str1,str2;
    
    /* Scan String */
    cout<<"Enter String1:\n";
    cin>>str1;
    cout<<"Enter String2:\n";
    cin>>str2;
    /* Function to check if strings are rotation of each other */
    checkStringRotation(str1,str2);
}

OUTPUT:
Enter string 1: 
ABBA
Enter string 2:
BBAA
Strings are in rotation of each other
 

Related Posts:

1. Program to check Palindromic Anagram.
2. Program to print all the Palindromic Substring of the String.
3. Program to check Panagram String.
4. Program to find first non-repeating character of the String.
5. Program to Reverse a String.
6. Program to Count Number of Characters in a String.
7. Program to Count frequency of particular character of the String.
8. Program to Count Number of Vowels and Number of Consonants in a String.
9. Program to Check if String is alphabetic or numeric or alpha-numeric.
10. Program to copy one String to Another.
11. Program to Concatenate Two Strings.
12. Program to Check whether given String is Palindrome or not.
13. Program to convert lower-case alphabet to upper-case alphabet and vice-versa.
14. Program to count total number of words in a string.
15. Program to find smallest and largest word of the String.
16. Program to find Most Frequent Character of the String.
17. Program to Remove all the blank spaces from the String.
18. Program to check if String is isogram or not.
19. Program to Reverse Each word of the String.
20. Program to Print All the Substring of the Given String.

The post Check if Two Strings are Rotations of each other appeared first on Helpmestudybro.

Here, we are given two strings and our task is to check whether two strings are anagram of each other or not. 

Two strings are called anagram of each other if the characters and number of characters of the strings are same, but the order of characters of the strings does not matter. In Technical language, two strings are called anagram of each other if they are permutation of each other.

Example:

INPUT:
Str1 = “abcdfr”
Str2 = “frdcba”
OUTPUT:
The strings are anagram of each other
Explanation:
“abcdfr” can be rearranged to form string “frdcba”.
INPUT:
Str1 = “abcdfr”
Str2 = “frdcbx”
OUTPUT:
The strings are anagram of each other
Explanation:
“abcdfr” can be rearranged to form string “frdcbx”

There are various ways to check whether two strings are anagram of each other. Some of them are:

METHOD  1: Sort and compare Technique to check whether two strings are anagram of each other

The brute-force solution of the given problem is to sort the given strings and then check whether both the strings are equal or not after sorting. If they are equal, then the strings are anagram of each other. Else, strings are not anagram of each other.

The time complexity of this solution is O(nlogn), based on type of sorting algorithm used.

C++ Program to check whether two strings are anagram of each other is as follows:

/* C++ Program to check whether two strings are anagram of each other */
#include<bits/stdc++.h>
using namespace std;
void checkAnagram(string str1,string str2)
{
    /* Sort the Strings */
    sort(str1.begin(),str1.end());
    sort(str2.begin(),str2.end());
    
    /* If Str1 is equal to Str2, then 
       strings are anagram of each other*/
    if(str1 == str2)
        cout<<"Strings are Anagram of each other\n";
    else
        cout<<"Strings are not Anagram of each other\n";
}
int main()
{
    string str1,str2;
    
    /* Scan the string */ 
    cout<<"Enter first string:\n";
    cin>>str1;
    cout<<"Enter second string:\n";
    cin>>str2;
    
    /* Function to check Anagram Strings */
    checkAnagram(str1,str2);
}

OUTPUT:
Enter first string:
ABBCD
Enter second string:
BBCAD
Strings are Anagram of each other

METHOD 2: Hashing Based Approach to check whether two strings are anagram of each other

Hashing based solution is a more time efficient approach. 

As we know, we have 256 ASCII character set(0-255).

We will create an integer array of size 256 and initialize it with zero.

We will traverse the first string and for every character encountered in first string, we will increment the ascii position value in the array.

Now, we will traverse the second string and for every character encountered in the second string, we will decrement the ascii position value in the array.

Finally, we will check whether all the values of the array are zero or not. If they are zero, then the given two strings are anagram of each other, else they are not anagram of each other.

The time complexity of Hash Based solution is O(n).

C++ Program to check whether two strings are anagram of each other is as follows:

/* C++ Program to check whether two strings are anagram of each other */
#include<bits/stdc++.h>
using namespace std;
void checkAnagram(string str1,string str2)
{
   int arr[256] = {0};
   int i;
   for(i = 0; i < str1.length(); i++)
   {
        arr[str1[i]]++;
   }
   for(i = 0; i < str2.length(); i++)
   {
        arr[str2[i]]--;
   }
   for(i = 0; i < 256; i++)
   {
       if(arr[i] != 0)
       {
            cout<<"The strings are not anagram of each other\n";
           return;
       }
   }
    cout<<"The strings are anagram of each other\n";
}
int main()
{
    string str1,str2;
    
    /* Scan the string */ 
    cout<<"Enter first string:\n";
    cin>>str1;
    cout<<"Enter second string:\n";
    cin>>str2;
    
    /* Function to check Anagram Strings */
    checkAnagram(str1,str2);
}

OUTPUT:
Enter first string:
ABBCD
Enter second string:
BBCAD
Strings are Anagram of each other

Related Posts:

1. Check Whether Given String is Palindromic Anagram or Not.
2. Check Whether Given String is Panagram or Not.
3. Find First Non-Repeating Character of the String.
4. Find Most Frequent Element of the Array.
5. Find Pair in an Array with Given Sum.
6. Find First Repeating Element of an Array.
7. Find Majority Element of an Array.
8. Find Most Frequent Character of the String.
9. Program to find first repeating element of an array.
10. Program to merge two sorted arrays.
11. Program to find missing number in an array.
12. Program to sort if array is sorted.
13. Program to print Alternate Elements of an Array.
14. Program to swap kth element from beginning to kth element from end in an Array.
15. Program to print all possible subarrays of the given array.
16. Program to print kth smallest and kth largest element of an Array.
17. Program to find equilibrium index of an Array.
18. Program to find majority element of an Array.
19. Program to find mean of the Array.
20. Program to check Idempotent Matrix.

The post Check whether two strings are anagram of each other appeared first on Helpmestudybro.

Longest Palindromic Substring: Longest Palindromic Substring of the given string is a substring of the string which is also palindrome. We need to find the largest possible substring of such kind.

If there is no palindromic substring of length greater than 1 present in the string, simple return first character of the string.

Example:

INPUT:
abcba
OUTPUT:
Longest Palindromic Substring: abcba
Explanation:
“abcba” is itself palindromic string.
INPUT:
abcded
OUTPUT:
Longest Palindromic Substring: ded
Explanation:
“ded” is the longest substring in the string “abcded” which is palindromic.

In this post, we will discuss the brute-force approach to get the solution. The steps required to find longest palindromic substring are:

1. Initialize an empty resultant  string.
2. Generate all possible substring of the given string.
3. For every substring generated, check whether it is palindrome or not.
4. If it is palindrome, check its length with resultant string length.
5. If it’s greater, assign the resultant string with generated palindromic substring.

The time complexity of this solution is O(n⁴) for generating all substring and check palindrome.

C++ Program to Find Longest Palindromic Substring in a given string is as follows:

/* C++ Program to Find Longest Palindromic Substring in a given string */
#include<bits/stdc++.h>
using namespace std;
bool isPalindrome(string str)
{
    string temp = str;
    reverse(temp.begin(),temp.end());
    return (temp==str) ? true : false ;
}
void longestPalindrome(string str)
{
    // Single characterb is itself a palindrome
    string res = str.substr(0,1);
    //Generate all possible substrings of a given string
    for(int i = 0 ; i < str.length() ; i++)
    {
        for(int j = i ; j < str.length() ; j++)
        {
            string substring = "";
            for(int k = i ; k <= j ; k++)
            {
                substring = substring + str[k];
            }
            // check whether generated substring is palindrome or not
            bool checkPalindrome = isPalindrome(substring);
            // If palindrome, compare its length with resultant palindrome
            if(checkPalindrome)
            {
                if(substring.length() > res.length())
                res = substring;
            }
        }
    }
    cout<<"Longest Palindromic Substring: "<<res<<"\n";
}
int main()
{
    string str;
    
    /* Scan String */
    cout<<"Enter a string:\n";
    cin>>str;
    
    /* Function to find Longest Palindromic Substring */
    longestPalindrome(str);
}

OUTPUT:
Enter a string:
abcded
Longest Palindromic Substring: ded

Related Posts:

1. Program to check Anagram Strings.
2. Program to check whether two Strings are Rotation of each other or not.
3. Program to check Palindromic Anagram.
4. Program to print all the Palindromic Substring of the String.
5. Program to check Panagram String.
6. Program to find first non-repeating character of the String.
7. Program to Reverse a String.
8. Program to Count Number of Characters in a String.
9. Program to Count frequency of particular character of the String.
10. Program to Count Number of Vowels and Number of Consonants in a String.
11. Program to Check if String is alphabetic or numeric or alpha-numeric.
12. Program to copy one String to Another.
13. Program to Concatenate Two Strings.
14. Program to Check whether given String is Palindrome or not.
15. Program to convert lower-case alphabet to upper-case alphabet and vice-versa.
16. Program to count total number of words in a string.
17. Program to find smallest and largest word of the String.
18. Program to find Most Frequent Character of the String.
19. Program to Remove all the blank spaces from the String.
20. Program to check if String is isogram or not.

The post Find Longest Palindromic Substring – SET 1 appeared first on Helpmestudybro.

Example:

INPUT:
ABCD
OUTPUT:
No of substring: 10
Substrings: A, B, C, D, AB, BC, CD, ABC, BCD, ABCD

The steps required to count and print all substrings of a string are as follows:

1. Set count = 0.
2. Three nested loops will be taken.
3. The outer loop will be used to take the starting character of the substring.
4. The middle loop will be used to take the last character of the substring.
5. The inner loop will be used to print the substring from starting character (from outer loop) to ending character (from middle loop). Increment count by 1.

C++ Program to count and print all substrings of a string are as follows:

/* C++ Program to count and print all substrings of a string */
#include<bits/stdc++.h>  
using namespace std;  
int main()  
{  
    string str;  
    cout<<"Enter a string:\n";  
    cin>>str;  
    int count = 0;  
    cout<<"The substring are:\n";  
    int size = str.length();  
    /* Outer loop for starting character of substring */  
    for(int i = 0; i < size; i++)  
    {  
        /* Middle loop for ending character of substring */  
        for(int j = i; j < size; j++)  
        {  
            string substring = "";  
            /* Inner loop for creating substring */  
            for(int k = i; k <= j; k++)  
            {  
                substring = substring + str[k];  
            }  
            count++;  
            cout<<substring<<"\n";  
        }  
    }  
    cout<<"The number of substrings are "<<count;  
}  

OUTPUT:
Enter a string: ABCD
The substring are:
A
AB
ABC
ABCD
B
BC
BCD
C
CD
D
The number of substrings are 10
Time Complexity:
O(n^3), where n is the length of the string

Related Posts:

1. Program to find longest palindromic Substring.
2. Program to check Anagram Strings.
3. Program to check whether two Strings are Rotation of each other or not.
4. Program to check Palindromic Anagram.
5. Program to print all the Palindromic Substring of the String.
6. Program to check Panagram String.
7. Program to find first non-repeating character of the String.
8. Program to print all possible subarrays of the given array.
9. Program to print kth smallest and kth largest element of an Array.
10. Program to find equilibrium index of an Array.
11. Program to find majority element of an Array.
12. Program to find mean of the Array.
13. Program to sort an Array of 0s and 1s.
14. Program to find first repeating element of an array.
15. Program to merge two sorted arrays.
16. Program to find missing number in an array.
17. Program to sort if array is sorted.
18. Program to print Alternate Elements of an Array.
19. Program to swap kth element from beginning to kth element from end in an Array.
20. Program to print all possible subarrays of the given array.

The post Print All Substrings of a String appeared first on Helpmestudybro.

Example:

INPUT:
HelpMeStudyBro is an Emerging Website
OUTPUT:
orBydutSeMpleH si na gnigremE etisbeW 

This problem can be easily solved using stack. The steps required to reverse each word in a string is as follows:

1. Create an empty character stack and initialize an empty resultant string.
2. Start traversing a string.
3. Push characters of the string in the stack until ‘space character’ appears.
4. Once space character is appeared.  Pop all characters from the stack and concatenate them with resultant string.
5. Concatenate a ‘space character’ afterwards.
6. Repeat steps from 3 to 5 until complete string is scanned.
7. In last, concatenate the remaining word to resultant string from stack.
8. Return the resultant string.

C++ Program to reverse each word in a string is as follows:

/* Program to reverse each word in a string */
#include<bits/stdc++.h>  
using namespace std;  
string reverseWords(string str)
{
    stack<char>st;
    string res = "";
    for(int i = 0 ; i < str.length() ; i++)
    {
        // Push the complete word in the string
        if(str[i] != ' ')
        {
            st.push(str[i]);
        }
        else
        {
            // reverse the word and concatneate to resultant string
            while(!st.empty())
            {
                
                char ch = st.top();
                res=res+ch;
                st.pop();
            }
            res=res+" ";
        }
    }
    // concatenate the last reversed word to string
    while(!st.empty())
    {
        char ch = st.top();
        res=res+ch;
        st.pop();
    }
    return res;
}
int main()  
{
    string str;
    cout<<"Enter a string: ";
    getline(cin,str);
    string res = reverseWords(str);
    cout<<"\nResultant string:\n"<<res<<"\n";
}

OUTPUT:
Enter a string: 
HelpMeStudyBro is an Emerging Website
Resultant string:
orBydutSeMpleH si na gnigremE etisbeW

Related Posts:

1. Program to Print All the Substring of the Given String.
2. Program to find longest palindromic Substring.
3. Program to check Anagram Strings.
4. Program to check whether two Strings are Rotation of each other or not.
5. Program to check Palindromic Anagram.
6. Program to print all the Palindromic Substring of the String.
7. Program to check Panagram String.
8. Program to find first non-repeating character of the String.
9. Program to Reverse a String.
10. Program to Count Number of Characters in a String.
11. Program to Count frequency of particular character of the String.
12. Program to Count Number of Vowels and Number of Consonants in a String.
13. Program to Check if String is alphabetic or numeric or alpha-numeric.
14. Program to copy one String to Another.
15. Program to Concatenate Two Strings.
16. Program to Check whether given String is Palindrome or not.
17. Program to convert lower-case alphabet to upper-case alphabet and vice-versa.
18. Program to count total number of words in a string.
19. Program to find smallest and largest word of the String.
20. Program to print Alternate Elements of an Array.

The post Reverse Each Word in a String appeared first on Helpmestudybro.