First clear solution for Non-unique Elements by c385 - python coding challenges

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

First solution in Clear category for Non-unique Elements by c385

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

April 9, 2015

Comments:

wicccked on April 14, 2015, 9:05 p.m.
<p>2nd list in unnecessary </p>

militant-daos on June 23, 2015, 5:59 p.m.
<p>Item removal has higher complexity (O(n)) than item appending (O(1)). We can just append items to the empty result list, rather than removing them from it's copy. Also, we involve list copying here, which is not necessary for this task, and can be costly for big lists.</p>

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!