/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 vote188 views1 answer
Python string: .strip()
Python
0 vote182 views1 answer
Convert tuple to array python
Python
2 votes178 views1 answer
Is python easier than javascript
Python
1 vote190 views1 answer
Show integer seabron heatmap values
Python
0 vote170 views1 answer
Download textdocuments with python
Python
0 vote221 views1 answer
Spooling in os
Python
0 vote196 views1 answer
Python cache return value
Python
35 votes191 views6 answers
Python generate random string
Python
0 vote196 views1 answer
Pyton get minimum value of array
Python
0 vote181 views1 answer
Python increment char a to b az to ba
Python