Anagrams in python and C++

[Rahul555-droid]

Definition

A word w is an anagram of a word v if a permutation of the letters transforming w
into v exists. Given a set of n words of length at most k, we would like to detect all
possible anagrams.

• input: below the car is a rat drinking cider and bending its elbow while this thing
  is an arc that can act like a cat which cried during the night caused by pain in its
  bowel
• output: {bowel below elbow}, {arc car}, {night thing}, {cried cider}, {act cat}

I can implement this in python and C++

Please assign me this issue under SWOC

[Rahul555-droid]

I would want to work on this issue for SWOC and would want to implement this in python.

Please assign me this!!