Solve string grouping and tree right-view problems

Problem 1: Group words that are anagrams

You are given an array of strings words.

Two strings are anagrams if they contain the same characters with the same frequencies (order can differ).

Task: Group the strings into lists where each list contains all strings that are anagrams of each other.

• Input: words: string[]
• Output: string[][] (order of groups and order within each group can be arbitrary)
• Constraints (typical): 1 <= words.length <= 10^4 , each word length <= 100 , lowercase English letters.

Example

• Input: ["eat","tea","tan","ate","nat","bat"]
• Output: [["eat","tea","ate"],["tan","nat"],["bat"]]

Problem 2: Right-side view of a binary tree

You are given the root of a binary tree. Imagine looking at the tree from the right side; return the values of the nodes you can see, ordered from top to bottom.

Task: Return an array of the rightmost node’s value at each depth.

• Input: root (binary tree node)
• Output: int[]

Example For the tree:

• 1 has left child 2 and right child 3
• 2 has right child 5
• 3 has right child 4

Right-side view is: [1, 3, 4]

Note (interview setting): You may need to define the tree node structure, build a tree from test data, and write basic test cases yourself.