Maha fucked around with this message at 23:22 on Dec 25, 2016

import itertools
def unique_n_combinations(iterable, n):

    unique_n_combinations = set(itertools.combinations(iterable, n))
    return unique_n_combinations
    # note: in python 3.5 and lower, the order of keys will not be preserved,
    # so if this is important you will want to sort afterwards
    
def test():
    my_list = ['a', 'a', 'b', 'b']
    three_combos = unique_n_combinations(my_list, 3)
    print(three_combos)
    assert three_combos == {('a', 'a', 'b'), ('a', 'b', 'b')}

>>>test()
{('a', 'b', 'b'), ('a', 'a', 'b')}

Eela6 fucked around with this message at 17:02 on Jan 4, 2017

from collections import Counter
from math import factorial

count = Counter({
    'e': 12, 'a': 9, 'i': 8,
     'o': 8, 'n': 6,'t': 6,
     'l': 4, 's': 4, 'u': 4,
     'd': 4 , 'g': 3,  'b': 2, 'h': 5,
     'c': 2, 'm': 2, 'p': 2,
     'k': 1, 'j': 1, 'x': 1, 
     'r': 13, 'v': 3, 'w': 4,
     'y': 4, 'q': 1, 'z': 1, 
     'f': 1, '*': 2
     })


        
def n_choose_k(n: int, k: int) -> int:
    """ choices of k objects from a collection of n"""
    if k > n:
        return 0
    return (factorial(n) // factorial(k) ) // factorial(n-k)

def copies_of_rack(rack: str) -> int:
    
    def product(iterable) -> int:
        total = 1
        for x in iterable:
            total *= x
        return total
        
    def ways_to_choose_copies_of_tile(tile: str) -> int:
        return n_choose_k(count[tile], rack_count[tile])
        
    rack_count = Counter(rack)
    copies = product(ways_to_choose_copies_of_tile(tile) for tile in rack_count)
    return copies
    
total_racks = sum(count[x] for x in count)

def frequency_of_rack(rack: str) -> float:    
    copies = copies_of_rack(rack)
    return copies / total_racks

Eela6 fucked around with this message at 06:44 on Jan 5, 2017