HackerEarth String Problems

Author: OmkarPathak

CompetitiveProgramming/HackerEarth/Algorithms/String/P07_SumitsString.py

@@ -0,0 +1,51 @@
+# Given a string 'S' , u need to tell whether it is 'sumit's string or not'.
+#
+# A string is called 'Sumit's String' , if distance between adjacent character is 1.
+#
+# Consider that the alphabets are arranged in cyclic manner from 'a' to 'z'. distance between any character
+# 'x' and 'y' will be defined as minimum number of steps it takes 'x' to reach 'y'. Here, character 'x' can
+# start moving clockwise or anti-clockwise in order to reach at position where character 'y' is placed.
+#
+# Print 'YES' if it is Sumit's string else print 'NO', for each yest case.
+#
+# Input :
+#
+# test cases, t
+# string , s
+# Output:
+#
+# Desired O/p
+#
+# Constraints :
+#
+# string length<=250
+# string has only lower case letters
+#
+# SAMPLE INPUT
+# 3
+# aba
+# zza
+# bcd
+#
+# SAMPLE OUTPUT
+# YES
+# NO
+# YES
+
+for _ in range(int(input())):
+    string = input()
+    sumit_string = True
+    check = 'abcdefghijklmnopqrstuvwxyz'
+    for i in range(len(string) - 1):
+        check_first = check.find(string[i]) + 1
+        check_second = check.find(string[i + 1]) + 1
+        if abs(check_second - check_first) == 1 or abs(check_second - check_first) == 25:
+            continue
+        else:
+            sumit_string = False
+            break
+
+    if sumit_string:
+        print('YES')
+    else:
+        print('NO')

CompetitiveProgramming/HackerEarth/Algorithms/String/P08_RemoveDupplicates.py

@@ -0,0 +1,43 @@
+# Given a string S. Your task is to remove all duplicates characters from the string S
+#
+# NOTE:
+# 1.) Order of characters in output string should be same as given in input string.
+# 2.) String S contains only lowercase characters ['a'-'z'].
+#
+# input:
+# Input contain a single string S.
+#
+# Output:
+# Print the string S with no any duplicate characters.
+#
+# Constraints:
+# Test Files 1 to 5:
+# 1<=|S|<=100
+# Test Files 6 to 10:
+# 1<=|S|<=100000
+#
+# Sample Output #1
+# hacker
+#
+# Sample Output #1
+# hacker
+#
+# Sample Input #2
+# hackerearth
+#
+# Sample Output #2
+# hackert
+#
+# Sample Input #3
+# programming
+#
+# Sample Output #3
+# progamin
+
+string = list(input())
+result = []
+for i in range(len(string)):
+    if string[i] not in result:
+        result.append(string[i])
+
+print(''.join(result))

CompetitiveProgramming/HackerEarth/Algorithms/String/P10_Conversion.py

@@ -0,0 +1,38 @@
+# Given a string, convert it into its number form .
+#
+# A or a -> 1
+# B or b -> 2
+# C or c -> 3
+# . . .
+# Z or z -> 26
+# space -> $
+# Input:
+#
+# test cases, t
+# string , s
+# Output:
+#
+# Desired O/p
+#
+# Constraints: string length <=200
+#
+# SAMPLE INPUT
+# 2
+# AMbuj verma
+# Aaaa bBBB
+#
+# SAMPLE OUTPUT
+# 11322110$22518131
+# 1111$2222
+
+for _ in range(int(input())):
+    string = input()
+    check = 'abcdefghijklmnopqrstuvwxyz'
+    result = []
+    for i in range(len(string)):
+        if string[i].lower() != ' ':
+            result.append(check.find(string[i].lower()) + 1)
+        else:
+            result.append('$')
+
+    print(''.join([str(i) for i in result]))