sreevidyavutukuru

import math 
def index(list1, n):
    startIndex = 0
    endIndex = len(list1) - 1
    
    while startIndex <= endIndex:
        mid = startIndex + int(math.floor((endIndex-startIndex)/2))
        if list1[mid] == n:
            print n
            print mid

sreevidyavutukuru

sqr = math.sqrt(10000)
print sqr

list1= []
i = 1
while i <=10000:
    list1.append(i)
    i += 1
x=2
for x in list1:

sreevidyavutukuru

class Solution(object):
    def lengthOfLongestSubstringTwoDistinct(self, s):
        """
        :type s: str
        :rtype: int
        """
        sublen = 1
        substrings = []
        result = {}
        for i in range(0,len(s)+1):

sreevidyavutukuru

#Kth rank value
scores = [10,20,12,3,8]
scores.sort()
rank_scores = {}
for i,val in enumerate(scores):
    rank_scores[i+1] = val
print rank_scores[3]

sreevidyavutukuru

def palindrom(string1):
    
    i = 0
    j = len(string1) -1
    flag = True
    while i<len(string1)-1 and j >=0:
        if string1[i] != string1[j]:
            flag = False
            break
        else:

sreevidyavutukuru

Str1 = "aaabbcgfhh"
SubStrs = []
SubStrd_Dict = {}
for i in range(1,len(Str1)):
    #SubStrs.append(i)
    SubStrs = []
    for j in range(0,len(Str1)-i):
        SubStrs.append(Str1[j:j+i])
        #print SubStrs
    SubStrd_Dict[i] = SubStrs