/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 vote131 views1 answer
How to console log in django heroku
Python Django
1 vote108 views1 answer
Example of Single-line comment in Python
Python
0 vote94 views1 answer
How to add to beginning of linked list python
Python
0 vote136 views2 answers
How to avoid inserting duplicate records in orm django
Python Django
16 votes104 views1 answer
Super idol
Python
0 vote110 views1 answer
Flask sqlalchemy query specific columns
Python
0 vote91 views1 answer
OneHotEncoder pyspark
Python
0 vote104 views2 answers
Numpy method to make polynomial model
Python
40 votes96 views3 answers
Train dev test split sklearn
Python
1 vote114 views1 answer
Data structures and algorithms in python
Python