Check rotation Python

PROGRAM TO CHECK IF STRINGS ARE ROTATIONS OF EACH OTHER OR NOT



# Function checks if passed strings (str1 and str2)
# are rotations of each other
def areRotations(string1, string2):
    size1 = len(string1)
    size2 = len(string2)
    temp = ''
  
    # Check if sizes of two strings are same
    if size1 != size2:
        return 0
  
    # Create a temp string with value str1.str1
    temp = string1 + string1
  
    # Now check if str2 is a substring of temp
    # string.count returns the number of occurrences of
    # the second string in temp
    if (temp.count(string2)> 0):
        return 1
    else:
        return 0
  
# Driver program to test the above function
string1 = "AACD"
string2 = "ACDA"
  
if areRotations(string1, string2):
    print "Strings are rotations of each other"
else:
    print "Strings are not rotations of each other"

OUTPUT
Strings are rotations of each other

Comments

Post a Comment

Popular posts from this blog

Special Keyboard Java

PROGRAM TO PRINT MAXIMUM NUMBER OF A'S USING GIVEN FOUR KEYS import java.io.*;   class GFG {        // A recursive function that returns      // the optimal length string  for N keystrokes      static int findoptimal( int N)      {          // The optimal string length is N          // when N is smaller than 7          if (N <= 6 )              return N;            // Initialize result          int max = 0 ;            // TRY ALL POSSIBLE BREAK-POINTS          // For any keystroke N, we need to        ...
Read more

Find Duplicates Java

PROGRAM TO FIND REPEATING NUMBERS IN AN ARRAY class MAIN {           public static void main(String args[]) {          int numRay[] = { 0 , 4 , 3 , 2 , 7 , 8 , 2 , 3 , 1 };               for ( int i = 0 ; i < numRay.length; i++) {              numRay[numRay[i] %  numRay.length] = numRay[numRay[i] %  numRay.length] + numRay.length;          }          System.out.println( "The repeating elements are : " );          for ( int i = 0 ; i < numRay.length; i++) {              if (numRay[i] >= numRay.length* 2 ) {                ...
Read more

Find first non-repeating character Python

PROGRAM TO FIND FIRST NON-REPEATING CHARACTER IN A STRING IN ONE TRAVERSAL NO_OF_CHARS = 256     # Returns an array of size 256 containg count # of characters in the passed char array def getCharCountArray(string):      count = [ 0 ] * NO_OF_CHARS      for i in string:          count[ ord (i)] + = 1      return count     # The function returns index of first non-repeating # character in a string. If all characters are repeating # then returns -1 def firstNonRepeating(string):      count = getCharCountArray(string)      index = - 1      k = 0          for i in string:          if count[ ord (i)] = = 1 :              index = k       ...
Read more