Python

[erikpc43]

If a dictionary is given like :  names = { "Peter": ("computer", "headphones", "chair),

                                                              "John": ("table", computer"),

                                                              "Ken": ( "headphones"),

                                                              "Ben": ("chair", "table" )    }

Now how can i return a set that will contain keys with the same values? it should be in alphabetical order by names like in this case {  ("John", "Peter"), ("Ken", "Peter"), ("Ben", "Peter"), ("Ben", "John") }. 

Thanks

[kuhnertdm]

This site isn't for homework help

[reniat]

We'll help you with specific questions, but you need to show us what you have so far and have a specific issue in mind. You've got to show that you at least tried something before we can help.

[Quantom]

Definitely seems like homework! But I'll give you a few pointers.

 

You're looking to bucket (i.e. group) people who have the same items. A dict will do. Iterate through the given dictionary, for each key, iterate through the items. Set this as your key for your new dictionary. You'll need a way to store this collection of people grouped by item, I'll leave that up to you.

After you've grouped by item, simply iterate once more and output the list of people for each key.

[INSERTNAMEHERE]

@erikpc43

https://docs.python.org/3/library/stdtypes.html#dict

 

Here you can find ressources on python dictionaries idk if I am too late but its worth working through the methods contained in the dict class.

Do that and you got the solution in no time  

If you have some questions concerning notation or syntax you could send me an message.