Find all substrings of a string in C++

 Find all substrings of a string in C++

For a given input string(str), write a function to print all the possible substrings.

Substring

A substring is a contiguous sequence of characters within a string. 
Example: "cod" is a substring of "coding". Whereas, "cdng" is not as the characters taken are not contiguous

Input Format:

The first and only line of input contains a string without any leading and trailing spaces. All the characters in the string would be in lower case.

Output Format:

Print the total number of substrings possible, where every substring is printed on a single line and hence the total number of output lines will be equal to the total number of substrings.

Note:

The order in which the substrings are printed, does not matter.

Constraints:

0 <= N <= 10^6
Where N is the length of the input string.

Time Limit: 1 second

Sample Input 1:

abc

Sample Output 1:

a 
ab 
abc 
b 
bc 
c 

 Sample Input 2:

co

Sample Output 2:

c 
co 
o

C++ Code:

void printSubstrings(char str[]){
  /* Don't write main().
   *  Don't read input, it is passed as function argument.
   * Print output as specified in the question.
   */
 if(str==nullptr) return;
  int len=0;
  while(str[len]!='\0')
    len++;
  for(int i=0; i<len; i++)
  {
    for(int j=i; j<len; j++)
    {
      // print characters from i to j
      for(int k=i; k<=j; k++)
        cout << str[k];
      cout << endl;
    }
 

}




SHARE

Milan Tomic

Hi. I’m Designer of Blog Magic. I’m CEO/Founder of ThemeXpose. I’m Creative Art Director, Web Designer, UI/UX Designer, Interaction Designer, Industrial Designer, Web Developer, Business Enthusiast, StartUp Enthusiast, Speaker, Writer and Photographer. Inspired to make things looks better.

• 
• 
• 
• 
•