Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Second: sets and unions solution in Clear category for How to Find Friends by BoguslawKalka
__author__ = 'boogi'
def check_connection(network, first, second):
setlist = []
for connection in network:
newset = set(connection.split('-'))
for t in setlist[:]:
if newset.intersection(t):
newset = newset.union(t)
setlist.remove(t)
setlist.append(newset)
set_to_check = set([first, second])
for s in setlist:
if set_to_check.issubset(s):
return True
return False
if __name__ == '__main__':
#These "asserts" using only for self-checking and not necessary for auto-testing
assert check_connection(
("dr101-mr99", "mr99-out00", "dr101-out00", "scout1-scout2",
"scout3-scout1", "scout1-scout4", "scout4-sscout", "sscout-super"),
"scout2", "scout3") == True, "Scout Brotherhood"
assert check_connection(
("dr101-mr99", "mr99-out00", "dr101-out00", "scout1-scout2",
"scout3-scout1", "scout1-scout4", "scout4-sscout", "sscout-super"),
"super", "scout2") == True, "Super Scout"
assert check_connection(
("dr101-mr99", "mr99-out00", "dr101-out00", "scout1-scout2",
"scout3-scout1", "scout1-scout4", "scout4-sscout", "sscout-super"),
"dr101", "sscout") == False, "I don't know any scouts."
Dec. 26, 2014