# Python | Unique pairs in list

Sometimes, while working with python list, we can have a binary matrix ( Nested list having 2 elements ). And we can have a problem in which we need to find the uniqueness of a pair. A pair is unique irrespective of order, it doesn’t appear again in list. Let’s discuss certain way in which this task can be performed.

Method : Using `frozenset() + Counter()` + list comprehension
The combination of above functions can perform this task. The `frozenset()` is used for ignoring the ordering, `Counter()` is used to perform the task of checking the uniqueness and iteration is done using list comprehension.

 `# Python3 code to demonstrate working of ` `# Unique pairs in list ` `# using frozenset() + Counter() + list comprehension ` `from` `collections ``import` `Counter ` ` `  `# initialize list ` `test_list ``=` `[[``5``, ``6``], [``9``, ``8``], [``8``, ``9``], [``1``, ``4``], [``6``, ``5``], [``10``, ``1``]] ` ` `  `# printing original list ` `print``(``"The original list is : "` `+` `str``(test_list)) ` ` `  `# Unique pairs in list ` `# using frozenset() + Counter() + list comprehension ` `temp ``=` `Counter(``frozenset``(ele) ``for` `ele ``in` `test_list) ` `res ``=` `[temp[``frozenset``(ele)] ``=``=` `1` `for` `ele ``in` `test_list] ` ` `  `# printing result ` `print``(``"The Unique status of elements is "` `+` `str``(res)) `

Output :

```The original list is : [[5, 6], [9, 8], [8, 9], [1, 4], [6, 5], [10, 1]]
The Unique status of elements is [False, False, False, True, False, True]
```

My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.

Article Tags :

Be the First to upvote.

Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.