EdisonChendi

#coding:UTF-8

class Graph:

    def __init__(self):
        # use dict to store the graph
        # the number of keys in self.ves is the number of vertices in the graph
        # the total number of values(list) is the sum of degree of each vertex
        self.ves = {}

EdisonChendi

#coding:UTF-8

from collections import defaultdict

def find_anagrams(setence):
    words = set(setence.split())
    dd = defaultdict(list)
    for w in words: # O(nklgk)
        dd["".join(sorted(w))].append(w)
    return {k:v for k, v in dd.items() if len(v) > 1} # O(n)

EdisonChendi

import unittest
import re

def permutations(ops, len):
    if len == 1:
        return [[op] for op in ops]
    l = []
    for i, op in enumerate(ops):
        for s in permutations(ops, len-1):
            l.append([op,]+s)

EdisonChendi

import unittest
import string
import collections
from pprint import pprint

# def print(*args, **kwargs):
#     pass

def make_table(letters, width):
    table = {}