all strings programs

Author: thatsabhishek

Diff for: Milestone 2/strings/CheckPalindrome.py

@@ -0,0 +1,38 @@
+# Given a string, determine if it is a palindrome, considering only alphanumeric characters.
+# Palindrome
+# A palindrome is a word, number, phrase, or other sequences of characters which read the same backwards and forwards.
+
+# Sample Input 1 :
+# abcdcba
+# Sample Output 1 :
+# true 
+
+s = input()
+r = s[::-1]
+
+if s == r :
+    print('true')
+else:
+    print('false')
+    
+# CN Code
+from sys import stdin
+
+def ispalindrome(string):
+    left = 0
+    right = len(string) - 1
+    
+    while left < right:
+        if string[left] != string[right]:
+            return False
+        left += 1
+        right -= 1
+    return True
+
+#main
+string = stdin.readline().strip()
+ans = ispalindrome(string)
+if ans:
+    print("true")
+else:
+    print("false")

Diff for: Milestone 2/strings/CheckPermutation.py

@@ -0,0 +1,39 @@
+# For a given two strings, 'str1' and 'str2', check whether they are a permutation of each other or not.
+# Permutations of each other
+# Two strings are said to be a permutation of each other when either of the string's characters can be rearranged so that it becomes identical to the other one.
+
+# Example: 
+# str1= "sinrtg" 
+# str2 = "string"
+
+# The character of the first string(str1) can be rearranged to form str2 and hence we can say that the given strings are a permutation of each other.
+
+# Sample Input 1:
+# abcde
+# baedc
+# Sample Output 1:
+# true
+
+
+from sys import stdin
+
+
+def isPermutation(string1, string2) :
+    if sorted(string1) == sorted(string2):
+        return True
+    else:
+        return False
+
+
+
+#main
+string1 = stdin.readline().strip();
+string2 = stdin.readline().strip();
+
+ans = isPermutation(string1, string2)
+
+if ans :
+    print('true')
+else :
+    print('false')
+

Diff for: Milestone 2/strings/CompresstheString.py

@@ -0,0 +1,41 @@
+# Write a program to do basic string compression. For a character which is consecutively repeated more than once, replace consecutive duplicate occurrences with the count of repetitions.
+# Example:
+# If a string has 'x' repeated 5 times, replace this "xxxxx" with "x5".
+
+# The string is compressed only when the repeated character count is more than 1.
+# Note:
+# Consecutive count of every character in the input string is less than or equal to 9. You are not required to print anything. It has already been taken care of. Just implement the given function and return the compressed string.
+
+# Sample Input 1:
+# aaabbccdsa
+# Sample Output 1:
+# a3b2c2dsa
+
+from sys import stdin,setrecursionlimit
+setrecursionlimit(10**7)
+
+
+def getCompressedString(input) :
+	# Write your code here.
+	a = input
+	i = 0
+	x = ''
+	while(i < len(a)):
+		j = i+1
+		c = 1
+		while j < len(a) and (a[i] == a[j]):
+			j += 1
+			c += 1
+		if c == 1:
+			x += a[i]
+		else:
+			x += a[i]+str(c)
+		i = j
+	return x
+
+
+
+# Main.
+string = stdin.readline().strip();
+ans = getCompressedString(string)
+print(ans)

Diff for: Milestone 2/strings/HighestOccuringCharacter.py

@@ -0,0 +1,39 @@
+# For a given a string(str), find and return the highest occurring character.
+# Example:
+# Input String: "abcdeapapqarr"
+# Expected Output: 'a'
+# Since 'a' has appeared four times in the string which happens to be the highest frequency character, the answer would be 'a'.
+# If there are two characters in the input string with the same frequency, return the character which comes first.
+# Consider:
+# Assume all the characters in the given string to be in lowercase always.
+
+# Sample Input 1:
+# abdefgbabfba
+# Sample Output 1:
+# b
+
+
+from sys import stdin
+
+
+def highestOccuringChar(string) :
+	ASCII_SIZE = 256
+	ctr = [0] * ASCII_SIZE
+	max = -1
+	ch = ''
+	for i in string:
+		ctr[ord(i)] += 1
+
+	for i in string:
+		if max < ctr[ord(i)]:
+			max = ctr[ord(i)]
+			ch = i
+	return ch
+
+
+
+#main
+string = stdin.readline().strip();
+ans = highestOccuringChar(string)
+
+print(ans)

Diff for: Milestone 2/strings/RemoveConsecutiveDuplicates.py

@@ -0,0 +1,33 @@
+# For a given string(str), remove all the consecutive duplicate characters.
+# Example:
+# Input String: "aaaa"
+# Expected Output: "a"
+
+# Input String: "aabbbcc"
+# Expected Output: "abc"
+
+# Note:
+# You are not required to print anything. It has already been taken care of.
+
+
+from sys import stdin
+
+def removeConsecutiveDuplicates(string) :
+	s=''
+	i=0
+	while i<len(string):
+		x = string[i]
+		j=i+1
+		while j<len(string) and string[j] == x:
+			j=j+1
+		s += string[i]
+		i = j
+	return s
+	
+		
+#main
+string = stdin.readline().strip()
+
+ans = removeConsecutiveDuplicates(string)
+
+print(ans)

Diff for: Milestone 2/strings/Removecharacter.py

@@ -0,0 +1,34 @@
+# For a given a string(str) and a character X, write a function to remove all the occurrences of X from the given string.
+# The input string will remain unchanged if the given character(X) doesn't exist in the input string.
+
+# Note:
+# You are not required to print anything explicitly. It has already been taken care of.
+
+# Sample Input 1:
+# aabccbaa
+# a
+# Sample Output 1:
+# bccb
+
+
+from sys import stdin
+
+
+def removeAllOccurrencesOfChar(string, ch) :
+	# Your code goes here
+	s = string
+	x=""
+	for i in s:
+		if i != ch:
+			x=x+i
+	return x
+
+
+
+#main
+string = stdin.readline().strip()
+ch = stdin.readline().strip()[0]
+
+ans = removeAllOccurrencesOfChar(string, ch)
+
+print(ans)

Diff for: Milestone 2/strings/ReverseEachWord.py

@@ -0,0 +1,25 @@
+# Aadil has been provided with a sentence in the form of a string as a function parameter. The task is to implement a function so as to print the sentence such that each word in the sentence is reversed. A word is a combination of characters without any spaces.
+# Example:
+# Input Sentence: "Hello, I am Aadil!"
+# The expected output will print, ",olleH I ma !lidaA".
+
+
+from sys import stdin
+
+
+def reverseEachWord(string) :
+	s = string
+	new = s.split()
+	ns = ''
+	for i in range(len(new)):
+		sad = new[i][::-1]
+		ns = ns+sad+' '
+	return ns
+
+
+#main
+string = stdin.readline().strip()
+
+ans = reverseEachWord(string)
+
+print(ans)