- Trending Categories
Data Structure
Networking
RDBMS
Operating System
Java
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Match any string containing a sequence of at least two p's.
To match any string containing a sequence of at least two p’s with JavaScript RegExp, use the p{2,} Quantifier.
Example
<html>
<head>
<title>JavaScript Regular Expression</title>
</head>
<body>
<script>
var myStr = "Welcome 1, 10, 100, 1000";
var reg = /\d{2,}/g;
var match = myStr.match(reg);
document.write(match);
</script>
</body>
</html>
Published on 26-Feb-2018 08:20:28
- Related Questions & Answers
- Match any string containing a sequence of N p's
- Match any string containing a sequence of two to three p's.
- Match any string containing zero or more p's.
- Match any string containing at most one p.
- Match any string containing one or more p's with JavaScript RegExp.
- Match any string with p at the end of it.
- Match any string with p at the beginning of it.
- Design a DFA of a string with at least two 0’s and at least two 1’s
- Count pairs (p, q) such that p occurs in array at least q times and q occurs at least p times in C++
- Convert a number of length N such that it contains any one digit at least 'K' times in C++
- Get at least one match in list querying with MongoDB?
- Check If All 1's Are at Least Length K Places Away in C++
- What's the Kotlin equivalent of Java's String[]?
- Can 'false' match some string in MySQL?
- Subarray sum with at least two elements in JavaScript
Advertisements