/Python/Search for a symmetrical inner elements of a list python

Search for a symmetrical inner elements of a list python

def symmetrical_sum(a):
    dup=[x for n, x in enumerate(a) if x in a[:n]] #to get the duplicate
    
    to_int = int(''.join(map(str,dup))) #change duplicate into int
    dup1_index=a.index(to_int) #index the first duplicate
    dup2_index=a.index(to_int,dup1_index+1) #index the second duplicate
    portion=a[dup1_index:dup2_index+1] #get the symetric portion
    total = sum(portion) #sum the elements in portion
    tuple1 = (portion,total) #create tuple
    return tuple1

Source: stackoverflow.com

Similar codes

0 vote234 views1 answer
Plt add y gridlines
Python
2 votes231 views2 answers
Python beep windows
Python
58 votes180 views1 answer
Case in pyhton
Python
0 vote244 views1 answer
Filter dict by list of keys python
Python
1 vote268 views1 answer
Model evaluate function
Python
0 vote235 views1 answer
Performance of extend vs append loop
Python
32 votes229 views4 answers
Python logging level
Python
0 vote238 views1 answer
Get next iterator without incrementing python
Python
0 vote255 views1 answer
Django queryset to instance
Python Django
7 votes220 views4 answers
Pip update django
Python Django