Check if a string is Colindrome

Given a string, check if it is Colindrome or not. A string is said to be colindrome if it has consecutive 3 alphabets followed by the reverse of these 3 alphabets and so on.

Examples :

Input : cappaccappac
Output : String is colindrome

Input : mollomaappaa 
Output : String is Colindrome

Approach : Take two empty strings s1 and s2, and start iterating over the given string. Take first three letters of the string and store it in s1, next three chars in s2 and then match s1 and s2. If they are same then do the same again till length of the given string else return false.



C++

filter_none

edit
close

play_arrow

link
brightness_4
code

// CPP program to check if a
// string is Colindrome or not
#include<bits/stdc++.h>
using namespace std;
  
// Function to check if a string
// is Colindrome or not
bool colindrome(string s)
{
    int i1 = 0;
      
    for (int i = 0; i < s.length(); i++) {
      
        int i2 = i1 + 3;
      
        // Taking two empty Strings
        string s1 = "";
        string s2 = "";
      
        int c1 = 0, c2 = 0;
      
        // Iterate upto 3 letters
        for (i1 = i1; i1 < s.length(); i1++) {
            c1++;
  
            // concat each word with taken String
            s1 = s1 + s[i1];
            if (c1 == 3) {
                break;
            }
        }
  
        // Iterate upto 3 letters
        for (i2 = i2; i2 < s.length(); i2++) {
            c2++;
  
            // concat each word with taken String
            s2 = s2 + s[i2];
            if (c2 == 3) {
                break;
            }
        }
  
        // Reverse the second String
        string s3 = "";
        for (int k = s2.length() - 1; k >= 0; k--) {
            s3 = s3 + s2[k];
        }
  
        // Checks equality of two strings
        if (s1 != s3) {
            // If the two Strings are not same
            // then return false
            return false;
        }
  
        // Increment first variable by 6 and
        // second variable by 3
        i1 = i1 + 6;
        i2 = i2 + 3;
    }
      
    return true;
}
  
// Driver Code
int main()
{   
    // Input string
    string s = "cbbbbc";
      
    if(colindrome(s))
        cout<<"String is colindrome\n";
    else
        cout<<"Not ccolindrome";
          
    return 0;
}

chevron_right


Java

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java code to check if a given string is Colindrome.
public class Colindrome {
  
    // Function to check Colindrome
    static boolean colindrome(String s)
    {
        int i1 = 0;
        for (int i = 0; i < s.length(); i++) {
            int i2 = i1 + 3;
  
            // Taking two empty Strings
            String s1 = "";
            String s2 = "";
            int c1 = 0, c2 = 0;
  
            // Iterate upto 3 letters
            for (i1 = i1; i1 < s.length(); i1++) {
                c1++;
  
                // concat each word with taken String
                s1 = s1 + s.charAt(i1);
                if (c1 == 3) {
                    break;
                }
            }
  
            // Iterate upto 3 letters
            for (i2 = i2; i2 < s.length(); i2++) {
                c2++;
  
                // concat each word with taken String
                s2 = s2 + s.charAt(i2);
                if (c2 == 3) {
                    break;
                }
            }
  
            // Reverse the second String
            String s3 = "";
            for (int k = s2.length() - 1; k >= 0; k--) {
                s3 = s3 + s2.charAt(k);
            }
  
            // Checks equality of two strings
            if (s1.equals(s3) != true) {
                // If the two Strings are not same then return false
                return false;
            }
  
            // Increment first variable by 6 and second variable by 3
            i1 = i1 + 6;
            i2 = i2 + 3;
        }
        return true;
    }
  
    // Driver code
    public static void main(String[] args)
    {
        String s = "cbbbbc";
        boolean b = colindrome(s);
        if (b) {
            System.out.println("String is colindrome");
        }
        else {
            System.out.println("Not Colindrome");
        }
    }
}

chevron_right


Python3

filter_none

edit
close

play_arrow

link
brightness_4
code

# python program to check if a
# string is Colindrome or not
  
# Function to check if a string
# is Colindrome or not
def colindrome(s):
    i1 = 0
    for i in range (0, len(s)):
        i2 = i1 + 3
  
        # Taking two empty Strings
        s1 = ""
        s2 = ""
      
        c1 = 0; c2 = 0;
      
        # Iterate upto 3 letters
        while(i1 < len(s)):
            c1 += 1
  
            # concat each word with taken String
            s1 = s1 + s[i1]
            if (c1 == 3) : break
            i1 += 1
  
        # Iterate upto 3 letters
        while(i2 < len(s)):
            c2 += 1
  
            # concat each word with taken String
            s2 = s2 + s[i2]
            if (c2 == 3) : break
            i2 += 1
  
        # Reverse the second String
        s3 = ""
        for k in range(len(s2)-1, -1, -1) :
            s3 = s3 + s2[k]
  
        # Checks equality of two strings
        if (s1 != s3) :
            # If the two Strings are not same
            # then return false
            return False
  
        # Increment first variable by 6 and
        # second variable by 3
        i1 = i1 + 6
        i2 = i2 + 3
  
    return True
  
# Driver Code
if __name__ == '__main__'
  
    # Input string
    s = "cbbbbc";
      
    if(colindrome(s)) :
        print("String is colindrome")
    else :
        print("Not ccolindrome")
  
# contributed by Abhishek Sharma DTU.

chevron_right


Output:

String is colindrome


My Personal Notes arrow_drop_up

Hello everyone, I am Bishal KUMAR Dubey and most importantly an idea creator I just love Programming languages and love to know new concepts everyday,every minute,every second Here to help Other GEEKS

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.



Improved By : Abhishekk781



Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.