Python Sorting Dictionary by values can be unstable? (in Hackerrank)

user_8866772 0
Viewed 875

I'm doing some practice in Hackerrank for Python 3 learning.

In the task Most Common you are given a string which contains only lowercase English characters and you need to find the top three most common characters in that string.

I met some questions.

My solution for this problem is below:

#!/bin/python3
import sys

if __name__ == "__main__":
  s = input().strip()
  ch_dict = {}
  for ch in s:
      if ch in ch_dict : ch_dict[ch] +=1
      else: ch_dict[ch] = 1

  result = sorted(ch_dict.items(),key=lambda d:d[1],reverse=True)
  for i in result:
      if i[1] != 1:
          print(" ".join(map(str,i)))

When I test this code in local environment, it works!

But in online test, it may fail!

For this input:

aabbbccde

I submit a lot of times, sometimes get right answer like this:

b 3
a 2
c 2

and can also get this:

b 3
c 2
a 2

It seems like the sort can be unstable ? OR what's matter whit my code ? OR is something wrong in Hackerrank environment ?

How can i guarantee my output?

dictionary sorting python
6 Answers

Python dictionaries are unordered. When you iterate over their contents, the order is implementation dependent, see Why is the order in dictionaries and sets arbitrary?

You are sorting your items by the values only, so given that your list the items in arbitrary order, sometimes the ('a', 2) pair will come first, sometimes the ('c', 2) pair is.

If you want to stabilise the order, break ties between values by sorting on the key as well.

Your challenge states:

Sort output in descending order of occurrence count.
If the occurrence count is the same, sort the characters in ascending order.

so you need to sort by value first, and then by key, and the direction between these two differs.

You can achieve this by sorting twice, or by sorting on the inverse score:

# Sort forward by key, to produce a stable order between keys
by_key = sorted(ch_dict.items(), key=lambda d: d[0])
# Sort backward by value, ties are left in the original order, so by key
result = sorted(by_key, key=lambda d: d[1], reverse=True)

or in one step:

sorted(ch_dict.items(), key=lambda d: (-d[1], d[0]))

so sort by the negative count, then the key, and don't reverse.

Note that the challenge actually asks only for the top three characters. The challenge doesn't use huge inputs, but if there were, then using sorting is actually inefficient. You don't need to sort all key-value pairs, only the top 3. How would you go about getting just the top 3? You could use a heap queue, which efficiently can give you the top N of any sequence:

import heapq

result = heapq.nsmallest(3, ch_dict.items(), key=lambda d: (-d[1], d[0]))

Where sorting takes O(NlogN) time (N being the size of the dictionary), a heapq takes O(NlogK) time, N being the same value but K being the count of top items; here it is 3. For a dictionary with 10.000 items, sorting takes about 133k steps to complete, but a heap queue only takes 16k steps. That's going to be almost 10 times faster!

user_1002970

The problem is here:

key=lambda d:d[1]

The key only considers the second value, instead, use both values.

user_9485500

Dictionaries are unordered. You are sorting your output by the value only, but since the order of keys is not guaranteed in the original dict, the ordering within each value in the output can vary.

You can fix this by ordering on both:

sorted(ch_dict.items(), key=lambda d: (d[1], d[0]), reverse=True)
user_1043490

dict.items can return the (key, value) pairs in any order, dependend on details like the implementation or key-insertion-order. sorted then iterates over these pairs in whatever order dict.items returned them.

If you want a deterministic output, use key=lambda d: (d[1], d[0]) in order to sort the (key, value) pairs by the key lexicographically if the value happens to be the same.

(In case you are using Python 2, key=lambda key, value: (value, key) looks nicer.)

user_36200030

sorted() is actually stable in that it preserves the order of items with the same key as extracted by the key function you provided – in this case the key being the value. But since dicts are unordered, the preserved order is undefined for items with the same value.

A solution is to sort by (value, key) tuples:

result = sorted(ch_dict.items(), key=lambda d: (-d[1], d[0]))

Note the removed reversed argument, replaced by negating the value, as it seems that you'd like to sort the keys in ascending order and the values in descending.

user_26816320

in the Hackerrank hierarchy, you are in the Collections section. so the solution is probably :

#!/bin/python3
import sys,collections
if __name__ == "__main__":
    s = 'abcdebbca' # input().strip()
    res=collections.Counter(s).items(s)
    sortres= sorted ( res, key=(lambda x : (-x[1],x[0])))
    for k,v in sortres[:3] : print k,v

the line sortres= sorted ( res, key=(lambda x : (-x[1],x[0]))) is necessary like well explained by @Martijn Pieters.

EDIT

Since problem arise from dict, an other answer which uses only lists, sets and sorted stability :

import sys

if __name__ == "__main__":
    s = raw_input().strip()
    set_k, list_kv = set() , list() 
    for x in sorted(s):
        if x not in set_k:
            if set_k : list_kv.append((-count,val))
            set_k.add(x)
            count , val = 0 , x
        count+=1
    for k,v in sorted(list_kv)[:3] : print v,-k
user_40162850
Related