HF RL Explorer

Task: Regex Pattern Matching - Exactly N or M Occurrences

Task: Regex Pattern Matching - Exactly N or M Occurrences: a task in Terminal-Lego-15k (Harbor dataset). Your task is to create a solution that uses regular expressions to match strings where a specific character or pattern occurs exactly n OR m times (not a range between n and m, but specifically…

The task

Your task is to create a solution that uses regular expressions to match strings where a specific character or pattern occurs **exactly n OR m times** (not a range between n and m, but specifically one or the other).

Part of PrimeIntellect/Terminal-Lego-15k.