/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

11 votes184 views6 answers
If statements python
Python
4 votes175 views1 answer
How to round the values in a list
Python
0 vote275 views1 answer
Vbscript shutdown remote computer
Python
3 votes184 views2 answers
Flask db migrate
Python
0 vote197 views1 answer
Copy file merged hdfs
Python
2 votes167 views2 answers
Python replace first
Python
1 vote169 views1 answer
Python tkinter disable dropdown
Python
0 vote175 views1 answer
XML to MS SQL
Python
0 vote171 views1 answer
Python mark function as no return
Python
1 vote175 views1 answer
X= [10] def List_ex(): x.append(20) def add_list(): x=[30,40] x.append(50) print (x) List_ex() print (x) add_list() print (x)
Python