Google Interview Question
Backend DevelopersCountry: United States
def is_subsequence(s1, s2):
if len(s1) > len(s2):
main_string, sub_string = s1, s2
else:
main_string, sub_string = s2, s1
res = check(main_string, sub_string)
if res[0] == True:
return res[1]
else:
return res[0]
def check(main_string, sub_string):
m = len(main_string)
n = len(sub_string)
i,j,matches = 0,0,0
indexes = []
while i < m:
if sub_string[j] == main_string[i]:
indexes.append(j)
j+=1
if n == j:
matches += 1
j = 0
i+=1
return matches == 1, indexes
def is_subsequence(s1, s2):
if len(s1) > len(s2):
main_string, sub_string = s1, s2
else:
main_string, sub_string = s2, s1
res = check(main_string, sub_string)
if res[0] == True:
return res[1]
else:
return res[0]
def check(main_string, sub_string):
m = len(main_string)
n = len(sub_string)
i,j,matches = 0,0,0
indexes = []
while i < m:
if sub_string[j] == main_string[i]:
indexes.append(j)
j+=1
if n == j:
matches += 1
j = 0
i+=1
return matches == 1, indexes
def is_subsequence(s1, s2):
if len(s1) > len(s2):
main_string, sub_string = s1, s2
else:
main_string, sub_string = s2, s1
res = check(main_string, sub_string)
if res[0] == True:
return res[1]
else:
return res[0]
def check(main_string, sub_string):
m = len(main_string)
n = len(sub_string)
i,j,matches = 0,0,0
indexes = []
while i < m:
if sub_string[j] == main_string[i]:
indexes.append(j)
j+=1
if n == j:
matches += 1
j = 0
i+=1
return matches == 1, indexes
def is_subsequence(s1, s2):
- Anonymous February 18, 2018if len(s1) > len(s2):
main_string, sub_string = s1, s2
else:
main_string, sub_string = s2, s1
res = check(main_string, sub_string)
if res[0] == True:
return res[1]
else:
return res[0]
def check(main_string, sub_string):
m = len(main_string)
n = len(sub_string)
i,j,matches = 0,0,0
indexes = []
while i < m:
if sub_string[j] == main_string[i]:
indexes.append(j)
j+=1
if n == j:
matches += 1
j = 0
i+=1
return matches == 1, indexes