Given a string s of zeros and ones, return the maximum score after splitting the string into two non-empty sub-strings (i.e. left sub-strings and right sub-strings). The score after splitting a string is the number of zeros in the left sub-strings plus the number of ones in the right sub-strings.

Input: s = ‘011101’

Output: 5

def splitin(x,y): sum=0 for i in range(len(x)): if y == x[i]: sum+=1 return sum s=input("Enter the string of 0's and 1's : ") L=[] for i in range(1,len(s)): sum=0 sum=splitin(s[:i],'0')+splitin(s[i:],'1') L.append(sum) print(max(L))

Input_1:

Enter the string of 0’s and 1’s : 011101

Output:

5

Input_2:

Enter the string of 0’s and 1’s : 1111

Output:

3

**Morae Q!**

->Convert Numbers into Roman Numerals

->Given the string s, return the size of the longest sub-string

->Given an array of string words. Return all strings in words which is sub-string of another word in any order.

->Return the minimum positive value of startValue such that the step by step is never less than 1.

->Given the number k, return the minimum number of Fibonacci.

->Given a string s of zeros and ones, return the maximum score after splitting the string

->Given a sorted array and a value x,Write a efficient functions to find floor of x.

->Print all numbers less than n which are having digits only 3 or 7 or both.

->Function that returns true if given array can be divided into pairs.

->Find the smallest element in the list that is larger than the given target.

->Print the First N prime numbers.

->The Chef’s Binary Tree.

->The minimum number of strikes he will have to make.(so that all his enemies have the same name)

->Sum of Natural Numbers.

->Sum of the Input.

->Find the Sum of the Series: 1 + 1/2 + 1/3 + .. + 1/N.

->Put Even and Odd elements in a List into Two Different Lists.

->Python Program to Merge Two Lists and Sort it.

->Median of Three.

->Python Program to Find the Largest Number in a List.