maxdeeppath

paths=[
'/a/b/c',
'/b/d/ee',
'/a/f/b/c',
'/a/b/c/d/e',
'/a/b',
'/a/b/e']

def _inpath( path, paths):    
    for v in paths:
        if _instr(v,path):
            return True
    return False 
def _instr(str, sub):
    return str[0:len(sub)]==sub and sub!=str
    

for v in paths:
    if not _inpath(v, paths):
        print v