FAQ: Introduction to Regular Expressions - Quantifiers - 0 or More, 1 or More

This community-built FAQ covers the “Quantifiers - 0 or More, 1 or More” exercise from the lesson “Introduction to Regular Expressions”.

Paths and Courses
This exercise can be found in the following Codecademy content:

Practical Data Cleaning

FAQs on the exercise Quantifiers - 0 or More, 1 or More

There are currently no frequently asked questions associated with this exercise – that’s where you come in! You can contribute to this section by offering your own questions, answers, or clarifications on this exercise. Ask or answer a question by clicking reply (reply) below.

If you’ve had an “aha” moment about the concepts, formatting, syntax, or anything else with this exercise, consider sharing those insights! Teaching others and answering their questions is one of the best ways to learn and stay sharp.

Join the Discussion. Help a fellow learner on their journey.

Ask or answer a question about this exercise by clicking reply (reply) below!

Agree with a comment or answer? Like (like) to up-vote the contribution!

Need broader help or resources? Head here.

Looking for motivation to keep learning? Join our wider discussions.

Learn more about how to use this guide.

Found a bug? Report it!

Have a question about your account or billing? Reach out to our customer support team!

None of the above? Find out where to ask other questions here!

Is there an quantifier for “n or more”, where “n” can be set to a minimum number of occurrences?


Yes you can type this



you can type hooo*t or hoo+t

1 Like

Odd. In the Quantifiers - 0 or More, 1 or More lesson, I had to use fixed quantifiers instead of the Kleene star or the Kleene plus to match the following strings:

Match these strings

  • :no_entry_sign:hoot
  • :no_entry_sign:hoooooot
  • :no_entry_sign:hooooooooooot

Don’t match these strings

  • :no_entry_sign:hot
  • :no_entry_sign:hoat
  • :no_entry_sign:hoo

Using the Kleene star or the Kleene plus resulted in matching “hot” as well, which is what we don’t want to do. Is there any solution that can be provided using the Kleene methods? I would be curious to know.

You can add a minimum number of o characters that must be matched before relying on repetition, the previous comment has examples of this.

I see, thanks for answering.