python algorithm, find duplicates in list [closed]

by 

>>> from collections import Counter
>>> Counter(['apple','cherry','coffee','apple','coffee','coffee'])
Counter({'coffee': 3, 'apple': 2, 'cherry': 1})
>>> for k,v in _.items():
...   print k,v
... 
cherry 1
coffee 3
apple 2

More Related Contents:

  1. Removing duplicates in lists
  2. How to generate all permutations of a list?
  3. How to split text without spaces into list of words
  4. Understanding recursion in Python
  5. Find all combinations of a list of numbers with a given sum
  6. Why is Bubble Sort implementation looping forever?
  7. Edit Distance in Python
  8. Find longest repetitive sequence in a string
  9. Python string ‘in’ operator implementation algorithm and time complexity
  10. heapq with custom compare predicate
  11. Simple Python Challenge: Fastest Bitwise XOR on Data Buffers
  12. Algorithm to find which number in a list sum up to a certain number
  13. Checking if all elements in a list are unique
  14. When splitting an empty string in Python, why does split() return an empty list while split(‘\n’) returns [”]?
  15. Weighted random sample in python
  16. General bars and stars
  17. Python Integer Partitioning with given k partitions
  18. What is the complexity of the sorted() function?
  19. What’s the algorithm of ‘set.intersection()’ in python?
  20. How to incrementally sample without replacement?
  21. Replace list of list with “condensed” list of list while maintaining order
  22. Python Weighted Random [duplicate]
  23. How can I interleave or create unique permutations of two strings (without recursion)
  24. Python: powerset of a given set with generators [duplicate]
  25. How can I fit a Bézier curve to a set of data?
  26. All possible paths from one node to another in a directed tree (igraph)
  27. fastest method of getting k smallest numbers in unsorted list of size N in python?
  28. Mergesort with Python
  29. Find non-common elements in lists
  30. Algorithm for solving Sudoku

Leave a Comment