<div>
This regex matches both lower and upper cases:<br />

<pre><code id="code-20-38148620-1">[a-zA-Z]?[a-zA-Z]\d[a-zA-Z\d]? \d[a-zA-Z]{2}</code></pre>
</div>


This regex matches both lower and upper cases:


[a-zA-Z]?[a-zA-Z]\d[a-zA-Z\d]? \d[a-zA-Z]{2}

<div>
<div class="content wysiwyg-content">
Hi<br />
<br />
Can you please advise regex for the following condition<br />
<br />
AN NAA<br />
<br />
ANA NAA<br />
<br />
ANN NAA<br />
<br />
AAN NAA<br />
<br />
AANN NAA<br />
<br />
AANA NAA<br />
<br />
(N = Numeric, A = Alpha)
</div>
</div>


Hi

Can you please advise regex for the following condition

AN NAA

ANA NAA

ANN NAA

AAN NAA

AANN NAA

AANA NAA

(N = Numeric, A = Alpha)

need regex for the following

A regular expression ("regex") is a sequence of characters that define a search pattern, mainly for use in pattern matching with strings, or string matching, i.e. "find and replace"-like operations. Regular expression processors are found in several search engines, search and replace dialogs of several word processors and text editors, and in the command lines of text processing utilities, such as sed and AWK. Many programming languages provide regular expression capabilities, some built-in, for example Perl, JavaScript, Ruby, AWK, and Tcl, and others via a standard library, for example .NET languages, Java, Python and C++ (since C++11). Most other languages offer regular expressions via a library.