EasyText Processing

Alphabetic Word Matcher

Write a regex that matches strings made up of alphabetic letters only, with no digits, punctuation, or spaces allowed anywhere.

//
hello / world123 / Hello / hi_there / test test

Test cases

  • hello
  • Hello
  • world123
  • hi_there
  • test test
  • ​(empty)

How to Solve this Regex Challenge

To complete the Alphabetic Word Matcher challenge, you must write a regular expression pattern that satisfies all specified test cases.

Steps to Complete:

  1. Analyze the Requirements: Read the description and review the list of test cases below. Identify which strings must be matched (green markers) and which must be rejected (red markers).
  2. Draft Your Pattern: Enter your regex in the interactive editor. Use the provided Hint button if you get stuck.
  3. Verify: The test cases panel will update in real-time as you type, showing which strings match your current expression.
  4. Review the Solution: Once you successfully pass all test cases, review the explanation to understand the logic behind the solution.