/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 vote173 views2 answers
Python easter eggs
Python
0 vote126 views1 answer
Python - oordinated universal time
Python
0 vote138 views1 answer
Hewwo world
Python
0 vote125 views1 answer
Application automation python library
Python
4 votes123 views1 answer
Stack data structure python
Python
1 vote134 views3 answers
Merge multiple excel files with multiple worksheets into a single dataframe
Python
0 vote172 views1 answer
Transition from python 2 to 3 terminal
Python
0 vote144 views1 answer
With torch.no_grad() if condition
Python
0 vote127 views1 answer
Pydub audiosegment to numpy array
Python
0 vote127 views1 answer
Format when turning float into string
Python