Using Counter, O(n) clear solution for Non-unique Elements by rugala - python coding challenges

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

Using Counter, O(n) solution in Clear category for Non-unique Elements by rugala

from collections import Counter


def checkio(data):
    freqs = Counter(data)
    
    return [item for item in data if freqs[item] > 1]

April 20, 2015

Comments:

gaurav2.forever on April 26, 2015, 7:03 p.m.
I did some testing to check if your solution is really fast and the result says its fastest :) . see below my test code. author = 'Gaurav' import timeit from collections import Counter data = [i for i in range(0,1000)] def checkio1(data): freqs = Counter(data) <pre class='brush: python'>return [item for item in data if freqs[item] > 1] </pre> def checkio2(data): newList = [] for item in data: if data.count(item) > 1: newList.append(item) return newList print "Time took for Collection:",timeit.Timer('f(data)', 'from main import data,checkio1 as f').timeit(1000) print "Time took for simple method:",timeit.Timer('f(data)', 'from main import data,checkio2 as f').timeit(1000) OUTPUT: Time took for Collection: 0.579716003754 Time took for simple method: 21.8123519665

gaurav2.forever on April 26, 2015, 7:05 p.m.
<h1>Your header here…</h1> I did some testing to check if your solution is really fast and the result says its fastest :) . see below my test code. <pre class='brush: python'>Your code content here… </pre> print "Time took for simple method:",timeit.Timer('f(data)', 'from main import data,checkio2 as f').timeit(1000) <h1>Your header here…</h1> Time took for Collection: 0.579716003754 Time took for simple method: 21.8123519665

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!