Clear clear solution for Non-unique Elements by radekj - python coding challenges

Enable Javascript in your browser and then refresh this page, for a much enhanced experience.

Clear solution in Clear category for Non-unique Elements by radekj

def checkio(data):
    return [i for i in data if data.count(i) > 1]

Feb. 22, 2015

Comments:

aaviles on March 28, 2015, 9:59 a.m.
Beautiful!

nott on May 16, 2015, 11:31 a.m.
O(n**2)

abes975 on May 31, 2015, 6:02 p.m.
newbie question: why not O(n) ?

veky on Sept. 24, 2015, 8:43 a.m.
Because usually people perceive accessing a single item of the list as an elementary operation. In that view, every .count is O(n), since it has to look at all the elements. And since .count is invoked for each element, the overall complexity is O(n**2).

denisOrg on May 27, 2015, 9:44 p.m.
It is the best solution!

gregoryloyse on May 29, 2015, 9:57 p.m.
Neat solution! Readable and great for data that is relatively small. But bear in mind it will get increasingly slower for larger sized data. The list’s count method will, for each item, iterate over every item in data to count the number of occurences of that item

rejexted on Oct. 11, 2016, 8:27 p.m.
What would be the most efficient way to write this, rather than the shortest?

hakernp02 on Feb. 23, 2017, 6:56 p.m.
Nice.

List but not the least

0 %

PyCharm The Python IDE for Professional Developers. Enjoy productive Python, web and scientific development with PyCharm. Download it now!