Solve string grouping and tree right-view problems

Problem 1 You are given a list of strings strs. Organize the strings into groups so that every group contains exactly the strings that are anagrams of each other. Two strings are anagrams when they use the same letters with the same frequency. Each input string must appear in exactly one group. You may return the groups in any order, and the strings inside each group may also be in any order. An empty string is considered an anagram only of another empty string. Example 1:…