Accumulator/looping problem

[student8]

defining a function that considers every pair of consecutive characters in s. It returns a string with the letters o and p inserted between every pair of consecutive characters of s
-if the first character in the pair is uppercase, it inserts an uppercase O, if it's lowercase, it inserts the lowercase o.
-if the second character is uppercase, it inserts an uppercase P, if it's lowercase, it inserts the lowercase p.
-if at least one of the character is not a letter in the alphabet, it does not insert anything between that pair.
-if s has one or less characters, the function returns the same string as s.

This is how far I got to tackling this problem, although it doesn't give what is expected (after my code below there are some examples of what the function should do)

def oPify(s):
     newS= ''

     if s<=1:
          return s
     
     for i in s:
          newS = newS + s[i] + 'op'
     return newS    

Examples:
>>> oPify("aa")
’aopa’
>>> oPify("aB")
’aoPB’
>>> oPify("ooo")
’oopoopo’
>>> oPify("ax1")
’aopx1’
>>> oPify("abcdef22")
’aopbopcopdopeopf22’
>>> oPify("abcdef22x")
’aopbopcopdopeopf22x’
>>> oPify("aBCdef22x")
’aoPBOPCOpdopeopf22x’
>>> oPify("x")
’x’
>>> oPify("123456")
’123456’

[ichabod801]

I'm not sure what your if statement is supposed to do. At the moment it will just cause an error. Perhaps you mean if len(s)<= 1:?

Note that the examples given only insert between letters. Going one letter at a time isn't going to work. You need to look at pairs of letters. Have you learned zip yet? If so, zip the string to the string with the first character missing. If not, you will have to loop through the indexes of the string, pulling the current index and the next index. Then you need to check both characters to make sure they are letters, and then check their case to figure out the case of the letters op that you will insert.

[student8]

I'm not sure what your if statement is supposed to do. At the moment it will just cause an error. Perhaps you mean if len(s)<= 1:?

Note that the examples given only insert between letters. Going one letter at a time isn't going to work. You need to look at pairs of letters. Have you learned zip yet? If so, zip the string to the string with the first character missing. If not, you will have to loop through the indexes of the string, pulling the current index and the next index. Then you need to check both characters to make sure they are letters, and then check their case to figure out the case of the letters op that you will insert.

Can you show me how to do so with loops (i haven't learned zip) please? or show me another example

[ichabod801]

I can show you how to do it with loops. I would prefer you try to do it with the two loops I described, and then I can help you fix any problems.

[student8]

I can show you how to do it with loops. I would prefer you try to do it with the two loops I described, and then I can help you fix any problems.

This is what I have so far:

def oPify(s):
    newS= ''
 
    if len(s)<=1:
          return s
    for i in range(0, len(s), 2):
        newS= newS+s[i:i+2]
        if i.isalpha() in newS:
            if i.lower():
                s= s[i]+'op'+s[i+2]

[ichabod801]

You're still trying to do it in one. You need to do it in two. Write two loops, one that goes through the indexes of the string, and an inner one that goes through the possible lengths from that index.