RegEx XVII : Quantifiers - x{n}, x{n,}, x{n,}

Instructions

Code

Resources

Solutions

Comments

Quantifiers indicate numbers of characters or expressions to match.

x{n}

Where n is a positive integer, matches exactly n occurrences of the preceding item x.

"candy".match(/a{2}/) ➞ null
"caandy".match(/a{2}/) ➞ "aa"

x{n,}

Where n is a positive integer, matches at least n occurrences of the preceding item x.

"candy".match(/a{2,}/) ➞ null
"caandy".match(/a{2,}/) ➞ "aa"
"caaaaaandy".match(/a{2,}/) ➞ "aaaaaa"

x{n,m}

Where n is 0 or a positive integer, m is a positive integer, and m > n, matches at least n and at most m occurrences of the preceding item x.

"cndy".match(/a{1,3}/) ➞ null
"candy".match(/a{1,3}/) ➞ "a"
"caandy".match(/a{1,3}/) ➞ "aa"
"caaaaaaaaaaandy".match(/a{1,3}/) ➞ "aaa"

Create a RegExp to find ellipsis: 3 (or more?) dots in a row. Use one of the 3 quantifiers above in your solution.

"Hello!... Wait. How goes?..... GoodBye!..".match(/REGEXP/g) ➞ "..., ....."

Notes

Check out the Resources tab if you get stuck.

Watch a quick demo on how Edabit works.

Tests

Console