computer science udacity

backwards and the interval is 2. there ' s one other cool thing you can does with string slicing. You can add a third parameter,k, like this:s[i:j:k]. This gives a slice of the stringsFrom indexiTo indexj-1 , with step size k. Check out the following examples: >>> s = ' Python is fun! ' >>> S[1:12:2] ' Yhni u ' >>> S[1:12:3] ' Yoif ' >>> S[::2] ' Pt

, Numspiders)return(None,None,None) def barnYard1():Heads = Int (Raw_input (' Enter number of heads: ')) legs = Int (Raw_input (' Enter number of legs: ')) pigs, chickens, spiders = solve1 (legs, heads)ifPigs = =None:Print ' There is no solution ' Else:Print ' Number of pigs: ', pigsPrint ' Number of chickens: ', chickensPrint ' Number of spiders: ', spidersImproved: Output all the solutions: def solve2(Numlegs, numheads):Solutionfound =False forNumspidersinchRange0, Numheads +1): forNumc

Assume is s a string of lower case characters.Write A program This prints the longest substring of in s which the letters occur in alphabetical order. For example, if s = ‘azcbobobegghakl‘ , then your program should printLongest substring in alphabetical order Is:begghIn the case of ties, print the first substring. For example, if s = ‘abcbcd‘ , then your program should printLongest substring in alphabetical order IS:ABC# Paste Your code into this boxCount = 1result = S[0]While S:Newcount = 1New