strings string pattern matching is an important problem that occurs in many areas of science and information processing in computingit occurs naturally as part of data processingtext editingterm rewritinglexical analysisand information retrieval -"algorithms for finding patterns in strings, aho strings are ubiquitous in programming today--scriptingweb developmentand bioinformatics all make extensive use of strings string can be viewed as special kind of arraynamely one made out of characters we treat strings separately from arrays because certain operations which are commonly applied to strings--for examplecomparisonjoiningsplittingsearching for substringsreplacing one string by anotherparsingetc --do not make sense for general arrays you should know how strings are represented in memoryand understand basic operations on strings such as comparisoncopyingjoiningsplittingmatchingetc advanced string processing algorithms often use hash tables (and dynamic programming (page in this we present problems on strings which can be solved using basic techniques strings boot camp palindromic string is one which reads the same when it is reversed the program below checks whether string is palindromic rather than creating new string for the reverse of the input stringit traverses the input string forwards and backwardsthereby saving space notice how it uniformly handles even and odd length strings def is_palindromic ( )note that [~ifor in [ len( is [-( return all( [ = [~ifor in range (len( / )the time complexity is (nand the space complexity is ( )where is the length of the string know your string libraries the key operators and functions on strings are [ ]len( ) ts[ : (and all the other variants of slicing for lists described on page ) in ts strip() startswith(prefix) endswith(suffix)'euclid,axiom ,parallel linessplit(',') ' '',join(('gauss''prince of mathematicians'' - ')) tolower()and 'name namerank rankformat(name='archimedes'rank= it' important to remember that strings are immutable--operations like [ :or +' imply creating new array of characters that is then assigned back to this implies that concatenating single character times to string in for loop has ( time complexity (some