I was asked to solve a coding problem involving regular expressions. The question described a simplified regex format using uppercase letters and square brackets (e.g., [ABC]) representing character choices. I had to generate the longest valid regex that matches two given strings but not a third one. The problem required understanding of character sets, string matching, and constraints like uniqueness and balanced brackets.