CarlosLabs
Hackerrank Challenges - Hackerrank in a String
(CM) Part of the solution can be gleaned by reading the problem description in Hackerrank.
def hackerrankInString(s): # array to check against p = [['h','a','c','k','e','r','r','a','n','k'], [-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]] retVal="NO" startP=0 startS=0 endP=len(p[0]) endS=len(s) prevCheck=0 if (len(s) < len(p[0])): return retVal s = s.lower() for ch in range(startS,endS): thisCharS=s[ch] thisCharP=p[0][startP] if (thisCharS==thisCharP) and ((p[1][startP])==(-1)): #print('match: ' + thisCharP) p[1][startP]=ch startP+=1 if (startP >= endP): break if (p[1][0]<p[1][1]) and \ (p[1][1]<p[1][2]) and \ (p[1][2]<p[1][3]) and \ (p[1][3]<p[1][4]) and \ (p[1][4]<p[1][5]) and \ (p[1][5]<p[1][6]) and \ (p[1][6]<p[1][7]) and \ (p[1][7]<p[1][8]) and \ (p[1][8]<p[1][9]): retVal='YES' return retVal