Yes! I love word problems and data structures.

Let's think through this step by step.

A is the sister of B
B is the sister of C
C is the mother of D

Calculating...

A is the sister of C
A is the aunt of D

Answer: D is A's niece.

Generalized algorithm:
1. Use a directed graph to model the connections where person is a vertex and each relationship is an edge.
2. Add edges based on a set of rules. In this case the rules are:
  * 'mother'/'sister' edges create an 'aunt' edge
  * two 'sister' edges create a direct 'sister' edge
3. Repeatedly apply rules until there are no longer any new edges added.
spam fails_task lang_mismatch pii not_appropriate hate_speech sexual_content quality toxicity humor helpfulness creativity violence