Delete elements of an integer recursively

How about something like this?

def areaCodes(n):
  # if n is less than 1000, what does it mean about the number of digits?
  if n < 1000:
    return  # fill... 

  # otherwise, if n is greater than 1000, how can we alter n to remove the last
  # digit? (hint: there's an operation similar to division called f...r division)
  return areaCodes( # operate on n somehow...)

I assume that this is an exercise where recursion is necessary. If so, try this (there are better ways to accomplish your end goal, but I tried to modify your existing code as little as possible):

def areaCodes(n): 
    n_lst = list(str(n))
    del n_lst[-1]
    n_str =  ''.join(n_lst)
    n_int = int(n_str)
    if len(n_lst) > 3:
        return areaCodes(n_int)
    return n_int

This will call the function again if the length of the number is greater than three, and return the number otherwise. Basically, the only part you were missing in your original function was the following, which is the recursive part:

if len(n_lst) > 3:
    return areaCodes(n_int)

Remember that for a function to be recursive, it will have two main attributes:

1. It will at some point call itself. (this is what makes it 'repeat')
2. It will have some stopping condition (or base case).

You mentioned #1 when you wrote that you're supposed to use "the name in the return," so that's great! You just need to write that in your code:

return areaCodes(n), Where n is the updated phone number with a digit removed.

As you can see, each recursive call should do some work towards the solution, and should pass its mini-solution to the next recursive call.

Along with #2 above, you need to specify a base case, where the recursion will cease. So, since you're taking away a digit each time you call your function, you should include some kind of check to see if the current input is the length you want yet.

If it is the right length, you're done, and you should return the current number (not another recursive call).

Otherwise, you aren't done with the recursion yet.

import sys

def areaCodes(n): 
#Create a list 
myList = list(str(n))
#Delete last element
del myList[-1]
#Combine your elements into string list
myListStr =  ''.join(myList)
#Type cast to int
myListInt = int(myListSte)

#Check whether your list satisfies your condition
if len(myList) > 3:
    #Recusivley call the function again
    return areaCodes(myListInt)

#Return your list when recursion completes    
return myListInt


n = 12345
print areaCodes(n)