/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

1 vote149 views1 answer
Take columns to rows in pandas
Python
0 vote254 views2 answers
Jsonresponse status code django
Python Django
3 votes236 views3 answers
Flask migrate
Python
1 vote199 views1 answer
Split string every nth character
Python
12 votes267 views3 answers
Python pandas read_csv tsv
Python
2 votes255 views1 answer
Pass in queryset as filter django
Python Django
0 vote196 views1 answer
Bucket dataframe into ranges
Python
1 vote190 views1 answer
Add a button on tkinter
Python
0 vote212 views1 answer
Spark group by alias
Python
0 vote249 views1 answer
Python logging basicConfig+time
Python