## Google Interview Question for Backend Developers

• -1
of 1 vote

Country: United States

Comment hidden because of low score. Click to expand.
0
of 0 vote

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

Comment hidden because of low score. Click to expand.
0
of 0 vote

``````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``````

Comment hidden because of low score. Click to expand.
0
of 0 vote

``````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``````

Comment hidden because of low score. Click to expand.
0
of 0 vote

``````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``````

Comment hidden because of low score. Click to expand.
0
of 0 vote

a

Comment hidden because of low score. Click to expand.
0
of 0 vote

``a``

Comment hidden because of low score. Click to expand.
0
of 0 vote

afafa

Name:

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.

### Books

is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

### Videos

CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.